A task-space receding-horizon controller that uses a short contact-consistent rollout to generate a terminal kinematic reference satisfying internal non-penetration constraints, then computes only the first input of a smooth minimum-acceleration transition toward that reference.
Abstract
Real-time collision avoidance for robotic manipulators requires fast reactions to unexpected obstacle motion and lookahead to avoid becoming trapped by near-future constraints. Full model predictive control can provide this foresight, but its online cost may grow quickly with horizon length, model fidelity, and the number of active geometric constraints. Conversely, horizon-free reactive methods are computationally efficient but can be short-sighted in dynamic clutter. We present a task-space receding-horizon controller that uses a short contact-consistent rollout to generate a terminal kinematic reference satisfying internal non-penetration constraints, then computes only the first input of a smooth minimum-acceleration transition toward that reference. Starting from a closed-loop inverse-kinematics regulation law, the rollout is performed with an iterative dynamics solver operating on inflated convex robot and obstacle geometries, so that robot-obstacle contacts, dynamic obstacle motion, and self-collisions can shape the terminal reference without requiring full constrained trajectory optimization. We analyze the contact-inactive closed loop and show local exponential task-space regulation under standard regularity assumptions. For contacts activated inside the rollout, we characterize the corresponding discrete updates and bound the effect of moving obstacles on regular operating sets. Simulations on a 40-DOF multi-chain system show that intermediate horizons balance anticipation, responsiveness, and computational cost. Hardware experiments on a 6-DOF platform demonstrate consistent sim-to-real behavior without accurate inertial parameter estimation, and comparisons against dynamic optimization fabrics and model predictive control (MPC) baselines show improved success rates in dynamic clutter while preserving solve times compatible with real-time execution in the tested regimes.
The Safe-Koopman Framework is introduced, an operator-theoretic motion planning method that generalizes obstacle-free demonstrations to planar planning tasks with obstacles and avoids collisions observed in the unconstrained Koopman baseline.
Xu-Chen Liu, Rui-Qi Ke, Yan-Dong Wang et al.· IEEE Transactions on Neural...· 0 citations
A dual-layered computational framework for the robust trajectory planning and active stabilization of a robotic manipulator transporting a non-fixed payload and an active sliding control strategy based on Nonlinear Model Predictive Control are presented.
Sara Federico, Ciro Natale, Fabio Ruggiero et al.· Machines· 0 citations
This work presents an adaptive formation and collision avoidance framework for differential-drive multi-robot systems. The strategy is based on a deformable virtual structure for planning, control barrier functions for safety, and a decentralized model predictive control to drive robot motion. The virtual structure act...
C. Canseco, H. Castañeda· 2026 IEEE/ASME International...· 0 citations
Simulation results for a three-UAV swarm in a cluttered environment demonstrate that the proposed distributed NMPC-based trajectory planning method can generate dynamically feasible and collision-free trajectories, while enabling the swarm to reach the assigned target positions and preserve the desired formation within...
Ying-Ting Cui, Tong-Xin Zeng, Bin Li· Drones· 0 citations
This study proposes a novel real-time trajectory planning framework designed to address the complex navigation challenges of collaborative robots operating in shared workspaces. The developed framework effectively integrates Model Predictive Path Integral (MPPI) control with Artificial Potential Field (APF) mechanisms...
Nezih Bora Yavas, Zafer Bingul· 2026 IEEE/ASME International...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.