相关论文: Sequential motion planning in connected sums of re…
Starting from Borel's description of the mod-2 cohomology of real flag manifolds, we give a minimal presentation of the cohomology ring for semi complete flag manifolds $F_{k,m}:=F(1,\ldots,1,m)$ where $1$ is repeated $k$ times. The…
Using the notion of contiguity of simplicial maps, we adapt Farber's topological complexity to the realm of simplicial complexes. We show that, for a finite simplicial complex $K$, our discretized concept recovers the topological complexity…
A classical result asserts that the complex projective plane modulo complex conjugation is the 4-dimensional sphere. We generalize this result in two directions by considering the projective planes over the normed real division algebras and…
In this paper we study a notion of topological complexity for the motion planning problem. The topological complexity is a number which measures discontinuity of the process of motion planning in the configuration space X. More precisely,…
Given a compact metric space $X$, we associate to it an inverse sequence of finite $T_0$ topological spaces. The inverse limit of this inverse sequence contains a homeomorphic copy of $X$ that is a strong deformation retract. We provide a…
Inversion of various inclusions, that characterize continuity in topological spaces, results in numerous variants of quotient and perfect maps. In the framework of convergences, the said inclusions are no longer equivalent, and each of them…
We consider rationally connected complex projective manifolds M and show that their loop spaces--infinite dimensional complex manifolds--have properties similar to those of M. Furthermore, we give a finite dimensional application concerning…
We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of $n$ hyperplanes in an $r$-dimensional linear space is min$\{n+1,2r\}$.
It has been observed that the very important motion planning problem of robotics mathematically speaking boils down to the problem of finding a section to the path-space fibration, raising the notion of topological complexity, as introduced…
Topological complexity is a homotopy invariant that measures the minimal number of continuous rules required for motion planning in a space. In this work, we introduce persistent analogs of topological complexity and its cohomological lower…
There are two rather distinct approaches to Morse theory nowadays: smooth and discrete. We propose to study a real valued function by assembling all associated sections in a topological category. From this point of view, Reeb functions on…
We study the topological complexity of work maps with respect to some subspaces of the configuration space and a workspace considered as the target set of the motion of robots. The motivation is to optimize and reduce the number of motion…
In this paper we have shown that a double sequence in a topological space satisfies certain conditions which in turn are capable to generate a topology on a non empty set. Also we have used the idea of I-convergence of double sequences to…
In the directed setting, the spaces of directed paths between fixed initial and terminal points are the defining feature for distinguishing different directed spaces. The simplest case is when the space of directed paths is homotopy…
The thesis presents the subject of synthetic topology, especially with relation to metric spaces. A model of synthetic topology is a categorical model in which objects possess an intrinsic topology in a suitable sense, and all morphisms are…
When planning motions in a configuration space that has underlying symmetries (e.g. when manipulating one or multiple symmetric objects), the ideal planning algorithm should take advantage of those symmetries to produce shorter…
The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configuration space of a mechanical system. In this paper we…
This is the first of the two articles where we determine the higher smooth surgery structure sets of complex projective spaces (up to some extension problems) and the forgetful map to their topological versions in low dimensions. In this…
We introduce the geodesic complexity of a metric space, inspired by the topological complexity of a topological space. Both of them are numerical invariants, but, while the TC only depends on the homotopy type, the GC is an invariant under…
Motion planning seeks a collision-free path in a configuration space (C-space), representing all possible robot configurations in the environment. As it is challenging to construct a C-space explicitly for a high-dimensional robot, we…