New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding

Jiri Svancara, Pavel Surynek

Abstract

We address the problem of optimal multi-agent path finding (MAPF) in this paper. The task is to find a set of actions for each agent in know terrain so that each agent arrives to its desired destination from a given starting position. Agents are not allowed to collide with each other along their paths. Furthermore, a solution that minimizes the total time is required. In this paper we study search-based algorithms that systematically explore state space. These algorithms require a good heuristic function that can improve the computational effectiveness by changing the order in which the states are expanded. We propose such new heuristic, which is based on relaxation of MAPF solving via its reduction to multi-commodity flow over time expanded graph. The multi-commodity flow is relaxed to single commodity flow, which can be solved in polynomial time. We show that our new heuristic is monotone and therefore can be used in search-based algorithms effectively. We also give theoretical analysis of the new heuristic and compare it experimentally with base-line heuristics that are often used.

References

  1. Botea, A. and Surynek, P. (2015). Multi-agent path finding on strongly biconnected digraphs. In Bonet, B. and Koenig, S., editors, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA., pages 2024-2030. AAAI Press.
  2. Boyarski, E., Felner, A., Stern, R., Sharon, G., Tolpin, D., Betzalel, O., and Shimony, S. E. (2015). ICBS: improved conflict-based search algorithm for multiagent pathfinding. In (Yang and Wooldridge, 2015), pages 740-746.
  3. Dinitz, E. (1970). Algorithm for solution of a problem of maximal flow in a network with power estimation. Soviet Math. Dokl., 11:1277-1280.
  4. Even, S., Itai, A., and Shamir, A. (1976). On the complexity of timetable and multicommodity flow problems. SIAM J. Comput., 5(4):691-703.
  5. Hart, P. E., Nilsson, N. J., and Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Systems Science and Cybernetics, 4(2):100-107.
  6. Kautz, H. A. and Selman, B. (1999). Unifying sat-based and graph-based planning. In Dean, T., editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6, 1999. 2 Volumes, 1450 pages, pages 318-325. Morgan Kaufmann.
  7. Kornhauser, D., Miller, G. L., and Spirakis, P. G. (1984). Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. In 25th Annual Symposium on Foundations of Computer Science, West Palm Beach, Florida, USA, 24-26 October 1984, pages 241-250. IEEE Computer Society.
  8. Ma, H. and Koenig, S. (2016). Optimal target assignment and path finding for teams of agents. In Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, Singapore, May 9-13, 2016, pages 1144-1152.
  9. Pearl, J. (1984). Heuristics - intelligent search strategies for computer problem solving. Addison-Wesley series in artificial intelligence. Addison-Wesley.
  10. Ratner, D. and Warmuth, M. K. (1990). Nxn puzzle and related relocation problem. J. Symb. Comput., 10(2):111-138.
  11. Ryan, M. R. K. (2008). Exploiting subgraph structure in multi-robot path planning. J. Artif. Intell. Res. (JAIR), 31:497-542.
  12. Sharon, G., Stern, R., Felner, A., and Sturtevant, N. R. (2012). Conflict-based search for optimal multi-agent path finding. In Hoffmann, J. and Selman, B., editors, Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada. AAAI Press.
  13. Sharon, G., Stern, R., Goldenberg, M., and Felner, A. (2013). The increasing cost tree search for optimal multi-agent pathfinding. Artif. Intell., 195:470-495.
  14. Silver, D. (2005). Cooperative pathfinding. InProceedings of the First Artificial Intelligence and Interactive Digital Entertainment Conference, June 1-5, 2005, Marina del Rey, California, USA, pages 117-122.
  15. Standley, T. S. (2010). Finding optimal solutions to cooperative pathfinding problems. In Fox, M. and Poole, D., editors, Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010. AAAI Press.
  16. Surynek, P. (2009). A novel approach to path planning for multiple robots in bi-connected graphs. In 2009 IEEE International Conference on Robotics and Automation, ICRA 2009, Kobe, Japan, May 12-17, 2009, pages 3613-3619. IEEE.
  17. Surynek, P. (2015). Reduced time-expansion graphs and goal decomposition for solving cooperative path finding sub-optimally. In (Yang and Wooldridge, 2015), pages 1916-1922.
  18. Yang, Q. and Wooldridge, M., editors (2015). Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015. AAAI Press.
  19. Yu, J. and LaValle, S. M. (2012). Multi-agent path planning and network flow. In Frazzoli, E., Lozano-P érez, T., Roy, N., and Rus, D., editors, Algorithmic Foundations of Robotics X - Proceedings of the Tenth Workshop on the Algorithmic Foundations of Robotics, WAFR 2012, MIT, Cambridge, Massachusetts, USA, June 13-15 2012, volume 86 of Springer Tracts in Advanced Robotics, pages 157-173. Springer.
  20. Yu, J. and LaValle, S. M. (2013a). Planning optimal paths for multiple robots on graphs. In 2013 IEEE International Conference on Robotics and Automation, Karlsruhe, Germany, May 6-10, 2013, pages 3612-3617. IEEE.
  21. Yu, J. and LaValle, S. M. (2013b). Structure and intractability of optimal multi-robot path planning on graphs. In desJardins, M. and Littman, M. L., editors, Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA. AAAI Press.
Download


Paper Citation


in Harvard Style

Svancara J. and Surynek P. (2017). New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding . In Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-220-2, pages 451-458. DOI: 10.5220/0006184504510458


in Bibtex Style

@conference{icaart17,
author={Jiri Svancara and Pavel Surynek},
title={New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding},
booktitle={Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2017},
pages={451-458},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006184504510458},
isbn={978-989-758-220-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding
SN - 978-989-758-220-2
AU - Svancara J.
AU - Surynek P.
PY - 2017
SP - 451
EP - 458
DO - 10.5220/0006184504510458