M Farber, AK Paul - Topology and its Applications, 2022 - Elsevier
In this paper we develop a theory of sequential parametrized motion planning generalising the approach of parametrized motion planning, which was introduced recently in [3]. A …
M Farber, J Oprea - Topology and its Applications, 2019 - Elsevier
In this article we study the higher topological complexity TC r (X) in the case when X is an aspherical space, X= K (π, 1) and r≥ 2. We give a characterisation of TC r (K (π, 1)) in terms …
A Espinosa Baro, M Farber, S Mescher, J Oprea - Mathematische Annalen, 2024 - Springer
We generalize results from topological robotics on the topological complexity (TC) of aspherical spaces to sectional categories of fibrations inducing subgroup inclusions on the …
J González, B Gutiérrez, D Gutiérrez, A Lara - arXiv preprint arXiv …, 2015 - arxiv.org
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 …
M Farber, AK Paul - European Journal of Mathematics, 2024 - Springer
Autonomous motion of a system (robot) is controlled by a motion planning algorithm. A sequential parametrized motion planning algorithm works under variable external conditions …
J González, B Gutiérrez, A Guzmán, C Hidber… - …, 2015 - researchgate.net
The topological complexity (TC) of the complement of a complex hyperplane arrangement, which is either linear generic or else affine in general position, has been computed by …
J González, M Grant… - The Quarterly Journal of …, 2019 - academic.oup.com
We develop a theory of generalized Hopf invariants in the setting of sectional category. In particular, we show how Hopf invariants for a product of fibrations can be identified as …
CA Ipanaque Zapata, J González - … Mathematics, Algorithms and …, 2020 - World Scientific
We present optimal motion planning algorithms which can be used in designing practical systems controlling objects moving in Euclidean space without collisions. Our algorithms are …