Related papers: Linear motion planning with controlled collisions …

In this paper we study paramertized motion planning algorithms which provide universal and flexible solutions to diverse motion planning problems. Such algorithms are intended to function under a variety of external conditions which are…

We define the LS-category cat_g by means of covers of a space by general subsets, and show that this definition coincides with the classical Lusternik-Schnirelmann category for compact metric ANR spaces. We apply this result to give short…

We study a specific line arrangement obtained from a generic $2$-section of the braid arrangement, and compute the fundamental group of its complement via braid monodromy. We show that the resulting presentation of the fundamental group…

Milnor manifolds are a class of certain codimension-$1$ submanifolds of the product of projective spaces. In this paper, we study the LS-category and topological complexity of these manifolds. We determine the exact value of the LS-category…

The space of configurations of n ordered points in the plane serves as a classifying space for the pure braid group PB_n. Elements of Thompson's group F admit a model similar to braids, except instead of braiding the strands split and…

We study higher analogues of effective and effectual topological complexity of spaces equipped with a group action. These are $G$-homotopy invariant and are motivated by the (higher) motion planning problem of $G$-spaces for which their…

In robotics, a topological theory of motion planning was initiated by M. Farber. The multitasking motion planning problem is new and its theoretical part via topological complexity has hardly been developed, but the concrete implementations…

Planning problems are hard, motion planning, for example, isPSPACE-hard. Such problems are even more difficult in the presence of uncertainty. Although, Markov Decision Processes (MDPs) provide a formal framework for such problems, finding…

We develop the properties of the $n$-th sequential topological complexity $TC_n$, a homotopy invariant introduced by the third author as an extension of Farber's topological model for studying the complexity of motion planning algorithms in…

We present some results supporting the Iwase-Sakai conjecture about coincidence of the topological complexity $TC(X)$ and monoidal topological complexity $TC^M(X)$. Using these results we provide lower and upper bounds for the topological…

We are trying to look over the Lusternik-Schnirelmann theory (L-S theory, for short) and the Topological Complexity (TC, for short) as a natural extension of the L-S theory. In particular, we focus on the impact of the ideas originated from…

Let $T(n)$ denote the maximum number of unit distances that a set of $n$ points in the Euclidean plane $\mathbb{R}^2$ can determine with the additional condition that the distinct unit length directions determined by the configuration must…

Task and motion planning under Signal Temporal Logic constraints is known to be NP-hard. A common class of approaches formulates these hybrid problems, which involve discrete task scheduling and continuous motion planning, as mixed-integer…

This paper investigates continuous-time motion planning under Signal Temporal Logic (STL) specifications. The goal is to generate smooth robot trajectories that satisfy high-level logical and timing requirements while respecting low-level…

We systematically construct a distinct class of complex potentials including parity-time ($\cal PT$) symmetric potentials for the stationary Schr\"odinger equation by using the soliton and periodic solutions of the four integrable real…

Lattice-based planning techniques simplify the motion planning problem for autonomous vehicles by limiting available motions to a pre-computed set of primitives. These primitives are then combined online to generate more complex maneuvers.…

Weighted cup-length calculations in singular cohomology led Farber and Grant in 2008 to general lower bounds for the topological complexity of lens spaces. We replace singular cohomology by K-theory, and weighted cup-length arguments by…

We give a complete classification of homomorphisms from the commutator subgroup of the braid group on $n$ strands to the braid group on $n$ strands when $n$ is at least 7. In particular, we show that each nontrivial homomorphism extends to…

We show that the Kazhdan-Lusztig category $KL_k$ of level-$k$ finite-length modules with highest-weight composition factors for the affine Lie superalgebra $\widehat{\mathfrak{gl}(1|1)}$ has vertex algebraic braided tensor supercategory…

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…