Soft Subdivision Search in Motion Planning, II: Axiomatics

DOI10.1007/978-3-319-19647-3_2zbMath1407.68493OpenAlexW746239517MaRDI QIDQ3452548

Chee-Keng Yap

Publication date: 12 November 2015

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19647-3_2

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Related Items (3)

Soft subdivision motion planning for complex planar robots ⋮ Soft Subdivision Motion Planning for Complex Planar Robots ⋮ Rods and Rings: Soft Subdivision Planner for R^3 x S^2.

Uses Software

• SqFreeEVAL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• SqFreeEVAL: An (almost) optimal real-root isolation algorithm
• Nondeterministic functions and the existence of optimal proof systems
• Lepp-bisection algorithms, applications and mathematical properties
• Lower bounds for zero-dimensional projections
• A “retraction” method for planning the motion of a disc
• Semi-dynamic Connectivity in the Plane
• On soft predicates in subdivision motion planning
• Near optimal tree size bounds on a simple real root isolation algorithm
• A simple but exact and efficient algorithm for complex root isolation
• Planning Algorithms
• Algorithms in real algebraic geometry

This page was built for publication: Soft Subdivision Search in Motion Planning, II: Axiomatics