Dynamic Connected Cooperative Coverage Problem
Tristan Charrier, Fran\c{c}ois Schwarzentruber, Eva Soulier
TL;DR
This paper investigates the computational complexity of a dynamic coverage problem where agents must visit regions and stay connected, proving PSPACE-completeness and NP-completeness under various conditions.
Contribution
The paper establishes the computational complexity classifications of the dynamic coverage problem and its variants, including proofs of PSPACE-completeness and NP-completeness.
Findings
The problem is PSPACE-complete in general.
The problem becomes NP-complete for bounded plans.
Complexities are maintained for certain subclasses of graphs.
Abstract
We study the so-called dynamic coverage problem by agents located in some topological graph. The agents must visit all regions of interest but they also should stay connected to the base via multi-hop. We prove that the algorithmic complexity of this planning problem is PSPACE-complete. Furthermore we prove that the problem becomes NP-complete for bounded plans. We also prove the same complexities for the reachability problem of some positions. We also prove that complexities are maintained for a subclass of topological graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Logic, Reasoning, and Knowledge · Complexity and Algorithms in Graphs