TY - GEN
T1 - Planning complex inspection tasks using redundant roadmaps
AU - Englot, Brendan
AU - Hover, Franz
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2017.
PY - 2017
Y1 - 2017
N2 - The aim of this work is fast, automated planning of robotic inspections involving complex 3D structures. A model comprised of discrete geometric primitives is provided as input, and a feasible robot inspection path is produced as output. Our algorithm is intended for tasks in which 2.5D algorithms, which divide an inspection into multiple 2D slices, and segmentation-based approaches, which divide a structure into simpler components, are unsuitable. This degree of 3D complexity has been introduced by the application of autonomous in-water ship hull inspection; protruding structures at the stern (propellers, shafts, and rudders) are positioned in close proximity to one another and to the hull, and clearance is an issue for a mobile robot. A global, sampling-based approach is adopted, in which all the structures are simultaneously considered in planning a path. First, the state space of the robot is discretized by constructing a roadmap of feasible states; construction ceases when each primitive is observed by a specified number of states. Once a roadmap is produced, the set cover problem and traveling salesman problem are approximated in sequence to build a feasible inspection tour. We analyze the performance of this procedure in solving one of the most complex inspection planning tasks to date, covering the stern of a large naval ship, using an a priori triangle mesh model obtained from real sonar data and comprised of 100,000 primitives. Our algorithm generates paths on a par with dual sampling, with reduced computational effort.
AB - The aim of this work is fast, automated planning of robotic inspections involving complex 3D structures. A model comprised of discrete geometric primitives is provided as input, and a feasible robot inspection path is produced as output. Our algorithm is intended for tasks in which 2.5D algorithms, which divide an inspection into multiple 2D slices, and segmentation-based approaches, which divide a structure into simpler components, are unsuitable. This degree of 3D complexity has been introduced by the application of autonomous in-water ship hull inspection; protruding structures at the stern (propellers, shafts, and rudders) are positioned in close proximity to one another and to the hull, and clearance is an issue for a mobile robot. A global, sampling-based approach is adopted, in which all the structures are simultaneously considered in planning a path. First, the state space of the robot is discretized by constructing a roadmap of feasible states; construction ceases when each primitive is observed by a specified number of states. Once a roadmap is produced, the set cover problem and traveling salesman problem are approximated in sequence to build a feasible inspection tour. We analyze the performance of this procedure in solving one of the most complex inspection planning tasks to date, covering the stern of a large naval ship, using an a priori triangle mesh model obtained from real sonar data and comprised of 100,000 primitives. Our algorithm generates paths on a par with dual sampling, with reduced computational effort.
UR - http://www.scopus.com/inward/record.url?scp=84984815995&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84984815995&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-29363-9_19
DO - 10.1007/978-3-319-29363-9_19
M3 - Conference contribution
AN - SCOPUS:84984815995
SN - 9783319293622
T3 - Springer Tracts in Advanced Robotics
SP - 327
EP - 343
BT - Robotics Research - The 15th International Symposium ISRR
A2 - Christensen, Henrik I.
A2 - Khatib, Oussama
T2 - 15th International Symposium of Robotics Research, 2011
Y2 - 9 December 2011 through 12 December 2011
ER -