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

Hannah Lehner

dblp:210/9813 · DBLP profile ↗
← Back
2ranked-venue papers
2as 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 · 2 · 2 first-author · 1 since 2021Systems, architecture and hardware · 2 · 2 first-author · 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
Reinforcement learning · 30% Legged, aerial and field robots · 30% Knowledge representation and reasoning · 30%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
exploration
0.512021
Exploration of Large Outdoor Environments Using Multi-Criteria Decision Making · ICRA 2021
Knowledge, reasoning and agents › Knowledge representation and reasoning › decision theory
multi-criteria decision making
0.512021
Exploration of Large Outdoor Environments Using Multi-Criteria Decision Making · ICRA 2021
Robotics › Legged, aerial and field robots
planetary exploration
0.512021
Exploration of Large Outdoor Environments Using Multi-Criteria Decision Making · ICRA 2021
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning › constraint-based planning
resource-constrained planning
0.112021
Exploration of Large Outdoor Environments Using Multi-Criteria Decision Making · ICRA 2021

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

multi-criteria decision-making · 0.5PROMETHEE II · 0.5
YearPublicationVenuePosition
2021 Exploration of Large Outdoor Environments Using Multi-Criteria Decision Making
abstract
We present a Multi-Criteria Decision Making (MCDM) framework specifically designed for planetary exploration. Our work is based on PROMETHEE II, which allows operators to add task-specific criteria and conditions. We extended this algorithm to improve its resource usage by reducing the number of candidate exploration goals that have to be evaluated and compared. This is crucial when given a large number of goals, as is typical for outdoor environments. In addition, we identified five different criteria for planetary exploration, including a novel criterion that we call Direction of Interest (DOI), and use a categorization of these for further resource optimizations. We thereby ensure that the CPU usage of our decision making method can meet the limited budget of a space rover. We present simulated and real-world experiments with the Lightweight Rover Unit (LRU) and show a reduction of the processing time for decision making of approx. 70%.
Hannah Lehner, Martin J. Schuster, Tim Bodenmüller, Rudolph Triebel
ICRA1
2017 Exploration with active loop closing: A trade-off between exploration efficiency and map quality
abstract
A robotic system for search and rescue missions needs to efficiently explore and map new areas. In this paper, we present an integrated exploration strategy with active loop closing, which balances between the exploration speed and map quality. Specifically, it finds a trade-off between moving towards unknown space to gather new information and revisiting previous locations to improve localization accuracy and map quality through loop closures. Our integrated exploration is built upon a submap-based 6D SLAM system. Loop closure constraints originate from pairwise submap matches, which allow the optimization of an underlying SLAM graph. During exploration, we employ the expected information gain as well as the robot's localization uncertainty estimates to weigh exploration and revisiting actions online. We introduce the match effect as the expected impact of a loop closure on global optimization and consider this novel criterion together with the match likelihood and cost when evaluating the utility of revisiting previous locations. To demonstrate our approach, we present simulated and real-world experiments, comparing two variants of our novel method to a frontier-based exploration.
Hannah Lehner, Martin J. Schuster, Tim Bodenmüller, Simon Kriegel
IROS1