Constructing roadmaps of semi-algebraic sets. I: Completeness
From MaRDI portal
Publication:1117992
DOI10.1016/0004-3702(88)90055-0zbMath0668.14016MaRDI QIDQ1117992
Publication date: 1988
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(88)90055-0
68T99: Artificial intelligence
14-04: Software, source code, etc. for problems pertaining to algebraic geometry
68W99: Algorithms in computer science
14Pxx: Real algebraic and real-analytic geometry
Related Items
Entropy and complexity of a path in sub-Riemannian geometry, Computing roadmaps of semi-algebraic sets on a variety, Finding connected components of a semialgebraic set in subexponential time, Finding connected components of a semialgebraic set in subexponential time, A survey of motion planning algorithms from the perspective of autonomous UAV guidance, On the topology of real algebraic plane curves, Construction of C-space roadmaps from local sensory data. What should the sensors look for?, An opportunistic global path planner, Mechanical parts orienting: the case of a polyhedron on a table, Randomization for robot tasks: using dynamic programming in the space of knowledge states, Pseudo minimum translational distance between convex polyhedra. I. Definition and properties, Pseudo minimum translational distance between convex polyhedra. II. Robot collision-free path planning, Genetic algorithms in bidisciplinary (aerodynamics/electromagnetism) optimization, Efficient Boustrophedon multi-robot coverage: An algorithmic approach, Simplified Voronoi diagrams, Techniques for exploiting structure in matrix formulae of the sparse resultant, Search for shortest path around semialgebraic obstacles in the plane, Counting connected components of a semialgebraic set in subexponential time, Construction of roadmaps in semi-algebraic sets, An efficient algorithm for hidden surface removal. II, Geometry and search in motion planning., Computational complexity and constraint logic programming languages, Optimal path planning based on visibility, Recent progress in exact geometric computation, Construction of \(C^ 2\) Pythagorean-hodograph interpolating splines by the homotopy method, An application of algebraic geometry to encryption: tame transformation method, The complexity of approximating a nonlinear program, A variational approach to path planning in three dimensions using level set methods, Macaulay style formulas for sparse resultants, Much Ado about Zero, A public key system with signature and master key functions
Cites Work
