Abstract
In this paper, we consider the problem of planning collision-free trajectories to navigate a team of labeled robots from a set of start locations to a set of goal locations, where robots have pre-assigned and non-interchangeable goals. We present a solution to this problem for a centralized team operating in an obstacle-free, two-dimensional workspace. Our algorithm allows robots to follow Optimal Motion Plans (OMPs) to their goals when possible and has them enter Circular HOlding Patterns (CHOPs) to safely navigate congested areas. This OMP\(+\)CHOP algorithm is shown to be safe and complete, and simulation results show scalability to hundreds of robots.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Buckley, S.: Fast motion planning for multiple moving robots. In: Proceedings of the 1989 IEEE International Conference on Robotics and Automation (ICRA), pp. 322–326 (1989)
de Wilde, B., ter Mors, A.W., Witteveen, C.: Push and rotate: cooperative multi-agent path planning. In: Proceedings of the 2013 International Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 87–94 (2013)
Erdmann, M., Lozano-Perez, T.: On multiple moving objects. Algorithmica 2, 1419–1424 (1986)
FAA: Overview of small uas notice of proposed rulemaking (2015)
Forbes: Meet amazon prime air, a delivery-by-aerial-drone project (2013)
Goldenberg, M., Felner, A., Stern, R., Sharon, G., Sturtevant, N., Holte, R.C., Schaeffer, J.: Enhanced partial expansion A*. J. Artif. Intell. Res. 50(1), 141–187 (2014)
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)
Hastings, E.J., Mesit, J., Guha, R.K.: Optimization of large-scale, real-time simulations by spatial hashing. In: Proceedings of the 2005 Summer Computer Simulation Conference, pp. 9–17 (2005)
Kant, K., Zucker, S.W.: Toward efficient trajectory planning: the path-velocity decomposition. Int. J. Robot. Res. (IJRR) 5(3), 72–89 (1986)
Kuhn, H.: The hungarian method for the assignment problem. Nav. Res. Logist. Q. 2(1–2), 83–97 (1955)
Peng, J., Akella, S.: Coordinating multiple robots with kinodynamic constraints along specified paths. Int. J. Robot. Res. (IJRR) 24(4), 295–310 (2005)
Specht, E.: The best known packings of equal circles in a square (2013). [Online]. Available: http://hydra.nat.uni-magdeburg.de/packing/csq/csq.html
Tomlin, C., Pappas, G.J., Sastry, S.: Conflict resolution for air traffic management: a study in multi-agent hybrid systems. IEEE Trans. Autom. Control 43, 509–521 (1998)
Turpin, M., Michael, N., Kumar, V.: CAPT: concurrent assignment and planning of trajectories for multiple robots. Int. J. Robot. Res. 33(1), 98–112 (2014)
van den Berg, J.: RVO2 library documentation (2008). [Online]. Available: http://gamma.cs.unc.edu/RVO2/documentation/2.0/index.html
van den Berg, J., Guy, S.J., Lin, M.C., Manocha, D.: Reciprocal n-body collision avoidance. In: The 14th International Symposium on Robotics Research (ISRR), pp. 3–19 (2009)
van den Berg, J., Snoeyink, J., Lin, M., Manocha, D.: Centralized path planning for multiple robots: optimal decoupling into sequential plans. In: Proceedings of Robotics: Science and Systems (RSS) (2009)
Wagner, G., Choset, H.: Subdimensional expansion for multirobot path planning. Artif. Intell. 219, 1–24 (2015)
Yu, J., LaValle, S.M.: Planning optimal paths for multiple robots on graphs. In: Proceedings of 2014 IEEE International Conference on Robotics and Automation (ICRA), pp. 3612–3617 (2013)
Acknowledgements
We gratefully acknowledge the support of ONR grants N00014-09-1-1051 and N00014-09-1-103, NSF grant IIS-1426840, and Exyn Technologies. Sarah Tang is supported by NSF Research Fellowship Grant No. DGE-1321851. The authors would also like to thank Levi Cai from the University of Pennsylvania for his implementation of the M* algorithm.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Tang, S., Kumar, V. (2018). A Complete Algorithm for Generating Safe Trajectories for Multi-robot Teams. In: Bicchi, A., Burgard, W. (eds) Robotics Research. Springer Proceedings in Advanced Robotics, vol 3. Springer, Cham. https://doi.org/10.1007/978-3-319-60916-4_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-60916-4_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60915-7
Online ISBN: 978-3-319-60916-4
eBook Packages: EngineeringEngineering (R0)