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

DOI10.1016/J.JDA.2012.01.004zbMATH Open1247.68012OpenAlexW1986938448MaRDI QIDQ450535FDOQ450535

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

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

zbMATH Keywords

spannerVoronoi diagramsensor networkcoverage problemvisibility graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Title not available (Why is that?)
• Finding constrained and weighted Voronoi diagrams in the plane
• Title not available (Why is that?)
• Voronoi diagrams with barriers and the shortest diagonal problem
• Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field

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)