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

María Luisa Rodríguez-Arévalo

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

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 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
Robot navigation and mapping · 50% Reinforcement learning · 25% Optimization for machine learning · 25%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › SLAM
active SLAM
0.212015
On the monotonicity of optimality criteria during exploration in active SLAM · ICRA 2015
Machine learning › Reinforcement learning
exploration
0.212015
On the monotonicity of optimality criteria during exploration in active SLAM · ICRA 2015
Machine learning › Optimization for machine learning › optimization
optimality criteria
0.212015
On the monotonicity of optimality criteria during exploration in active SLAM · ICRA 2015
Robotics › Robot navigation and mapping
SLAM
0.212015
On the monotonicity of optimality criteria during exploration in active SLAM · ICRA 2015

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

e-optimality · 0.2dead reckoning · 0.2d-optimality · 0.2a-optimality · 0.2
YearPublicationVenuePosition
2018 On the Importance of Uncertainty Representation in Active SLAM
abstract
The purpose of this work is to highlight the paramount importance of representing and quantifying uncertainty to correctly report the associated confidence of the robot's location estimate at each time step along its trajectory and therefore decide the correct course of action in an active SLAM mission. We analyze the monotonicity property of different decision-making criteria, both in 2-D and 3-D, with respect to the representation of uncertainty and of the orientation of the robot's pose. Monotonicity, the property that uncertainty increases as the robot moves, is essential for adequate decision making. We analytically show that, by using differential representations to propagate spatial uncertainties, monotonicity is preserved for all optimality criteria, A-opt, D-opt, and E-opt, and for Shannon's entropy. We also show that monotonicity does not hold for any criteria in absolute representations using Roll-Pitch-Yaw and Euler angles. Finally, using unit quaternions in absolute representations, the only criteria that preserve monotonicity are D-opt and Shannon's entropy.
María Luisa Rodríguez-Arévalo, José Neira, José A. Castellanos 0001
IEEE Trans. Robotics1
2015 On the monotonicity of optimality criteria during exploration in active SLAM
abstract
In this paper we investigate the monotonicity of various optimality criteria during the exploration phase of an active SLAM algorithm. Optimality criteria such as A-opt, D-opt or E-opt are used in active SLAM to account for uncertainty in the map or the robot's pose, and these criteria are usually part of utility functions which help active SLAM algorithms decide where the robot should move next. The monotonicity of the optimality criteria is of utmost importance. During the exploration phase, i.e. when the robot is traversing new territory or cannot perform a loop closure, the most common way of estimating the pose of the robot is through dead-reckoning. Correctly accounting for the uncertainty is important for an active SLAM algorithm and in particular for a dead-reckoning scenario, where by definition the uncertainty in the robot's pose grows. If monotonicity does not hold in this scenario, active SLAM algorithms can execute actions under the false belief that the uncertainty has reduced. We show analytically and experimentally some conditions in which the A-opt and E-opt criteria lose monotonicity in a dead-reckoning scenario, where the propagation of the robot's pose is done using a linearized framework. We also show analytically and experimentally that under the same conditions the D-opt does not lose monotonicity and, in general for the linearized framework under consideration, D-opt does not break monotonicity.
Henry Carrillo, Yasir Latif, María Luisa Rodríguez-Arévalo, José Neira, José A. Castellanos 0001
ICRA3