By Topic

A dynamic-programming-styled algorithm for time-optimal multi-agent task assignment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Guang Yang ; Dept. of Mechanical, Aerospace, & Manuf. Eng., Polytech. Univ. Brooklyn, NY, USA ; Kapila, V.

Cooperative control of multiple agents is an area of intense current research activity. Many practical applications of multi-agent control frequently necessitate assignment of tasks among agents such that the overall mission goals are accomplished in a minimal amount of time. We use a dynamic programming formulation to address a class of time-optimal multi-agent task assignment problems. Based on the recurrence relation obtained from the principle of optimality, we develop an algorithm with a distributed computational architecture for the global time-optimal task assignment. In addition, we propose a communication protocol to facilitate distributed decision making among agents. Illustrative studies are included to demonstrate the efficacy of the proposed time-optimal multi-agent task assignment algorithm

Published in:

Decision and Control, 2001. Proceedings of the 40th IEEE Conference on  (Volume:2 )

Date of Conference: