Related papers: Bidirectional Sequential Motion Planning
For a pointed topological space $X$, we use an inductive construction of a simplicial resolution of $X$ by wedges of spheres to construct a "higher homotopy structure" for $X$ (in terms of chain complexes of spaces). This structure is then…
A precise meaning is given to the notion of continuous iteration of a mapping. Usual discrete iterations are extended into a dynamical flow which is a homotopy of them all. The continuous iterate reveals that a dynamical map is formend by…
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 define the concept of a bi-operad. We develop the homotopy theory of "Bital-Sets" and of infinite-bi-operads. We develop a geometry of generalized schemes based on the spectra of distributive monochromatic bi-operads.
The main objective of this paper is to introduce a new method for qualitative analysis of various designs of robot arms. To this end we define the complexity of a map, examine its main properties and develop some methods of computation. In…
We introduce the notion of a topological symmetry as a quantum mechanical symmetry involving a certain topological invariant. We obtain the underlying algebraic structure of the Z_2-graded uniform topological symmetries of type (1,1) and…
We consider the problem of optimal path planning in different homotopy classes in a given environment. Though important in robotics applications, path-planning with reasoning about homotopy classes of trajectories has typically focused on…
Iterations of odd piecewise continuous maps with two discontinuities, i.e., symmetric discontinuous bimodal maps, are studied. Symbolic dynamics is introduced. The tools of kneading theory are used to study the homology of the discrete…
In this paper, we extend the definition of cohomology associated to monotone graph properties, to encompass twisted functor coefficients. We introduce oriented matchings on graphs, and focus on their (twisted) cohomology groups. We…
We study certain topological problems that are inspired by applications to autonomous robot manipulation. Consider a continuous map $f\colon X\to Y$, where $f$ can be a kinematic map from the configuration space $X$ to the working space $Y$…
We study the higher (sequential) topological complexity, a numerical homotopy invariant for the planar polygon spaces. For these spaces with a small genetic codes and dimension $m$, Davis showed that their topological complexity is either…
The optimal transport problem has many applications in machine learning, physics, biology, economics, etc. Although its goal is very clear and mathematically well-defined, finding its optimal solution can be challenging for large datasets…
We prove equivariant versions of the Beilinson-Lichtenbaum conjecture for Bredon motivic cohomology of smooth complex and real varieties with an action of the group of order two. This identifies equivariant motivic and topological…
We define real topological Hochschild homology of separated log schemes with involutions. We show that real topological Hochschild homology is $(\mathbb{P}^n,\mathbb{P}^{n-1})$-invariant, which leads to the definition of the motivic real…
We study dynamics and bifurcations of 2-dimensional reversible maps having a symmetric saddle fixed point with an asymmetric pair of nontransversal homoclinic orbits (a symmetric nontransversal homoclinic figure-8). We consider…
In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…
We introduce two new algebraic invariants, the (co)homological distances between continuous maps, which provide computable lower bounds for the homotopic distance and strictly refine the classical cup-length estimates. We then define the…
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…
Despite the attention that the problem of path planning for tethered robots has garnered in the past few decades, the approaches proposed to solve it typically rely on a discrete representation of the configuration space and do not exploit…
One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…