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

Alexander Ivanov 0002

dblp:41/754-2 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2016
0000-0001-6973-0210ORCID · verified

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

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-author

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 · 87% Motion planning and robot control · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
exploration
0.212016
An efficient robotic exploration planner with probabilistic guarantees · ICRA 2016
Machine learning › Reinforcement learning › exploration › autonomous exploration
integrated exploration
0.212016
An efficient robotic exploration planner with probabilistic guarantees · ICRA 2016
Robotics › Motion planning and robot control
path planning
0.112016
An efficient robotic exploration planner with probabilistic guarantees · ICRA 2016

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

probabilistic framework · 0.2hamiltonian path problem · 0.2
YearPublicationVenuePosition
2016 An efficient robotic exploration planner with probabilistic guarantees
abstract
Efficient robotic exploration of an unknown, sensor limited, global-information-deficient environment poses a unique challenge to path planning algorithms because no deterministic guarantees on path completion and mission success can be made. Integrated Exploration (IE), which strives to combine localization and exploration, must be solved in order to create an autonomous robotic system capable of long term operation in new and challenging environments. This paper formulates a probabilistic framework which allows the creation of exploration algorithms providing probabilistic guarantees of success. A novel connection is made between the Hamiltonian Path Problem and exploration. The Guaranteed Probabilistic Information Explorer (G-PIE) is developed for the IE problem, providing a probabilistic guarantee on path completion, and asymptotic optimality of exploration.
Alexander Ivanov 0002, Mark E. Campbell
ICRA1