2014 | OriginalPaper | Buchkapitel
A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well
verfasst von : Pavel Surynek
Erschienen in: PRICAI 2014: Trends in Artificial Intelligence
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.