English
Related papers

Related papers: Changeable Sweep Coverage Problem

200 papers

Most consumer-level low-cost unmanned aerial vehicles (UAVs) have limited battery power and long charging time. Due to these energy constraints, they cannot accomplish many practical tasks, such as monitoring a sport or political event for…

Robotics · Computer Science 2021-01-27 Jyh-Ming Lien , Sam Rodriguez , Marco Morales

Wireless sensor networks (WSNs) are emerging as an effective means for environment monitoring. This paper investigates a strategy for energy efficient monitoring in WSNs that partitions the sensors into covers, and then activates the covers…

Data Structures and Algorithms · Computer Science 2007-05-23 Zoe Abrams , Ashish Goel , Serge Plotkin

Coverage is one of the fundamental issues in wireless sensor networks (WSNs). It reflects the ability of WSNs to detect the fields of interest. In a real sensor networks application, the detection area is always non-ideal and the terrain of…

Networking and Internet Architecture · Computer Science 2013-12-25 Lin Feng , Tie Qiu , Zhenlong Sun , Feng Xia , Yu Zhou

In this paper, we present a novel problem of optimal placement of sensor nodes in wirelessly rechargeable Wireless Sensor Networks (WSNs) wrt. a charging requirement constraint and a task utility requirement constraint. We call this problem…

Networking and Internet Architecture · Computer Science 2018-05-22 Md Solimul Chowdhury

We study a mobile wireless sensor network (MWSN) consisting of multiple mobile sensors or robots. Three key factors in MWSNs, sensing quality, energy consumption, and connectivity, have attracted plenty of attention, but the interaction of…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-06-20 Jun Guo , Hamid Jafarkhani

One of the fundamental issue in wireless sensor network is conserving energy and thus extending the lifetime of the network. In this paper we investigate the coverage problem in camera sensor networks by developing two algorithms which…

Systems and Control · Computer Science 2017-10-13 Mohsen Hooshmand , Shadrokh Samavi , S. M. Reza Soroushmehr

A multi-agent coverage problem is considered with energy-constrained agents. The objective of this paper is to compare the coverage performance between centralized and decentralized approaches. To this end, a near-optimal centralized…

Optimization and Control · Mathematics 2020-08-27 Xiangyu Meng , Xinmiao Sun , Christos G. Cassandras , Kaiyuan Xu

We carry out a structural and algorithmic study of a mobile sensor coverage optimization problem targeting 2D surfaces embedded in a 3D workspace. The investigated settings model multiple important applications including camera network…

Robotics · Computer Science 2021-03-22 Si Wei Feng , Kai Gao , Jie Gong , Jingjin Yu

This paper considers the application of Model Predictive Control (MPC) to a weighted coverage path planning (WCPP) problem. The problem appears in a wide range of practical applications, including search and rescue (SAR) missions. The basic…

Systems and Control · Electrical Eng. & Systems 2025-10-02 Kilian Schweppe , Ludmila Moshagen , Georg Schildbach

Recently, Wireless Rechargeable Sensor Networks (WRSNs) that leveraged the advantage of wireless energy transfer technology have opened a promising opportunity in solving the limited energy issue. However, an ineffective charging strategy…

Artificial Intelligence · Computer Science 2025-05-23 Huynh Thi Thanh Binh , Le Van Cuong , Dang Hai Dang , Le Trong Vinh

Coverage is one of the fundamental issues in wireless multimedia sensor networks (WMSNs). It reflects the ability of WMSNs to detect the fields. Motivated by the existing-enhancing algorithm of traditional 2D WMSNs, a new 3D WMSNs sensing…

Networking and Internet Architecture · Computer Science 2015-09-17 Shasha Xu , Weijie Lyu , Huilin Li

The coverage problem in wireless sensor networks deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments in sensor networks. A line segment ` is said…

Computational Geometry · Computer Science 2017-11-16 Dinesh Dash , Arijit Bishnu , Arobinda Gupta , Subhas C. Nandy

In this paper we focus on the mobile sensor coverage problem formulated as a continuous locational optimization problem. Cort\`es et al. first proposed a distributed version of the Lloyd descent algorithm with guaranteed convergence to a…

Systems and Control · Computer Science 2014-12-02 Ajay Deshpande

Coverage path planning is a well-studied problem in robotics in which a robot must plan a path that passes through every point in a given area repeatedly, usually with a uniform frequency. To address the scenario in which some points need…

Machine Learning · Computer Science 2020-06-02 Rishi Shah , Yuqian Jiang , Justin Hart , Peter Stone

Assuming a random uniform distribution of n sensor nodes over a virtual grid, this paper addresses the problem of finding the maximum number of connected set covers each ensuring 100% coverage of the query region. The connected sets remain…

Networking and Internet Architecture · Computer Science 2014-02-14 Dibakar Saha , Nabanita Das

Optimal maintenance of sensor nodes in a Wireless Rechargeable Sensor Network (WRSN) requires effective scheduling of power delivery vehicles by solving the Charging Scheduling Problem (CSP). Deploying Unmanned Aerial Vehicles (UAVs) as…

Robotics · Computer Science 2023-04-17 Qiuchen Qian , James O'Keeffe , Yanran Wang , David Boyle

We study the problem of minimizing overall trip time for battery electric vehicles in road networks. As battery capacity is limited, stops at charging stations may be inevitable. Careful route planning is crucial, since charging stations…

Data Structures and Algorithms · Computer Science 2019-10-23 Moritz Baum , Julian Dibbelt , Andreas Gemsa , Dorothea Wagner , Tobias Zündorf

In this work, we study the target detection and tracking problem in mobile sensor networks, where the performance metrics of interest are probability of detection and tracking coverage, when the target can be stationary or mobile and its…

Networking and Internet Architecture · Computer Science 2010-06-23 Evsen Yanmaz , Hasan Guclu

This paper considers three related mobile robot multi-target sensory coverage and inspection planning problems in 2-D environments. In the first problem, a mobile robot must find the shortest path to observe multiple targets with a limited…

Robotics · Computer Science 2024-05-27 E. Fourney , J. W. Burdick , E. D. Rimon

We consider the problem of maximizing the lifetime of coverage (MLCP) of targets in a wireless sensor network with battery-limited sensors. We first show that the MLCP cannot be approximated within a factor less than $\ln n$ by any…

Networking and Internet Architecture · Computer Science 2014-07-01 Vivek Kumar Bagaria , Ashwin Pananjady , Rahul Vaze