Sequential Parametrized Motion Planning and its Complexity

Michael Farber; Amit Kumar Paul

Home/Archive/arXiv

arXiv · 2205.08453

Sequential Parametrized Motion Planning and its Complexity

Michael Farber·Amit Kumar Paul

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we develop theory of sequential parametrized motion planning which generalises the approach of parametrized motion planning, which was introduced recently in [3]. A sequential parametrized motion planning algorithm produced a motion of the system which is required to visit a prescribed sequence of states, in certain order, at specified moments of time. The sequential parametrized algorithms are universal as the external conditions are not fixed in advance but rather constitute part of the input of the algorithm. The second part of this article consists of a detailed analysis of the sequential parametrized topological complexity of the Fadell - Neuwirth fibration. In the language of robotics, sections of the Fadell - Neuwitrh fibration are algorithms for moving multiple robots avoiding collisions with other robots and with obstacles in Euclidean space. In the last section of the paper we introduce the new notion of TC-generating function of a fibration, examine examples and raise some general questions about its analytic properties.

Explore related subjects

math.AT

Keep this discovery

BibTeX RIS

Michael Farber, Amit Kumar Paul. 2022-05-17. Sequential Parametrized Motion Planning and its Complexity. https://arxiv.org/abs/2205.08453

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Homogeneous Milnor fibers and Kato--Matsumoto bounds via simplicial multiwedges

For every $n\geq 3$ and $s\geq 2$, we construct a homogeneous polynomial of degree $n(n+1)/2$ whose Milnor fiber is exactly $2s$-connected and whose rational cohomology contains a strictly defined nontrivial $n$-fold Massey product on classes of degree $2s+1$, implying that the Milnor fiber is non-formal, while attaining the Kato--Matsumoto connectivity bound. Our construction is based on the simplicial multiwedges of the nerve complexes of simple polytopes introduced by Limonchenko, combined with Suciu's realization of weighted homogeneous Milnor fibers. We thereby answer two problems posed by Suciu.

math.AT↗

arXiv2026

The homotopy types of directed path and trace spaces

We construct a saturated directed space with a Hausdorff $\Delta$-generated underlying space and two distinct points such that the trace space between them is homeomorphic to a square, whereas the directed path space has a nontrivial fundamental group. In particular, the canonical quotient map is not a weak homotopy equivalence. The same conclusion holds for regular directed paths modulo increasing homeomorphisms.

math.AT↗

arXiv2026

Moduli spaces of geometric functorial field theories

We develop tools to compute moduli spaces of geometric functorial field theories as mapping spaces of equivariant simplicial presheaves. Given a d-dimensional geometric structure F, presented as a presheaf on the site of smooth families of d-manifolds, we define its Cartesian realization, which is an O(d)-equivariant simplicial presheaf on the site of Cartesian spaces. We use Cartesian realizations to present the moduli space of functorial field theories with geometric structure F as a mapping space between O(d)-equivariant simplicial presheaves. In a companion paper, we use this result to compute the moduli space of smooth one-dimensional oriented Riemannian functorial field theories valued in an arbitrary smooth symmetric monoidal infinity-category.

math.AT↗