Trajectory Planning for Kinematically Redundant Systems via a B-Spline Based Optimis0061tion Approach

The combination of highly dynamic systems with a limited work envelope, with a less dynamic system which has a larger working envelope, promises to combine the advantages of both systems while eliminating the disadvantages. Due to the created kinematic redundancy it is not trivial to generate trajectories that make use of both systems, while considering limits and allowing for parallel motion. There are several approaches to creating trajectories for such systems. One of which is to formulate an optimisation problem that directly considers the stroke and dynamic limits of each axis to plan trajectories. However, the dimension of the resulting optimisation problems can quickly make this approach infeasible, as they result in long computation times. The objective of this contribution is to develop an optimisation based approach for trajectory planning of redundant systems, which scales well with the problem size. Furthermore, the approach aims at avoiding tunable parameters which can not be physically linked to the machine or the process. The primary method of achieving that objective is the incorporation of b-spline functions into the optimisation problem. These represent the position, velocity, acceleration and jerk of each axis over time. By only having to solve the optimisation problem for the b-spline coefficients, the dimension of the problem is reduced without sacrificing temporal resolution. Constraints are formulated to ensure that axis bounds are respected and an objective function is designed to minimise the jerk of the base axes. In the presented non-redundant test case, the optimisation approach generated valid trajectories comparable to those generated by the TwinCAT CNC kernel, confirming the plausibility of the approach. For the redundant system, the algorithm effectively resolved the kinematic redundancy by generating synchronised trajectories that respected the dynamic constraints of both systems.

Authors

Institutions

Publication Details

Published
2025-06-24
DOI
https://doi.org/10.23919/ecc65951.2025.11187290
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Trajectory Planning for Kinematically Redundant Systems via a B-Spline Based Optimis0061tion Approach

Alexander Verl, Daniel Kurth
Robotic Path Planning Algorithms
article

Trajectory Planning for Kinematically Redundant Systems via a B-Spline Based Optimis0061tion Approach

Alexander Verl, Daniel Kurth
article en

Abstract

The combination of highly dynamic systems with a limited work envelope, with a less dynamic system which has a larger working envelope, promises to combine the advantages of both systems while eliminating the disadvantages. Due to the created kinematic redundancy it is not trivial to generate trajectories that make use of both systems, while considering limits and allowing for parallel motion. There are several approaches to creating trajectories for such systems. One of which is to formulate an optimisation problem that directly considers the stroke and dynamic limits of each axis to plan trajectories. However, the dimension of the resulting optimisation problems can quickly make this approach infeasible, as they result in long computation times. The objective of this contribution is to develop an optimisation based approach for trajectory planning of redundant systems, which scales well with the problem size. Furthermore, the approach aims at avoiding tunable parameters which can not be physically linked to the machine or the process. The primary method of achieving that objective is the incorporation of b-spline functions into the optimisation problem. These represent the position, velocity, acceleration and jerk of each axis over time. By only having to solve the optimisation problem for the b-spline coefficients, the dimension of the problem is reduced without sacrificing temporal resolution. Constraints are formulated to ensure that axis bounds are respected and an objective function is designed to minimise the jerk of the base axes. In the presented non-redundant test case, the optimisation approach generated valid trajectories comparable to those generated by the TwinCAT CNC kernel, confirming the plausibility of the approach. For the redundant system, the algorithm effectively resolved the kinematic redundancy by generating synchronised trajectories that respected the dynamic constraints of both systems.

University of Stuttgart (DE)
Openalex Percentile: Top 71%
Robotic Path Planning Algorithms
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.