Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search

16 Sep 2018Pavel Surynek

We address item relocation problems in graphs in this paper. We assume items placed in vertices of an undirected graph with at most one item per vertex... (read more)

PDF Abstract


No code implementations yet. Submit your code now

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.