Reachability and Coverage Planning for Connected Agents

Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber

IJCAI 2019 pp. 144-150

doi:10.24963/IJCAI.2019/21 /ijcai/2019/charrier2019ijcai-reachability/

Abstract

Motivated by the increasing appeal of robots in information-gathering missions, we study multi-agent path planning problems in which the agents must remain interconnected. We model an area by a topological graph specifying the movement and the connectivity constraints of the agents. We study the theoretical complexity of the reachability and the coverage problems of a fleet of connected agents on various classes of topological graphs. We establish the complexity of these problems on known classes, and introduce a new class called sight-moveable graphs which admit efficient algorithms.

PDF IJCAI Semantic Scholar

Cite

Text

Charrier et al. "Reachability and Coverage Planning for Connected Agents." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/21

Markdown

[Charrier et al. "Reachability and Coverage Planning for Connected Agents." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/charrier2019ijcai-reachability/) doi:10.24963/IJCAI.2019/21

BibTeX

@inproceedings{charrier2019ijcai-reachability,
  title     = {{Reachability and Coverage Planning for Connected Agents}},
  author    = {Charrier, Tristan and Queffelec, Arthur and Sankur, Ocan and Schwarzentruber, François},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {144-150},
  doi       = {10.24963/IJCAI.2019/21},
  url       = {https://mlanthology.org/ijcai/2019/charrier2019ijcai-reachability/}
}