Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2105.06030

Changeable Sweep Coverage Problem

Dieyan Liang·Hong Shen
View original source ↗Read source document ↗Export metadata ↓

Abstract

Sweep coverage is to realize the periodic coverage of targets by planning the periodic sweeping paths of mobile sensors. It is difficult for sensors to reduce energy consumption by reducing the moving distances. Therefore, charging technology is the best way to extend the lifetime of the sweep coverage network. This paper studies the sweep coverage of rechargeable sensors: the sensors are rechargeable, constantly sweep between the target points and the charging stations not only tp meet the periodic coverage requirement of the target points, but also need to return to the charging stations during the charging period to avoid running out of energy. This paper proposes the general definition of Chargeable Sweep Coverage (CSC) problem for the first time, and studies the complexity of the CSC problem by analyzing CSC problems under different constraints, and then proposes two kinds of CSC problems under special constraints: 1) The sensors need to return to their original charging stations for charging; 2) The sensors can go to different charging stations for charging, and the number of charging stations is 2. Both of these problems are NP-hard. In this paper, these two problems are modeled as the maximum set coverage problem, and the approximation algorithms are obtained by reducing the number of candidate paths to polynomials. The validity and scalability of the proposed algorithms is proved by theoretical proof and experimental simulation.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Dieyan Liang, Hong Shen. 2021-05-13. Changeable Sweep Coverage Problem. https://arxiv.org/abs/2105.06030

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