Advertisement

On Randomized Searching for Multi-robot Coordination

  • Jakub Hvězda
  • Miroslav KulichEmail author
  • Libor Přeučil
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 613)

Abstract

In this chapter, we propose a novel approach for solving the coordination of a fleet of mobile robots, which consists of finding a set of collision-free trajectories for individual robots in the fleet. This problem is studied for several decades, and many approaches have been introduced. However, only a small minority is applicable in practice because of their properties - small computational requirement, producing solutions near-optimum, and completeness. The approach we present is based on a multi-robot variant of Rapidly Exploring Random Tree algorithm (RRT) for discrete environments and significantly improves its performance. Although the solutions generated by the approach are slightly worse than one of the best state-of-the-art algorithms presented in [23], it solves problems where ter Morses algorithm fails.

Notes

Acknowledgements

This work has been supported by the European Union’s Horizon 2020 research and innovation programme under grant agreement No 688117, by the Technology Agency of the Czech Republic under the project no. TE01020197 “Centre for Applied Cybernetics”, the project Rob4Ind4.0 CZ.02.1.01/0.0/0.0/15_003/0000470 and the European Regional Development Fund. The work of Jakub Hvězda was also supported by the Grant Agency of the Czech Technical University in Prague, grant No. SGS18/206/OHK3/3T/37.

