Related papers: Topological complexity of a map
We introduce the concept of injective category number $\text{IC}(f)$ for a continuous map $f\colon X\to~Y$, and present fundamental results concerning this numerical invariant. The value $\text{IC}(f)$ quantifies the \aspas{complexity} or…
This work serves as an opening and basis of an ongoing program investigating topological and geometric aspects of the moduli space of smooth fiberings on a manifold. The present paper focuses on the algebraic and differential topology of…
How hard is it to program $n$ robots to move about a long narrow aisle such that only $w$ of them can fit across the width of the aisle? In this paper, we answer that question by calculating the topological complexity of $\text{conf}(n,w)$,…
Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…
In this article we study the higher topological complexity ${\sf TC}_r(X)$ in the case when $X$ is an aspherical space, $X=K(\pi, 1)$ and $r\ge 2$. We give a characterisation of ${\sf TC}_r(K(\pi, 1))$ in terms of classifying spaces for…
Embodied intelligence has witnessed remarkable progress in recent years, driven by advances in computer vision, natural language processing, and the rise of large-scale multimodal models. Among its core challenges, robot manipulation stands…
The Lusternik-Schnirelmann category $cat(X)$ is a homotopy invariant which is a numerical bound on the number of critical points of a smooth function on a manifold. Another similar invariant is the topological complexity $TC(X)$ (a la…
The increased availability of interactive maps on the Internet and on personal mobile devices has created new challenges in computational cartography and, in particular, for label placement in maps. Operations like rotation, zoom, and…
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…
When doing representation learning on data that lives on a known non-trivial manifold embedded in high dimensional space, it is natural to desire the encoder to be homeomorphic when restricted to the manifold, so that it is bijective and…
Let $f : X\to X$ be a dominating meromorphic map on a compact K\"ahler manifold $X$ of dimension $k$. We extend the notion of topological entropy $h^l_{\mathrm{top}}(f)$ for the action of $f$ on (local) analytic sets of dimension $0\leq l…
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic second-order formula over evolving subgraphs of a fixed maximal…
Soft robotics has emerged as the standard solution for grasping deformable objects, and has proven invaluable for mobile robotic exploration in extreme environments. However, despite this growth, there are no widely adopted computational…
In the formation control problem for autonomous robots a distributed control law steers the robots to the desired target formation. A local stability result of the target formation can be derived by methods of linearization and center…
Let C be a closed subset of a topological space X, and let f : C --> X. Let us assume that f is continuous and f(x) lies in C for every x in the boundary of C. How many times can one iterate f? This paper provides estimates on the number of…
Energy-minimizing constraint maps are a natural extension of the obstacle problem within a vectorial framework. Due to inherent topological constraints, these maps manifest a diverse structure that includes singularities similar to harmonic…
Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…
Solving optimization tasks based on functions and losses with a topological flavor is a very active, growing field of research in data science and Topological Data Analysis, with applications in non-convex optimization, statistics and…
Let f be a dominant meromorphic self-map on a compact Kaehler manifold X which preserves a fibration given by a meromorphic map from X to a compact Kaehler manifold Y. We compute the dynamical degrees of f in term of its dynamical degrees…
The capability of autonomous exploration in complex, unknown environments is important in many robotic applications. While recent research on autonomous exploration have achieved much progress, there are still limitations, e.g., existing…