Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation
Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation
Fast and efficient path generation is critical for robots operating in complex environments. This motion planning problem is often performed in a robot's actuation or configuration space, where popular pathfinding methods such as A <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">*</sup> , RRT <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">*</sup> , get exponentially more computationally expensive to execute …