A Simple Path Non-existence Algorithm Using C-Obstacle Query

DOI10.1007/978-3-540-68405-3_17zbMath1188.93025OpenAlexW1492287580WikidataQ57425624 ScholiaQ57425624MaRDI QIDQ3564311

No author found.

Publication date: 2 June 2010

Published in: Springer Tracts in Advanced Robotics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68405-3_17

zbMATH Keywords

separation distanceadaptive cell decompositionpath non-existence for a robotpenetration depth computations

Mathematics Subject Classification ID

Adaptive control/observation systems (93C40) Geometric methods (93B27) Automated systems (robots, etc.) in control theory (93C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• Spatial Planning: A Configuration Space Approach
• Planning Algorithms

This page was built for publication: A Simple Path Non-existence Algorithm Using C-Obstacle Query