Constructing roadmaps of semi-algebraic sets. I: Completeness
From MaRDI portal
Publication:1117992
DOI10.1016/0004-3702(88)90055-0zbMath0668.14016OpenAlexW2021392696MaRDI 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
Artificial intelligence (68T99) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Algorithms in computer science (68W99) Real algebraic and real-analytic geometry (14Pxx)
Related Items
An application of algebraic geometry to encryption: tame transformation method, An efficient algorithm for hidden surface removal. II, Geometry and search in motion planning., Computational complexity and constraint logic programming languages, Simplified Voronoi diagrams, The complexity of approximating a nonlinear program, 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, Querying probabilistic business processes for sub-flows, Techniques for exploiting structure in matrix formulae of the sparse resultant, A survey of motion planning algorithms from the perspective of autonomous UAV guidance, Algorithm for Connectivity Queries on Real Algebraic Curves, On the topology of real algebraic plane curves, Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results, Optimal path planning based on visibility, Computing the Hausdorff Boundary Measure of Semialgebraic Sets, Unnamed Item, Mereology in Engineering and Computer Science, Optimization-based approach to path planning for closed chain robot systems, Construction of C-space roadmaps from local sensory data. What should the sensors look for?, Search for shortest path around semialgebraic obstacles in the plane, 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, Symbolic approximate time-optimal control, Counting connected components of a semialgebraic set in subexponential time, Finding connected components of a semialgebraic set in subexponential time, Macaulay style formulas for sparse resultants, Recent progress in exact geometric computation, Entropy and complexity of a path in sub-Riemannian geometry, Computing the homology of semialgebraic sets. I: Lax formulas, Computing roadmaps of semi-algebraic sets on a variety, Multiquery motion planning in uncertain spaces: incremental adaptive randomized roadmaps, Construction of \(C^ 2\) Pythagorean-hodograph interpolating splines by the homotopy method, Efficient Boustrophedon multi-robot coverage: An algorithmic approach, Much Ado about Zero, Finding connected components of a semialgebraic set in subexponential time, The Convergence of Bird Flocking, A variational approach to path planning in three dimensions using level set methods, Construction of roadmaps in semi-algebraic sets, On polynomial vector fields having a given affine variety as attractive and invariant set: application to robotics, A public key system with signature and master key functions, Bounding the length of gradient trajectories
Cites Work
