Related papers: On Targeted Complexity of Discrete Motion
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$…
A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…
In this paper, we examine how topological complexity, simplicial complexity, discrete topological complexity, and combinatorial complexity compare when applied to models of $S^1$. We prove that the topological complexity of non-minimal…
The Topological complexity a la Farber $\text{TC}(-)$ is a homotopy invariant which have interesting applications in Robotics, specifically, in the robot motion planning problem. In this work we calculate the topological complexity of the…
Many practical applications in topological data analysis arise from data in the form of point clouds, which then yield simplicial complexes. The combinatorial structure of simplicial complexes captures the topological relationships between…
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…
We develop a framework for computing the homology of weighted simplicial complexes with coefficients in a discrete valuation ring. A weighted simplicial complex, $(X,v)$, introduced by Dawson [Cah. Topol. G\'{e}om. Diff\'{e}r. Cat\'{e}g. 31…
The singular simplicial set Sing(X) of a space X completely captures its weak homotopy type. We introduce a category of_controlled sets_, yielding _simplicial controlled sets_, such that one can functorially produce a singular simplicial…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…
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…
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''…
A general method for constructing simplicial complex from observed time series of dynamical systems based on the delay coordinate reconstruction procedure is presented. The obtained simplicial complex preserves all pertinent topological…
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…
This paper explores topological complexity in the finite equivariant setting. We first define and study an equivariant version of Tanaka's combinatorial complexity for finite topological spaces. We explore the relationships between this…
Let $A$ be either a simplicial complex $K$ or a small category $\mathcal C$ with $V(A)$ as its set of vertices or objects. We define a twisted structure on $A$ with coefficients in a simplicial group $G$ as a function $$ \delta\colon…
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…
In this paper, we systematically develop the $m$-contiguity distance between simplicial maps as a discrete approximation framework for homotopical complexity in the category of simplicial complexes. We construct an increasing sequence of…
We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…
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…
Let $V$ be a finite set. Let $\mathcal{K}$ be a simplicial complex with its vertices in $V$. In this paper, we discuss some differential calculus on $V$. We construct some constrained homology groups of $\mathcal{K}$ by using the…