Robotics: Science and Systems XVII 2021
DOI: 10.15607/rss.2021.xvii.018
|View full text |Cite
|
Sign up to set email alerts
|

TARE: A Hierarchical Framework for Efficiently Exploring Complex 3D Environments

Abstract: We present a method for autonomous exploration in complex three-dimensional (3D) environments. Our method demonstrates exploration faster than the current state-of-the-art using a hierarchical framework -one level maintains data densely and computes a detailed path within a local planning horizon, while another level maintains data sparsely and computes a coarse path at the global scale. Such a framework shares the insight that detailed processing is most effective close to the robot, and gains computational s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
29
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 79 publications
(37 citation statements)
references
References 19 publications
(27 reference statements)
0
29
0
Order By: Relevance
“…Exploration algorithms are loosely characterized as information theoretic [6,11,19,34], which are seen as mathematically sound, frontier-based [7,17,20,28,37,40], which are computationally efficient, or graph search-based [8,12,13,38], which are scalable. Our pipeline is primarily frontier-based, but with a new frontier definition and selection heuristic, and also uses graph search for specific behaviors.…”
Section: Related Workmentioning
confidence: 99%
“…Exploration algorithms are loosely characterized as information theoretic [6,11,19,34], which are seen as mathematically sound, frontier-based [7,17,20,28,37,40], which are computationally efficient, or graph search-based [8,12,13,38], which are scalable. Our pipeline is primarily frontier-based, but with a new frontier definition and selection heuristic, and also uses graph search for specific behaviors.…”
Section: Related Workmentioning
confidence: 99%
“…The method [19] uses a combination of sampling and frontierbased method to reduce the impact of finding unexplored areas in large scenarios. There are also some two-stage methods [12], [13] to cover the entire environment efficiently by different planning strategies in the global and local map.…”
Section: Related Workmentioning
confidence: 99%
“…The resulting long re-planning times make them unpractical for time-constrained and fast-paced dynamic scenarios. These computational issues are partially addressed by [9], [10], but as the aforementioned methods, they simplify or do not consider the kinodynamic constraints of the robot.…”
Section: Introductionmentioning
confidence: 99%