Related papers: Topological complexity of a map
Sequential parametrized topological complexity is a numerical homotopy invariant of a fibration, which arose in the robot motion planning problem with external constraints. In this paper, we study sequential parametrized topological…
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…
In this paper we introduce and study a new concept of parametrised topological complexity, a topological invariant motivated by the motion planning problem of robotics. In the parametrised setting, a motion planning algorithm has high…
We give sufficient conditions for the following problem: given a topological space X, a metric space Y, a subspace Z of Y, and a continuous map f from X to Y, is it possible, by applying to f an arbitrarily small perturbation, to ensure…
By a formula of Farber the topological complexity TC(X) of a (p-1)-connected, m-dimensional CW-complex X is bounded above by (2m+1)/p+1. There are also various lower estimates for TC(X) such as the nilpotency of the ring $H^*(X\times…
The Topological complexity a la Farber $\text{TC}(-)$ is a homotopy invariant which have interesting applications in Robotics, specifically, in the robot motion planning problem. In this work we calculate the topological complexity of the…
In this paper, we transfer the problem of measuring navigational complexity in topological spaces to the nearness theory. We investigate the most important component of this problem, the topological complexity number (denoted by TC), with…
Parametrized topological complexity is a homotopy invariant that represents the degree of instability of motion planning problem that involves external constraints. We consider the parametrized topological complexity in the case of…
We introduce and study the proper topological complexity of a given configuration space, a version of the classical invariant for which we require that the algorithm controlling the motion is able to avoid any possible choice of ``unsafe''…
We show how locally smooth actions of compact Lie groups on a manifold $X$ can be used to obtain new upper bounds for the topological complexity $\TC(X)$, in the sense of Farber. We also obtain new bounds for the topological complexity of…
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…
Manifolds occur naturally as configuration spaces of robotic systems. They provide global descriptions of local coordinate systems that are common tools in expressing positions of robots. The purpose of this survey is threefold. Firstly, we…
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…
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…
We study motion planning algorithms for collision free control of multiple objects in the presence of moving obstacles. We compute the topological complexity of algorithms solving this problem. We apply topological tools and use information…
The interaction topology is critical for efficient cooperation of mobile robotic networks (MRNs). We focus on the local topology inference problem of MRNs under formation control, where an inference robot with limited observation range can…
Instabilities of robot motion are caused by topological reasons. In this paper we find a relation between the topological properties of a configuration space (the structure of its cohomology algebra) and the character of instabilities,…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
Given a space $X$, the topological complexity of $X$, denoted by $TC(X)$, can be viewed as the minimum number of "continuous rules" needed to describe how to move between any two points in $X$. Given subspaces $Y_1$ and $Y_2$ of $X$, there…
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…