Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field

DOI10.1007/978-3-540-73951-7_50MaRDI QIDQ3603559zbMATH OpenOpenAlexFDO

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

Publication date 17 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73951-7_50

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Algorithms for computing best coverage path in the presence of obstacles in a sensor field
• Complexity of barrier coverage with relocatable sensors in the plane
• Barrier Coverage with Uniform Radii in 2D

Cited in

(2)

• Heuristic anti-monitoring path searching algorithm in sensory field
• Algorithms for computing best coverage path in the presence of obstacles in a sensor field

This page was built for publication: 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 Q3603559)