Sweep-coverage

Weili Wu, Zhao Zhang, Wonjun Lee, Ding Zhu Du

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

In all previous coverage problems, targets or areas are required to be monitored all the time. But in many applications typically featured as patrolling, target points are only required to be monitored with certain frequency. For example, a set of static sensors are distributed in a forest, surveilling ecological environment. Information collected by those static sensors are gathered by a set of mobile sensors, say, at least once every three hours. One may be wondering what is the minimum number of mobile sensors that are needed to accomplish such a task, and how to design trajectories for those mobile sensors. Motivated by such a consideration, Cheng et al. proposed the following dynamic coverage problem.

Original languageEnglish
Title of host publicationSpringer Optimization and Its Applications
PublisherSpringer
Pages183-192
Number of pages10
DOIs
Publication statusPublished - 2020

Publication series

NameSpringer Optimization and Its Applications
Volume162
ISSN (Print)1931-6828
ISSN (Electronic)1931-6836

ASJC Scopus subject areas

  • Control and Optimization

Fingerprint Dive into the research topics of 'Sweep-coverage'. Together they form a unique fingerprint.

Cite this