Optimal movement of mobile sensors for barrier coverage of a planar region
From MaRDI portal
Publication:1040594
DOI10.1016/j.tcs.2009.07.007zbMath1192.68816OpenAlexW2001156795MaRDI QIDQ1040594
Andreas Wiese, Yuzhuang Hu, Qiaosheng Shi, Evangelos Kranakis, M. V. D. Burmester, Binay K. Bhattacharya
Publication date: 25 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.007
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
On synchronization and orientation in distributed barrier coverage with relocatable sensors, On the displacement for covering a unit interval with randomly placed sensors, Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage, Barrier Coverage with Uniform Radii in 2D, A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with MinSum movement, Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain, “Green” Barrier Coverage with Mobile Sensors, Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane, Optimal online and offline algorithms for robot-assisted restoration of barrier coverage, Optimal sensor networks for area monitoring using rotating and beam sensors, 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 covering multiple barriers, Weak coverage of a rectangular barrier, On the moment absolute deviation of order statistics from uniform distribution, Optimal placement of base stations in border surveillance using limited capacity drones, Complexity of barrier coverage with relocatable sensors in the plane, Maximizing Barrier Coverage Lifetime with Mobile Sensors, Optimal point movement for covering circular regions
Cites Work
- Disjoint circuits of prescribed homotopies in a graph on a compact surface
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Slowing down sorting networks to obtain faster sorting algorithms
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item