Coordinated motion planning for two independent robots

DOI10.1007/BF01530889zbMath0875.68438OpenAlexW2066528300MaRDI QIDQ1356168

Micha Sharir, Shmuel Sifrony

Publication date: 7 July 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01530889

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10)

Related Items

Triangles in space or building (and analyzing) castles in the air, Motion planning in the presence of movable obstacles, KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS, Shortest coordinated motion for square robots, Multiple object semilinear motion planning, On approximating shortest paths in weighted triangular tessellations, On the general motion-planning problem with two degrees of freedom

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• On multiple moving objects
• Separating two simple polygons by a sequence of translations
• 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
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• A “retraction” method for planning the motion of a disc
• Generalized voronoi diagrams for moving a ladder. I: Topological analysis
• An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers