An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers

DOI10.1016/0196-6774(87)90038-1zbMath0643.68050OpenAlexW2031799253MaRDI QIDQ3785936

Daniel Leven, Micha Sharir

Publication date: 1987

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(87)90038-1

zbMATH Keywords

ladderpolygonal obstaclesmotion-planning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04)

Related Items

On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, The visibility diagram: A data structure for visibility problems and motion planning, Coordinated motion planning for two independent robots, A survey of motion planning and related geometric algorithms, Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom, On the general motion-planning problem with two degrees of freedom, An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space, The complexity of the free space for motion planning amidst fat obstacles, Robot motion planning and the single cell problem in arrangements, An approximation algorithm ford₁-optimal motion of a rod robot with fixed rotations, On the complexity of a single cell in certain arrangements of surfaces related to motion planning, The complexity of the free space for a robot moving amidst fat obstacles