Advertisement

Autonomous Agents and Multi-Agent Systems

, Volume 32, Issue 5, pp 693–740 | Cite as

A complete multi-robot path-planning algorithm

  • Ebtehal Turki Saho Alotaibi
  • Hisham Al-Rawi
Article

Abstract

In the domain of multi-robot path-planning problems, robots must move from their start locations to their goal locations while avoiding collisions with each other. The research problem that we addressed is to find a complete solution for the multi-robot path-planning problem. Our first contribution is to recognize the solvable instances of the problem with our solvability test; the theoretical analysis has already been provided to show the validity of this test. Our second contribution is to solve this problem completely, in polynomial time, with the Push and Spin (PASp) algorithm. Once the problem was solved, we found decisions within the complete solution that may improve the performance of the complete algorithm. Hence, our third contribution is to improve the performance by selecting the best path from the set of complete paths. We refer to the improved version of our algorithm as the improved PASp algorithm. In terms of the completeness evaluation, the mathematical proofs demonstrate that the PASp is a complete algorithm for a wider class of problem instances than the classes solved by the Push and Swap (PAS), Push and Rotate (PAR), Bibox or the tractable multi-robot path-planning (MAPP) algorithms. Moreover, PASp solves any graph recognized to be solvable without any assumptions. In addition, the theoretical proof of the PASp algorithm showed completive polynomial performance in terms of total-path-lengths and execution time. In our performance evaluation, the experimental results showed that the PASp performs competitively, in reasonable execution time, in terms of number of moves compared to the PAS, PAR, Bibox and MAPP algorithms on a set of benchmark problems from the video-game industry. In addition, the results showed the scalability and robustness of PASp in problems that can be solved only by PASp. Such problems require high levels of coordination with an efficient number of moves and short execution time. In grid and bi-connected graphs with too many cycles, PASp required more moves and more time than the PAS, PAR and Bibox algorithms. However, PASp is the only algorithm capable of solving such instances with only one unoccupied vertex. Furthermore, adding heuristic search and smooth operation to the improved PASp showed significant further improvement by reducing the number of moves for all problem instances. PASp produced the best plans in a bit higher time. Finally, the PASp algorithm solves a wider class of problems and performs more completely in very complex/crowded environments than other state-of-art algorithms. Additionally, the Spin operation introduces a novel swapping technique to exchange two items and restore others in a graph for industrial applications.

Keywords

Multi-robot Path planning Algorithms 

Notes

Acknowledgements

We would like to thank both reviewers of autonomous agents and multi-agent systems journal for their insightful comments and critical review which for sure improved the clarity and quality of the work.

Supplementary material

10458_2018_9391_MOESM1_ESM.pdf (1010 kb)
Supplementary material 1 (PDF 1009 kb)

