Brunel University Research Archive (BURA) >
Research Areas >
Information Systems and Computing >
Please use this identifier to cite or link to this item:
|Title: ||Evolutionary approaches to robot path planning|
|Authors: ||Kent, Simon|
|Advisors: ||Dracopoulos, DC|
|Publication Date: ||1999|
|Publisher: ||Brunel University|
|Abstract: ||The ultimate goal in robotics is to create machines which are more independent and rely less on humans to guide them in their operation. There are many sub-systems which may be present in such a robot, one of which is path planning — the ability to determine a sequence of positions or conﬁgurations
between an initial and goal position within a particular obstacle cluttered workspace.
Many classical path planning techniques have been developed, but these tend to have drawbacks such as their computational requirements; the suitability of the plans they produce for a particular application; or how well they are able to generalise to unseen problems. In recent years, evolutionary based problem solving techniques have seen a rise in popularity, possibly coinciding with the improvement in the computational power afforded researches by successful developments in hardware.
These techniques adopt some of the features of natural evolution and mimic them in a computer. The increase in the number of publications in the areas of Genetic Algorithms (GA) and Genetic Programming (GP) demonstrate the success achieved when applying these techniques to ever more problem areas.
This dissertation presents research conducted to determine whether there is a place for Evolutionary Approaches, and speciﬁcally GA and GP, in the development of future path planning techniques.|
|Description: ||This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.|
|Appears in Collections:||Information Systems and Computing|
School of Information Systems, Computing and Mathematics Theses
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.