References

  1. 1.
    Bennewitz M, Burgard W, Thrun S (2001) Optimizing schedules for prioritized path planning of multi-robot systems. In: IEEE international conference on robotics and automation, proceedings 2001 ICRA, vol 1, pp 271–276Google Scholar
  2. 2.
    van den Berg J, Overmars M (2005) Prioritized motion planning for multiple robots. In: 2005 IEEE/RSJ international conference on intelligent robots and systems. IEEE, pp 430–435Google Scholar
  3. 3.
    van den Berg J, Snoeyink J, Lin MC, Manocha D (2009) Centralized path planning for multiple robots: optimal decoupling into sequential plans. In: Trinkle J, Matsuoka Y, Castellanos JA (eds) Robotics: science and systems V, University of Washington, Seattle, USA, 28 June–1 July 2009. The MIT PressGoogle Scholar
  4. 4.
    Cap M, Novak P, Kleiner A, Selecky M, Pechoucek M (2015) Prioritized planning algorithms for trajectory coordination of multiple mobile robots. IEEE Trans Autom Sci Eng Spec Is (2015)Google Scholar
  5. 5.
    Chiew K (2010) Scheduling and routing of autonomous moving objects on a mesh topology. Oper Res Int J 12(3):385–397CrossRefGoogle Scholar
  6. 6.
    DeWilde B, Ter Mors A, Witteveen C (2014) Push and rotate: a complete multi-agent pathfinding algorithm. J Artif Intell Res 51:443–492MathSciNetCrossRefGoogle Scholar
  7. 7.
    Dobson A, Solovey K, Shome R, Halperin D, Bekris KE (2017) Scalable asymptotically-optimal multi-robot motion planning. In: 2017 international symposium on multi-robot and multi-agent systems (MRS), pp 120–127, December 2017Google Scholar
  8. 8.
    Doriya R, Mishra S, Gupta S (2015) A brief survey and analysis of multi-robot communication and coordination. In: International conference on computing, communication automation, pp 1014–1021, May 2015Google Scholar
  9. 9.
    Gawrilow E, Köhler E, Möhring RH, Stenzel B (2008) Dynamic routing of automated guided vehicles in real-time. Springer, Heidelberg, pp 165–177Google Scholar
  10. 10.
    Geramifard A, Chubak P, Bulitko V (2006) Biased cost pathfinding. In: AAAI conference on artificial intelligence and interactive digital entertainment, pp 112–114Google Scholar
  11. 11.
    Goldreich O (2011) Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard. In: Goldreich O (ed) Studies in complexity and cryptography. Miscellanea on the Interplay between randomness and computation - in collaboration with Avigad L, Bellare M, Brakerski Z, Goldwasser S, Halevi S, Kaufman T, Levin L, Nisan N, Ron D, Lecture Notes in Computer Science, vol 6650. Springer, pp 1–5Google Scholar
  12. 12.
    Hopcroft J, Schwartz J, Sharir M (1984) On the complexity of motion planning for multiple independent objects; PSPACE-hardness of the “Warehouseman’s Problem”. Int J Rob Res 3(4):76–88CrossRefGoogle Scholar
  13. 13.
    Hvězda J, Kulich M, Přeučil L (2018) Improved discrete RRT for coordinated multi-robot planning. In: Proceedings of the 15th international conference on informatics in control, automation and robotics, ICINCO 2018 - vol 2, pp 181–189Google Scholar
  14. 14.
    Hvězda J, Rybecký T, Kulich M, Přeučil L Context-aware route planning for automated warehouses. In: 21st IEEE international conference on intelligent transportation systems (in press)Google Scholar
  15. 15.
    Karaman S, Frazzoli E (2010) Incremental sampling-based algorithms for optimal motion planning. CoRR abs/1005.0416Google Scholar
  16. 16.
    Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. CoRR abs/1105.1186Google Scholar
  17. 17.
    Latombe JC (1991) Robot motion planning. Kluwer Academic Publishers, NorwellCrossRefGoogle Scholar
  18. 18.
    LaValle S, Hutchinson S (1998) Optimal motion planning for multiple robots having independent goals. IEEE Trans Robot Autom 14(6):912–925CrossRefGoogle Scholar
  19. 19.
    Lavalle SM (1998) Rapidly-exploring random trees: a new tool for path planning. Technical report, Computer Science Deptartment, Iowa State University, 11Google Scholar
  20. 20.
    Luna R, Bekris KE (2011) Efficient and complete centralized multi-robot path planning. In: 2011 IEEE/RSJ international conference on intelligent robots and systems. IEEE, pp 3268–3275, September 2011Google Scholar
  21. 21.
    ter Mors A (2011) Evaluating heuristics for prioritizing context-aware route planning agents. In: International conference on networking, sensing and control, pp 127–132, April 2011Google Scholar
  22. 22.
    ter Mors A, Witteveen C, Ipema C, de Nijs F, Tsiourakis T (2012) Empirical evaluation of multi-agent routing approaches. In: 2012 IEEE/WIC/ACM international conferences on web intelligence and intelligent agent technology, vol 2, pp 305–309, December 2012Google Scholar
  23. 23.
    ter Mors AW, Witteveen C, Zutt J, Kuipers FA (2010) Context-aware route planning. In: Dix J, Witteveen C (eds) Multiagent system technologies. Springer, Heidelberg, pp 138–149CrossRefGoogle Scholar
  24. 24.
    O’Donnell PA, Lozano-Perez T (1989) Deadlock-free and collision-free coordination of two robot manipulators. In: IEEE robotics and automation conference, pp 484–489Google Scholar
  25. 25.
    Parker LE (2009) Path planning and motion coordination in multiple mobile robot teams. In: Encyclopedia of complexity and system science (2009)CrossRefGoogle Scholar
  26. 26.
    Peasgood M, Clark CM, McPhee J (2008) A complete and scalable strategy for coordinating multiple robots within roadmaps. IEEE Trans Rob 24(2):283–292CrossRefGoogle Scholar
  27. 27.
    Ryan MR (2008) Exploiting subgraph structure in multi-robot path planning. J Artif Intell Res, pp 497–542CrossRefGoogle Scholar
  28. 28.
    Selman B, Levesque H, Mitchell D (1992) A new method for solving hard satisfiability problems. In: Proceedings of the tenth national conference on artificial intelligence, AAAI 1992. AAAI Press, pp 440–446Google Scholar
  29. 29.
    Silver D (2005) Cooperative pathfinding. In: The 1st conference on artificial intelligence and interactive digital entertainment, pp 117–122Google Scholar
  30. 30.
    Simeon T, Leroy S, Lauumond JP (2002) Path coordination for multiple mobile robots: a resolution-complete algorithm. IEEE Trans Robot Autom 18(1):42–49CrossRefGoogle Scholar
  31. 31.
    Solovey K, Salzman O, Halperin D (2014) Finding a needle in an exponential haystack: discrete RRT for exploration of implicit roadmaps in multi-robot motion planning. Algorithmic Found Rob XI:591–607Google Scholar
  32. 32.
    Suurballe J (1974) Disjoint paths in a network 4:125–145MathSciNetCrossRefGoogle Scholar
  33. 33.
    Wang KC, Botea A (2011) MAPP: a scalable multi-agent path planning algorithm with tractability and completeness guarantees. J Artif Intell Res, pp 55–90Google Scholar
  34. 34.
    Wang KHC, Botea A (2008) Fast and memory-efficient multi-agent pathfinding. In: ICAPS, pp 380–387Google Scholar
  35. 35.
    Wang W, Goh WB (2012) Multi-robot path planning with the spatio-temporal A* algorithm and its variants. In: Dechesne F, Hattori H, ter Mors A, Such JM, Weyns D, Dignum F (eds) Advanced agent technology. Springer, Heidelberg, pp 313–329CrossRefGoogle Scholar
  36. 36.
    Wang W, Goh WB (2015) A stochastic algorithm for makespan minimized multi-agent path planning in discrete space. Appl Soft Comput 30:287–304CrossRefGoogle Scholar
  37. 37.
    Yen JY (1971) Finding the k shortest loopless paths in a network. Manage Sci 17(11):712–716MathSciNetCrossRefGoogle Scholar
  38. 38.
    Zhang T, Ding M, Wang B, Chen Q (2015) Conflict-free time-based trajectory planning for aircraft taxi automation with refined taxiway modeling 50Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Jakub Hvězda
    • 1
    • 2
  • Miroslav Kulich
    • 1
    Email author
  • Libor Přeučil
    • 1
  1. 1.Czech Institute of Informatics, Robotics, and CyberneticsCzech Technical University in PraguePragueCzech Republic
  2. 2.Department of Cybernetics, Faculty of Electrical EngineeringCzech Technical University in PraguePragueCzech Republic

Personalised recommendations