Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming
Path planning is one of the issues to be handled in the development of autonomous systems. For a group of agents, cooperative path planning is crucial to ensure that a given mission is accomplished in the shortest time possible with optimal solution. Optimal means that the resulting path has minimal...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Asian Research Publishing Network (ARPN).
2016
|
| Subjects: | |
| Online Access: | http://eprints.uthm.edu.my/4235/ http://eprints.uthm.edu.my/4235/1/AJ%202016%20%2826%29.pdf |
| Summary: | Path planning is one of the issues to be handled in the development of autonomous systems. For a group of agents, cooperative path planning is crucial to ensure that a given mission is accomplished in the shortest time possible with optimal solution. Optimal means that the resulting path has minimal length hence the total consumed energy by the agents is the least. Cooperative path planning fuses information from all agents to plan an optimal path. There are a number of cooperative path planning methods available in the literature for multi-agent including Cell Decomposition, Roadmap and Potential Field to name but three. This paper will review and compare the performances of those existing methods that can find solution without graph search algorithm such as Mixed-Integer Linear Programming (MILP) techniques which exactly solves the problem and then propose four alternative MILP formulations which are computationally less intensive and suited for real-time purposes, but yield a theoretically guaranteed suboptimal solution. |
|---|