You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
One way to do this: write a unit test case that does something like this:
for all goals:
for a grid of X/Y start positions:
set pose = start poisition
while(pose not at goal):
pose = pathplanner.update(curPose)
if(too many steps):
Fail
Pass
This will be a long testcase, but it can exhaustively show that we can plan from any start spot to any goal without getting stuck.
It's quite possible we'll change the base map params in the future (different obstacle size, strenght... differnet goal strenght)
Add logic to detect and warn about local minima the robot coudl get stuck in.
The text was updated successfully, but these errors were encountered: