Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.
DOI: 10.1109/robot.2006.1641810
|View full text |Cite
|
Sign up to set email alerts
|

Consistent observation grouping for generating metric-topological maps that improves robot localization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
42
0

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(42 citation statements)
references
References 12 publications
0
42
0
Order By: Relevance
“…[8,9] Because under the condition of a given robot path, the more the observations between submaps are closer to the conditional independence, the more this approximation of map segmentation can be ignored. [10,11] For this purpose, which is defined as (2), a map segmentation method based on spectral clustering is proposed.…”
Section: Analysis Of Map Segmentation Methods Used In Ruinsmentioning
confidence: 99%
“…[8,9] Because under the condition of a given robot path, the more the observations between submaps are closer to the conditional independence, the more this approximation of map segmentation can be ignored. [10,11] For this purpose, which is defined as (2), a map segmentation method based on spectral clustering is proposed.…”
Section: Analysis Of Map Segmentation Methods Used In Ruinsmentioning
confidence: 99%
“…There are two critical issues in this partitioning approach: first, the computation of the arc weights; and second, the criterion adopted to perform the partition itself. As for the first, the arc weights are assigned according to the Sensed-Space-Overlap (SSO), following our previous work [3], particularized for landmark observations. This simple but effective measure represents the information shared by two keyframes.…”
Section: Map Partitioning Methodsmentioning
confidence: 99%
“…We augment G t−1 to reflect the robot's motion by adding a node n t to to the topology and an edge to the previous node n t−1 , resulting in an intermediate graph G 1) Creation of New Regions: We then probabilistically bisect the current region R c using the spectral clustering method outlined in Blanco et al [17]. We construct the similarity matrix using the laser point overlap between each pair of nodes in the region.…”
Section: A the Proposal Distributionmentioning
confidence: 99%