A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder

DOI10.1016/0020-0190(89)90042-2MaRDI QIDQ1822971zbMATH OpenOpenAlexFDO

Authors Micha Sharir

Publication date 1989

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(89)90042-2

zbMATH Keywords

computational geometryshortest pathsmotion planningarrangements of curvesDavenport-Schinzel sequences

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
• A Lagrangian-based algorithm for a combinatorial motion planning problem
• Pseudo approximation algorithms with applications to optimal motion planning
• Pseudo approximation algorithms, with applications to optimal motion planning
• Sequential parametrized motion planning and its complexity
• Sequential parametrized motion planning and its complexity. II
• An exact algorithm for kinodynamic planning in the plane
• A general purpose algorithm for optimal trajectory planning of closed loop multibody systems
• Layer, Lie algebraic method of motion planning for nonholonomic systems
• Efficient Motion Planning for an L-Shaped Object

Cites work

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 4060713 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Optimal piecewise linear motion of an object among obstacles
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences

Cited in

(5)

• Shortest paths for line segments
• Optimal piecewise linear motion of an object among obstacles
• Lower bounds on moving a ladder in two and three dimensions
• An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
• An approximation algorithm ford₁-optimal motion of a rod robot with fixed rotations

This page was built for publication: A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder

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