Maximum Gaps in Path Coverage

被引:1
|
作者
Shamoun, Simon [1 ]
Abdelzaher, Tarek [2 ]
Bar-Noy, Amotz [1 ]
机构
[1] CUNY, New York, NY 10021 USA
[2] Univ Illinois, Urbana, IL 61801 USA
关键词
sensor selection; path coverage; coverage gaps;
D O I
10.1145/3345768.3355940
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We study the maximum size of coverage gaps by sensors selected to cover a path. Gap sizes, and not just total coverage, are important because significant events can be missed during uncovered periods. The amount of knowledge about a path affects the ability to select sensors to cover it. We first study how coverage gaps are affected by increases in knowledge and improvements in selection strategies when sensors are selected to maximize path coverage. The gap size does not necessarily decrease in the same way that coverage increases with a better selection. We then show that even simple modifications to the algorithm can reduce the coverage gap, and show how this is affected about the level of knowledge.
引用
收藏
页码:109 / 112
页数:4
相关论文
共 50 条
  • [21] Maximum independent and disjoint coverage
    Dhar, Amit Kumar
    Madireddy, Raghunath Reddy
    Pandit, Supantha
    Singh, Jagpreet
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (04) : 1017 - 1037
  • [22] The Generalized Maximum Coverage Problem
    Cohen, Reuven
    Katzir, Liran
    INFORMATION PROCESSING LETTERS, 2008, 108 (01) : 15 - 22
  • [23] Heliostats for maximum ground coverage
    Schramek, P
    Mills, DR
    ENERGY, 2004, 29 (5-6) : 701 - 713
  • [24] Small arrays of maximum coverage
    Das, Shagnik
    Meszaros, Tamas
    JOURNAL OF COMBINATORIAL DESIGNS, 2018, 26 (10) : 487 - 504
  • [25] Maximum independent and disjoint coverage
    Amit Kumar Dhar
    Raghunath Reddy Madireddy
    Supantha Pandit
    Jagpreet Singh
    Journal of Combinatorial Optimization, 2020, 39 : 1017 - 1037
  • [26] Budgeted maximum graph coverage
    Krumke, SO
    Marathe, MV
    Poensgen, D
    Ravi, SS
    Wirth, HC
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2002, 2573 : 321 - 332
  • [27] MAXIMUM TERM OF AN ENTIRE SERIES WITH GAPS
    BUCKHOLTZ, JD
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1965, 16 (02) : 272 - +
  • [28] Safest Path Adversarial Coverage
    Yehoshua, Roi
    Agmon, Noa
    Kaminka, Gal A.
    2014 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2014), 2014, : 3027 - 3032
  • [29] An American Path to Universal Coverage
    Kirsch, Richard
    JOURNAL OF AMBULATORY CARE MANAGEMENT, 2019, 42 (03): : 211 - 217
  • [30] Coverage Path Planning using Path Primitive Sampling and Primitive Coverage Graph for Visual Inspection
    Jing, Wei
    Deng, Di
    Xiao, Zhe
    Liu, Yong
    Shimada, Kenji
    2019 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2019, : 1472 - 1479