路徑規划（Path Planning）算法總結
不同的路徑規划算法
| Classical Approach | Artificial Intelligence (Heuristic Approach) |
|---|---|
| Potential Field.(1979) | Neural Network Technique. (1943) |
| Roadmap Cell Decomposition.(1987) | Fuzzy Logic Technique. (1965) |
| Grid Based.(1988) | Genetic Algorithm Technique. (1989) |
| PRM (Probabilistic Roadmap).(1996) | Ant Colony Optimization Technique.(1992) |
| Rapidly Exploring Random Tree.(1998) | Particle Swarm Optimization Technique.(1995) |
| Virtual Impedance Method. | Bacterial Foraging Optimization.(2002) |
| Convex Hull and Local Search Method. | Bee Colony Optimization Technique.(2005) |
| Divide and Conquer Method. | Firefly Algorithm Optimization Technique.(2008) |
| Grey Wolf Optimization.(2014) |
(來源：Methodology for Path Planning and Optimization of Mobile Robots: A Review， 2018)
經典方法
1. 人工勢場
2. 路線圖晶格分解（翻譯有待確認）
3. 基於網格
4. 隨機路線圖法
5. 快速搜索隨機樹法
6. 虛擬阻抗法
7. Convex Hull and Local Search Method （暫未找到對應翻譯）
8. 分治法
人工智能（啟發式方法）
待補充。。。
參考：
- Methodology for Path Planning and Optimization of Mobile Robots: A Review