3 papers
cs.RO2026
Rapidly-Iterating Grid-Based Near-Optimal Kinodynamic Motion Planning
Michael Moncton, Eric Frew
This paper develops the Rapidly-iterating kinoDynamic Grid (RDG) algorithm, an asymptotically near-optimal kinodynamic motion planning algorithm that produces high quality solution…
cs.RO2026
Achieving Asymptotic Near-Optimality Without -Similarity
Michael Moncton, Eric Frew
Sampling-based motion planning algorithms are a popular class of trajectory planning algorithm due to their speed in complex, high-dimensional environments and ability to handle ki…
cs.RO2023
Path Planning in 3D with Motion Primitives for Wind Energy-Harvesting Fixed-Wing Aircraft
Seung-Keol Ryu, Michael Moncton, Han-Lim Choi +1
In this work, a set of motion primitives is defined for use in an energy-aware motion planning problem. The motion primitives are defined as sequences of control inputs to a simpli…