Related papers: Relative Topological Complexity and Configuration …

Topological complexity $\TC{B}$ of a space $B$ is introduced by M. Farber to measure how much complex the space is, which is first considered on a configuration space of a motion planning of a robot arm. We also consider a stronger version…

The $s$-th higher topological complexity of a space $X$, $TC_s(X)$, can be estimated from above by homotopical methods, and from below by homological methods. We give a thorough analysis of the gap between such estimates when $X=RP^m$, the…

Farber introduced a notion of topological complexity $\TC(X)$ that is related to robotics. Here we introduce a series of numerical invariants $\TC_n(X), n=1,2, ...$ such that $\TC_2(X)=\TC(X)$ and $\TC_n(X)\le \TC_{n+1}(X)$. For these…

We define a new version of Topological Complexity (TC) of a space, denoted as $\text{dTC}$, which, we think, fits better for motion planning for some autonomous systems. Like Topological complexity, \text{dTC} is also a homotopy invariant.…

We define and develop a homotopy invariant notion for the sequential topological complexity of a map $f:X\to Y,$ denoted $TC_{r}(f)$, that interacts with $TC_{r}(X)$ and $TC_{r}(Y)$ in the same way Jamie Scott's topological complexity map…

For a tree $T$, we show that for many positive integer values of $n$, and an integer $s \geq 2$, the higher topological complexity $TC_s$ of the unordered configuration spaces of trees $U\mathcal{C}^nT$, is maximal. In other words, we prove…

We determine topological complexity of a series of finite spaces which is weakly homotopy equivalent to a circle $S^1$, and give a finite space $X$ satisfying the inequality tc$(X) <$ cat$(X {\times} X)$. This answers two conjectures on…

We provide an upper bound on the topological complexity of twisted products. We use it to give an estimate $$TC(X)\le TC(\pi_1(X))+\dim X$$ of the topological complexity of a space in terms of its dimension and the complexity of its…

Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…

We prove an upper bound of higher topological complexity $TC_n(X)$ using higher $\mathcal{D}$-topological complexity $TC_n^{\mathcal{D}}(X)$ of a space $X$. An intermediate invariant $\widetilde{TC}_n(X)$ is used in the proof. We interpret…

Let TC$_n$(X) denote the n-th topological complexity of a topological space X. It is known that TC$_n$(X) does not exceed n-1 for non-contractible X, and so it makes sense to describe spaces X with TC$_n$(X) =n-1. Grant--Lupton--Oprea…

Given two real algebraic varieties X and Y, we denote by R(X,Y) the set of all regular maps from X to Y. The set R(X,Y) is regarded as a topological subspace of the space C(X,Y) of all continuous maps from X to Y endowed with the…

In this paper, we investigate discrete topological complexity $TC(K)$ introduced for situations where the configuration space possesses a simplicial structure. %Simplicial complexes are well-known and commonly used in programming for…

The Lusternik-Schnirelmann category cat and topological complexity TC are related homotopy invariants. The topological complexity TC has applications to the robot motion planning problem. We calculate the Lusternik-Schnirelmann category and…

This note attempts to make clear the relation between configurations of points in a space Y and those in its Cartesian product with the reals. We show that under certain conditions there is an equivalence between C(Y x R^n, X) and the n-th…

We explore the topology of configuration spaces of hard disks experimentally, and show that several changes in the topology can already be observed with a small number of particles. The results illustrate a theorem of Baryshnikov, Bubenik,…

In the directed setting, the spaces of directed paths between fixed initial and terminal points are the defining feature for distinguishing different directed spaces. The simplest case is when the space of directed paths is homotopy…

Let $B$ be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let $P$ be a convex polygon with $n$ vertices. Given a starting configuration (a location and a direction of travel)…

Topological complexity is a homotopy invariant that measures the minimal number of continuous rules required for motion planning in a space. In this work, we introduce persistent analogs of topological complexity and its cohomological lower…

A topological theory initiated recently by the author uses methods of algebraic topology to estimate numerically the character of instabilities arising in motion planning algorithms. The present paper studies random motion planning…