Soft Subdivision Motion Planning for Complex Planar Robots

DOI10.4230/LIPICS.ESA.2018.73MaRDI QIDQ5009643zbMATH OpenOpenAlexFDO

Authors

Publication date 4 August 2021

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

zbMATH Keywords

computational geometryalgorithmic motion planningplanar robots with complex geometryresolution-exact algorithmssoft predicates

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Soft subdivision motion planning for complex planar robots
• Path Planning for Simple Robots using Soft Subdivision Search
• On soft predicates in subdivision motion planning
• On soft predicates in subdivision motion planning
• Soft subdivision search in motion planning. II: Axiomatics
• Subdimensional expansion for multirobot path planning
• Efficiently Planning Compliant Motion in the Plane
• Mobile robot path planning for fine‐grained and smooth path spcification
• Configuration spaces and robot motion planning algorithms
• scientific article; zbMATH DE number 426008

Cites work

• scientific article; zbMATH DE number 2238822 (Why is no real title available?)
• CGAL Arrangements and their applications. A step-by-step guide
• On soft predicates in subdivision motion planning
• Planning Algorithms
• Robot motion planning with uncertainty in control and sensing
• Soft subdivision search in motion planning. II: Axiomatics

Cited in

(6)

• Rods and Rings: Soft Subdivision Planner for R^3 x S^2.
• Soft subdivision motion planning for complex planar robots
• Soft subdivision search in motion planning. II: Axiomatics
• On soft predicates in subdivision motion planning
• On soft predicates in subdivision motion planning
• Path Planning for Simple Robots using Soft Subdivision Search

Describes a project that uses

Uses Software

• OMPL
• core 2
• CGAL

This page was built for publication: Soft Subdivision Motion Planning for Complex Planar Robots

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