Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants

@inproceedings{Surynek2017ModifyingOS,
  title={Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants},
  author={Pavel Surynek and Ariel Felner and Roni Stern and Eli Boyarski},
  booktitle={SOCS},
  year={2017}
}
In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. In this paper we focus on finding suboptimal solutions for MAPF for the sum-of-costs variant. Recently, a SAT-based approached was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we present SAT-based unbounded- and bounded-suboptimal algorithms and compare them to relevant algorithms. Experimental results show that in… CONTINUE READING
43
Twitter Mentions

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 32 REFERENCES

Conflict-based search for optimal multiagent pathfinding

G. Sharon, R. Stern, A. Felner, N. R. Sturtevant
  • Artif. Intell., 219:40–66
  • 2015
VIEW 17 EXCERPTS
HIGHLY INFLUENTIAL

In ECAI

Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. Efficient SAT approach to multiagent pat objective
  • pages 810–818,
  • 2016
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Constraint-based multi-robot path planning

  • 2010 IEEE International Conference on Robotics and Automation
  • 2010
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL