Skip to main content
SpringerLink
Log in
Book cover

Brazilian Conference on Intelligent Systems

BRACIS 2020: Intelligent Systems pp 140–153Cite as

Solving Multi-Agent Pickup and Delivery Problems Using a Genetic Algorithm

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 12320))

Abstract

In the Multi-Agent Pickup and Delivery (MAPD) problem, agents must process a sequence of tasks that may appear in the system in different time-steps. Commonly, this problem has two parts: (i) task allocation, where the agent receives the appropriate task, and (ii) path planning, where the best path for the agent to perform its task, without colliding with other agents, is defined. In this work, we propose an integer-encoded genetic algorithm for solving the task allocation part of the MAPD problem combined with two-path planning algorithms already known in the literature: the Prioritized Planning and the Improved Conflict-Based Search (ICBS). Computational experiments were carried out with different numbers of agents and the frequency of tasks. The results show that the proposed approach achieves better results for large instances when compared to another technique from the literature.

The authors thank the financial support provided by CAPES, CNPq (grants 312337/2017-5, 312682/2018-2, 311206/2018-2, and 451203/2019-4), FAPEMIG, FAPESP, and UFJF.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    https://github.com/carolladeira/MAPD.

  2. 2.

    https://docs.scipy.org/doc/scipy/reference/generated/scipy.stats.wilcoxon.html.

