A General Formal Framework for Pathfinding Problems with Multiple Agents

• DOI: 10.1609/aaai.v27i1.8592
• Publication Date: 2022-06-22T20:52:15Z
• Authors: Esra Erdem; Doga Kisa; Umut Oztok; Peter Schüller
• Keywords: 0209 industrial biotechnology; 0202 electrical engineering, electronic engineering, information engineering; 02 engineering and technology

Pathfinding for a single agent is the problem of planning a route from an initial location to a goal location in an environment, going around obstacles. Pathfinding for multiple agents also aims to plan such routes for each agent, subject to different constraints, such as restrictions on the length of each path or on the total length of paths, no self-intersecting paths, no intersection of paths/plans, no crossing/meeting each other. It also has variations for finding optimal solutions, e.g., with respect to the maximum path length, or the sum of plan lengths. These problems are important for many real-life applications, such as motion planning, vehicle routing, environmental monitoring, patrolling, computer games. Motivated by such applications, we introduce a formal framework that is general enough to address all these problems: we use the expressive high-level representation formalism and efficient solvers of the declarative programming paradigm Answer Set Programming. We also introduce heuristics to improve the computational efficiency and/or solution quality. We show the applicability and usefulness of our framework by experiments, with randomly generated problem instances on a grid, on a real-world road network, and on a real computer game terrain.