Generalized geometric triangulation algorithm for mobile robot absolute self-localization
Triangulation with active beacons is widely used in the absolute localization of mobile robots. The Geometric Triangulation algorithm allows the self- localization of a robot on a plane. However, the three beacons it uses must be “properly ordered” and the algorithm works consistently only when the...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2003
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/2023 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/2023 |
| Resumo: | Triangulation with active beacons is widely used in the absolute localization of mobile robots. The Geometric Triangulation algorithm allows the self- localization of a robot on a plane. However, the three beacons it uses must be “properly ordered” and the algorithm works consistently only when the robot is within the triangle formed by these beacons. This paper presents an improved version of the algorithm, which does not require beacon ordering and works over the whole navigation plane except for a few well-determined lines where localization is not possible. |
|---|