Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes

Pavel Surynek. Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes. In IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2021, Prague, Czech Republic, September 27 - Oct. 1, 2021. pages 7931-7938, IEEE, 2021. [doi]

@inproceedings{Surynek21-1,
  title = {Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes},
  author = {Pavel Surynek},
  year = {2021},
  doi = {10.1109/IROS51168.2021.9636296},
  url = {https://doi.org/10.1109/IROS51168.2021.9636296},
  researchr = {https://researchr.org/publication/Surynek21-1},
  cites = {0},
  citedby = {0},
  pages = {7931-7938},
  booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2021, Prague, Czech Republic, September 27 - Oct. 1, 2021},
  publisher = {IEEE},
  isbn = {978-1-6654-1714-3},
}