On soft predicates in subdivision motion planning

DOI10.1016/j.comgeo.2015.04.002zbMath1339.68283OpenAlexW2216320547MaRDI QIDQ2354924

Cong Wang, Yi-Jen Chiang, Chee-Keng Yap

Publication date: 27 July 2015

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.6533

zbMATH Keywords

motion planningsubdivision algorithmsexact algorithmsresolution-exact algorithmssoft predicates

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Artificial intelligence for robotics (68T40)

Related Items (4)

Soft subdivision motion planning for complex planar robots ⋮ The complexity of subdivision for diameter-distance tests ⋮ Soft Subdivision Motion Planning for Complex Planar Robots ⋮ Rods and Rings: Soft Subdivision Planner for R^3 x S^2.

Uses Software

• gmp
• MPFR
• SqFreeEVAL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SqFreeEVAL: An (almost) optimal real-root isolation algorithm
• An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• 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
• A sweepline algorithm for Voronoi diagrams
• Motion planning via manifold samples
• Computing Roadmaps of General Semi-Algebraic Sets
• 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
• Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space
• In Praise of Numerical Computation
• Generalized voronoi diagrams for moving a ladder. I: Topological analysis
• Nonuniform Discretization for Kinodynamic Motion Planning and its Applications
• When Newton meets Descartes
• Near optimal tree size bounds on a simple real root isolation algorithm
• A simple but exact and efficient algorithm for complex root isolation
• Shortest path amidst disc obstacles is computable
• Planning Algorithms
• Accurate Minkowski sum approximation of polyhedral models

This page was built for publication: On soft predicates in subdivision motion planning