Related papers: Topological complexity of generic hyperplane arran…

Parametrized motion planning algorithms have high degree of flexibility and universality, they can work under a variety of external conditions, which are viewed as parameters and form part of the input of the algorithm. In this paper we…

In this short note we observe that the higher topological complexity of an iterated connected sum of real projective spaces is maximal possible. Unlike the case of regular TC, the result is accessible through easy mod 2 zero-divisor…

How hard is it to program $n$ robots to move about a long narrow aisle such that only $w$ of them can fit across the width of the aisle? In this paper, we answer that question by calculating the topological complexity of $\text{conf}(n,w)$,…

Despite the attention that the problem of path planning for tethered robots has garnered in the past few decades, the approaches proposed to solve it typically rely on a discrete representation of the configuration space and do not exploit…

Using known results about their integral cohomology ring, we prove that the topological complexity of the space of n-gons in R^3 with prescribed side lengths equals 2n-5, assuming that the space is nonempty and does not contain any…

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…

We study a probabilistic variant of the r-th sequential parametrized topological complexity, which bounds this classical invariant from below and measures the difficulty in constructing permissive parametrized motion planning algorithms. On…

We prove a new lower bound for the almost 20 year old problem of determining the smallest possible size of an essential cover of the $n$-dimensional hypercube $\{\pm 1\}^n$, i.e. the smallest possible size of a collection of hyperplanes…

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…

This note is a survey on the topology of hyperplane arrangements. We mainly focus on the relationship between topology and the real structure, such as adjacent relations of chambers and stratifications related to real structures.

We define a simpler notion of symmetric topological complexity more ad hoc to the motion planning problem which was the original motivation for the definition of topological complexity. This is a homotopy invariant that we call…

Over the complex numbers, the complement of a collection of hyperplanes is a widely-studied object; the cohomology ring, in particular, is known to have a structure depending only on the combinatorial properties of the intersection of…

We calculate the higher topological complexity TC$_s$ for the complements of reflection arrangements, in other words for the pure Artin type groups of all finite complex reflection groups. In order to do that we introduce a simple…

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…

We establish that the isomorphy type as an abstract algebraic variety of the complement of an ample hyperplane sub-bundle H of a projective space bundle of rank r-1 over the projective line depends only on the the r-fold self-intersection…

We present a new approach to equivariant version of the topological complexity, called a symmetric topological complexity. It seems that the presented approach is more adequate for the analysis of an impact of symmetry on the the motion…

Following our previous work, we develop an algorithm to compute a presentation of the fundamental group of certain partial compactifications of the complement of a complex arrangement of lines in the projective plane. It applies, in…

We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…

We use an alternative definition of topological complexity to show that the topological complexity of the mapping telescope of a sequence $X_1\rightarrow X_2\rightarrow X_3\rightarrow...$ is bounded above by $2max{TC(X_i); i=1,2,...}$.

We consider the problem of robot motion planning in an oriented Riemannian manifold as a topological motion planning problem in its oriented frame bundle. For this purpose, we study the topological complexity of oriented frame bundles,…