Related papers: Topological complexity of collision-free multi-tas…
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 paper, we investigate discrete topological complexity $TC(K)$ introduced for situations where the configuration space possesses a simplicial structure. %Simplicial complexes are well-known and commonly used in programming for…
We give explicit descriptions of all path connected components and isolated points of both spaces of composition operators and nonzero weighted composition operators acting from a Fock space $\mathcal{F}^p(\mathbb{C}^n)$ to another one…
Multi-robot motion planning (MRMP) is the problem of finding collision-free paths for a set of robots in a continuous state space. The difficulty of MRMP increases with the number of robots and is exacerbated in environments with narrow…
We discuss computability and computational complexity of conformal mappings and their boundary extensions. As applications, we review the state of the art regarding computability and complexity of Julia sets, their invariant measures and…
We study the problem of motion-planning for free-flying multi-link robots and develop a sampling-based algorithm that is specifically tailored for the task. Our work is based on the simple observation that the set of configurations for…
In this paper we discover a connection between the Milnor fibration theory and current research trends in topological robotics. The configuration space and workspace are often described as subspaces of some Euclidean spaces. The work map is…
We study an elementary problem of topological robotics: rotation of a line, which is fixed by a revolving joint at a base point: one wants to bring the line from its initial position to a final position by a continuous motion in the space.…
We give simple upper bounds for rational sectional category and use them to compute invariants of the type of Farber's topological complexity of rational spaces. In particular we show that the sectional category of formal morphisms reaches…
We study the topology of the complex points of the algebraic loop space of a smooth curve.
We first study the higher version of the relative topological complexity by using the homotopic distance. We also introduced the generalized version of the relative topological complexity of a topological pair on both the Schwarz genus and…
After a short summary of known results on surface-complexity of closed 3-manifolds, we will classify all closed orientable 3-manifolds with surface-complexity one.
We introduce and analyze a new geometric structure on topological surfaces generalizing the complex structure. To define this so called higher complex structure we use the punctual Hilbert scheme of the plane. The moduli space of higher…
The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X.…
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…
Multi-robot assembly systems are becoming increasingly appealing in manufacturing due to their ability to automatically, flexibly, and quickly construct desired structural designs. However, effectively planning for these systems in a manner…
We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…
In this study, we delve into the discrete TC of surjective simplicial fibrations, aiming to unravel the interplay between topological complexity, discrete geometric structures, and computational efficiency. Moreover, we examine the…
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…
Sequential parametrized topological complexity is a numerical homotopy invariant of a fibration, which arose in the robot motion planning problem with external constraints. In this paper, we study sequential parametrized topological…