Path-Planning
Path-Planning copied to clipboard
Implementation for A* with stricted visited list, Lifelong Planning A* and D* Lite final version
``` java {[r=0,c=0]|g:10000|r:5|h:1|b:f} {[r=0,c=1]|g:10000|r:5|h:1|b:f} {[r=0,c=2]|g:10000|r:10000|h:2|b:f}+++ {[r=1,c=0]|g:4|r:4|h:0|b:f} {[r=1,c=1]|g:10000|r:10000|h:1|b:t} {[r=1,c=2]|g:10000|r:3|h:2|b:f}+++ {[r=2,c=0]|g:3|r:3|h:1|b:f} {[r=2,c=1]|g:10000|r:10000|h:1|b:t} {[r=2,c=2]|g:2|r:2|h:2|b:f}+++ {[r=3,c=0]|g:2|r:2|h:2|b:f} {[r=3,c=1]|g:10000|r:10000|h:2|b:t} {[r=3,c=2]|g:1|r:1|h:2|b:f}+++ {[r=4,c=0]|g:10000|r:2|h:3|b:f} {[r=4,c=1]|g:1|r:1|h:3|b:f} {[r=4,c=2]|g:0|r:0|h:3|b:f}+++ ``` - Note:`g` and `r` are the same as the given example. But...
Currently, I'm implementing `succ` and `pred` as a single `children` as that in `AStar`.