Pages that link to "Item:Q1117992"
From MaRDI portal
The following pages link to Constructing roadmaps of semi-algebraic sets. I: Completeness (Q1117992):
Displayed 44 items.
- Querying probabilistic business processes for sub-flows (Q359875) (← links)
- Symbolic approximate time-optimal control (Q533800) (← links)
- A survey of motion planning algorithms from the perspective of autonomous UAV guidance (Q614803) (← links)
- On the topology of real algebraic plane curves (Q626980) (← links)
- Construction of C-space roadmaps from local sensory data. What should the sensors look for? (Q676266) (← links)
- An opportunistic global path planner (Q686736) (← links)
- Mechanical parts orienting: the case of a polyhedron on a table (Q686747) (← links)
- Randomization for robot tasks: using dynamic programming in the space of knowledge states (Q686748) (← links)
- Pseudo minimum translational distance between convex polyhedra. I. Definition and properties (Q866227) (← links)
- Pseudo minimum translational distance between convex polyhedra. II. Robot collision-free path planning (Q866230) (← links)
- Genetic algorithms in bidisciplinary (aerodynamics/electromagnetism) optimization (Q866243) (← links)
- Efficient Boustrophedon multi-robot coverage: An algorithmic approach (Q1022450) (← links)
- Simplified Voronoi diagrams (Q1101687) (← links)
- Techniques for exploiting structure in matrix formulae of the sparse resultant (Q1127958) (← links)
- Search for shortest path around semialgebraic obstacles in the plane (Q1190959) (← links)
- Counting connected components of a semialgebraic set in subexponential time (Q1207337) (← links)
- Construction of roadmaps in semi-algebraic sets (Q1311619) (← links)
- An efficient algorithm for hidden surface removal. II (Q1342857) (← links)
- Geometry and search in motion planning. (Q1353911) (← links)
- Computational complexity and constraint logic programming languages (Q1354033) (← links)
- Optimal path planning based on visibility (Q1411497) (← links)
- Recent progress in exact geometric computation (Q1779568) (← links)
- Construction of \(C^ 2\) Pythagorean-hodograph interpolating splines by the homotopy method (Q1815867) (← links)
- An application of algebraic geometry to encryption: tame transformation method (Q1884054) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- Multiquery motion planning in uncertain spaces: incremental adaptive randomized roadmaps (Q2299188) (← links)
- A variational approach to path planning in three dimensions using level set methods (Q2572792) (← links)
- Macaulay style formulas for sparse resultants (Q2782655) (← links)
- Mereology in Engineering and Computer Science (Q3295807) (← links)
- Much Ado about Zero (Q3644735) (← links)
- A public key system with signature and master key functions (Q4241652) (← links)
- Entropy and complexity of a path in sub-Riemannian geometry (Q4422727) (← links)
- Computing roadmaps of semi-algebraic sets on a variety (Q4700178) (← links)
- (Q5028436) (← links)
- Bounding the length of gradient trajectories (Q5028959) (← links)
- Computing the Hausdorff Boundary Measure of Semialgebraic Sets (Q5130991) (← links)
- On polynomial vector fields having a given affine variety as attractive and invariant set: application to robotics (Q5266191) (← links)
- Optimization-based approach to path planning for closed chain robot systems (Q5403422) (← links)
- The Convergence of Bird Flocking (Q5501926) (← links)
- Finding connected components of a semialgebraic set in subexponential time (Q5905520) (← links)
- Finding connected components of a semialgebraic set in subexponential time (Q5966655) (← links)
- Algorithm for Connectivity Queries on Real Algebraic Curves (Q6060394) (← links)
- Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results (Q6170822) (← links)