Skip to main content
Top

2020 | OriginalPaper | Chapter

Multi-modal Multi-agent Path Finding with Optimal Resource Utilization

Authors : Aysu Bogatarkan, Esra Erdem, Alexander Kleiner, Volkan Patoglu

Published in: Proceedings of 5th International Conference on the Industry 4.0 Model for Advanced Manufacturing

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents collide with each other. We study a general version of MAPF, called mMAPF, that involves further challenges, such as multi-modal transportation modes, a set of waypoints to visit for each agent, and consumption of different types of resources. We introduce a declarative method to solve mMAPF, using answer set programming that provides a flexible formal framework to address all these challenges while optimizing multiple objectives.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Bogatarkan, A., Patoglu, V., Erdem, E.: A declarative method for dynamic multiagent path finding. In: Proceedings of the 5th Global Conference on Artificial Intelligence, pp. 54–67 (2019) Bogatarkan, A., Patoglu, V., Erdem, E.: A declarative method for dynamic multiagent path finding. In: Proceedings of the 5th Global Conference on Artificial Intelligence, pp. 54–67 (2019)
2.
go back to reference Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. ACM Commun. 54(12), 92–103 (2011)CrossRef Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. ACM Commun. 54(12), 92–103 (2011)CrossRef
3.
go back to reference Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming: an introduction to the special issue. AI Mag. 37(3), 5–6 (2016)CrossRef Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming: an introduction to the special issue. AI Mag. 37(3), 5–6 (2016)CrossRef
4.
go back to reference Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive Datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845–860 (2000)CrossRef Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive Datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845–860 (2000)CrossRef
5.
go back to reference Chouhan, S.S., Niyogi, R.: DMAPP: a distributed multi-agent path planning algorithm. In: Proceedings of AI, pp. 123–135 (2015) Chouhan, S.S., Niyogi, R.: DMAPP: a distributed multi-agent path planning algorithm. In: Proceedings of AI, pp. 123–135 (2015)
6.
go back to reference Chouhan, S.S., Niyogi, R.: DiMPP: a complete distributed algorithm for multi-agent path planning. J. Exp. Theor. Artif. Intell. 29(6), 1129–1148 (2017)CrossRef Chouhan, S.S., Niyogi, R.: DiMPP: a complete distributed algorithm for multi-agent path planning. J. Exp. Theor. Artif. Intell. 29(6), 1129–1148 (2017)CrossRef
8.
go back to reference Dresner, K.M., Stone, P.: A multiagent approach to autonomous intersection management. J. Artif. Intell. Res. (JAIR) 31, 591–695 (2008)CrossRef Dresner, K.M., Stone, P.: A multiagent approach to autonomous intersection management. J. Artif. Intell. Res. (JAIR) 31, 591–695 (2008)CrossRef
9.
go back to reference Erdem, E., Kisa, D.G., Oztok, U., Schueller, P.: A general formal framework for pathfinding problems with multiple agents. In Proceedings of AAAI (2013) Erdem, E., Kisa, D.G., Oztok, U., Schueller, P.: A general formal framework for pathfinding problems with multiple agents. In Proceedings of AAAI (2013)
10.
go back to reference Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: Preliminary report. In Proceedings of ICLP (Technical Communications) (2014) Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: Preliminary report. In Proceedings of ICLP (Technical Communications) (2014)
11.
go back to reference Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of International Logic Programming Conference and Symposium, pp. 1070–1080 (1988) Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of International Logic Programming Conference and Symposium, pp. 1070–1080 (1988)
12.
go back to reference Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generat. Comput. 9, 365–385 (1991)MATHCrossRef Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generat. Comput. 9, 365–385 (1991)MATHCrossRef
13.
go back to reference Hart, P.E., Nilsson, N.J., Raphael, B.: Correction to “a formal basis for the heuristic determination of minimum cost paths”. SIGART Newslett. 37, 28–29 (1972) Hart, P.E., Nilsson, N.J., Raphael, B.: Correction to “a formal basis for the heuristic determination of minimum cost paths”. SIGART Newslett. 37, 28–29 (1972)
14.
go back to reference Jansen, R., Sturtevant, N.: A new approach to cooperative pathfinding. In: Proceedings of AAMAS, pp. 1401–1404 (2008) Jansen, R., Sturtevant, N.: A new approach to cooperative pathfinding. In: Proceedings of AAMAS, pp. 1401–1404 (2008)
16.
go back to reference Luna, R., Bekris, K.E.: Efficient and complete centralized multi-robot path planning. In Proceedings of IROS, pp. 3268–3275 (2011) Luna, R., Bekris, K.E.: Efficient and complete centralized multi-robot path planning. In Proceedings of IROS, pp. 3268–3275 (2011)
17.
go back to reference Marek, V., Truszczynski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: A 25-Year Perspective, pp. 375–398. Springer, Heidelberg (1999) Marek, V., Truszczynski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: A 25-Year Perspective, pp. 375–398. Springer, Heidelberg (1999)
18.
go back to reference Niemela, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25, 241–273 (1999)MathSciNetMATHCrossRef Niemela, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25, 241–273 (1999)MathSciNetMATHCrossRef
19.
go back to reference Ratner, D., Warmuth, M.K.: Finding a shortest solution for the n × n extension of the 15-puzzle is intractable. In: Proceedings of AAAI, pp. 168–172 (1986) Ratner, D., Warmuth, M.K.: Finding a shortest solution for the n × n extension of the 15-puzzle is intractable. In: Proceedings of AAAI, pp. 168–172 (1986)
20.
go back to reference Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40–66 (2015)MathSciNetMATHCrossRef Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40–66 (2015)MathSciNetMATHCrossRef
21.
go back to reference Silver, D.: Cooperative pathfinding. In: Proceedings of AIIDE, pp. 117–122 (2005) Silver, D.: Cooperative pathfinding. In: Proceedings of AIIDE, pp. 117–122 (2005)
22.
go back to reference Simons, P., Niemelae, I., Soininen, T.: Extending and implementing the stable model semantics. Artif. Intell. 138(1), 181–234 (2002)MathSciNetMATHCrossRef Simons, P., Niemelae, I., Soininen, T.: Extending and implementing the stable model semantics. Artif. Intell. 138(1), 181–234 (2002)MathSciNetMATHCrossRef
23.
go back to reference Surynek, P.: On propositional encodings of cooperative path-finding. In: Proceedings of ICTAI, pp. 524–531 (2012) Surynek, P.: On propositional encodings of cooperative path-finding. In: Proceedings of ICTAI, pp. 524–531 (2012)
24.
go back to reference Surynek, P., Felner, A., Stern, R., Boyarski, E.: Efficient SAT approach to multiagent path finding under the sum of costs objective. In: Proceedings of ECAI, pp. 810–818 (2016) Surynek, P., Felner, A., Stern, R., Boyarski, E.: Efficient SAT approach to multiagent path finding under the sum of costs objective. In: Proceedings of ECAI, pp. 810–818 (2016)
25.
go back to reference Wang, K.-H.C., Botea, A.: Fast and memory-efficient multi-agent pathfinding. In: Proceedings of ICAPS, pp. 380–387 (2008) Wang, K.-H.C., Botea, A.: Fast and memory-efficient multi-agent pathfinding. In: Proceedings of ICAPS, pp. 380–387 (2008)
26.
go back to reference Yu, J., LaValle, S.M.: Planning optimal paths for multiple robots on graphs. In: Proceedings of ICRA, pp. 3612–3617 (2013) Yu, J., LaValle, S.M.: Planning optimal paths for multiple robots on graphs. In: Proceedings of ICRA, pp. 3612–3617 (2013)
Metadata
Title
Multi-modal Multi-agent Path Finding with Optimal Resource Utilization
Authors
Aysu Bogatarkan
Esra Erdem
Alexander Kleiner
Volkan Patoglu
Copyright Year
2020
DOI
https://doi.org/10.1007/978-3-030-46212-3_24

Premium Partners