Related papers: Sequential motion planning assisted by group actio…
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 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.
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''…
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…
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…
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…
Let $X$ be a $G$-space. In this paper, we introduce the notion of sectional category with respect to $G$. As a result, we obtain $G$-homotopy invariants: the LS category with respect to $G$, the sequential topological complexity with…
We study several properties of expansive group actions on metric spaces and obtain relation between expansivity for subgroup and group actions. Through counter examples necessity of hypothesis are justified. We also study expansivity of…
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…
Given a partial action of a topological group $G$ on a space $X$, we determine properties $\mathcal P$ which can be extended from $X$ to its globalization. We treat the cases when $\mathcal P$ is any of the following: Hausdorff, regular,…
The notion of effective topological complexity, introduced by B{\l}aszczyk and Kaluba, deals with using group actions in the configuration space in order to reduce the complexity of the motion planning algorithm. In this article we focus on…
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 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,…
We present a simple approach to questions of topological orbit equivalence for actions of countable groups on topological and smooth manifolds. For example, for any action of a countable group $\Gamma$ on a topological manifold where the…
Some basic notions and results in Topological Dynamics are extended to continuous groupoid actions in topological spaces. We focus mainly on recurrence properties. Besides results that are analogous to the classical case of group actions,…
We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the…
By the work of Brodzki-Niblo-Nowak-Wright and Monod, topological amenability of a continuous group action can be characterized using uniformly finite homology groups or bounded cohomology groups associated to this action. We show that…
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…
We define the orbit category for transitive topological groupoids and their equivariant CW-complexes. By using these constructions we define equivariant Bredon homology and cohomology for actions of transitive topological groupoids. We show…
In this article, we define amorphic complexity for actions of locally compact $\sigma$-compact amenable groups on compact metric spaces. Amorphic complexity, originally introduced for $\mathbb Z$-actions, is a topological invariant which…