saberbud/PathPlanning
1
0
Fork 0
mirror of https://github.com/zhm-real/PathPlanning.git synced 2026-08-29 08:34:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
Huiming Zhou
2020-07-29 00:35:01 -07:00
committed by GitHub
parent 4074d4c4ed
commit 1f3016d3e7
1 changed files with 0 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files
README.md
-30
View File
@@ -28,14 +28,6 @@ Directory Structure
└── rrt_3D
├── rrt3D.py # rrt3D : goal-biased rrt3D
└── rrtstar3D.py
└── 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
└── Model-free Control
├── Sarsa.py # SARSA : on-policy TD control
└── Q-learning.py # Q-learning : off-policy TD control
## Animations - Search-Based
### Best-First & Dijkstra
@@ -105,28 +97,6 @@ Directory Structure
</table>
</div>
### 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>
<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>
</tr>
</table>
</div>
### 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>
## Papers
### Search-base Planning
* [A*: ](https://ieeexplore.ieee.org/document/4082128) A Formal Basis for the Heuristic Determination of Minimum Cost Paths