
Reachability and Coverage Planning for Connected Agents: Extended Version
Motivated by the increasing appeal of robots in informationgathering mi...
read it

Losing at Checkers is Hard
We prove computational intractability of variants of checkers: (1) decid...
read it

Algorithmic Complexity of Secure Connected Domination in Graphs
Let G = (V,E) be a simple, undirected and connected graph. A connected (...
read it

On the achromatic number of signed graphs
In this paper, we generalize the concept of complete coloring and achrom...
read it

Surjective HColouring over Reflexive Digraphs
The Surjective HColouring problem is to test if a given graph allows a ...
read it

Gathering in 1Interval Connected Graphs
We examine the problem of gathering k ≥ 2 agents (or multiagent rendezv...
read it

Complexity of Determining Nonemptiness of the Core
Coalition formation is a key problem in automated negotiation among self...
read it
Dynamic Connected Cooperative Coverage Problem
We study the socalled 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 multihop. We prove that the algorithmic complexity of this planning problem is PSPACEcomplete. Furthermore we prove that the problem becomes NPcomplete 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.
READ FULL TEXT
Comments
There are no comments yet.