Mooophy/Path-Planning
Implementation for A* with stricted visited list, Lifelong Planning A* and D* Lite final version
C++MIT
Issues
- 0
Result of DSatr re-planning
#25 opened by Mooophy - 0
Add a auxiliary data structure to track old keys
#24 opened by Mooophy - 1
Is coordinate in LpState needed?
#11 opened by Mooophy - 0
To add path building.
#23 opened by Mooophy - 1
Pointer to LpState or Coordinate are what should be held by q, rather than LpState
#17 opened by Mooophy - 0
Refactor ideas for LpAstar
#22 opened by Mooophy - 1
- 1
Bug : something wrong with priority queue
#21 opened by Mooophy - 0
- 0
- 0
Add bool field to hold blocked or not in LpState
#13 opened by Mooophy - 0
Add update_vertex(LpState)
#15 opened by Mooophy - 0
add compute_shortest_path()
#16 opened by Mooophy - 0
filter out the invalid coordinates in neighbors.
#19 opened by Mooophy - 0
Add unorded_set<Coordinate> as Blockeds.
#14 opened by Mooophy - 0
Add a wrapper of LpAstarCore for encapsulation
#12 opened by Mooophy - 1
Test LpState with PriorityQueue
#10 opened by Mooophy - 0
GetAsyncKeyState may need debouncing.
#6 opened by Mooophy - 0
change (y, x) back to (x, y) for State
#7 opened by Mooophy - 0
Are succ and pred all just children?
#8 opened by Mooophy - 1
- 1
Potential problem in AStarSel::Result
#3 opened by Mooophy - 0
- 0
Hush function needed for Node
#2 opened by Mooophy - 3
updating needed for priority queue
#1 opened by Mooophy