Marat Agranovskiy

MeshA*: Efficient Path Planning with Motion Primitives

We study a path planning problem where the possible move actions are represented as a finite set of motion primitives aligned with the grid representation of the environment. That is, each primitive corresponds to a short kinodynamically-feasible motion of an agent and is represented as a sequence o