SCG '86 Proceedings of the second annual symposium on Computational geometry
New methods for computing visibility graphs
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
Watchman routes under limited visibility
Computational Geometry: Theory and Applications
Journal of Algorithms
Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
A randomized art-gallery algorithm for sensor placement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
View planning for automated three-dimensional object reconstruction and inspection
ACM Computing Surveys (CSUR)
Finding shortest safari routes in simple polygons
Information Processing Letters
Chained Lin-Kernighan for Large Traveling Salesman Problems
INFORMS Journal on Computing
The visibility--voronoi complex and its applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements
Computer Vision and Image Understanding - Special issue on omnidirectional vision and camera networks
On the optimal placement of multiple visual sensors
Proceedings of the 4th ACM international workshop on Video surveillance and sensor networks
Planning Algorithms
Robust geometric computing and optimal visibility coverage
Robust geometric computing and optimal visibility coverage
Qualitative vision-based path following
IEEE Transactions on Robotics - Special issue on rehabilitation robotics
Directional Sensor Placement with Optimal Sensing Range, Field of View and Orientation
Mobile Networks and Applications
An approximate algorithm for solving the watchman route problem
RobVis'08 Proceedings of the 2nd international conference on Robot vision
Information Sciences: an International Journal
Inspection planning in the polygonal domain by Self-Organizing Map
Applied Soft Computing
Multi-robot repeated area coverage
Autonomous Robots
Visiting convex regions in a polygonal map
Robotics and Autonomous Systems
| Hi-index | 0.00 |
In this paper, we address the inspection planning problem to "see" the whole area of the given workspace by a mobile robot. The problem is decoupled into the sensor placement problem and the multi-goal path planning problem to visit found sensing locations. However the decoupled approach provides a feasible solution, its overall quality can be poor, because the sub-problems are solved independently. We propose a new randomized approach that considers the path planning problem during solution process of the sensor placement problem. The proposed algorithm is based on a guiding of the randomization process according to prior knowledge about the environment. The algorithm is compared with two algorithms already used in the inspection planning. Performance of the algorithms is evaluated in several real environments and for a set of visibility ranges. The proposed algorithm provides better solutions in both evaluated criterions: a number of sensing locations and a length of the inspection path.