Second-Order Multidimensional Guiding Vector Field for Parametric Path-Following Under Holonomic Constraints

Autonomous path-following in higher-dimensional workspaces is a crucial yet challenging task for modern industrial applications. However, traditional geometric path-followers fail to accommodate robots requiring actuator control via acceleration-level commands. This paper proposes a lightweight guiding vector field (GVF) framework that commands second-order dynamics to support holonomic path-following over the Special Euclidean group $\mathrm{SE}(n).$ Defined as a map from the first to the second tangent bundle of this configuration space, the GVF balances four decoupled components: an attractive acceleration field, a skew-projected heading field, a feedforward-based centripetal acceleration field, and a kinematically-modeled tangential drive field. Using techniques such as smooth mollifiers to extend the closest point projection, the paper also tackles the GVF-based path-following of parametrically-defined curves, another problem that has traditionally proved difficult to solve. Through rigorous mathematical analysis, this paper proves that the algorithm retains the geometric guarantees of traditional GVF algorithms, such as smoothness, path invariance, and stable asymptotic convergence to the path. This architecture serves as the basis of the Pedro Pathing motion-planning and path-following library.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-06-17
DOI
https://doi.org/10.5281/zenodo.20725319
Primary Topic
Advanced Numerical Analysis Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Second-Order Multidimensional Guiding Vector Field for Parametric Path-Following Under Holonomic Constraints

Baron Henderson, Havish Sripada
Zenodo (CERN European Organization for Nuclear Research)
Advanced Numerical Analysis Techniques
preprint

Second-Order Multidimensional Guiding Vector Field for Parametric Path-Following Under Holonomic Constraints

Baron Henderson, Havish Sripada
preprint en

Abstract

Autonomous path-following in higher-dimensional workspaces is a crucial yet challenging task for modern industrial applications. However, traditional geometric path-followers fail to accommodate robots requiring actuator control via acceleration-level commands. This paper proposes a lightweight guiding vector field (GVF) framework that commands second-order dynamics to support holonomic path-following over the Special Euclidean group $\mathrm{SE}(n).$ Defined as a map from the first to the second tangent bundle of this configuration space, the GVF balances four decoupled components: an attractive acceleration field, a skew-projected heading field, a feedforward-based centripetal acceleration field, and a kinematically-modeled tangential drive field. Using techniques such as smooth mollifiers to extend the closest point projection, the paper also tackles the GVF-based path-following of parametrically-defined curves, another problem that has traditionally proved difficult to solve. Through rigorous mathematical analysis, this paper proves that the algorithm retains the geometric guarantees of traditional GVF algorithms, such as smoothness, path invariance, and stable asymptotic convergence to the path. This architecture serves as the basis of the Pedro Pathing motion-planning and path-following library.

Zenodo (CERN European Organization for Nuclear Research)
Hospital San Pedro (ES)
Sustainable cities and communities
Advanced Numerical Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.