2020-06-19 19:00:08 -07:00
|
|
|
Directory Structure
|
|
|
|
|
------
|
|
|
|
|
.
|
|
|
|
|
└── Search-based Planning
|
2020-06-28 20:59:32 -07:00
|
|
|
└── Search_2D
|
|
|
|
|
├── bfs.py # breadth-first searching
|
|
|
|
|
├── dfs.py # depth-first searching
|
|
|
|
|
├── dijkstra.py # dijkstra's
|
|
|
|
|
├── a_star.py # A*
|
|
|
|
|
├── bidirectional_a_star.py # Bidirectional A*
|
|
|
|
|
├── ARAstar.py # Anytime Reparing A*
|
|
|
|
|
├── IDAstar.py # Iteratively Deepening A*
|
2020-06-28 23:06:45 -07:00
|
|
|
├── LRTAstar.py # Learning Real-time A*
|
|
|
|
|
└── RTAAstar.py # Real-time Adaptive A*
|
2020-06-28 20:59:32 -07:00
|
|
|
└── Search_3D
|
|
|
|
|
├── Astar3D.py # A*_3D
|
|
|
|
|
├── bidirectional_Astar3D.py # Bidirectional A*_3D
|
|
|
|
|
└── LRT_Astar3D.py # Learning Real-time A*_3D
|
|
|
|
|
└── gif # Animations
|
2020-06-28 21:01:01 -07:00
|
|
|
└── Sampling-based Planning
|
|
|
|
|
└── rrt_2D
|
|
|
|
|
├── rrt.py # rrt : goal-biased rrt
|
|
|
|
|
└── rrt_star.py
|
|
|
|
|
└── rrt_3D
|
|
|
|
|
├── rrt3D.py # rrt3D : goal-biased rrt3D
|
|
|
|
|
└── rrtstar3D.py
|
2020-06-19 19:00:08 -07:00
|
|
|
└── Stochastic Shortest Path
|
2020-06-28 20:59:57 -07:00
|
|
|
├── value_iteration.py # value iteration
|
|
|
|
|
├── policy_iteration.py # policy iteration
|
|
|
|
|
├── Q-value_iteration.py # Q-value iteration
|
|
|
|
|
└── Q-policy_iteration.py # Q-policy iteration
|
2020-06-19 23:38:30 -07:00
|
|
|
└── Model-free Control
|
2020-06-28 20:59:57 -07:00
|
|
|
├── Sarsa.py # SARSA : on-policy TD control
|
|
|
|
|
└── Q-learning.py # Q-learning : off-policy TD control
|
2020-06-20 00:10:50 -07:00
|
|
|
|
2020-06-20 13:36:11 -07:00
|
|
|
## Animations
|
2020-06-27 17:16:03 -07:00
|
|
|
### DFS & BFS (Dijkstra)
|
2020-06-20 14:03:32 -07:00
|
|
|
* Blue: starting state
|
|
|
|
|
* Green: goal state
|
2020-06-20 13:43:09 -07:00
|
|
|
|
|
|
|
|
<div align=right>
|
2020-06-20 13:36:11 -07:00
|
|
|
<table>
|
|
|
|
|
<tr>
|
2020-06-27 17:16:03 -07:00
|
|
|
<td><img src="https://github.com/zhm-real/path-planning-algorithms/blob/master/Search-based%20Planning/gif/DFS.gif" alt="dfs" width="400"/></a></td>
|
|
|
|
|
<td><img src="https://github.com/zhm-real/path-planning-algorithms/blob/master/Search-based%20Planning/gif/BFS.gif" alt="bfs" width="400"/></a></td>
|
|
|
|
|
</tr>
|
|
|
|
|
</table>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
### A* and A* Variants
|
|
|
|
|
<div align=right>
|
|
|
|
|
<table>
|
|
|
|
|
<tr>
|
|
|
|
|
<td><img src="https://github.com/zhm-real/path-planning-algorithms/blob/master/Search-based%20Planning/gif/Astar.gif" alt="astar" width="400"/></a></td>
|
|
|
|
|
<td><img src="https://github.com/zhm-real/path-planning-algorithms/blob/master/Search-based%20Planning/gif/Bi-Astar.gif" alt="biastar" width="400"/></a></td>
|
2020-06-20 13:36:11 -07:00
|
|
|
</tr>
|
2020-06-28 20:47:51 -07:00
|
|
|
</table>
|
|
|
|
|
<table>
|
2020-06-28 20:45:07 -07:00
|
|
|
<tr>
|
2020-06-29 10:30:05 -07:00
|
|
|
<td><img src="https://github.com/zhm-real/path-planning-algorithms/blob/master/Search-based%20Planning/gif/RepeatedA_star.gif" alt="repeatedastar" width="400"/></a></td>
|
2020-06-28 20:45:07 -07:00
|
|
|
<td><img src="https://github.com/zhm-real/path-planning-algorithms/blob/master/Search-based%20Planning/gif/ARA_star.gif" alt="arastar" width="400"/></a></td>
|
2020-06-29 10:30:05 -07:00
|
|
|
</tr>
|
|
|
|
|
</table>
|
|
|
|
|
<table>
|
|
|
|
|
<tr>
|
2020-06-28 20:45:07 -07:00
|
|
|
<td><img src="https://github.com/zhm-real/path-planning-algorithms/blob/master/Search-based%20Planning/gif/LRTA_star.gif" alt="lrtastar" width="400"/></a></td>
|
2020-06-29 10:30:05 -07:00
|
|
|
<td><img src="https://github.com/zhm-real/path-planning-algorithms/blob/master/Search-based%20Planning/gif/RTAA_star.gif" alt="rtaastar" width="400"/></a></td>
|
2020-06-28 20:45:07 -07:00
|
|
|
</tr>
|
2020-06-20 13:36:11 -07:00
|
|
|
</table>
|
|
|
|
|
</div>
|
|
|
|
|
|
2020-06-20 14:03:32 -07:00
|
|
|
### Value/Policy/Q-value/Q-policy Iteration
|
|
|
|
|
* Brown: losing states
|
|
|
|
|
<div align=right>
|
|
|
|
|
<table>
|
|
|
|
|
<tr>
|
|
|
|
|
<td><img src="https://github.com/zhm-real/path-planning-algorithms/blob/master/Stochastic%20Shortest%20Path/gif/VI.gif" alt="value iteration" width="400"/></a></td>
|
2020-06-20 15:23:14 -07:00
|
|
|
<td><img src="https://github.com/zhm-real/path-planning-algorithms/blob/master/Stochastic%20Shortest%20Path/gif/VI_E.gif" alt="value iteration" width="400"/></a></td>
|
2020-06-20 14:03:32 -07:00
|
|
|
</tr>
|
|
|
|
|
</table>
|
|
|
|
|
</div>
|
|
|
|
|
|
2020-06-20 14:12:35 -07:00
|
|
|
### SARSA(on-policy) & Q-learning(off-policy)
|
|
|
|
|
* Brown: losing states
|
|
|
|
|
<div align=right>
|
|
|
|
|
<table>
|
|
|
|
|
<tr>
|
|
|
|
|
<td><img src="https://github.com/zhm-real/path-planning-algorithms/blob/master/Model-free%20Control/gif/SARSA.gif" alt="value iteration" width="400"/></a></td>
|
|
|
|
|
<td><img src="https://github.com/zhm-real/path-planning-algorithms/blob/master/Model-free%20Control/gif/Qlearning.gif" alt="value iteration" width="400"/></a></td>
|
|
|
|
|
</tr>
|
|
|
|
|
</table>
|
|
|
|
|
</div>
|
2020-06-20 14:03:32 -07:00
|
|
|
|
2020-06-20 00:10:50 -07:00
|
|
|
## License
|
|
|
|
|
MIT License
|