Asymptotically optimal inspection planning using systems with differential constraints
Open Access
- 1 May 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4126-4133
- https://doi.org/10.1109/icra.2013.6631159
Abstract
This paper proposes a new inspection planning algorithm, called Random Inspection Tree Algorithm (RITA). Given a perfect model of a structure, sensor specifications, robot's dynamics, and an initial configuration of a robot, RITA computes the optimal inspection trajectory that observes all points on the structure. Many inspection planning algorithms have been proposed, most of them consist of two sequential steps. In the first step, they compute a small set of observation points such that each point on the structure is visible. In the second step, they compute the shortest trajectory to visit all observation points at least once. The robot's kinematic and dynamic constraints are taken into account only in the second step. Thus, when the robot has differential constraints and operates in cluttered environments, the observation points may be difficult or even infeasible to reach. To alleviate this difficulty, RITA computes both observation points and the trajectory to visit the observation points simultaneously. RITA uses sampling-based techniques to find admissible trajectories with decreasing cost. Simulation results for 2-D environments are promising. Furthermore, we present analysis on the probabilistic completeness and asymptotic optimality of our algorithm.Keywords
This publication has 10 references indexed in Scilit:
- Sampling-based sweep planning to exploit local planarity in the inspection of complex 3D structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- Uncertainty-driven view planning for underwater inspectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- Sampling-based algorithms for optimal motion planningThe International Journal of Robotics Research, 2011
- Optimal kinodynamic motion planning using incremental sampling-based methodsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Uniform Coverage of Automotive Surface PatchesThe International Journal of Robotics Research, 2005
- Sensor-based Coverage of Unknown Environments: Incremental Construction of Morse DecompositionsThe International Journal of Robotics Research, 2002
- Randomized Kinodynamic Motion Planning with Moving ObstaclesThe International Journal of Robotics Research, 2002
- A randomized art-gallery algorithm for sensor placementPublished by Association for Computing Machinery (ACM) ,2001
- Coverage of Known Spaces: The Boustrophedon Cellular DecompositionAutonomous Robots, 2000
- Randomized planning for short inspection pathsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2000