A Path Planning Method for Chargeable Sweep Coverage With Multiple Charging Stations

Dieyan Liang

doi:10.1109/ACCESS.2024.3373543

2024-01-01

Dieyan Liang

Baojian Feng *

Xuefeng Liao

DOI：10.1109/ACCESS.2024.3373543

原文链接

原文求助

摘要

En 中文

The energy limit would abbreviate the lifetime of sweep coverage network. Wireless charging technology might be the best way to extend the lifetime of sweep coverage networks, as sensors are required to constantly move to ensure periodic target coverage. This paper studies the sweep coverage facilitated by rechargeable sensors, which persistently navigate between target nodes and charging stations to fulfill the periodic coverage demands of the targets while ensuring they return to the charging stations before their energy runs out. This paper firstly proposes a general definition of the Chargeable Sweep Coverage (CSC) problem, and studies the CSC problem by examining various constraints. We also propose one CSC problem subject to a special constraint where the sensors must return to their initial charging stations to recharge. The CSC problem under constrain is also NP-hard. In this paper, the problem is modeled as Maximum nodes inclusion problem with unbound candidate paths. We discuss the effective paths of the problems by situation, bound the candidate paths to certain lengths using discretization technology, and employ existing approximation algorithms to get the approximation solutions. When the charging period is greater than the sweep period, we get a 2/5 -approximation algorithm. For the opposite, we get 1/6 -approximation algorithms for it. The validity and scalability of the proposed algorithms are proved by theoretical proofs and experimental simulations.

Keyword:

Sensors

Charging stations

Approximation algorithms

Wireless sensor networks

Routing

Inductive charging

Batteries

Path planning

Scalability

mobile sensors

sweep coverage

approximation algorithm

chargeable

期刊

IEEE Access

IF:

3.6

论文数:

9.8W

被引数:

29.4W

机构

Huizhou University

学者数:

895

论文数: 848

被引数: 1.4K

Wenzhou University of Technology

学者数:

476

论文数: 455

被引数: 367

引用论文

Development of gray matter atrophy in relapsing–remitting multiple sclerosis is not gender dependent: Results of a 5-year follow-up study

Clinical Neurology and Neurosurgery

IF0

2013-12-01

PREAI

Ondrej Dolezal; Tereza Gabelic; Dana Horakova; Niels Bergsland; Michael G. Dwyer; Zdeněk Seidl; Jan Krasensky; Deepa P. Ramasamy; Manuela Vaneckova; Eva Havrdova; Robert Zivadinov

Approximation Algorithms for the Generalized Team Orienteering Problem and its Applications

IEEE-ACM TRANSACTIONS ON NETWORKING

IF3.6

2021-02-01