The complexity of the free space for motion planning amidst fat obstacles

DOI10.1007/BF01258292MaRDI QIDQ1842754zbMATH OpenOpenAlexFDO

Authors A. Frank van der Stappen

Publication date 20 April 1995

Published in Journal of Intelligent \& Robotic Systems (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial complexitymotion planning algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10)

Recommendations

• The complexity of the free space for a robot moving amidst fat obstacles
• Models and motion planning
• Models and motion planning
• Motion planning in environments with low obstacle density
• Approximate motion planning and the complexity of the boundary of the union of simple geometric figures

Cites work

• 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 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
• Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
• Efficient Motion Planning for an L-Shaped Object
• Fat Triangles Determine Linearly Many Holes
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• Point location in fat subdivisions
• Robot motion planning with uncertainty in control and sensing
• The complexity of the free space for a robot moving amidst fat obstacles
• The complexity of the free space for motion planning amidst fat obstacles

Cited in

(30)

• Kinetic collision detection for convex fat objects
• Decompositions and boundary coverings of non-convex fat polyhedra
• Dynamic motion planning in low obstacle density environments
• The complexity of the free space for a robot moving amidst fat obstacles
• Range searching in low-density environments
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• Guarding scenes against invasive hypercubes.
• Models and motion planning
• Local polyhedra and geometric graphs
• The complexity of the free space for motion planning amidst fat obstacles
• On the flatness of Minkowski sums
• Walking around fat obstacles.
• Bounding the locus of the center of mass for a part with shape variation
• Reprint of: Bounding the locus of the center of mass for a part with shape variation
• Approximate unions of lines and Minkowski sums
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
• The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
• Placing Text Boxes on Graphs
• Unions of fat convex polytopes have short skeletons
• Approximation algorithms for polynomial-expansion and low-density graphs
• Models and motion planning
• Dynamic motion planning in low obstacle density environments
• Dynamic data structures for fat objects and their applications
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
• Approximating the -low-density value
• An optimal-time algorithm for shortest paths on realistic polyhedra
• On realistic terrains
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• Improved bounds on the union complexity of fat objects

This page was built for publication: The complexity of the free space for motion planning amidst fat obstacles

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