Related papers: On the complexity of parametrized motion planning …
In this paper we study symmetric motion planning algorithms, i.e. such that the motion from one state A to another B, prescribed by the algorithm, is the time reverse of the motion from B to A. We experiment with several different notions…
It has been observed that the very important motion planning problem of robotics mathematically speaking boils down to the problem of finding a section to the path-space fibration, raising the notion of topological complexity, as introduced…
We introduce a bivariate version of topological complexity, $\mathrm{TC}(f,g)$, associated with two continuous maps $f\colon X\to Z$ and $g\colon Y\to Z$. This invariant measures the minimal number of continuous motion planning rules…
In this paper we develop theory of sequential parametrized motion planning which generalises the approach of parametrized motion planning, which was introduced recently in [3]. A sequential parametrized motion planning algorithm produced a…
In terms of Rudyak's generalization of Farber's topological complexity of the path motion planning problem in robotics, we give a complete description of the topological instabilities in any sequential motion planning algorithm for a system…
We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the…
The topological complexity TC(X) is a numerical homotopy invariant of a topological space X which is motivated by robotics and is similar in spirit to the classical Lusternik-Schnirelmann category of X. Given a mechanical system with…
Starting from Borel's description of the mod-2 cohomology of real flag manifolds, we give a minimal presentation of the cohomology ring for semi complete flag manifolds $F_{k,m}:=F(1,\ldots,1,m)$ where $1$ is repeated $k$ times. The…
Topological complexity is a numerical homotopy invariant that measures the instability of motion planning in a space. To study the topological complexity of non-simply connected spaces, Costa and Farber introduced a cohomology class whose…
The paper surveys topological problems relevant to the motion planning problem of robotics and includes some new results and constructions. First we analyse the notion of topological complexity of configuration spaces which is responsible…
In this note we introduce parameterized Gromov-Witten invariants for symplectic fiber bundles and study the topology of the symplectomorphism group. We also give sample applications showing the non-triviality of certain homotopy groups of…
We develop the theory of probabilistic variants of the one-category and diagonal topological complexity, which bound the classical LS-category and topological complexity from below. Unlike any other classical or probabilistic invariants,…
We give rigorous foundations for parametrized homotopy theory in this monograph. After preliminaries on point-set topology, base change functors, and proper actions of non-compact Lie groups, we develop the homotopy theory of equivariant…
Parametrized motion planning algorithms have high degrees of universality and flexibility, as they are designed to work under a variety of external conditions, which are viewed as parameters and form part of the input of the underlying…
This paper explores topological complexity in the finite equivariant setting. We first define and study an equivariant version of Tanaka's combinatorial complexity for finite topological spaces. We explore the relationships between this…
The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configuration space of a mechanical system. In this paper we…
We introduce and study the sequential analogue of Grant's parametrized topological complexity of group epimorphisms, which generalizes the sequential topological complexity of groups. We derive bounds for sequential parametrized topological…
In this paper, we deal with the robot motion planning problem in multi-valued function theory. We first enrich the multi-homotopy studies by introducing a multi-homotopy lifting property and a multi-fibration. Then we compute both a…
In this paper we generalize the discrete r-homotopy to the discrete (s, r)-homotopy. Then by this notion, we introduce the discrete motion planning for robots which can move discreetly. Moreover, in this case the number of motion planning,…
We study certain topological problems that are inspired by applications to autonomous robot manipulation. Consider a continuous map $f\colon X\to Y$, where $f$ can be a kinematic map from the configuration space $X$ to the working space $Y$…