Redundant Robot Joint Acceleration Planning via Quadratic Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing robot control planning methods for redundant robots require complex logic processing and classification calculations, leading to low efficiency and inaccurate results when dealing with redundant joints.
Innovation Solution
A joint acceleration planning method using a quadratic programming approach, which involves receiving a joint acceleration planning request, obtaining optimization functions from a quadratic programming function library, and performing quadratic optimization to determine joint accelerations, thereby simplifying the planning process and improving accuracy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If existing robot control planning methods are used for redundant robots, then the robot can perform tasks with multiple degrees of freedom, but the control planning process becomes complicated with complex logic processing and classification calculations, resulting in low efficiency and difficulty in obtaining accurate results
Solution Approach 1:
The patent transforms the control planning problem from a complex logical classification task into a quadratic optimization problem by changing the mathematical parameters and formulation approach. Instead of using traditional inverse kinematics with complex branching logic for redundant joints, the patent formulates the problem as minimizing a quadratic cost function subject to constraints, which can be solved systematically using quadratic programming algorithms. This parameter transformation resolves the contradiction by maintaining redundant joints capability while eliminating the complexity of logic processing and classification calculations.
2Adaptability or versatility
If existing robot control planning methods are used for redundant robots, then the robot can achieve various tasks through coordination of multiple degrees of freedom, but the control planning efficiency becomes low due to complicated logic processing
Solution Approach 1:
The patent replaces the mechanical-like complex logical processing system with a mathematical optimization system. Instead of using traditional control planning methods that rely on intricate logic trees and classification calculations, the patent substitutes this with a quadratic programming framework that systematically handles task coordination through mathematical optimization. This substitution dramatically improves control planning efficiency while maintaining the ability to coordinate multiple degrees of freedom for various tasks.
3Adaptability or versatility
If existing robot control planning methods are used for redundant robots, then the robot can utilize additional joint parameters, but the accuracy of control planning results becomes difficult to obtain due to complex calculations
Solution Approach 1:
The patent incorporates feedback mechanisms through the quadratic optimization framework, where the cost function continuously evaluates the current joint configuration and provides feedback for adjustment. The optimization algorithm iteratively refines the solution by comparing the current state against the desired task requirements and constraints, ensuring accurate control planning results. This feedback-driven approach maintains joint configuration flexibility while systematically improving the accuracy of control planning by eliminating the uncertainty associated with complex logical calculations.
Data Source
AI summary
A joint acceleration planning method, a redundant robot using the same, and a computer readable storage medium are provided. The method includes: obtaining an optimization objective function, a joint acceleration inequation constraint function and a joint acceleration equation constraint function corresponding to the optimization target from a quadratic programming function library, where the optimization objective function is an objective function obtained based on the upper and lower limits of the optimization target and a Euclidean distance algorithm; and obtaining a joint acceleration planning result by performing a quadratic optimization solving on a joint acceleration of each of the target joints of the robot at time k according to the end Cartesian space speed at time k+1, the joint parameter set of the target joints of the robot at time k, the sampling period, the optimization objective function, the joint acceleration inequation constraint function, and the joint acceleration equation constraint function.


