Academic Journal

TRAJECTORY OPTIMIZATION FOR HIGHLY ARTICULATED ROBOTS BASED ON SPARSITY--FREE LOCAL DIRECT COLLOCATION.

Bibliographic Details
Title: TRAJECTORY OPTIMIZATION FOR HIGHLY ARTICULATED ROBOTS BASED ON SPARSITY--FREE LOCAL DIRECT COLLOCATION.
Authors: CARDONA-ORTIZ, DANIEL, ARECHAVALETA, GUSTAVO
Source: International Journal of Applied Mathematics & Computer Science; 2025, Vol. 35 Issue 4, p577-589, 13p
Subject Terms: Trajectory optimization, Optimal control theory, Computer performance, Mathematical optimization, Nonlinear programming, Industrial robots, Robot motion
Abstract: In this paper, we introduce a numerical optimal control scheme (NOCS) for generating dynamically feasible robot motions under several constraints while optimizing a given performance criterion. In particular, the NOCS transforms continuous optimal control problems into large-scale sparsity-free nonlinear programs (NLPs) by means of a dedicated strategy called the block indexation procedure (BIP). As a result, the optimized open-loop control law is obtained fast under limited-memory allocation. The robot's equations of motion, and their partial derivatives with respect to the state of the robot and control inputs, are analytically evaluated. For this, state-of-the-art algorithms available in the Pinocchio and RBDL open-source libraries are used. Otherwise, the NOCS applies the BIP with numerical differentiation techniques. The effectiveness of the NOCS is numerically validated with different robots composed by many degrees of freedom. Also, we provide performance comparisons against CasADi, a popular general purpose optimal control framework that applies automatic differentiation. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Applied Mathematics & Computer Science is the property of Paradigm Publishing Services and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
ISSN:1641876X
DOI:10.61822/amcs-2025-0041