Corpus ID: 38693704

Using Hierarchical Constraints to Avoid Conflicts in Multi-Agent Pathfinding

@inproceedings{Walker2017UsingHC,
  title={Using Hierarchical Constraints to Avoid Conflicts in Multi-Agent Pathfinding},
  author={Thayne T. Walker and David M. Chan and Nathan R. Sturtevant},
  booktitle={ICAPS},
  year={2017}
}
  • Thayne T. Walker, David M. Chan, Nathan R. Sturtevant
  • Published in ICAPS 2017
  • Computer Science
  • Recent work in multi-agent path planning has provided a number of optimal and suboptimal solvers that can efficiently find solutions to problems of growing complexity. Solvers based on Conflict-Based Search (CBS) combine single-agent solvers with shared constraints between agents to find feasible solutions. Suboptimal variants of CBS introduce alternate heuristics to avoid conflicts. In this paper we study the multiagent planning problem in the context of non-holonomic vehicles planning on a… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.

    References

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

    Enhanced Partial Expansion A

    VIEW 5 EXCERPTS

    M*: A complete multirobot path planning algorithm with performance bounds

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Fast and Memory-Efficient Multi-Agent Pathfinding

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL