Nov 2026· IEEE Robotics and Automation Letters· Vol 11, pp. 12568-12575· 0 citations· 30 references
TL;DR
BLAST is proposed, a biconvex, limit-aware path-and-timing optimization framework that couples B-spline collision-free path optimization with velocity and acceleration profiling under explicit dynamical and operational constraints and retains computational tractability while incorporating actuator limits and system dynamics directly into the optimization.
Abstract
Planning fast and dynamically feasible motions within prescribed safe regions in $C$-space is a critical requirement for many dynamical systems, including manipulators and unmanned aerial vehicles, especially when operating near their performance limits. Existing planning pipelines often compute a collision-free geometric path and subsequently time-parameterize it under kinematic limits, while neglecting the effects of the full system dynamics. As a result, the generated motions may require excessive actuator effort, increase mechanical and thermal loading during execution, and even lead to torque-limit violations. In this work, we propose BLAST, a biconvex, limit-aware path-and-timing optimization framework that couples B-spline collision-free path optimization with velocity and acceleration profiling under explicit dynamical and operational constraints. By exploiting the resulting problem structure, BLAST retains computational tractability while incorporating actuator limits and system dynamics directly into the optimization. We evaluate the proposed approach against recent state-of-the-art methods across point-mass, AAV, and manipulators, including a full 7-DoF setup. Our comprehensive results demonstrate that our anytime framework explicitly accounts for system constraints and reduces actuation energy, uses fewer control points, and substantially decreases torque-limit violations during execution.
We present FAVOR (Free-floating Arm Velocity Optimization with Recursive Sensitivities), a planner for collision-free reaching, tracking, and prescribed-time pre-grasp interception on an unactuated spacecraft. It optimizes Bezier joint-velocity curves with linear velocity, acceleration, and continuity constraints. Deci...
Duo Zhang, Zhi-Zhuo Zhang, Xiao-Li Bai et al.· 0 citations
This paper presents a fast adaptive planning method for tractor-trailer systems that resolves parameter uncertainties by adapting a nominal trajectory to true parameters via iLQR, eliminating the need to store MPs for various configurations.
Tian-Yu Zhou, Ye-Wei Wang, Akhil Umat et al.· 2026 IEEE 22nd International...· 0 citations
The effectiveness of the proposed framework is validated through a representative industrial case study featuring both natively redundant and non-redundant robotic platforms, demonstrating improved computational efficiency, enhanced task reliability, and robust performance in highly constrained environments.
Fabio Mastromarino, Raffaele Carli, N. Longo et al.· 2026 IEEE 22nd International...· 0 citations
This work explores a new axis of vectorization built upon reparameterizing the planning space through analytic IK, and shows that the planner can synthesize plans in microseconds to milliseconds for high dimensional systems, with complex constraints, up to 10x faster than the current state-of-the-art.
S. R. Iyer, Thomas Cohn, Zachary Kingston· 0 citations
A geometry-driven framework for certifying infeasibility through an explicit resolution-dependent analysis of configuration space topology is presented, and a parallel frontier-expansion algorithm that exploits GPU acceleration for efficient simplicial reconstruction in high-dimensional spaces is developed.
Autonomous navigation in dynamic environments requires computing spatiotemporal trajectories that satisfy non-holonomic motion constraints. When the trajectories of the moving obstacles are predictable or known, a promising approach is to rely on the combination of state lattices constructed from precomputed feasible m...
Marat Agranovskiy, K. Yakovlev· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.