Approximate kinodynamic planning using \(L_ 2\)-norm dynamic bounds

DOI10.1016/0898-1221(94)90074-4zbMath0805.68139OpenAlexW2270974788WikidataQ128037016 ScholiaQ128037016MaRDI QIDQ1324341

John H. Reif, Stephen R. Tate

Publication date: 24 May 1994

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(94)90074-4

zbMATH Keywords

roboticsapproximation algorithmskinodynamic motion planning

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Computing methodologies and applications (68U99)

Related Items (2)

Time-optimal trajectories of a rod in the plane subject to velocity constraints ⋮ Continuous alternation: the complexity of pursuit in continuous domains

Cites Work

• Unnamed Item
• An algorithm for shortest-path motion in three dimensions
• Motion planning with inertial constraints
• An exact algorithm for kinodynamic planning in the plane
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers

This page was built for publication: Approximate kinodynamic planning using \(L_ 2\)-norm dynamic bounds