A combined coordination technique for Multi-Agent Path Planning
Authors:
- 1 November 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21647143,p. 563-568
Abstract
Multi-Agent Path Planning (MAPP) can be considered the basic building block for implementing a reliable Multi-Agent Systems capable for interacting with real world. MAPP main task is how to get the appropriate path for movable agents where each agent is considered a dynamic obstacle to the others. Planning the exact path for each movable agent in a highly dynamic environment is a difficult task. This paper presents a combined coordination technique for solving MAPP problem; this technique takes the benefits of both agents' capabilities and system resources when available. Moreover it combines three planning algorithms, namely; task allocation using extended global assignment problem model, Checkpoint Priority Action Database algorithm for MAPP coordination and Potential Fields Methods for local path planning.Keywords
This publication has 7 references indexed in Scilit:
- Multiple Mobile Robot Systems2008
- Path Planning Based on Grid-Potential Fields2008
- A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)2007
- Coordinating the motions of multiple robots with specified trajectories2003
- Randomized kinodynamic planning2003
- A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles2003
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996