References

  1. Boyarski, E., et al.: ICBS: improved conflict-based search algorithm for multi-agent pathfinding. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), Buenos Aires, Argentina, pp. 740–746, July 2015

    Google Scholar 

  2. D’Andrea, R.: Guest editorial: a revolution in the warehouse: a retrospective on kiva systems and the grand challenges ahead. IEEE Trans. Autom. Sci. Eng. 9(4), 638–639 (2012)

    Article  Google Scholar 

  3. Felner, A., et al.: Search-based optimal solvers for the multi-agent pathfinding problem: summary and challenges. In: Proceedings of the 10th International Symposium on Combinatorial Search, SOCS 2017, USA, 16–17 June 2017, pp. 29–37. AAAI Press, Pittsburgh, June 2017

    Google Scholar 

  4. Grenouilleau, F., van Hoeve, W., Hooker, J.N.: A multi-label A* algorithm for multi-agent pathfinding. In: Benton, J., Lipovetzky, N., Onaindia, E., Smith, D.E., Srivastava, S. (eds.) Proceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS, pp. 181–185 (2019)

    Google Scholar 

  5. Jose, K., Pratihar, D.K.: Task allocation and collision-free path planning of centralized multi-robots system for industrial plant inspection using heuristic methods. Robot. Auton. Syst. 80, 34–42 (2016)

    Article  Google Scholar 

  6. Li, J., Surynek, P., Felner, A., Ma, H., Kumar, T.K.S., Koenig, S.: Multi-agent path finding for large agents. In: The 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, 27 January–1 February 2019, pp. 7627–7634. AAAI Press, Honolulu (2019)

    Google Scholar 

  7. Li, J., Tinka, A., Kiesel, S., Durham, J.W., Kumar, T.K.S., Koenig, S.: Lifelong multi-agent path finding in large-scale warehouses. CoRR abs/2005.07371 (2020). https://arxiv.org/abs/2005.07371

  8. Liu, C., Kroll, A.: A centralized multi-robot task allocation for industrial plant inspection by using A* and genetic algorithms. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2012. LNCS (LNAI), vol. 7268, pp. 466–474. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29350-4_56

    Chapter  Google Scholar 

  9. Liu, M., Ma, H., Li, J., Koenig, S.: Task and path planning for multi-agent pickup and delivery. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2019, 13–17 May 2019, pp. 1152–1160. International Foundation for Autonomous Agents and Multiagent Systems, Montreal (2019)

    Google Scholar 

  10. Ma, H., Hönig, W., Kumar, T.K.S., Ayanian, N., Koenig, S.: Lifelong path planning with kinematic constraints for multi-agent pickup and delivery. In: The 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, The 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI, Honolulu, Hawaii, USA, pp. 7651–7658 (2019)

    Google Scholar 

  11. Ma, H., et al.: Overview: generalizations of multi-agent path finding to real-world scenarios. CoRR abs/1702.05515, pp. 1–4 (2017)

    Google Scholar 

  12. Ma, H., Li, J., Kumar, T.S., Koenig, S.: Lifelong multi-agent path finding for online pickup and delivery tasks. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, pp. 837–845. International Foundation for Autonomous Agents and Multiagent Systems, Richland (2017)

    Google Scholar 

  13. Morris, R., et al.: Planning, scheduling and monitoring for airport surface operations. In: Planning for Hybrid Systems, Papers from the 2016 AAAI Workshop, 13 February 2016, vol. WS-16-12, pp. 608–614. AAAI Press, Phoenix (2016)

    Google Scholar 

  14. Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40–66 (2015)

    Article  MathSciNet  Google Scholar 

  15. Silver, D.: Cooperative pathfinding. In: AIIDE, vol. 1, pp. 117–122 (2005)

    Google Scholar 

  16. Standley, T.S.: Finding optimal solutions to cooperative pathfinding problems. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010, 11–15 July 2010, pp. 173–178. AAAI Press, Atlanta (2010)

    Google Scholar 

  17. Stern, R., et al.: Multi-agent pathfinding: definitions, variants, and benchmarks. In: Proceedings of the 12th International Symposium on Combinatorial Search, SOCS, Napa, California, pp. 151–159 (2019)

    Google Scholar 

  18. Svancara, J., Vlk, M., Stern, R., Atzmon, D., Barták, R.: Online multi-agent pathfinding. In: The 33rd AAAI Conference on Artificial Intelligence, AAAI, The 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI, Honolulu, Hawaii, USA, pp. 7732–7739 (2019)

    Google Scholar 

  19. Veloso, M.M., Biswas, J., Coltin, B., Rosenthal, S.: CoBots: robust symbiotic autonomous mobile service robots. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence, IJCAI 2015, 25–31 July 2015, p. 4423. AAAI Press, Buenos Aires (2015)

    Google Scholar 

  20. Walker, T.T., Sturtevant, N.R., Felner, A.: Extended increasing cost tree search for non-unit cost domains. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI, Stockholm, Sweden, pp. 534–540 (2018)

    Google Scholar 

  21. Wurman, P.R., D’Andrea, R., Mountz, M.: Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Mag. 29(1), 9–20 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidade Federal de Juiz de Fora, Juiz de Fora, Brazil

    Ana Carolina L. C. Queiroz, Heder S. Bernardino, Alex B. Vieira & Helio J. C. Barbosa

  2. Laboratório Nacional de Computação Científica, Petrópolis, Brazil

    Helio J. C. Barbosa

Authors
  1. Ana Carolina L. C. Queiroz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Heder S. Bernardino
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alex B. Vieira
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Helio J. C. Barbosa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Ana Carolina L. C. Queiroz , Heder S. Bernardino , Alex B. Vieira or Helio J. C. Barbosa .

Editor information

Editors and Affiliations

  1. Federal University of São Carlos, São Carlos, Brazil

    Ricardo Cerri

  2. Federal University of ABC, Santo Andre, Brazil

    Ronaldo C. Prati

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Queiroz, A.C.L.C., Bernardino, H.S., Vieira, A.B., Barbosa, H.J.C. (2020). Solving Multi-Agent Pickup and Delivery Problems Using a Genetic Algorithm. In: Cerri, R., Prati, R.C. (eds) Intelligent Systems. BRACIS 2020. Lecture Notes in Computer Science(), vol 12320. Springer, Cham. https://doi.org/10.1007/978-3-030-61380-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-61380-8_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-61379-2

  • Online ISBN: 978-3-030-61380-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation