相关论文: Lusternik-Schnirelmann category and based topologi…
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 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…
The higher topological complexity of a space $X$, $\text{TC}_r(X)$, $r=2,3,\ldots$, and the topological complexity of a map $f$, $\text{TC}(f)$, have been introduced by Rudyak and Pave\v{s}i\'{c}, respectively, as natural extensions of…
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,…
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…
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.…
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.…
Let X be a (not-necessarily homotopy-associative) H-space. We show that TC_{n+1}(X) = cat(X^n), for n >= 1, where TC_{n+1}(-) denotes the so-called higher topological complexity introduced by Rudyak, and cat(-) denotes the…
In this paper, we deal with the robot motion planning problem in multi-valued function theory. We first enrich the multi-homotopy studies by introducing a multi-homotopy lifting property and a multi-fibration. Then we compute both a…
We provide explicit motion planners for Euiclidean configuration spaces. This allows us to recover some known values of the topological complexity and the Lusternik-Schinirelman category of these spaces.
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…
In this work we will review the notion of topological complexity, introduced by Michael Farber in 2003. We will use this theory of topological complexity to solve the motion planning problem of a mobile robot that navigates in the Euclidean…
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 first study the higher version of the relative topological complexity by using the homotopic distance. We also introduced the generalized version of the relative topological complexity of a topological pair on both the Schwarz genus and…
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.…
It has been observed that the very important motion planning problem of robotics mathematically speaking boils down to the problem of finding a section to the path-space fibration, raising the notion of topological complexity, as introduced…
For a pair of spaces $X$ and $Y$ such that $Y \subseteq X$, we define the relative topological complexity of the pair $(X,Y)$ as a new variant of relative topological complexity. Intuitively, this corresponds to counting the smallest number…
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…
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 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…