Multi-robot path finding and coordination is one of the key performance-affecting subsystems of the overall robotic order fulfilment process for use in warehouse applications. The purpose of path finding and coordination is to plan and coordinate the motions of multi-robot systems such that all robots reach their assigned goals safely. Much research has focused on solving the multi-robot path finding problem in a general way. As a result, researchers have considered a system-wide goal state where all robots are at their goal destinations in some final time. In this paper, a novel algorithm is designed specifically for order fulfilment used in warehouse applications. The key assumption is that all robots do not necessarily need to be at their destination locations at the same time. The resulting solution is referred to as visiting pebble motion on rectangular grids. More specifically, a starvation-free, semi-decentralized, scalable multi-robot coordination algorithm is presented. The proposed algorithm takes the constraints of real robot dynamics and collision avoidance into account and is capable of operating under asynchronous conditions while providing analytical performance guarantees.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
Tax calculation will be finalised during checkout.
Pinkam N, Newaz AAR, Jeong S, Chong NY (2019) Rapid coverage of regions of interest for environmental monitoring. Intel Serv Robot 12:393–406
Oihane Parra O, Rodriguez I, Jauregi E, Lazkano E, Ruiz T (2019) GidaBot: a system of heterogeneous robots collaborating as guides in multi-floor environments. Intel Serv Robot 12:319–332
Vaidis M, Otis MJ (2020) Toward a robot swarm protecting a group of migrants. Intel Serv Robot 13:299–314
Wurman PR, D’Andrea R, Mountz M (2008) Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Mag 29(1):9–19
Lamballais T, Roy D, de Koster MBM (2017) Estimating performance in a robotic mobile fulfillment system. Eur J Oper Res 256(3):976–990
Enright J, Wurman PR (2011) Optimization and coordinated autonomy in mobile fulfilment systems. In: Proceedings of the 9th AAAI conference on automated action planning for autonomous mobile robots, pp 33–38
Guizzo E (2008) Three engineers, hundreds of robots, one warehouse. IEEE Spectr 45(7):26–34
Lang S-D (1999) An extended banker’s algorithm for deadlock avoidance. IEEE Trans Softw Eng 25:428–432
Kalinovcic L, Petrovic T, Bogdan S, Bobanac V (2011) Modified Banker’s algorithm for scheduling in multi-AGV systems. In: Proceedings of the the IEEE international conference on automation science and engineering, pp 351–356
Bobanac V, Bogdan S (2008) Routing and scheduling in multi-agv systems based on dynamic banker algorithm. In: Proceedings of the 16th mediterranean conference on control and automation, pp 1168–1173
Raynal M (2013) Concurrent programming: algorithms, principles, and foundations. Springer, Berlin
Surynek P (2013) Mutex reasoning in cooperative path finding modeled as propositional satisfiability. In: Proceedings of the IEEE/RSJ international conference on intelligent robots and systems, pp 4326–4331
Surynek P (2012) Towards optimal cooperative path planning in hard setups through satisfiability solving. In: Proceedings of the 12th Pacific rim international conference on artificial intelligence, pp 564–576
Standley TS, Korf R (2011) Complete algorithms for cooperative pathfinding problems. In: Proceedings of the 22nd international joint conference on artificial intelligence, pp 668–673
Sharon G, Stern R, Felner A, Sturtevant NR (2015) Conflict-based search for optimal multi-agent path finding. Artif Intell 219:40–66
Sharon G, Stern R, Goldenberg M, Felner A (2013) The increasing cost tree search for optimal multi-agent path finding. Artif Intell 195:470–495
de Wilde B, ter Mors AW, Witteveen C (2014) Push and rotate: a complete multi-agent pathfinding algorithm. J Artif Intell Res 51:443–492
Ryan MRK (2008) Exploiting subgraph structure in multi-robot path planning. J Artif Intell Res 31:497–542
Ryan M (2007) Graph decomposition for efficient multi-robot path planning. In: Proceedings of the 20th international joint conference on artificial intelligence, pp 2003–2008
Luna R, Bekris KE (2011) Efficient and complete centralized multi-robot path planning. In: Proceedings of the IEEE/RSJ international conference on intelligent robots and systems, pp 3268–3275
van Den Berg J, Snoeyink J, Lin MC, Manocha D (2009) Centralized path planning for multiple robots: optimal decoupling into sequential plans. In: Proceedings of the robotics: science and systems, pp 1–8
Solovey K, Halperin D (2014) k-color multi-robot motion planning. Int J Robot Res 33(1):82–97
Ratner D, Warmuth MK (1986) Finding a shortest solution for the N x N extension of the 15-puzzle is intractable. In: Association for the advancement of artificial intelligence, pp 168–172
Kornhauser D, Miller GL, Spirakis P (1984a) Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. In: Proceedings of the 25th annual symposium on foundations of computer science, pp 241–250
Surynek P (2016) Makespan optimal solving of cooperative path-finding via reductions to propositional Satisfiability. arXiv:1610.05452
Slocum J, Weisstein EW (2020) “15 Puzzle”. From MathWorld—a Wolfram web resource. https://mathworld.wolfram.com/15Puzzle.html. Accessed 27 Oct 2020
Johnson WW, Story WE (1879) Notes on the 15 puzzle. Am J Math 2(4):397–404
Surynek P (2009) A novel approach to path planning for multiple robots in bi-connected graphs. In: Proceedings the IEEE international conference on robotics and automation, pp 3613–3619
Wilson RM (1974) Graph puzzles, homotopy, and the alternating group. J Comb Theory Ser B 16(1):86–96
Goldreich O (1984) 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. Lecture Notes in Computer Science, vol 6650. Springer, Berlin
Ma H, Koenig S, Ayanian N, Cohen L, Hoenig W, Kumar S, Uras T, Xu H, Tovey C, Sharon G (2016) Overview: generalizations of multi-agent path finding to real-world scenarios. In: Proceedings IJCAI-16 workshop on multiagent path finding, pp 1–4
Roozbehani H, D’Andrea R (2011) Adaptive highways on a grid. Robot Res 70:661–680
Yu J, Rus D (2015) Pebble motion on graphs with rotations: efficient feasibility tests and planning algorithms. In Proceedings of eleventh workshop on the algorithmic foundations of robotics, pp 729–746
Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107
Skiena SS (2008) The algorithm design manual, 2nd edn. Springer, London
Moore EF (1959) The shortest path through a maze. In: Proceedings the international symposium on the theory of switching. Harvard University Press, pp 285–292
Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271
Hazard CJ, Wurman PR, D’Andrea R (2006) Alphabet soup: a testbed for studying resource allocation in multi-vehicle systems. In: Proceedings the AAAI workshop on auction-based robot coordination, pp 23–30
Conflicts of interest
The authors declare that they have no conflict of interest.
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
Lee, G., van Eeden, C.F. Visiting pebbles on rectangular grids: coordinating multiple robots in mobile fulfilment systems. Intel Serv Robotics (2021). https://doi.org/10.1007/s11370-021-00350-1
- Pebble motion on graphs
- Multi-robot coordination
- Starvation freedom
- Mobile fulfilment systems
- Asynchronous process