Go home now Header Background Image
Submission Procedure
share: |
Follow us
Volume 6 / Issue 4

available in:   HTML (32 kB) PDF (76 kB) PS (229 kB)
Similar Docs BibTeX   Write a comment
Links into Future
DOI:   10.3217/jucs-006-04-0422


Using Genetic Algorithms to Solve the Motion Planning Problem

Craig Eldershaw (Oxford University Computer Laboratory, United Kingdom)

Stephen Cameron (Oxford University Computer Laboratory, United Kingdom)

Abstract: Motion planning is a field of growing importance as more and more computer controlled devices are being used. Many different approaches exist to motion planning|none of them ideal in all situations. This paper considers how to convert a general motion planning problem into one of global optimisation. We regard the general problem as being the classical configuration space findpath problem, but assume that the configurations of the device can be bounded by a hierarchy of hyper-spheres rather than being explicitly computed. A program to solve this problem has been written employing Genetic Algorithms. This paper describes how this was done, and some preliminary results of using it.

Keywords: complex geometries, motion planning, path optimisation

Categories: G.1.6, I.2.10, I.2.8, I.2.9