Swimmer

Review of Motion Planning 본문

개념공부/Path planning

Review of Motion Planning

Zach Choi 2021. 7. 11. 22:01

Path Planning 알고리즘을 개발 원리 및 시기에 따라 Traditional Algorithm과 ML-based Algorithm으로 분류한다. Tradition Algorithm은 Graph Based method, Sampling based method, Curve Interpolation으로 구분한다. ML-based Algorithm 은  Supervised Learning, Optimal Value Reinforcement Learning, Policy Gradient Reinforcement Learning.

 

Graph Search Based Algorithm

1. Dijsktra's Algorithm

2. A* Algorithm

   Hybrid A*, Field D*, Anytime A*, State Lattice Algorithm

 

Sampling Based Algorithm

1. RRT (Rapidly exploring Random Tree)

2. PRM (Probably Roadmap Method)

 

Interpolating Curve Algorithm

1. Line and Circle (Dubins, Reeds and Shepp)

2. Clothoid

3. Polynomial (Hermite, 2차)

4. Bezier Curve (2, 3, 4차)

5. B Spline

 

ML-based Algorithm

1. Optimal Value RL

Markov Chain, Markov Decision Process, Model Free RL and Model Based dynamic programming, Temporal Difference and Monte Carlo methods

'개념공부 > Path planning' 카테고리의 다른 글

Clothoid  (0) 2022.11.02
A* (A star 경로 계획 알고리즘)  (0) 2022.10.31
Corridor Map Method(CMM) Path Planning  (0) 2021.04.08
Hermite Spline <설명, Matlab Code>  (0) 2020.10.11
Path Smoothing 공부해보기  (0) 2020.09.29
Comments