Skip to main content
SpringerLink
Log in

A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well

  • Conference paper
PRICAI 2014: Trends in Artificial Intelligence (PRICAI 2014)

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

Included in the following conference series:

Abstract

This paper addresses makespan optimal solving of cooperative path-finding problem (CPF) by translating it to propositional satisfiability (SAT). A novel very simple SAT encoding of CPF is proposed and compared with existing elaborate encodings. The conducted experimental evaluation shown that the simple design of the encoding allows solving it faster than existing encodings for CPF in cases with higher density of agents.

This work is supported by the Czech Science Foundation (contract no. GAP103/10/1287).

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Audemard, G., Simon, L.: The Glucose SAT Solver (2013), http://labri.fr/perso/lsimon/glucose/ (accessed in June 2014)

  2. Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability. IOS Press (2009)

    Google Scholar 

  3. Bjork, M.: Successful SAT Encoding Techniques. Journal on Satisfiability, Boolean Modeling and Computation (2009)

    Google Scholar 

  4. Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers (2003)

    Google Scholar 

  5. Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Gent, I.P., Walsh, T.: The SAT Phase Transition. In: Proceedings of the 11th European Conference on Artificial Intelligence (ECAI 1994), pp. 105–109. John Wiley and Sons (1994)

    Google Scholar 

  7. Huang, R., Chen, Y., Zhang, W.: A Novel Transition Based Encoding Scheme for Planning as Satisfiability. In: Proceedings AAAI 2010. AAAI Press (2010)

    Google Scholar 

  8. Kautz, H., Selman, B.: Unifying SAT-based and Graph-based Planning. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 318–325. Morgan Kaufmann (1999)

    Google Scholar 

  9. Korf, R.E., Taylor, L.A.: Finding Optimal Solutions to the 24-Puzzle. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), pp. 1202–1207. AAAI Press (1996)

    Google Scholar 

  10. Ratner, D., Warmuth, M.K.: Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable. In: Proceedings of AAAI 1986, pp. 168–172. Morgan Kaufmann (1986)

    Google Scholar 

  11. Régin, J.-C.: A Filtering Algorithm for Constraints of Difference in CSPs. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI 1994), pp. 362–367. AAAI Press (1994)

    Google Scholar 

  12. Ryan, M.R.K.: Exploiting Subgraph Structure in Multi-Robot Path Planning. Journal of Artificial Intelligence Research (JAIR) 31, 497–542 (2008)

    MATH  Google Scholar 

  13. Sharon, G., Stern, R., Goldenberg, M., Felner, A.: The increasing cost tree search for optimal multi-agent pathfinding. Artificial Intelligence 195, 470–495 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  14. Silver, D.: Cooperative Pathfinding. In: Proceedings of the 1st Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE 2005), pp. 117–122. AAAI Press (2005)

    Google Scholar 

  15. Standley, T.S., Korf, R.E.: Complete Algorithms for Cooperative Pathfinding Problems. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 668–673. IJCAI/AAAI Press (2011)

    Google Scholar 

  16. Surynek, P.: Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving. In: Anthony, P., Ishizuka, M., Lukose, D. (eds.) PRICAI 2012. LNCS, vol. 7458, pp. 564–576. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  17. Surynek, P.: On Propositional Encodings of Cooperative Path-Finding. In: Proceedings of the 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012), pp. 524–531. IEEE Press (2012)

    Google Scholar 

  18. de Wilde, B., ter Mors, A., Witteveen, C.: Push and rotate: cooperative multi-agent path planning. In: Proceedings of International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2013), pp. 87–94. IFAAMAS (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University Prague, Malostranské, náměstí 2/25, 118 00, Praha 1, Czech Republic

    Pavel Surynek

Authors
  1. Pavel Surynek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. MIMOS Berhad Technology Park Malaysia, 57000, Bukit Jalil, KL, Malaysia

    Duc-Nghia Pham

  2. Kyungpook National University, Sankyuk-Dong, Buk-Gu, 702-701, Daegu, Korea

    Seong-Bae Park

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Surynek, P. (2014). A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well. In: Pham, DN., Park, SB. (eds) PRICAI 2014: Trends in Artificial Intelligence. PRICAI 2014. Lecture Notes in Computer Science(), vol 8862. Springer, Cham. https://doi.org/10.1007/978-3-319-13560-1_66

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13560-1_66

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13559-5

  • Online ISBN: 978-3-319-13560-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation