DeepAI AI Chat
Log In Sign Up

Dynamic Connected Cooperative Coverage Problem

by   Tristan Charrier, et al.

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.


page 1

page 2

page 3

page 4


Reachability and Coverage Planning for Connected Agents: Extended Version

Motivated by the increasing appeal of robots in information-gathering mi...

Losing at Checkers is Hard

We prove computational intractability of variants of checkers: (1) decid...

On Colouring (2P_2,H)-Free and (P_5,H)-Free Graphs

The Colouring problem asks whether the vertices of a graph can be colour...

Algorithmic Complexity of Secure Connected Domination in Graphs

Let G = (V,E) be a simple, undirected and connected graph. A connected (...

On Exploring Temporal Graphs of Small Pathwidth

We show that the Temporal Graph Exploration Problem is NP-complete, even...

Inequalities for space-bounded Kolmogorov complexity

There is a parallelism between Shannon information theory and algorithmi...

Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading

We consider dynamic loading and unloading problems for heavy geometric o...