Algorithms for computing best coverage path in the presence of obstacles in a sensor field

DOI10.1016/J.JDA.2012.01.004MaRDI QIDQ450535zbMATH OpenOpenAlexFDO

Authors Senjuti Basu Roy, Sajal K. Das, Gautam Das

Publication date 13 September 2012

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2012.01.004

zbMATH Keywords

spannerVoronoi diagramsensor networkcoverage problemvisibility graph

Mathematics Subject Classification ID

Approximation algorithms (68W25) Mathematical problems of computer architecture (68M07) Distributed systems (68M14)

Recommendations

• Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
• Barrier Coverage with Uniform Radii in 2D
• Path optimization with limited sensing ability

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
• Finding constrained and weighted Voronoi diagrams in the plane
• Voronoi diagrams with barriers and the shortest diagonal problem

Cited in

(3)

• Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
• Efficient algorithms for support path with time constraint
• Heuristic anti-monitoring path searching algorithm in sensory field

This page was built for publication: Algorithms for computing best coverage path in the presence of obstacles in a sensor field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450535)