Graphics gems IV
Introduction to Algorithms
A review of conflict detection and resolution modeling methods
IEEE Transactions on Intelligent Transportation Systems
Robotics and Autonomous Systems
Information Sciences: an International Journal
Pareto-optimal coordination of multiple robots with safety guarantees
Autonomous Robots
Hi-index | 0.00 |
This paper presents a cooperative decentralized path-planning algorithm for a group of autonomous agents that provides guaranteed collision-free 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.