Bridging Discrete Planning and Continuous Execution for Redundant Robot
Organizations: Thrust of Artificial Intelligence, The Hong Kong University of Science and Technology (Guangzhou), Guangzhou 511400, China
Abstract
Voxel-grid reinforcement learning is widely adopted for path planning in redundant manipulators due to its simplicity and reproducibility. However, direct execution through point-wise numerical inverse kinematics on 7-DoF arms often yields step-size jitter, abrupt joint transitions, and instability near singular configurations. This work proposes a bridging framework between discrete planning and continuous execution without modifying the discrete planner itself. On the planning side, step-normalized 26-neighbor Cartesian actions and a geometric tie-breaking mechanism are introduced to suppress unnecessary turns and eliminate step-size oscillations. On the execution side, a task-priority damped least-squares (TP-DLS) inverse kinematics layer is implemented. This layer treats end-effector position as a primary task, while posture and joint centering are handled as subordinate tasks projected into the null space, combined with trust-region clipping and joint velocity constraints. On a 7-DoF manipulator in random sparse, medium, and dense environments, this bridge raises planning success in dense scenes from about 0.58 to 1.00, shortens representative path length from roughly 1.53 m to 1.10 m, and while keeping end-effector error below 1 mm, reduces peak joint accelerations by over an order of magnitude, substantially improving the continuous execution quality of voxel-based RL paths on redundant manipulators.
Figures & tables
| Density | Algorithm | Success rate | Length | Turns | MinClearance | Steps |
|---|---|---|---|---|---|---|
| Sparse | Original | 0.68 | 192.572 | 1862.9 | 0.213 | 2126.72 |
| Sparse | NoNorm | 0.6 | 283.35 | 1451.42 | 0.213 | 2563.84 |
| Sparse | Improved | 1.0 | 0.602 | 4.26 | 0.216 | 7.02 |
| Medium | Original | 0.68 | 168.516 | 1681.98 | 0.157 | 1926.16 |
| Medium | NoNorm | 0.7 | 195.7 | 1122.5 | 0.152 | 1725.12 |
| Medium | Improved | 1.0 | 0.598 | 3.98 | 0.165 | 6.98 |
| Density | Solver | Success_rate | DQ_95 | MaxVel | MaxAcc | JointMargin | Backtracks | |
|---|---|---|---|---|---|---|---|---|
| Sparse | Num-IK | 1.0 | 0.8211 | 141.8634 | 12701.6607 | 0.0053 | 7.18 | 0.7231 |
| Sparse | TP-DLS | 1.0 | 0.0113 | 84.2102 | 3943.5816 | 0.0126 | 19.44 | |
| Medium | Num-IK | 1.0 | 0.6415 | 190.3101 | 16793.8613 | 0.0045 | 6.5 | |
| Medium | TP-DLS | 1.0 | 0.0113 | 79.747 | 3860.0759 | 0.0112 | 37.6 | |
| Dense | Num-IK | 1.0 | 0.937 | 175.8501 | 15659.236 | 0.0002 | 5.48 | |
| Dense | TP-DLS | 1.0 | 0.0088 | 91.651 | 4438.005 | 0.014 | 22.16 |
Robot Motion Planning
Robot motion planning finds safe, feasible paths and trajectories for robots moving through constrained, changing environments.
See all 271 papers