Genetic Algorithms in path planning Mansoureh Ziaei Intelligent - - PowerPoint PPT Presentation

genetic algorithms
SMART_READER_LITE
LIVE PREVIEW

Genetic Algorithms in path planning Mansoureh Ziaei Intelligent - - PowerPoint PPT Presentation

Genetic Algorithms in path planning Mansoureh Ziaei Intelligent Robotics Seminar, Group TAMS, University of Hamburg Agenda I. Concepts of Genetic Algorithms A. Parameters B. Limitations C. Variants D. Problem domains II. Path


slide-1
SLIDE 1

Genetic Algorithms

in path planning

Mansoureh Ziaei Intelligent Robotics Seminar, Group TAMS, University of Hamburg

slide-2
SLIDE 2

Agenda

I. Concepts of Genetic Algorithms A. Parameters B. Limitations C. Variants D. Problem domains II. Path planning

2 [http://imgkid.com]

slide-3
SLIDE 3

Darwin’s theory of evolution

Organisms change over time As a result of changes in heritable physical or behavioral traits To better adapt to its environment To survive and have more offspring Microevolution Macroevolution

[http://www.livescience.com] 3

slide-4
SLIDE 4

Why evolution as an inspiration for computational problems?

Searching through a huge number of possibilities Effective use of parallelism Adaptive computer programs Innovative computer programs Complex solutions

4

slide-5
SLIDE 5

Genetic Algorithms

[http://evolutionarysystemsbiology.org]

Invented by John Holland in 1960s Goal: importing natural adaption into computer systems rather than solving specific problems

5

slide-6
SLIDE 6

How?

  • Genetic representation of the

solution domain

  • Fitness function to evaluate the

solution domain

  • Selection mechanisms
  • Crossover
  • Mutation

6

slide-7
SLIDE 7

GAs parameters

7 [http://www.edc.ncl.ac.uk]

slide-8
SLIDE 8

Limitations

  • Fitness function evaluation
  • Scaling with complexity
  • Stop criterion
  • Local optima
  • Dynamic data sets
  • Right/wrong measure
  • Speed of convergence

8

slide-9
SLIDE 9

Variants

  • Chromosome representation
  • Elitism
  • Parallel implementations
  • Adaptive GAs

9

slide-10
SLIDE 10

Problem domains

  • Timetabling and scheduling
  • Engineering
  • Global optimization problem
  • Pattern /speech recognition
  • Training neural networks
  • Path planning
  • ...

10

slide-11
SLIDE 11

Path planning

11

slide-12
SLIDE 12

Autonomous robot navigation

12

  • Explore an environment independent of human presence or intervention
  • Uncertain environment
  • Generate a feasible path and optimize it in world space
  • Global planning vs. local planning

[2]

slide-13
SLIDE 13

Using genetic algorithms

  • Value-encoded scheme
  • Path fitness based on path length

and path feasibility

13 [2] [2]

slide-14
SLIDE 14

Applied elements

Fitness function: Rank selection Single cross point Mutation Elitism

14 [4] [4]

slide-15
SLIDE 15

Thanks! Questions?

Bibliography:

1.

Melanie, Mitchell. "An introduction to genetic algorithms." Cambridge, Massachusetts London, England, Fifth printing 3 (1999). 2. Manikas, W., Kaveh Ashenayi, and RogerL Wainwright. "Genetic algorithms for autonomous robot navigation." Instrumentation & Measurement Magazine, IEEE 10.6 (2007): 26-31. 3. Alvarez, Alberto, Andrea Caiti, and Reiner Onken. "Evolutionary path planning for autonomous underwater vehicles in a variable ocean." Oceanic Engineering, IEEE Journal of 29.2 (2004): 418-429.

4.

Sedighi, Kamran H., et al. "Autonomous local path planning for a mobile robot using a genetic algorithm." Evolutionary Computation, 2004. CEC2004. Congress on. Vol. 2. IEEE, 2004.

15