Motion planning via manifold samples
From MaRDI portal
Publication:2017878
DOI10.1007/s00453-012-9736-1zbMath1308.68134arXiv1107.0803OpenAlexW3099020824MaRDI QIDQ2017878
Dan Halperin, Oren Salzman, Michael Hemmer, Barak Raveh
Publication date: 23 March 2015
Published in: Algorithmica, Algorithms – ESA 2011 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.0803
Computational aspects related to convexity (52B55) 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
Soft subdivision motion planning for complex planar robots ⋮ Throwing a sofa through the window ⋮ Soft Subdivision Motion Planning for Complex Planar Robots ⋮ Motion planning via manifold samples ⋮ On soft predicates in subdivision motion planning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- CGAL Arrangements and their applications. A step-by-step guide
- Arrangements on parametric surfaces. I: General framework and infrastructure
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Robot motion planning with uncertainty in control and sensing
- A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
- Motion planning via manifold samples
- A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- On Translational Motion Planning of a Convex Polyhedron in 3-Space
- A generic algebraic kernel for non-linear geometric applications
- Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
- Planning Algorithms
- Accurate Minkowski sum approximation of polyhedral models
- Algorithms in real algebraic geometry
