Directional Sensor Planning for Occlusion Avoidance
- 15 September 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 38 (6) , 3713-3733
Abstract
Directional sensors, such as video cameras, have become ubiquitous to many autonomous robots applications, such as monitoring and surveillance. The performance of these sensors and processing algorithms, however, may be hindered by the presence of objects that block visibility. This article presents a novel approach for planning the path of a mobile directional sensor deployed to observe multiple targets distributed in an environment populated with multiple obstacles and occlusions. Unlike existing art gallery or watchman’s route methods, the visibility theory and motion planners developed in this article account for both line-of-sight visibility and bounded field-of-view constraints, and can provide obstacle avoidance based on robot geometry and kinodynamic constraints. The computational complexity analysis and experiments on a camera-equipped drone demonstrate that, despite the challenging geometric characteristics of directional C-targets, the approach scales to real-world problems. Furthermore, when compared to algorithms inspired by traveling salesman and target coverage approaches, the directional visibility planners presented in this article are significantly more effective both at guaranteeing complete target visibility and at minimizing distance traveled.Keywords
Funding Information
- Office of Naval Research (N00014-17-1-2175, N00014-19-1-2144)
This publication has 50 references indexed in Scilit:
- Intelligent Coverage Path Planning for Agricultural Robots and Autonomous Machines on Three-Dimensional TerrainJournal of Intelligent & Robotic Systems, 2013
- Improved Results on Geometric Hitting Set ProblemsDiscrete & Computational Geometry, 2010
- An Information Roadmap Method for Robotic Sensor Path PlanningJournal of Intelligent & Robotic Systems, 2009
- Information-Driven Search Strategies in the Board Game of CLUE $^{\circit{R}}$IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2009
- TSP with neighborhoods of varying sizeJournal of Algorithms, 2005
- Art Gallery and Illumination Problems2000
- Geometric Shortest Paths and Network Optimization2000
- An Output-Sensitive Algorithm for Computing Visibility GraphsSIAM Journal on Computing, 1991
- The Ultimate Planar Convex Hull Algorithm?SIAM Journal on Computing, 1986
- Optimal packing and covering in the plane are NP-completeInformation Processing Letters, 1981