Efficient on-line path planning algorithm and navigation for a mobile robot

Maki K. Habib, Shinichi Yuta

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A simple and efficient method for modelling a robot environment and an efficient on-line path planning algorithm are proposed to generate the optimal path within that environment. The suggested path planning algorithm is based on a good method for structuring the free space of a mobile robot environment into a set of overlapping prime rectangular areas PRAs that are suited to path planning and navigation tasks. The structuring of the free space environment starts by dividing the enlarged world map of that mobile robot environment into rectangular cells. These cells represent free and closed areas. Then, the free space in the specified environment is structured in terms of PRAs, and a connectivity table is constructed to provide the structure necessary for path finding. Using these results, a simple and computationally efficient algorithm is described which solves the pathfinding from a PRA containing the starting point to a PRA containing the goal point. Since movement between the PRAs cannot have fixed cost-distance attached to them, an efficient method is proposed that dynamically allocates costs to path segments as the path develops. The suggested algorithms allow optimal paths made up of straight lines and rectangular turns to be found efficiently with high speed. Consequently, a geometric representation of this path is executed. Then, a real time execution algorithm is introduced to control the robot during the execution of the planned path. Experimental examples based on the proposed algorithms and an analysis of the results are presented for a selected environment executed on the mobile robot Yamabico-9.

Original languageEnglish
Pages (from-to)187-210
Number of pages24
JournalInternational Journal of Electronics
Volume69
Issue number2
Publication statusPublished - 1990 Aug
Externally publishedYes

Fingerprint

Motion planning
Mobile robots
Navigation
Robots
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Efficient on-line path planning algorithm and navigation for a mobile robot. / Habib, Maki K.; Yuta, Shinichi.

In: International Journal of Electronics, Vol. 69, No. 2, 08.1990, p. 187-210.

Research output: Contribution to journalArticle

Habib, Maki K. ; Yuta, Shinichi. / Efficient on-line path planning algorithm and navigation for a mobile robot. In: International Journal of Electronics. 1990 ; Vol. 69, No. 2. pp. 187-210.
@article{8d07d179f0e14a64b5c04bf7a69de42e,
title = "Efficient on-line path planning algorithm and navigation for a mobile robot",
abstract = "A simple and efficient method for modelling a robot environment and an efficient on-line path planning algorithm are proposed to generate the optimal path within that environment. The suggested path planning algorithm is based on a good method for structuring the free space of a mobile robot environment into a set of overlapping prime rectangular areas PRAs that are suited to path planning and navigation tasks. The structuring of the free space environment starts by dividing the enlarged world map of that mobile robot environment into rectangular cells. These cells represent free and closed areas. Then, the free space in the specified environment is structured in terms of PRAs, and a connectivity table is constructed to provide the structure necessary for path finding. Using these results, a simple and computationally efficient algorithm is described which solves the pathfinding from a PRA containing the starting point to a PRA containing the goal point. Since movement between the PRAs cannot have fixed cost-distance attached to them, an efficient method is proposed that dynamically allocates costs to path segments as the path develops. The suggested algorithms allow optimal paths made up of straight lines and rectangular turns to be found efficiently with high speed. Consequently, a geometric representation of this path is executed. Then, a real time execution algorithm is introduced to control the robot during the execution of the planned path. Experimental examples based on the proposed algorithms and an analysis of the results are presented for a selected environment executed on the mobile robot Yamabico-9.",
author = "Habib, {Maki K.} and Shinichi Yuta",
year = "1990",
month = "8",
language = "English",
volume = "69",
pages = "187--210",
journal = "International Journal of Electronics",
issn = "0020-7217",
publisher = "Taylor and Francis Ltd.",
number = "2",

}

TY - JOUR

T1 - Efficient on-line path planning algorithm and navigation for a mobile robot

AU - Habib, Maki K.

AU - Yuta, Shinichi

PY - 1990/8

Y1 - 1990/8

N2 - A simple and efficient method for modelling a robot environment and an efficient on-line path planning algorithm are proposed to generate the optimal path within that environment. The suggested path planning algorithm is based on a good method for structuring the free space of a mobile robot environment into a set of overlapping prime rectangular areas PRAs that are suited to path planning and navigation tasks. The structuring of the free space environment starts by dividing the enlarged world map of that mobile robot environment into rectangular cells. These cells represent free and closed areas. Then, the free space in the specified environment is structured in terms of PRAs, and a connectivity table is constructed to provide the structure necessary for path finding. Using these results, a simple and computationally efficient algorithm is described which solves the pathfinding from a PRA containing the starting point to a PRA containing the goal point. Since movement between the PRAs cannot have fixed cost-distance attached to them, an efficient method is proposed that dynamically allocates costs to path segments as the path develops. The suggested algorithms allow optimal paths made up of straight lines and rectangular turns to be found efficiently with high speed. Consequently, a geometric representation of this path is executed. Then, a real time execution algorithm is introduced to control the robot during the execution of the planned path. Experimental examples based on the proposed algorithms and an analysis of the results are presented for a selected environment executed on the mobile robot Yamabico-9.

AB - A simple and efficient method for modelling a robot environment and an efficient on-line path planning algorithm are proposed to generate the optimal path within that environment. The suggested path planning algorithm is based on a good method for structuring the free space of a mobile robot environment into a set of overlapping prime rectangular areas PRAs that are suited to path planning and navigation tasks. The structuring of the free space environment starts by dividing the enlarged world map of that mobile robot environment into rectangular cells. These cells represent free and closed areas. Then, the free space in the specified environment is structured in terms of PRAs, and a connectivity table is constructed to provide the structure necessary for path finding. Using these results, a simple and computationally efficient algorithm is described which solves the pathfinding from a PRA containing the starting point to a PRA containing the goal point. Since movement between the PRAs cannot have fixed cost-distance attached to them, an efficient method is proposed that dynamically allocates costs to path segments as the path develops. The suggested algorithms allow optimal paths made up of straight lines and rectangular turns to be found efficiently with high speed. Consequently, a geometric representation of this path is executed. Then, a real time execution algorithm is introduced to control the robot during the execution of the planned path. Experimental examples based on the proposed algorithms and an analysis of the results are presented for a selected environment executed on the mobile robot Yamabico-9.

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

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

M3 - Article

AN - SCOPUS:0025474910

VL - 69

SP - 187

EP - 210

JO - International Journal of Electronics

JF - International Journal of Electronics

SN - 0020-7217

IS - 2

ER -