Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dung-Han Lee

dblp:289/0375 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Robot navigation and mapping · 67% Reinforcement learning · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
exploration
0.512021
Graph-based Topological Exploration Planning in Large-scale 3D Environments · ICRA 2021
Robotics › Robot navigation and mapping › robot mapping
map representation
0.512021
Graph-based Topological Exploration Planning in Large-scale 3D Environments · ICRA 2021
Robotics › Robot navigation and mapping › robot mapping
topological map
0.512021
Graph-based Topological Exploration Planning in Large-scale 3D Environments · ICRA 2021

Methods — techniques the papers use, named apart from their topics

graph-based planning · 0.5convex polyhedron decomposition · 0.5
YearPublicationVenuePosition
2021 Graph-based Topological Exploration Planning in Large-scale 3D Environments
abstract
Currently, state-of-the-art exploration methods maintain high-resolution map representations in order to optimize exploration goals in each step that maximizes information gain. However, during exploring, those "optimal" selections could quickly become obsolete due to the influx of new information, especially in large-scale environments, and result in high-frequency re-planning that hinders the overall exploration efficiency. In this paper, we propose a graph-based topological planning framework, building a sparse topological map in three-dimensional (3D) space to guide exploration steps with high-level intents so as to render consistent exploration maneuvers. Specifically, this work presents a novel method to estimate 3D space’s geometry with convex polyhedrons. Then, the geometry information is utilized to group space into distinctive regions. And those regions are added as nodes into the topological map, directing the exploration process. We compared our method with the state-of-the-art in simulated environments. The proposed method achieves higher space coverage and outperforms exploration efficiency by more than 40% during experiments. Finally, a field experiment was conducted to further evaluate the applicability of our method to empower efficient and robust exploration in real-world environments.
Fan Yang 0092, Dung-Han Lee, John Keller, Sebastian A. Scherer
ICRA2