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

Orazio Di Benedetto

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

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

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

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 · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › localization › map-based localization
map matching
0.011994
Towards a Robust Methodology for Mobile Robot Localization Using Sonar · ICRA 1994
Robotics › Robot navigation and mapping › localization › robot localization
mobile robot localization
0.011994
Towards a Robust Methodology for Mobile Robot Localization Using Sonar · ICRA 1994
Robotics › Robot navigation and mapping › localization › range-based localization
sonar-based localization
0.011994
Towards a Robust Methodology for Mobile Robot Localization Using Sonar · ICRA 1994

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

least squares matching · 0.0geometric segmentation · 0.0extended kalman filter · 0.0
YearPublicationVenuePosition
1994 Towards a Robust Methodology for Mobile Robot Localization Using Sonar
abstract
A robust methodology for mobile robot localisation, or relocation, is described, making use of airborne sonar. A linear array of three sequentially fired ultrasonic transducers is proposed for performing a full scan of the environment, whose map is assumed to be a priori given. A geometric approach to relocation is adopted: the segmentation algorithm is based on an extended Kalman filter for estimating the geometrical parameters of different targets and related uncertainty. The features characterised by minimal geometrical uncertainty are used by the matching algorithm to perform a least squares search for the displacement and rotation that best take the sensor-based map into coincidence with the a priori reference map. A few heuristics are provided to enhance data robustness. An effective pruning strategy finally leads to solutions of the relocation problem with sub-centimeter positional accuracies and orientational accuracies within one degree.>
Angelo M. Sabatini, Orazio Di Benedetto
ICRA2