Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-09T07:39:39.970Z Has data issue: false hasContentIssue false

An incremental sampling-based approach to inspection planning: the rapidly exploring random tree of trees

Published online by Cambridge University Press:  11 March 2016

Andreas Bircher
Affiliation:
Autonomous Systems Lab at ETH Zurich, Leonhardstrasse 21, 8092 Zurich, Switzerland E-mails: andreas.bircher@mavt.ethz.ch, ulrich.schwesinger@mavt.ethz.ch, sammy.omari@mavt.ethz.ch, michael.burri@mavt.ethz.ch, rsiegwart@ethz.ch
Kostas Alexis*
Affiliation:
University of Nevada, Reno, 1664 N. Virginia St., 89557, Reno, NV, US
Ulrich Schwesinger
Affiliation:
Autonomous Systems Lab at ETH Zurich, Leonhardstrasse 21, 8092 Zurich, Switzerland E-mails: andreas.bircher@mavt.ethz.ch, ulrich.schwesinger@mavt.ethz.ch, sammy.omari@mavt.ethz.ch, michael.burri@mavt.ethz.ch, rsiegwart@ethz.ch
Sammy Omari
Affiliation:
Autonomous Systems Lab at ETH Zurich, Leonhardstrasse 21, 8092 Zurich, Switzerland E-mails: andreas.bircher@mavt.ethz.ch, ulrich.schwesinger@mavt.ethz.ch, sammy.omari@mavt.ethz.ch, michael.burri@mavt.ethz.ch, rsiegwart@ethz.ch
Michael Burri
Affiliation:
Autonomous Systems Lab at ETH Zurich, Leonhardstrasse 21, 8092 Zurich, Switzerland E-mails: andreas.bircher@mavt.ethz.ch, ulrich.schwesinger@mavt.ethz.ch, sammy.omari@mavt.ethz.ch, michael.burri@mavt.ethz.ch, rsiegwart@ethz.ch
Roland Siegwart
Affiliation:
Autonomous Systems Lab at ETH Zurich, Leonhardstrasse 21, 8092 Zurich, Switzerland E-mails: andreas.bircher@mavt.ethz.ch, ulrich.schwesinger@mavt.ethz.ch, sammy.omari@mavt.ethz.ch, michael.burri@mavt.ethz.ch, rsiegwart@ethz.ch
*
*Corresponding author. E-mail: kalexis@unr.edu
Rights & Permissions [Opens in a new window]

Summary

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A new algorithm, called rapidly exploring random tree of trees (RRTOT) is proposed, that aims to address the challenge of planning for autonomous structural inspection. Given a representation of a structure, a visibility model of an onboard sensor, an initial robot configuration and constraints, RRTOT computes inspection paths that provide full coverage. Sampling based techniques and a meta-tree structure consisting of multiple RRT* trees are employed to find admissible paths with decreasing cost. Using this approach, RRTOT does not suffer from the limitations of strategies that separate the inspection path planning problem into that of finding the minimum set of observation points and only afterwards compute the best possible path among them. Analysis is provided on the capability of RRTOT to find admissible solutions that, in the limit case, approach the optimal one. The algorithm is evaluated in both simulation and experimental studies. An unmanned rotorcraft equipped with a vision sensor was utilized as the experimental platform and validation of the achieved inspection properties was performed using 3D reconstruction techniques.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 2016 

Bircher supplementary material

Bircher supplementary material 1

Download Bircher supplementary material(Video)
Video 9.8 MB