Related papers: A new approach to the equivariant topological comp…
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…
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…
We show that the parametrised topological complexity of Cohen, Farber and Weinberger gives an invariant of group epimorphisms. We extend various bounds for the topological complexity of groups to obtain bounds for the parametrised…
We introduce and study a parametrized analogue of the directed topological complexity, originally developed by Goubault, Farber, and Sagnier. We establish the fibrewise basic dihomotopy invariance of directed parametrized topological…
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 present an Eilenberg-Steenrod-like axiomatic framework for equivariant coarse homology and cohomology theories. We also discuss a general construction of such coarse theories from topological ones and the associated transgression maps. A…
Parametrized motion planning algorithms have high degrees of universality and flexibility, as they are designed to work under a variety of external conditions, which are viewed as parameters and form part of the input of the underlying…
This short note introduces a notion of directed homotopy equivalence and of "directed" topological complexity (which elaborates on the notion that can be found in e.g. Farber's book) which have a number of desirable joint properties. In…
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 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…
We introduce fibrewise Whitehead- and fibrewise Ganea definitions of monoidal topological complexity. We then define several lower bounds for the topological complexity, which improve on the standard lower bound in terms of nilpotency of…
We study questions of the following type: Can one assign continuously and $\Sigma_m$-equivariantly to any $m$-tuple of distinct points on the sphere $S^n$ a multipath in $S^n$ spanning these points? A \emph{multipath} is a continuous map of…
Eisermann and Lamm introduced a notion of symmetric equivalence among symmetric union diagrams and studied it using a refined form of the Jones polynomial. We introduced invariants of symmetric equivalence via refined versions of…
In terms of Rudyak's generalization of Farber's topological complexity of the path motion planning problem in robotics, we give a complete description of the topological instabilities in any sequential motion planning algorithm for a system…
Equivariant quantization is a new theory that highlights the role of symmetries in the relationship between classical and quantum dynamical systems. These symmetries are also one of the reasons for the recent interest in quantization of…
The transparent way for the invariant (Hamiltonian) description of equivariant localization of the integrals over phase space is proposed. It uses the odd symplectic structure, constructed over tangent bundle of the phase space and permits…
In this paper, we investigate a curvature-adapted and proper complex equifocal submanifold in a symmetric space of non-compact type. The class of these submanifolds contains principal orbits of Hermann type actions as homogeneous examples.…
We introduce notions of continuous orbit equivalence and strong (respective, weak) continuous orbit equivalence for automorphism systems of \'{e}tale equivalence relations, and characterize them in terms of the semi-direct product…
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 introduce higher symmetric simplicial complexity $SC_n^{\Sigma}(K)$ of a simplicial complex $K$ and higher symmetric combinatorial complexity $CC_n^{\Sigma}(P)$ of a finite poset $P$. These are simplicial and combinatorial…