Mobile robot self-localization without explicit landmarks (Q1974471)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mobile robot self-localization without explicit landmarks |
scientific article; zbMATH DE number 1439710
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mobile robot self-localization without explicit landmarks |
scientific article; zbMATH DE number 1439710 |
Statements
Mobile robot self-localization without explicit landmarks (English)
0 references
7 May 2000
0 references
In mobile robot navigation, ``localization'' is the process of estimating the location of the robot within its environment. For the localization aspect of navigation, an exact combinatorial algorithm with complexity analysis is suggested. The method is based on a geometric model of the world and a point-and-shoot ranging device. Moreover, a rasterized version of the algorithm is given for execution upon a mobile robot, where sensor uncertainty can be taken into account. Some experimental results are given.
0 references
localization
0 references
mobile robot navigation
0 references
combinatorial algorithm
0 references
complexity analysis
0 references
geometric model of the world
0 references
point-and-shoot ranging device
0 references
sensor uncertainty
0 references
0.8013600707054138
0 references
0.7964084148406982
0 references
0.7825718522071838
0 references
0.7720960974693298
0 references
