Locally-Optimal Navigation in Multiply-Connected Environments without Geometric Maps

Benjamin Tovar, Steven M Lavalle, Rafael Murrieta

Research output: Contribution to conferencePaper

Abstract

In this paper we present an algorithm to build a sensor-based, dynamic data structure useful for robot navigation in an unknown, multiply-connected planar environment. This data structure offers a robust framework for robot navigation, avoiding the need of a complete geometric map or explicit localization, by building a minimal representation based entirely on critical events in online sensor measurements made by the robot. There are two sensing requirements for the robot: it must detect when it is close to the walls, to perform wall-following reliably, and it must be able to detect discontinuities in depth information. It is also assumed that the robot is able to drop, detect and recover a marker. The navigation paths generated are optimal up to the homotopy class to which the paths belong, even though no distance information is measured.

Original languageEnglish (US)
Pages3491-3497
Number of pages7
StatePublished - Dec 26 2003
Event2003 IEEE/RSJ International Conference on Intelligent Robots and Systems - Las Vegas, NV, United States
Duration: Oct 27 2003Oct 31 2003

Other

Other2003 IEEE/RSJ International Conference on Intelligent Robots and Systems
CountryUnited States
CityLas Vegas, NV
Period10/27/0310/31/03

Fingerprint

Navigation
Robots
Data structures
Sensors

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Computer Vision and Pattern Recognition
  • Computer Science Applications

Cite this

Tovar, B., Lavalle, S. M., & Murrieta, R. (2003). Locally-Optimal Navigation in Multiply-Connected Environments without Geometric Maps. 3491-3497. Paper presented at 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, Las Vegas, NV, United States.

Locally-Optimal Navigation in Multiply-Connected Environments without Geometric Maps. / Tovar, Benjamin; Lavalle, Steven M; Murrieta, Rafael.

2003. 3491-3497 Paper presented at 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, Las Vegas, NV, United States.

Research output: Contribution to conferencePaper

Tovar, B, Lavalle, SM & Murrieta, R 2003, 'Locally-Optimal Navigation in Multiply-Connected Environments without Geometric Maps' Paper presented at 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, Las Vegas, NV, United States, 10/27/03 - 10/31/03, pp. 3491-3497.
Tovar B, Lavalle SM, Murrieta R. Locally-Optimal Navigation in Multiply-Connected Environments without Geometric Maps. 2003. Paper presented at 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, Las Vegas, NV, United States.
Tovar, Benjamin ; Lavalle, Steven M ; Murrieta, Rafael. / Locally-Optimal Navigation in Multiply-Connected Environments without Geometric Maps. Paper presented at 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, Las Vegas, NV, United States.7 p.
@conference{f4f8dff577504ca49a7eeeb7d1650d10,
title = "Locally-Optimal Navigation in Multiply-Connected Environments without Geometric Maps",
abstract = "In this paper we present an algorithm to build a sensor-based, dynamic data structure useful for robot navigation in an unknown, multiply-connected planar environment. This data structure offers a robust framework for robot navigation, avoiding the need of a complete geometric map or explicit localization, by building a minimal representation based entirely on critical events in online sensor measurements made by the robot. There are two sensing requirements for the robot: it must detect when it is close to the walls, to perform wall-following reliably, and it must be able to detect discontinuities in depth information. It is also assumed that the robot is able to drop, detect and recover a marker. The navigation paths generated are optimal up to the homotopy class to which the paths belong, even though no distance information is measured.",
author = "Benjamin Tovar and Lavalle, {Steven M} and Rafael Murrieta",
year = "2003",
month = "12",
day = "26",
language = "English (US)",
pages = "3491--3497",
note = "2003 IEEE/RSJ International Conference on Intelligent Robots and Systems ; Conference date: 27-10-2003 Through 31-10-2003",

}

TY - CONF

T1 - Locally-Optimal Navigation in Multiply-Connected Environments without Geometric Maps

AU - Tovar, Benjamin

AU - Lavalle, Steven M

AU - Murrieta, Rafael

PY - 2003/12/26

Y1 - 2003/12/26

N2 - In this paper we present an algorithm to build a sensor-based, dynamic data structure useful for robot navigation in an unknown, multiply-connected planar environment. This data structure offers a robust framework for robot navigation, avoiding the need of a complete geometric map or explicit localization, by building a minimal representation based entirely on critical events in online sensor measurements made by the robot. There are two sensing requirements for the robot: it must detect when it is close to the walls, to perform wall-following reliably, and it must be able to detect discontinuities in depth information. It is also assumed that the robot is able to drop, detect and recover a marker. The navigation paths generated are optimal up to the homotopy class to which the paths belong, even though no distance information is measured.

AB - In this paper we present an algorithm to build a sensor-based, dynamic data structure useful for robot navigation in an unknown, multiply-connected planar environment. This data structure offers a robust framework for robot navigation, avoiding the need of a complete geometric map or explicit localization, by building a minimal representation based entirely on critical events in online sensor measurements made by the robot. There are two sensing requirements for the robot: it must detect when it is close to the walls, to perform wall-following reliably, and it must be able to detect discontinuities in depth information. It is also assumed that the robot is able to drop, detect and recover a marker. The navigation paths generated are optimal up to the homotopy class to which the paths belong, even though no distance information is measured.

UR - http://www.scopus.com/inward/record.url?scp=0348040199&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0348040199&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0348040199

SP - 3491

EP - 3497

ER -