TY - CHAP
T1 - Sweep-coverage
AU - Wu, Weili
AU - Zhang, Zhao
AU - Lee, Wonjun
AU - Du, Ding Zhu
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2020.
PY - 2020
Y1 - 2020
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85091947860&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-52824-9_11
DO - 10.1007/978-3-030-52824-9_11
M3 - Chapter
AN - SCOPUS:85091947860
T3 - Springer Optimization and Its Applications
SP - 183
EP - 192
BT - Springer Optimization and Its Applications
PB - Springer
ER -