References

  1. 1.
    Bhaduri, A. (2009). A mobile robot path planning using genetic artificial immune network algorithm. In World congress on nature and biologically inspired computing (pp. 1536–1539). IEEE.Google Scholar
  2. 2.
    Papadimitriou, C. H., Raghavan, P., Sudan, M., & Tamaki, H. (1994). Motion planning on a graph. In 1994 Proceedings. 35th Annual symposium on foundations of computer science (pp. 511–520). IEEE.Google Scholar
  3. 3.
    Goldreich, O. (2011). Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard. Lecture notes in computer science (pp. 1–5). Berlin Heidelberg: Springer.zbMATHGoogle Scholar
  4. 4.
    Dresner, K., & Stone, P. (2005). Multiagent traffic management: An improved intersection control mechanism. In Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems (pp. 471–477). ACM.Google Scholar
  5. 5.
    Roberts, J. M., Duff, E. S., & Corke, P. I. (2002). Reactive navigation and opportunistic localization for autonomous underground mining vehicles. Information Sciences, 145(1), 127–146.CrossRefzbMATHGoogle Scholar
  6. 6.
    Leitner, J. (2009). Multi-robot cooperation in space: a survey. In Advanced technologies for enhanced quality of life. AT-EQUAL’09 (pp. 144–151). IEEE.Google Scholar
  7. 7.
    Guizzo, E. (2008). Three engineers, hundreds of robots, one warehouse. IEEE Spectrum, 45(7), 26–34.CrossRefGoogle Scholar
  8. 8.
    Macwan, A., Vilela, J., Nejat, G., & Benhabib, B. (2015). A multirobot path-planning strategy for autonomous wilderness search and rescue. IEEE Transactions on Cybernetics, 45(9), 1784–1797.CrossRefGoogle Scholar
  9. 9.
    Tang, Z., & Ozguner, U. (2005). Motion planning for multitarget surveillance with mobile sensor agents. IEEE Transactions on Robotics, 21(5), 898–908.CrossRefGoogle Scholar
  10. 10.
    Zheng, T., Liu, D., & Wang, P. (2004). Priority based dynamic multiple robot path planning. In Proceedings of 2nd international conference on autonomous robots and agents.Google Scholar
  11. 11.
    Nieuwenhuisen, D., Kamphuis, A., & Overmars, M. H. (2007). High quality navigation in computer games. Science of Computer Programming, 67(1), 91–104.MathSciNetCrossRefGoogle Scholar
  12. 12.
    Kornhauser, D., Miller, G., & Spirakis, P. (1984). Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. Master’s thesis, M.I.T., Cambridge.Google Scholar
  13. 13.
    de Wilde, B., ter Mors, A. W., & Witteveen, C. (2014). Push and rotate: A complete multi-agent pathfinding algorithm. Journal of Artificial Intelligence Research, 51, 443–492.MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Luna, R., & Bekris, K. E. (2011). Push and swap: Fast cooperative path-finding with completeness guarantees. In IJCAI (pp. 294–300).Google Scholar
  15. 15.
    Surynek, P. (2009). A novel approach to path planning for multiple robots in bi-connected graphs. In IEEE international conference on robotics and automation (pp. 3613–3619). IEEE.Google Scholar
  16. 16.
    Wang, K.-H. C., & Botea, A. (2011). Mapp: A scalable multi-agent path planning algorithm with tractability and completeness guarantees. Journal of Artificial Intelligence Research, 42, 55–90.MathSciNetzbMATHGoogle Scholar
  17. 17.
    Alotaibi, E. T. S., & Al-Rawi, H. (2016). Multi-robot path-planning problem for a heavy traffic control application: A survey. International Journal of Advanced Computer Science and Applications, 7(6), 10.Google Scholar
  18. 18.
    Sajid, Q., Luna, R., & Bekris, K. E. (2012). Multi-agent pathfinding with simultaneous execution of single-agent primitives. In SOCS.Google Scholar
  19. 19.
    Wilson, R. M. (1974). Graph puzzles, homotopy, and the alternating group. Journal of Combinatorial Theory, Series B, 16(1), 86–96.MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Yu, J., & Rus, D. (2015). Pebble motion on graphs with rotations: Efficient feasibility tests and planning algorithms. In Algorithmic foundations of robotics XI (pp. 729–746). Berlin: Springer.Google Scholar
  21. 21.
    Mächler, P. (2012). Pebbles in motion polynomial algorithms for multi-agent path planning problems. Master of Science in Computer Science: University of Basel, Basel.Google Scholar
  22. 22.
    Ryan, M. R. K. (2008). Exploiting subgraph structure in multi-robot path planning. Journal of Artificial Intelligence Research, 31, 497–542.CrossRefzbMATHGoogle Scholar
  23. 23.
    Yu, J., & LaValle, S. M. (2013). Multi-agent path planning and network flow. In Algorithmic foundations of robotics X (pp. 157–173). Berlin: Springer.Google Scholar
  24. 24.
    Hopcroft, J. E., & Tarjan, R. E. (1971). Efficient algorithms for graph manipulation. Stanford, CA: University of California.zbMATHGoogle Scholar

Copyright information

© The Author(s) 2018

Authors and Affiliations

  1. 1.Computer Science DepartmentAl-Imam Muhammad Ibn Saud Islamic UniversityRiyadhSaudi Arabia

Personalised recommendations