The results indicate that inverse kinematics problems characterized by one-to-many mappings cannot be effectively treated as deterministic regression tasks and demonstrate that informed neural initialization combined with numerical optimization constitutes an effective and computationally efficient solution strategy.
Abstract
This paper investigates the use of deep neural networks (DNNs) for solving inverse kinematics problems exhibiting multiple valid joint-space solutions. A synthetic dataset is generated from the forward kinematics of the ABB IRB120 manipulator, with end-effector orientation represented using unit quaternions, and a DNN is trained to approximate the relationship between Cartesian pose and joint configuration under three scenarios: (i) full joint space, (ii) constrained joint space with fixed $q_{6}$ , and (iii) a hybrid approach combining neural inference with nonlinear optimization. The results show that, in the full joint space, the inverse kinematics mapping is inherently multi-valued, preventing the DNN from learning a consistent and physically realizable inverse mapping through deterministic regression and leading to large prediction errors. In contrast, constraining $q_{6}$ reduces the ambiguity present in the training dataset and improves learning stability at the cost of restricting the solution space. The hybrid formulation mitigates these limitations by using the DNN to provide an informed initial estimate for a nonlinear least-squares solver operating in the full joint space. The proposed Hybrid-DNN formulation achieves a mean position error of 1.406 mm, a mean orientation error of 0.900°, and a success rate of 94.2%, where success is defined as simultaneously achieving position and orientation errors below 5 mm and 2°, respectively. Although slightly less accurate than the Conventional-Multistart-10 baseline, it achieves near-equivalent solution quality while reducing the average number of function evaluations and execution time by approximately 95.1% and 82.5%, respectively. These results indicate that inverse kinematics problems characterized by one-to-many mappings cannot be effectively treated as deterministic regression tasks and demonstrate that informed neural initialization combined with numerical optimization constitutes an effective and computationally efficient solution strategy.
We introduce Learned Optimal Inverse Kinematics (LOInK), a method to generate approximately optimal solutions to an inverse kinematics problem. When trained on data consisting of sampled configurations and associated task variables and a given cost function, LOInK learns a bi-Lipschitz invertible mapping from configura...
Michael Somerfield, Damian Abood, Rui-Gang Wang et al.· 0 citations
Self-motion manifold (SMM) characterizes the geometric structure of the infinite inverse kinematic solutions set of a redundant manipulator at a fixed end-effector pose, and its efficient recovery underpins feasible and global optimal motion planning. Existing methods such as null-space continuation and learning-based...
MorphIK is a flow-matching model that solves inverse kinematics for revolute-joint-based kinematic chains it has never seen during training, and allows learning and generalizing neural inverse kinematics for a multitude of known and unknown robots.
Lennart Clasmeier, Jan-Gerrit Habekost, C. Weber et al.· 0 citations
Results establish that the empirical residual minimization is a mathematically principled approach to solving parametric PDE-constrained optimal control problems.
Nonlinear model predictive control (NMPC) can be applied to large nonlinear systems with complex objectives while enforcing constraints, but the cost of solving the underlying optimization problems limits real-time application for systems with fast dynamics or many states. Neural networks can reduce this online cost by...
A Movement Primitive learning algorithm based on Gaussian Processes, combined with real-time zero-shot adaptation through Pathwise Conditioning, which encapsulates the predictive uncertainty of the demonstrated movement using heteroscedastic GPs and utilizes an update via Matheron's rule to instantaneously adjust the t...
Adrián Prados, L. Lishan, Alberto Mendez et al.· Jornadas de Automática· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.