On soft predicates in subdivision motion planning

DOI10.1145/2462356.2462386zbMath1305.68288OpenAlexW2016873343MaRDI QIDQ5174495

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

Publication date: 17 February 2015

Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2462356.2462386

zbMATH Keywords

motion planningroboticscomputational geometrysubdivision 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 (3)

Amortized analysis of smooth quadtrees in all dimensions ⋮ Semi-dynamic Connectivity in the Plane ⋮ Soft Subdivision Search in Motion Planning, II: Axiomatics

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