Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-23T11:04:22.389Z Has data issue: false hasContentIssue false

Navigation of a mobile robot by locally optimal trajectories

Published online by Cambridge University Press:  01 September 1999

Kokou Djath
Affiliation:
CRAN-ENSEM-CNRS UPRESA 7039, 2, avenue de la forêt de Haye, 54516 Vandœuvre-lès-Nancy Cédex, France. E-mail: {kdjath, asiadat, dufaut, dwolf}@ensem.u-nancy.fr
Ali Siadet
Affiliation:
CRAN-ENSEM-CNRS UPRESA 7039, 2, avenue de la forêt de Haye, 54516 Vandœuvre-lès-Nancy Cédex, France. E-mail: {kdjath, asiadat, dufaut, dwolf}@ensem.u-nancy.fr
Michel Dufaut
Affiliation:
CRAN-ENSEM-CNRS UPRESA 7039, 2, avenue de la forêt de Haye, 54516 Vandœuvre-lès-Nancy Cédex, France. E-mail: {kdjath, asiadat, dufaut, dwolf}@ensem.u-nancy.fr
Didier Wolf
Affiliation:
CRAN-ENSEM-CNRS UPRESA 7039, 2, avenue de la forêt de Haye, 54516 Vandœuvre-lès-Nancy Cédex, France. E-mail: {kdjath, asiadat, dufaut, dwolf}@ensem.u-nancy.fr

Abstract

This paper proposes a navigation system for a non-holonomic mobile robot. The navigation is based on a “look and move” approach. The aim is to define intermediate points called sub-goals through which the robot must pass. This algorithm is particularly suitable for navigation in an unknown environment and obstacle avoidance. Between two successive sub-goals, a shortest path planning solution is adopted. We have adopted the “Dubins' car” because of the environment perception sensor, a 180° laser scanner. In order to minimize the calculation time, the theoretical results of shortest path are approximated by simple equations. The navigation algorithm proposed can be used either in a structured or unstructured environment. In this context the local map construction is based on the segmentation of a structured environment; so for an unstructured environment, a suitable algorithm must be used instead.

Type
Research Article
Copyright
© 1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)