Related papers: Explicit motion planning in digital projective pro…
We determine the Lusternik-Schnirelmann category of the projective product spaces introduced by D. Davis. We also obtained an upper bound for the topological complexity of these spaces, which improves the estimate given by J. Gonz\'alez, M.…
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…
This research is motivated by studying image processing algorithms through a topological lens. The images we focus on here are those that have been segmented by digital Jordan curves as a means of image compression. The algorithms of…
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…
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…
We construct "higher" motion planners for automated systems whose space of states are homotopy equivalent to a polyhedral product space $Z(K,\{(S^{k_i},\star)\})$, e.g. robot arms with restrictions on the possible combinations of…
Let $t$ be a positive integer. Following work of D. M. Davis, we study the topology of complex-projective product spaces, i.e. quotients of cartesian products of odd dimensional spheres by the diagonal $S^1$-action, and of the $t$-torsion…
We establish sharp upper bounds for the topological complexity of motion planning problem in spaces with small fundamental group, i.e. when it is finite of small order or has small cohomological dimension.
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…
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…
We study Farber's topological complexity (TC) of Davis' projective product spaces (PPS's). We show that, in many non-trivial instances, the TC of PPS's coming from at least two sphere factors is (much) lower than the dimension of the…
In this paper we generalize the discrete r-homotopy to the discrete (s, r)-homotopy. Then by this notion, we introduce the discrete motion planning for robots which can move discreetly. Moreover, in this case the number of motion planning,…
For positive integers $m$ and $s$, let $\mathbf{m}_s$ stand for the $s$-th tuple $(m,\ldots,m)$. We show that, for large enough $s$, the higher topological complexity $TC_s$ of an even dimensional real projective space $RP^m$ is…
In this paper, we study upper bounds for the topological complexity of the total spaces of some classes of fibre bundles. We calculate a tight upper bound for the topological complexity of an $n$-dimensional Klein bottle. We also compute…
Digital topological methods are often used on computing the topological complexity of digital images. We give new results on the relation between reducibility and digital contractibility in order to determine the topological complexity of a…
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,…
In this study, we improve the topological complexity computations on digital images with introducing the digital topological complexity computations of a surjective and digitally continuous map between digital images. We also reveal…
This book provides an introduction to the theory of digital (molecular) spaces (TDS). Digital spaces are combinatorial models of continuous spaces. TDS is one of alternative branches of digital topology that studies constructing and…
In this paper, we examine the relations of two closely related concepts, the digital Lusternik-Schnirelmann category and the digital higher topological complexity, with each other in digital images. For some certain digital images, we…
Digital topology has its own working conditions and sometimes differs from the normal topology. In the area of topological robotics, we have important counterexamples in this study to emphasize this red line between a digital image and a…