Related papers: Approaches to critical point theory via sequential…
Parametrized motion planning algorithms \cite{CFW} have a high degree of universality and flexibility; they generate the motion of a robotic system under a variety of external conditions. The latter are viewed as parameters and constitute…
Autonomous motion of a system (robot) is controlled by a motion planning algorithm. A sequential parametrized motion planning algorithm \cite{FP22} works under variable external conditions and generates continuous motions of the system to…
The topology of the causal boundary for standard static spacetimes--spacetimes time-invariantly conformal to a metric product of the Lorentz line and a Riemannian manifold--is studied in depth. As this is given in terms of a set of…
We prove multiplicity theorems for Keller $ C_c^1 $-functionals on Frechet spaces and Finsler manifolds which are invariant under the action of a discrete subgroup. For such functionals, we evaluate the minimal number of critical points by…
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…
We introduce the concept of parametrized homotopic distance, extending the classical notion of homotopic distance to the fibrewise setting. We establish its correspondence with the fibrewise sectional category of a specific fibrewise…
In this paper, we introduce the n-th discrete topological complexity and study its properties such as its relation with simplicial Lusternik-Schnirelmann category and how the higher dimensions of discrete topological complexity relate with…
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.…
The LS-category of a topological space is a numerical homotopy invariant, introduced originally in a course on the global calculus of variations by Lyusternik and Schnirelmann, to estimate the number of critical points of a smooth function.…
Topological complexity $\TC{B}$ of a space $B$ is introduced by M. Farber to measure how much complex the space is, which is first considered on a configuration space of a motion planning of a robot arm. We also consider a stronger version…
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 determine the Lusternik-Schnirelmann category of the projective product spaces introduced by D. Davis. We also obtained an upper bound for the topological complexity of these spaces, which improves the estimate given by J. Gonz\'alez, M.…
Let $X$ be a $G$-space. In this paper, we introduce the notion of sectional category with respect to $G$. As a result, we obtain $G$-homotopy invariants: the LS category with respect to $G$, the sequential topological complexity with…
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$…
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…
Introduced by Seifert and Threlfall, cylindrical neighborhoods of isolated critical points of smooth functions is an essential tool in the Lusternik- Schnirelmann theory. We conjecture that every isolated critical point of a smooth function…
We introduce and study a parametrized analogue of the directed topological complexity, originally developed by Goubault, Farber, and Sagnier. We establish the fibrewise basic dihomotopy invariance of directed parametrized topological…
In this article we study a homotopy invariant cat(X,B,\xi) on a pair of finite CW complexes with respect to a continuous closed 1-form. This is a generalisation of a Lusternik-Schnirelmann category developed by Farber, studying the topology…
Parametrized motion planning algorithms have high degree of flexibility and universality, they can work under a variety of external conditions, which are viewed as parameters and form part of the input of the algorithm. In this paper we…
Parametrized topological complexity is a homotopy invariant that represents the degree of instability of motion planning problem that involves external constraints. We consider the parametrized topological complexity in the case of…