Coordinated motion planning for two independent robots
From MaRDI portal
Publication:1356168
DOI10.1007/BF01530889zbMATH Open0875.68438OpenAlexW2066528300MaRDI QIDQ1356168FDOQ1356168
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
Cites Work
- Title not available (Why is that?)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- 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
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- On multiple moving objects
- Title not available (Why is that?)
- Separating two simple polygons by a sequence of translations
- Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- A “retraction” method for planning the motion of a disc
- Generalized voronoi diagrams for moving a ladder. I: Topological analysis
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
- An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
- Title not available (Why is that?)
Cited In (8)
- 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
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)
