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

M. Csorba

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

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

Applied, interdisciplinary, general and emerging computing · 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 · 81% Video understanding and tracking · 19%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping
SLAM
0.012001
A solution to the simultaneous localization and map building (SLAM) problem · IEEE Trans. Robotics Autom. 2001
Computer vision › Video understanding and tracking › multi-object tracking
data association
0.012001
A solution to the simultaneous localization and map building (SLAM) problem · IEEE Trans. Robotics Autom. 2001
Robotics › Robot navigation and mapping › robot mapping
map management
0.012001
A solution to the simultaneous localization and map building (SLAM) problem · IEEE Trans. Robotics Autom. 2001

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

millimeter wave radar · 0.0estimation theory · 0.0
YearPublicationVenuePosition
2001 A solution to the simultaneous localization and map building (SLAM) problem
abstract
The simultaneous localization and map building (SLAM) problem asks if it is possible for an autonomous vehicle to start in an unknown location in an unknown environment and then to incrementally build a map of this environment while simultaneously using this map to compute absolute vehicle location. Starting from estimation-theoretic foundations of this problem, the paper proves that a solution to the SLAM problem is indeed possible. The underlying structure of the SLAM problem is first elucidated. A proof that the estimated map converges monotonically to a relative map with zero uncertainty is then developed. It is then shown that the absolute accuracy of the map and the vehicle location reach a lower bound defined only by the initial vehicle uncertainty. Together, these results show that it is possible for an autonomous vehicle to start in an unknown location in an unknown environment and, using relative observations only, incrementally build a perfect map of the world and to compute simultaneously a bounded estimate of vehicle location. The paper also describes a substantial implementation of the SLAM algorithm on a vehicle operating in an outdoor environment using millimeter-wave radar to provide relative map observations. This implementation is used to demonstrate how some key issues such as map management and data association can be handled in a practical environment. The results obtained are cross-compared with absolute locations of the map landmarks obtained by surveying. In conclusion, the paper discusses a number of key issues raised by the solution to the SLAM problem including suboptimal map-building algorithms and map management.
Gamini Dissanayake, Paul Newman 0001, Steve Clark, Hugh F. Durrant-Whyte, M. Csorba
IEEE Trans. Robotics Autom.5