Approximate kinodynamic planning using L_ 2-norm dynamic bounds

DOI10.1016/0898-1221(94)90074-4MaRDI QIDQ1324341zbMATH OpenOpenAlexWikidataFDO

Authors J. 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

approximation algorithmskinodynamic motion planningrobotics

Mathematics Subject Classification ID

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

Recommendations

• An exact algorithm for kinodynamic planning in the plane
• Kinodynamic motion planning
• Nonuniform Discretization for Kinodynamic Motion Planning and its Applications

Cites work

• An algorithm for shortest-path motion in three dimensions
• An exact algorithm for kinodynamic planning in the plane
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Motion planning with inertial constraints
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers

Cited in

(6)

• An exact algorithm for kinodynamic planning in the plane
• Time-optimal trajectories of a rod in the plane subject to velocity constraints
• Kinodynamic motion planning
• Nonuniform Discretization for Kinodynamic Motion Planning and its Applications
• KABouM: Knowledge-Level Action and Bounding Geometry Motion Planner
• Continuous alternation: the complexity of pursuit in continuous domains

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1324341)