![Page 1: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/1.jpg)
1
Legged Locomotion Planning
Kang ZhaoB659 Intelligent RoboticsSpring 2013
![Page 2: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/2.jpg)
2
Planning Biped Navigation Strategies in Complex Environmentsβ’ Joel Chestnutt, James
Kuffner, Koichi Nishiwaki, Satoshi Kagami
![Page 3: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/3.jpg)
3
O Global terrain map MO GoalO Primitive set {Trans}O Search algorithm
![Page 4: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/4.jpg)
4
Algorithm - Biped Robot ModelO State:
O ΞΈ: position and orientation relative to {U}
O One-step motion destination
![Page 5: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/5.jpg)
5
Algorithm- State transitionsO Footstep transition
β¦
0
1
2 34
5 6
7
A 16-transitions set
Branching factor
![Page 6: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/6.jpg)
6
Algorithm- EnvironmentO Terrain map
![Page 7: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/7.jpg)
7
Algorithm- State Evaluation
π= π (π ,π ,ππ ,ππ)Location metric to
evaluate a locationβs cost
πΏπ={ πΏπ (π )β ππ πΏπ (π )>πΏπ
πππππ‘, π=1β¦5
πΏ (π )=βπ€ππΏπ
Slope angle
Roughness
Stability
Largest bump
Safety
![Page 8: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/8.jpg)
8
Slope angle
Roughness
Stability
Largest bump
Safety
The slope angle of the surface at the candidate location. Perfectly horizontal surfaces are desired. The slope angle is computed by fitting a plane h(x, y) to the cells in the location.
1π β
πβπΆ
ΒΏπ . h hπππ π‘βh (π . π₯ ,π . π¦ )β¨ΒΏΒΏ
max {π . h hπππ π‘βh (π . π₯ ,π . π¦ )β¨πβπΆ }
Itβs purpose is to take into account the possible inaccuracy of foot positioning. This can be computed using the roughness and largest bump metrics, using the cells around the foot location
![Page 9: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/9.jpg)
9
Algorithm- State Evaluation
Step metric to evaluate cost
of taking a step
π (π ,π ,ππ )=π .πππ π‘+π€hβ¨π» (π ,ππ )β¨ΒΏ
Cost of transition
β’ Penalty for height changeβ’ Collision check
ππ=π (π )π»={ π» (π ,ππ )
β ππ π» (π ,ππ )>π»βπππππ‘
π= π (π ,π ,ππ ,ππ)
![Page 10: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/10.jpg)
10
Algorithm- State Evaluation
Heuristic metric to evaluate
remaining cost
π (π ,ππ)=π€ππ· (π ,ππ )+π€π|Ζ (π ,ππ )|+π€hβ¨π» (π ,ππ )β¨ΒΏ
Euclidean distance Relative angle Height
difference
π= π (π ,π ,ππ ,ππ) The heuristic function estimates the cost to go from to a goal state
Its value is independent of the current search tree; it depends only on and the goal
![Page 11: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/11.jpg)
11
Best First SearchO It exploits state description to estimate how
βgoodβ each search node isO An evaluation function maps each node of
the search tree to a real number
O Greedy BFS
π (π ,ππ)
h (π )=π (π ,ππ)
![Page 12: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/12.jpg)
12
A* Search
h (π )=π (π ,ππ)
π (π ,ππ)
πΏ (ππ )+β π (ππ ,π ,ππ)
![Page 13: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/13.jpg)
Search tree
Searching the State SpaceA schematic view
Q s
Q g
![Page 14: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/14.jpg)
Search tree
Searching the State SpaceA schematic view
Q s
Q g
T 1
T 2
![Page 15: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/15.jpg)
Search tree
Searching the State SpaceA schematic view
Q s
Q g
![Page 16: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/16.jpg)
Search tree
Searching the State SpaceA schematic view
Q s
Q g
![Page 17: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/17.jpg)
Search tree
Searching the State SpaceA schematic view
Q s
Q g
![Page 18: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/18.jpg)
Search tree
Searching the State SpaceA schematic view
Q s
Q g
![Page 19: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/19.jpg)
19
ResultsO Cluttered terrain
![Page 20: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/20.jpg)
20
ResultsO Multi-level terrain
![Page 21: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/21.jpg)
21
ResultsO Uneven ground with obstacles
![Page 22: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/22.jpg)
22
Comparisons
O Distance to goalO Transitions and obstacle effectsO Metric weights
![Page 23: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/23.jpg)
23A 26-transitions set
A 40-transitions set BFS
![Page 24: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/24.jpg)
24
Performance comparison of A* and BFS for increasing numbers of stairs along the path
![Page 25: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/25.jpg)
25
![Page 26: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/26.jpg)
26
π (π ,ππ)=π€ππ· (π ,ππ )+π€π|Ζ (π ,ππ )|+π€hβ¨π» (π ,ππ )β¨ΒΏ
![Page 27: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/27.jpg)
27
Local-minimum problem
![Page 28: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/28.jpg)
28
Online Experiments
Stereo vision system
PlannerFootstep sequence
Trajectory generator
Walking area map
![Page 29: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/29.jpg)
29
Following work
O A tired planning Strategy for biped navigation, 2004O Biped navigation in rough environments using
on-board sensing, 2009
![Page 30: Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring 2013 1](https://reader035.vdocuments.mx/reader035/viewer/2022062423/56649f565503460f94c7a2f8/html5/thumbnails/30.jpg)
30
Multi-Step Motion Planning for Free-climbing Robotsβ’ Tim Bretl, Sanjay Lall,
Jean-Claude Latombe, Stephen Rock