Theory and implementation of path planning by negotiation for decentralized agents

✍ Scribed by Oliver Purwin; Raffaello D’Andrea; Jin-Woo Lee

• Publisher: Elsevier Science
• Year: 2008
• Tongue: English
• Weight: 966 KB
• Volume: 56
• Category: Article
• ISSN: 0921-8890
• DOI: 10.1016/j.robot.2007.09.020

✦ Synopsis

This paper presents a cooperative decentralized path-planning algorithm for a group of autonomous agents that provides guaranteed collisionfree trajectories in real-time. The algorithm is robust with respect to arbitrary delays in the wireless traffic, possible sources being transmission time and error correction. Agents move on reserved areas which are guaranteed not to intersect, therefore ensuring safety. A handshaking procedure guarantees recent information states for the agents. Conflicts between agents are resolved by a cost-based negotiation process. The basic algorithm is augmented by the introduction of waypoints, which increase performance at the cost of additional wireless traffic. An implementation of the algorithm is tested in simulation and successfully applied to a real system of autonomous robots. The results are presented and discussed.