Related papers: Transversal motion planning
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…
The topological complexity ${\sf TC}(X)$ is a homotopy invariant of a topological space $X$, motivated by robotics, and providing a measure of the navigational complexity of $X$. The topological complexity of a connected sum of real…
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 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…
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.…
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…
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…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…
We introduce a variant of Farber's topological complexity, defined for smooth compact orientable Riemannian manifolds, which takes into account only motion planners with the lowest possible "average length" of the output paths. We prove…
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''…
Farber and Rudyak introduced topological complexity $\mathbf{TC}(X)$ of motion planning and its higher analogs $\mathbf{TC}_n(X)$ to measure the complexity of assigning paths to point tuples. Motivated by motion planning where a robotic…
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…
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,…
We study an elementary problem of topological robotics: rotation of a line, which is fixed by a revolving joint at a base point: one wants to bring the line from its initial position to a final position by a continuous motion in the space.…
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…
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…
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…
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…
We introduce the geodesic complexity of a metric space, inspired by the topological complexity of a topological space. Both of them are numerical invariants, but, while the TC only depends on the homotopy type, the GC is an invariant under…
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.…