DMAPF: A Decentralized and Distributed Solver for Multi-Agent Path Finding Problem with Obstacles

  title={DMAPF: A Decentralized and Distributed Solver for Multi-Agent Path Finding Problem with Obstacles},
  author={Poom Pianpak and Tran Cao Son},
  booktitle={ICLP Technical Communications},
ion (e.g., planning for each agent independently then combine the partial plans to obtain the solution – while resolving any conflict), dealing with MAPF problems with a large number of agents (greater than a thousand) still remains a challenge. We have designed a decentralized and distributed MAPF algorithm, named DMAPF – Distributed Multi-Agent Pathfinder – with scalability in mind. DMAPF is able to take advantage of distributed computing to cope with the possibility of having an ever… 

Figures and Tables from this paper


A distributed solver for multi-agent path finding problems
The highlights of ros-dmapf are its scalability and a high degree of parallelism, and its evaluation against some other MAPF solvers shows that the system performs well.
Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem
This work proposes several ways to relax the optimality conditions of CBS trading solution quality for runtime as well as bounded-suboptimal variants, where the returned solution is guaranteed to be within a constant factor from optimal solution cost.
Conflict-based search for optimal multi-agent pathfinding
A new search algorithm called Conflict Based Search (CBS), which enables CBS to examine fewer states than A* while still maintaining optimality and shows a speedup of up to a full order of magnitude over previous approaches.
Cooperative Pathfinding
The results show that the new algorithms, especially WHCA*, are robust and efficient solutions to the Cooperative Pathfinding problem, finding more successful routes and following better paths than Local Repair A*.
Experimenting with robotic intra-logistics domains
The asprilo1 framework is introduced to facilitate experimental studies of approaches addressing complex dynamic applications in the domain of robotic intra-logistics and consists of a versatile benchmark generator, solution checker and visualizer as well as a bunch of reference encodings featuring various ASP techniques.
Clingo = ASP + Control: Preliminary Report
By strictly separating logic and control programs, clingo 4 also abolishes the need for dedicated systems for incremental and reactive reasoning, like iclingo and oclingo, respectively, and its flexibility goes well beyond the advanced yet still rigid solving processes of the latter.
Integrating ASP into ROS for Reasoning in Robots
A package integrating the new version of the ASP solver clingo with the popular open-source robotic middleware Robot Operating System (ROS) provides a generic way by which an ASP program can be used to control the behaviour of a robot and to respond to the results of the robot's actions.
Logic programs with stable model semantics as a constraint programming paradigm
  • I. Niemelä
  • Mathematics, Computer Science
    Annals of Mathematics and Artificial Intelligence
  • 2004
It is shown that the novel paradigm embeds classical logical satisfiability and standard (finite domain) constraint satisfaction problems but seems to provide a more expressive framework from a knowledge representation point of view.
ROS: an open-source Robot Operating System
This paper discusses how ROS relates to existing robot software frameworks, and briefly overview some of the available application software which uses ROS.
Stable models and an alternative logic programming paradigm
It is demonstrated that inherent features of stable model semantics naturally lead to a logic programming system that offers an interesting alternative to more traditional logic programming styles of Horn logic programming, stratified logic programming and logic programming with well-founded semantics.