Deep learning used for efficient path planning, outperforming A* in complex environments:https://arxiv.org/abs/1904.11102
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
The method looks very interesting (linear scaling on configuration space dimensionality looks awesome), but beating A* and RRT* is a very low bar (A* doesn't even obtain optimal solutions in a continuous c-space, while RRT* needs infinite time!)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
FYI Any Angle Path Finding algorithmshttps://en.wikipedia.org/wiki/Any-angle_path_planning …
-
Looking at the figures, the runtime of the proposed algorithm seems 100-200ms. Usually the numbers we expect from pathfinding papers are like below 10 ms... https://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13049 …
End of conversation
New conversation -
-
-
It looks as though you have to retrain it if the environment ever changes though...
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.