Location of Repository

Artificial intelligence tools for path generation and optimisation for mobile robots

By Mario Augusto Gongora


The ultimate goal in robotic systems is to develop machines that learn for themselves based on experience. In order to achieve on-line learning some software tools are needed to allow the robots to continually adapt their behaviour in order to constantly optimise their performance. This thesis presents research work focused on path planning for mobile robots with the objective of generating optimal paths for any type of mobile robot in an environment containing any number of static obstacles of any shape. The research specifically recognises that an optimal path can be defined according to several criteria including distance, time, energy consumption and risk. The easiest and most commonly used measure is to minimise distance, but this does not by itself optimise task performance, and the other criteria are generally far more important. Distance is used mainly because there is no direct method to optimise time, energy and risk as they depend on the characteristics of the robot and the environment. This is solved in this research by using a set of Artificial Intelligence tools working together to perform an optimisation process strictly on the criteria selected. The path planning system developed consists of an original and novel two-stage 4 process comprising generation followed by optimisation. Path generation is achieved using cellular automata whose behaviour has been determined by a genetic algorithm. A program called Rutar has been written in which the best behaviour found by the genetic algorithm is encoded, and it has been tested and shown to infallibly generate all the non-redundant paths between any two points around any obstacles. An interesting and valuable feature of Rutar is that the time taken to generate paths depends only on the amount of free space available in which the robot can move and therefore the more obstacles there are present, and hence the more complex the layout, the faster the execution time. The paths generated are sub-optimal solutions, which are then optimised according to the user's selection of a combination of Time, Energy, Distance and Risk criteria. The optimisation process is performed by another genetic algorithm. The original scheme used in this work allows any combination of all the desired criteria in a single optimisation process, allowing it to handle very complex non-linear problems. All of the optimisation criteria can be used in situations where the environment and the robot are considered to be unchanged during the interval in which the robot moves. This optimisation can be performed either off-line or on-line. However, the ability of the developed system to generate and optimise the paths very fast provide an opportunity for dynamic path optimisatiorý which ultimately can lead to on-line learning. This potential of the tools developed for the path planning system is explored and recommendations for further exploitation are made

Topics: TJ, QA76
OAI identifier: oai:wrap.warwick.ac.uk:2830

Suggested articles



  1. (1997). Adaptive navigation of Mobile Robots with obstacle avoidance, doi
  2. (1994). Ahuj a N.; Gross motion planning -A survey,
  3. (1995). An introduction to neural networks, doi
  4. (1996). ANSI Common Lisp; Englewood Cliffs,
  5. (1996). Approach to time-optimal, smooth and collision- firee path planning in a two robot arm environment, doi
  6. (1997). Benchmarkfor artificial intelligence applications on parallel computers -BEAP; doi
  7. (1992). Chaos andftactaA, newftontiers ofscience, Heinz-Otto Peitgen, Hartmut Jurgens, Dietmar Saupe, doi
  8. (1994). Collision-free path planningfor mobile robots and or AG Vv using simulated annealing,
  9. (1995). Complete navigation systemfor goal acquisition in unknown environments, Autonomous Robots, doi
  10. (1997). Evolutionary optimization approach to motor learning withfirst resula of an application to robot manipulators. ;
  11. (1994). Functional extension of the sufficient condition to design afamili, ol sensor-based deadlock-free path-planning algorithms, doi
  12. (1995). Genetic algorithmsfor robot control, doi
  13. (1996). Genetic control of near time-optimal motion jbr an industrial robot arm ; doi
  14. (1992). Genetic programming, on the programming qf computers by ineans of natural selection,
  15. (1993). High Reliability Path Generation For Automated Systems",
  16. (1995). Internal Se4f-Simulatorfor a Mobile Robot",
  17. (1996). Motion planning. for a cutting task based on criteria of'skilled operators, Nippon Kikai Gakkai Ronbunshu,
  18. (1995). Path generationfor mobile robot navigation using genetic algorithm, doi
  19. (1995). Real time traffic cowrol schemefor a multiple AGVsystem,
  20. (1989). Robot planning and control via potentialfunctions, in Robotics Review, Khatib 0., Graig J., LozanoPerez T., Eds., Cambridge NIA,
  21. (1996). Robust Path Optunization using Self Simulation ",
  22. (1996). Robust path planning in the plane,
  23. (1992). Thanailakis A.; Cellular automata based minimum cost path 181 estimation on binary maps, doi
  24. (1995). The Use of Wandering Intelligence in Mission Controlfor Allobile Robots",
  25. (1995). Time-optimal motion of a cooperating multiple robot system along a prescribedpath, doi
  26. (1985). Visibility polygon search and euclidean shortestpath, 26 th Simposium on Foundations for Computer Science, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.