Learning to Use Adaptive Motion Primitives in Search-Based Planning for Navigation
Raghav Sood,Shivam Vats,Maxim Likhachev,Raghav Sood,Shivam Vats,Maxim Likhachev
Heuristic-based graph search algorithms like A* are frequently used to solve motion planning problems in many domains. For most practical applications, it is infeasible and unnecessary to pre-compute the graph representing the whole search space. Instead, these algorithms generate the graph incrementally by applying a fixed set of actions (frequently called motion primitives) to find the successor...
