Finding feasible paths for a two-point body

DOI10.1016/0196-6774(89)90026-6zbMATH Open0676.68083OpenAlexW1992249087MaRDI QIDQ3832089FDOQ3832089

Authors: Ellen B. Feinberg, Christos Papadimitriou 

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0196-6774(89)90026-6

Recommendations

• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• An algorithm for shortest-path motion in three dimensions
• Shortest paths in the plane with polygonal obstacles
• scientific article; zbMATH DE number 4060716
• An O(n2) shortest path algorithm for a non-rotating convex body

zbMATH Keywords

two-point problemmotion planning problemvariable two-point problem

Mathematics Subject Classification ID

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

Cited In (3)

• Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment
• Trajectory planning for an articulated probe
• Solving the two-dimensional findpath problem using a line-triangle representation of the robot

This page was built for publication: Finding feasible paths for a two-point body

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