Rods and Rings: Soft Subdivision Planner for R^3 x S^2.

DOI10.4230/LIPICS.SOCG.2019.43MaRDI QIDQ5088973zbMATH OpenOpenAlexFDO

Authors Ching-Hsiang Hsu, Yi-Jen Chiang, Chee K. Yap

Publication date 18 July 2022

Full work available at URL https://arxiv.org/abs/1903.09416

zbMATH Keywords

algorithmic motion planningresolution-exact algorithmssoft predicatesspatial ring robotsspatial rod robotssubdivision methods

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Path Planning for Simple Robots using Soft Subdivision Search
• Soft subdivision motion planning for complex planar robots
• Soft Subdivision Motion Planning for Complex Planar Robots
• Soft subdivision search in motion planning. II: Axiomatics
• On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles

Cites work

• A “retraction” method for planning the motion of a disc
• A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
• Algorithms in real algebraic geometry
• CGAL Arrangements and their applications. A step-by-step guide
• Computing Roadmaps of General Semi-Algebraic Sets
• Constructing the exact Voronoi diagram of arbitrary lines in three-dimensional space. With fast point-location
• Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
• Generalized voronoi diagrams for moving a ladder. I: Topological analysis
• scientific article; zbMATH DE number 4149525 (Why is no real title available?)
• scientific article; zbMATH DE number 1461253 (Why is no real title available?)
• scientific article; zbMATH DE number 2238822 (Why is no real title available?)
• On soft predicates in subdivision motion planning
• 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 the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles
• On-line motion planning: Case of a planar rod
• Pianos are not flat: rigid motion planning in three dimensions
• Planning Algorithms
• Soft Subdivision Motion Planning for Complex Planar Robots
• Soft subdivision search in motion planning. II: Axiomatics

Describes a project that uses

Uses Software

• CGAL
• OMPL

This page was built for publication: Rods and Rings: Soft Subdivision Planner for R^3 x S^2.

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