Sequential parametrized motion planning and its complexity. II
From MaRDI portal
Publication:2699901
DOI10.1016/j.topol.2023.108490OpenAlexW4360603630WikidataQ122233372 ScholiaQ122233372MaRDI QIDQ2699901
Publication date: 19 April 2023
Published in: Topology and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.01091
topological complexityparametrized topological complexityFadell-Neuwirth bundlesequential topological complexity
Cites Work
- Unnamed Item
- Topological complexity of motion planning
- Sequential parametrized motion planning and its complexity
- Parametrized topological complexity of collision-free motion planning in the plane
- On higher analogs of topological complexity
- Multitasking collision-free optimal motion planning algorithms in Euclidean spaces
- Topology of Parametrized Motion Planning Algorithms
- Configuration Spaces.
This page was built for publication: Sequential parametrized motion planning and its complexity. II