Skip to content
Snippets Groups Projects
Commit 9fc6a14e authored by Jingyan Ling's avatar Jingyan Ling
Browse files

update journal

parent f345fb7a
No related merge requests found
...@@ -151,9 +151,20 @@ ...@@ -151,9 +151,20 @@
### 07/04/2019 (Fri) ### 07/04/2019 (Fri)
- Write out algorithm for multi-node path finding - Write out algorithm for multi-node path finding
- pseudo code: - pseudo code:
> for (episode in E):
> > set initial state s (choose first pair of nodes to connect randomly) ~~~~
> > while max steps per episode not reached: for (episode in E):
> > > set initial state s (choose first pair of nodes to connect randomly)
> while not every connection is built:
choose next connection
find a path
update matrix
retrieve cost (length of path)
update Q (as sum of all cost)
~~~~
- Q here represents total cost of certain choice of path finding order.
- Cost defined by length of path
- If path cannot be found, cost 200
- Research on KiCAD import needs and python API - Research on KiCAD import needs and python API
\ No newline at end of file
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment