Sequential parametrized motion planning and its complexity
From MaRDI portal
Recommendations
- Sequential parametrized motion planning and its complexity. II
- Topology of parametrized motion planning algorithms
- Parametrized topological complexity of sphere bundles
- Parametrized topological complexity of collision-free motion planning in the plane
- Topological complexity is a fibrewise L-S category
Cites work
- scientific article; zbMATH DE number 1544063 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3246961 (Why is no real title available?)
- A note on covers defining relative and sectional categories
- Configuration Spaces.
- Generating functions and topological complexity
- Higher topological complexity and its symmetrization
- Higher topological complexity of aspherical spaces
- On higher analogs of topological complexity
- On topological complexity of hyperbolic groups
- Parametrized topological complexity of collision-free motion planning in the plane
- Planning Algorithms
- Sequential motion planning of non-colliding particles in Euclidean spaces
- The genus of a fiber space
- Topological Complexity and Related Topics
- Topological complexity of motion planning
- Topology of parametrized motion planning algorithms
- Topology of robot motion planning
Cited in
(14)- Sequential motion planning of non-colliding particles in Euclidean spaces
- Sequential parametrized topological complexity and related invariants
- A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder
- Parametrized topological complexity of poset-stratified spaces
- Bidirectional sequential motion planning
- On soft predicates in subdivision motion planning
- Sequential parametrized motion planning and its complexity. II
- Parametrized topological complexity of sphere bundles
- Sequential parametrized topological complexity of sphere bundles
- Autonomous robots, motion algorithms and topology
- Sequential Parametrized Motion Planning and its Complexity
- The complexity of planar compliant motion planning under uncertainty
- Topology of parametrized motion planning algorithms
- Parametrized topological complexity of collision-free motion planning in the plane
This page was built for publication: Sequential parametrized motion planning and its complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2087777)