Hostname: page-component-8448b6f56d-c4f8m Total loading time: 0 Render date: 2024-04-23T14:56:52.806Z Has data issue: false hasContentIssue false
  • English
  • Français

Path planning of a mobile robot using genetic heuristics

Published online by Cambridge University Press:  01 September 1998

Andreas C. Nearchou
Andreas C. Nearchou
Affiliation:
Mechanical Engineering Department, University of Patras, 26 110 Patras, Greece. E-mail: nearchou@upatras.gr
Get access Rights & Permissions [Opens in a new window]

Abstract

A genetic algorithm for the path planning problem of a mobile robot which is moving and picking up loads on its way is presented. Assuming a findpath problem in a graph, the proposed algorithm determines a near-optimal path solution using a bit-string encoding of selected graph vertices. Several simulation results of specific task-oriented variants of the basic path planning problem using the proposed genetic algorithm are provided. The results obtained are compared with ones yielded by hill-climbing and simulated annealing techniques, showing a higher or at least equally well performance for the genetic algorithm.

Keywords

Path planningMobile robotGenetic heuristicsLoad picking
Type
Research Article
Information
Robotica , Volume 16 , Issue 5 , September 1998 , pp. 575 - 588
Copyright
© 1998 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.)