Multitasking collision-free optimal motion planning algorithms in Euclidean spaces
From MaRDI portal
(Redirected from Publication:4965908)
configuration spaceshigher motion planning algorithmssequential motion planningtopological complexity
Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Homotopy equivalences in algebraic topology (55P10) Discriminantal varieties and configuration spaces in algebraic topology (55R80) Artificial intelligence for robotics (68T40)
Abstract: We present optimal motion planning algorithms which can be used in designing practical systems controlling objects moving in Euclidean space without collisions. Our algorithms are optimal in a very concrete sense, namely, they have the minimal possible number of local planners. Our algorithms are motivated by those presented by Mas-Ku and Torres-Giese (as streamlined by Farber), and are developed within the more general context of the multitasking (a.k.a.~higher) motion planning problem. In addition, an eventual implementation of our algorithms is expected to work more efficiently than previous ones when applied to systems with a large number of moving objects.
Recommendations
- Sequential collision-free optimal motion planning algorithms in punctured Euclidean spaces
- Configuration spaces and robot motion planning algorithms
- Motion planning algorithms for configuration spaces in the higher dimensional case
- The higher topological complexity of configuration spaces of odd-dimensional spheres
- Topological complexity of motion planning
- Sequential motion planning of non-colliding particles in Euclidean spaces
- Configuration spaces and topological complexity
- scientific article; zbMATH DE number 2145101
- Parametrized topological complexity of collision-free motion planning in the plane
Cites work
- Configuration spaces and robot motion planning algorithms
- Configuration Spaces.
- Higher topological complexity and its symmetrization
- Lectures on algebraic topology.
- Motion planning algorithms for configuration spaces
- Motion planning algorithms for configuration spaces in the higher dimensional case
- On higher analogs of topological complexity
- Planning Algorithms
- Sequential motion planning of non-colliding particles in Euclidean spaces
- Topological complexity of motion planning
Cited in
(9)- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Parametrized topological complexity of collision-free motion planning in the plane
- Multiple object semilinear motion planning
- Sequential parametrized motion planning and its complexity. II
- Sequential motion planning of non-colliding particles in Euclidean spaces
- Reducing Multiple Object Motion Planning to Graph Searching
- scientific article; zbMATH DE number 2085300 (Why is no real title available?)
- Sequential collision-free optimal motion planning algorithms in punctured Euclidean spaces
- Motion planning algorithms for configuration spaces in the higher dimensional case
This page was built for publication: Multitasking collision-free optimal motion planning algorithms in Euclidean spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965908)
