By Topic

Decentralized cooperative conflict resolution among multiple autonomous mobile agents

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

3 Author(s)
Pallottino, Lucia ; Interdepartmental Res. Center "E. Piaggio", Pisa Univ., Italy ; Scordio, V.G. ; Bicchi, A.

In this paper we consider policies for cooperative, decentralized traffic management among a number of autonomous mobile agents. The conflict resolution problem is addressed considering realistic restrictions on possible maneuvers. We formulate this problem as one in mixed integer linear programming (MILP). The method, which proves successful in a centralized implementation with a large number of cooperating agents, is also extended to a decentralized setting. Conditions for the existence of conflict avoidance maneuvers for a system of 5 autonomous agents with a transitive information structure are provided, along with the explicit policy to be applied by each agent.

Published in:

Decision and Control, 2004. CDC. 43rd IEEE Conference on  (Volume:5 )

Date of Conference:

14-17 Dec. 2004