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

Max Glick

dblp:10/2693 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2006
—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 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › SLAM
bearing-only SLAM
0.112006
Evaluation of Algorithms for bearing-only SLAM · ICRA 2006
Robotics › Robot navigation and mapping › SLAM
rao-blackwellized particle filter
0.112006
Evaluation of Algorithms for bearing-only SLAM · ICRA 2006
Robotics › Robot navigation and mapping
SLAM
0.112006
Evaluation of Algorithms for bearing-only SLAM · ICRA 2006
Robotics › Robot navigation and mapping › SLAM › SLAM front-end
landmark initialization
0.012006
Evaluation of Algorithms for bearing-only SLAM · ICRA 2006

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

rao-blackwellized particle filter · 0.1outlier rejection · 0.1gaussian sum filter · 0.1
YearPublicationVenuePosition
2006 Evaluation of Algorithms for bearing-only SLAM
abstract
An important milestone for building affordable robots that can become widely popular is to address robustly the simultaneous localization and mapping (SLAM) problem with inexpensive, off-the-shelf sensors, such as monocular cameras. These sensors, however, impose significant challenges on SLAM procedures because they provide only bearing data related to environmental landmarks. This paper starts by providing an extensive comparison of different techniques for bearing-only SLAM in terms of robustness under different noise models, landmark densities and robot paths. We have experimented in a simulated environment with a variety of existing online algorithms including Rao-Blackwellized particle filters (RB-PFs). Our experiments suggest that RB-PFs are more robust compared to other existing methods and run considerably faster. Nevertheless, their performance suffers in the presence of outliers. In order to overcome this limitation we proceed to propose an augmentation of RB-PFs with: (a) Gaussian sum filters for landmark initialization and (b) an online, unsupervised outlier rejection policy. This framework exhibits impressive robustness and efficiency even in the presence of outliers
Kostas E. Bekris, Max Glick, Lydia E. Kavraki
ICRA2