Title: Planning and Navigation Where am I going How do I get there
1Planning and NavigationWhere am I going? How do
I get there?
6
2Configuration Space
6.2.1
3Path Planning Overview
6.2.1
- 1. Road Map, Graph construction
- Identify a set of routes within the free space
-
- Where to put the nodes?
- Topology-based
- at distinctive locations
- Metric-based
- where features disappear or get visible
- 2. Cell decomposition
- Discriminate between free and occupied cells
- Where to put the cell boundaries?
- Topology- and metric-based
- where features disappear or get visible
- 3. Potential Field
- Imposing a mathematical function over the space
4Visibility Graph
6.2.1
5Voronoi Diagram
6.2.1
6Voronoi, Sysquake Demo
6.2.1
7Exact Cell Decomposition
6.2.1
8Approximate Cell Decomposition
6.2.1
9Adaptive Cell Decomposition
6.2.1
10Path / Graph Search Strategies
6.2.1
11Potential Field
6.2.1
12Attractive Potential Field
6.2.1
- Parabolic function representing the Euclidean
distance to the goal - Attracting force converges linearly towards 0
13Repulsing Potential Field
6.2.1
- Barrier around the whole obstacle
- strong close to the obstacle
- no influence far from the obstacle
- minimum distance to the object
- Field tends to infinity as q gets closer to the
object
14Sysquake Demo
6.2.1
15Extended Potential Field Method
6.2.1
Khatib and Chatila
16Harmonic Potentials
6.2.1
17Obstacle Avoidance
6.2.2
known obstacles (map)
observed obstacle
v(t), w(t)
Planed path
18Bug Algorithm (Bug1)
6.2.2
19Bug Algorithm (Bug2)
6.2.2
20Vector Field Histogram (VFH)
6.2.2
Borenstein et al.
21Vector Field Histogram (VFH)
6.2.2
Borenstein et al.
22Video VFH
6.2.2
Borenstein et al.
23Bubble Band Concept
6.2.2
Khatib and Chatila
24Basic Curvature Velocity Methods (CVM)
6.2.2
Simmons et al.
25Dynamic Window Approach
6.2.2
Fox and Burgard, Brock and Khatib
26Global Dynamic Window Approach
6.2.2
27Schlegel Approach
6.2.2
28EPFL-ASL approach
6.2.2
29EPFL-ASL approach
6.2.2
30Comparison of Obstacle Avoidance Algorithms
6.2.2
Acrobat Document
31Comparison of Obstacle Avoidance Algorithms
6.2.2
32Comparison of Obstacle Avoidance Algorithms
6.2.2