Multi-Agent Path Finding: A New Boolean Encoding

Multi-agent pathfinding (MAPF) is an NP-hard problem. As such, dense maps may be very hard to solve optimally. In such scenarios, compilation-based approaches, via Boolean satisfiability (SAT) and answer set programming (ASP), have been shown to outperform heuristic-search-based approaches, such as...

Full description

Bibliographic Details

Published in:	The Journal of artificial intelligence research Vol. 75; pp. 323 - 350
Main Authors:	Asín Achá, Roberto, López, Rodrigo, Hagedorn, Sebastian, Baier, Jorge A.
Format:	Journal Article
Language:	English
Published:	San Francisco AI Access Foundation 01.01.2022
Subjects:	Algorithms Artificial intelligence Boolean Boolean algebra Declarative programming Mathematical programming Multiagent systems Performance evaluation Searching Solvers Warehouses
ISSN:	1076-9757, 1076-9757, 1943-5037
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!