-
# Path Planning Namespace
## Overview
### Objective
The pathplanning namespace introduces an ASTAR class implementing the A* algorithm, enhanced with object avoidance capabilities. The class …
-
How can we improve routing functions?
- [ ] support global router
- [ ] support auto-routing with arbitrary directions, at the moment groups of routes need to have the same angle.
See `gdsfac…
-
https://github.com/whoenig/libMultiRobotPlanning/blob/b01a527103d5a7c0eda529cf0e1ae9568b9b9391/include/libMultiRobotPlanning/a_star.hpp#L85
I think it could have infinite loop if no way from star…
-
For the efficiency function, I think it would make sense for us to add a function that compares the efficiency of a route through the existing network with a theoretical direct (as-the-crow-flies) rou…
-
algorithm now functions and generates line candidates. However, there are some areas of improvement to be made:
1. Efficiency generation is too slow and needs optimization. One idea could be to hav…
-
There is at least one bug sometimes causing Thangs to think they can't get to places that they can get to, leading them to run straight at their target (since they gave up on actually pathfinding).
T…
-
这个 Issue 记录自己今年收藏的书签。或者有意思的东西。
-
微博内容精选
-
Every examples in repository uses searchproblem instance only once for a path and ditch. Is this supposed to be use like this? Is any way to rerun with new start/goals preserving algorithm instance al…
-
**Is your feature request related to a problem? Please describe.**
A pathplanner that could avoid specific areas has been requested, e.g. because it makes the user walk slower over specific tiles.
…