A survey of motion planning and related geometric algorithms (Q1123032): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the shortest paths between two convex polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem connected with differential equations II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Connected with Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Movement of Robot Arms in 2-Dimensional Bounded Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Movement Problems for 2-Dimensional Linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing Multiple Object Motion Planning to Graph Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi Diagram in the Laguerre Geometry and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean shortest paths in the presence of rectilinear barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3479543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial Planning: A Configuration Space Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A “retraction” method for planning the motion of a disc / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized voronoi diagrams for moving a ladder. I: Topological analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for shortest-path motion in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating two simple polygons by a sequence of translations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motion planning in the presence of moving obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3721314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection and Closest-Pair Problems for a Set of Planar Discs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost linear upper bounds on the length of general Davenport-Schinzel sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shortest Paths Amidst Convex Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the two-dimensional Davenport-Schinzel problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on the length of Davenport-Schinzel sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shortest Paths in Polyhedral Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong NP-hardness of moving many discs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motion planning among time dependent obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Davenport and Schinzel / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments / rank
 
Normal rank

Latest revision as of 09:57, 20 June 2024

scientific article
Language Label Description Also known as
English
A survey of motion planning and related geometric algorithms
scientific article

    Statements

    A survey of motion planning and related geometric algorithms (English)
    0 references
    0 references
    0 references
    1988
    0 references
    Recent developments in the motion planning problem and related geometric algorithms are surveyed. This is a modified version of the paper by the same authors: ``Motion planning and related geometric algorithms in robotics'' which appeared in the proceedings of the internation congress of mathematicians, Berkeley, California USA in 1986. See also the preceding review.
    0 references
    0 references
    projection method
    0 references
    retraction method
    0 references
    motion planning
    0 references
    geometric algorithms
    0 references
    robotics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references