Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution

Cite

Text

Su et al. "Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution." AAAI Conference on Artificial Intelligence, 2024. doi:10.1609/AAAI.V38I16.29706

Markdown

[Su et al. "Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution." AAAI Conference on Artificial Intelligence, 2024.](https://mlanthology.org/aaai/2024/su2024aaai-bidirectional/) doi:10.1609/AAAI.V38I16.29706

BibTeX

@inproceedings{su2024aaai-bidirectional,
  title     = {{Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution}},
  author    = {Su, Yifan and Veerapaneni, Rishi and Li, Jiaoyang},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2024},
  pages     = {17559-17566},
  doi       = {10.1609/AAAI.V38I16.29706},
  url       = {https://mlanthology.org/aaai/2024/su2024aaai-bidirectional/}
}