Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain

DOI10.1007/s00454-013-9525-xzbMath1298.68276arXiv1207.6409OpenAlexW1988777116MaRDI QIDQ368758

Haitao Wang, Danny Z. Chen, Yan Gu, Jian Li

Publication date: 23 September 2013

Published in: Discrete \& Computational Geometry, Algorithm Theory – SWAT 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.6409

zbMATH Keywords

optimizationalgorithmsbarrier coveragelinear barriermin-max sensor movement

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Communication theory (94A05)

Related Items (21)

On synchronization and orientation in distributed barrier coverage with relocatable sensors ⋮ On the complexity of barrier resilience for fat regions and bounded ply ⋮ On the displacement for covering a unit interval with randomly placed sensors ⋮ Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage ⋮ “Green” Barrier Coverage with Mobile Sensors ⋮ Optimal online and offline algorithms for robot-assisted restoration of barrier coverage ⋮ Optimizing movement in convex and non-convex path-networks to establish connectivity ⋮ Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity ⋮ Improved PTASs for convex barrier coverage ⋮ Distributed algorithms for barrier coverage using relocatable sensors ⋮ Minimizing the aggregate movements for interval coverage ⋮ ``Green barrier coverage with mobile sensors ⋮ Algorithms for the line-constrained disk coverage and related problems ⋮ Minimizing the total cost of barrier coverage in a linear domain ⋮ Balanced splitting on weighted intervals ⋮ Algorithms for covering multiple barriers ⋮ Minimizing the Maximum Moving Cost of Interval Coverage ⋮ Weak coverage of a rectangular barrier ⋮ Complexity of barrier coverage with relocatable sensors in the plane ⋮ Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements ⋮ Maximizing Barrier Coverage Lifetime with Mobile Sensors

Cites Work

• Representing a functional curve by curves with fewer peaks
• Optimal movement of mobile sensors for barrier coverage of a planar region
• Optimal point movement for covering circular regions
• New Algorithms for Barrier Coverage with Mobile Sensors
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• An Optimal-Time Algorithm for Slope Selection
• Slowing down sorting networks to obtain faster sorting algorithms

This page was built for publication: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain