Coordinated motion planning for two independent robots

DOI10.1007/BF01530889MaRDI QIDQ1356168zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3160700 (Why is no real title available?)
• scientific article; zbMATH DE number 3951430 (Why is no real title available?)
• scientific article; zbMATH DE number 3054965 (Why is no real title available?)
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• A “retraction” method for planning the motion of a disc
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
• An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
• Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
• Generalized voronoi diagrams for moving a ladder. I: Topological analysis
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• On multiple moving objects
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• On the general motion-planning problem with two degrees of freedom
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• Separating two simple polygons by a sequence of translations
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences

Cited in

(9)

• Motion planning in the presence of movable obstacles
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• On approximating shortest paths in weighted triangular tessellations
• Multiple object semilinear motion planning
• Shortest coordinated motion for square robots
• On the general motion-planning problem with two degrees of freedom
• A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
• Triangles in space or building (and analyzing) castles in the air
• Computing shortest paths amid non-overlapping weighted disks

This page was built for publication: Coordinated motion planning for two independent robots

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