Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

În afara temei aiqbench

În afara temei aiqbench

Această știre a fost preluată de la o sursă pe care o urmărim, dar nu ține de domeniul AI sau cuantic, așa că nu există o perspectivă aiqbench pentru ea.

Decoupling Physical Speed from Path Parameterization in Singularity-Free Guiding Vector Fields

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2609.19726v1 Announce Type: new Abstract: The existing singularity-free guiding vector field (SF-GVF) with an additional virtual coordinate can eliminate singular points (i.e., points where the vector field vanishes) inherent in conventional GVFs and guarantee global convergence of robot trajectories to closed and self-intersecting desired paths. However, the desired speed given by the GVF along the desired path in the original lower-dimensional space cannot be arbitrarily specified but depends on path parameterizations. One possible workaround is to partially normalize the physical projection of the SF-GVF and assign a user-designed speed. However, we show that this workaround may introduce new singularities since the normalization denominator can become zero. To address this issue, we propose a new SF-GVF with prescribed physical speed (PPS). The integral curves of the new SF-GVF converge exponentially to the desired path from any initial condition in the higher-dimensional space (including virtual dimension); more importantly, the robot's physical speed converges to the PPS, while the path-error dynamics remain invariant under regular reparameterizations of the desired path. We further develop a saturated acceleration control law for second-order kinematic models. Finally, comparative simulations and 3D path-following experiments with a quadrotor under different PPS profiles validate the theoretical results and demonstrate the effectiveness of the proposed approach.

Abstract:The existing singularity-free guiding vector field (SF-GVF) with an additional virtual coordinate can eliminate singular points (i.e., points where the vector field vanishes) inherent in conventional GVFs and guarantee global convergence of robot trajectories to closed and self-intersecting desired paths. However, the desired speed given by the GVF along the desired path in the original lower-dimensional space cannot be arbitrarily specified but depends on path parameterizations. One possible workaround is to partially normalize the physical projection of the SF-GVF and assign a user-designed speed. However, we show that this workaround may introduce new singularities since the normalization denominator can become zero. To address this issue, we propose a new SF-GVF with prescribed physical speed (PPS). The integral curves of the new SF-GVF converge exponentially to the desired path from any initial condition in the higher-dimensional space (including virtual dimension); more importantly, the robot's physical speed converges to the PPS, while the path-error dynamics remain invariant under regular reparameterizations of the desired path. We further develop a saturated acceleration control law for second-order kinematic models. Finally, comparative simulations and 3D path-following experiments with a quadrotor under different PPS profiles validate the theoretical results and demonstrate the effectiveness of the proposed approach.

Robotics (cs.RO)

arXiv:2609.19726 [cs.RO]

(or arXiv:2609.19726v1 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2609.19726 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 293 cuvinte

Subiecte conexe