Related papers: On the topological complexity of directed parametr…
In this paper we study a notion of topological complexity for the motion planning problem. The topological complexity is a number which measures discontinuity of the process of motion planning in the configuration space X. More precisely,…
Using the notion of contiguity of simplicial maps, we adapt Farber's topological complexity to the realm of simplicial complexes. We show that, for a finite simplicial complex $K$, our discretized concept recovers the topological complexity…
Parametrized motion planning algorithms \cite{CFW} have a high degree of universality and flexibility; they generate the motion of a robotic system under a variety of external conditions. The latter are viewed as parameters and constitute…
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…
We develop a theory of generalized Hopf invariants in the setting of sectional category. In particular we show how Hopf invariants for a product of fibrations can be identified as shuffle joins of Hopf invariants for the factors. Our…
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…
We establish a stable homotopy-theoretic version of a recent result of Farber and Weinberger on the fibrewise topological complexity of sphere bundles and prove, by closely parallel methods, a similar result for real, complex and…
Analysis of motion algorithms for autonomous systems operating under variable external conditions leads to the concept of parametrized topological complexity \cite{CFW}. In \cite{CFW}, \cite{CFW2} the parametrized topological complexity was…
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…
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…
Topological complexity for spaces was introduced by M. Farber as a minimal number of continuity domains for motion planning algorithms. It turns out that this notion can be extended to the case of not necessarily commutative C*-algebras.…
In this paper, we introduce relative LS category of a map and study some of its properties. Then we introduce `higher topological complexity' of a map, a homotopy invariant. We give a cohomological lower bound and compare it with previously…
The Lusternik-Schnirelmann category $cat(X)$ is a homotopy invariant which is a numerical bound on the number of critical points of a smooth function on a manifold. Another similar invariant is the topological complexity $TC(X)$ (a la…
We compute the Lusternik-Schnirelmann category (LS-cat) and the higher topological complexity ($TC_s$, $s\geq2$) of the "no-$k$-equal" configuration space Conf$_k(\mathbb{R},n)$. This yields (with $k=3$) the LS-cat and the higher…
We develop the properties of the $n$-th sequential topological complexity $TC_n$, a homotopy invariant introduced by the third author as an extension of Farber's topological model for studying the complexity of motion planning algorithms in…
By analogy with the invariant Q-category defined by Scheerer, Stanley and Tanr\'e, we introduce the notions of Q-sectional category and Q-topological complexity. We establish several properties of these invariants. We also obtain a formula…
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…
We introduce a version of Farber's topological complexity suitable for investigating mechanical systems whose configuration spaces exhibit symmetries. Our invariant has vastly different properties to the previous approaches of Colman-Grant,…
The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X.…
We define and study an equivariant version of Farber's topological complexity for spaces with a given compact group action. This is a special case of the equivariant sectional category of an equivariant map, also defined in this paper. The…