|
@@ -1 +1,17 @@
|
|
|
-# path-planning-algorithms
|
|
|
|
|
|
|
+Directory Structure
|
|
|
|
|
+------
|
|
|
|
|
+ .
|
|
|
|
|
+ └── Search-based Planning
|
|
|
|
|
+ ├── bfs.py # breadth-first searching
|
|
|
|
|
+ ├── dfs.py # depth-first searching
|
|
|
|
|
+ ├── dijkstra.py # dijkstra's algorithm
|
|
|
|
|
+ └── a_star.py # a* algorithm
|
|
|
|
|
+ └── Stochastic Shortest Path
|
|
|
|
|
+ ├── value_iteration.py # value iteration
|
|
|
|
|
+ ├── policy_iteration.py # policy iteration
|
|
|
|
|
+ ├── Q-value_iteration.py # Q-value iteration
|
|
|
|
|
+ └── Q-policy_iteration.py # Q-policy iteration
|
|
|
|
|
+ └── Sampling-based Planning
|
|
|
|
|
+ ├── Sarsa.py # SARSA : on-policy TD control
|
|
|
|
|
+ └── Q-learning.py # Q-learning : off-policy TD control
|
|
|
|
|
+ └── Model-free Control
|