IDEAS home Printed from https://ideas.repec.org/a/dba/ejacia/v2y2026i1p139-148.html

Task-Constrained Manipulation Planning in Robot Joint Space Using Long Short-Term Memory Networks

Author

Listed:
  • Rezaei, Ali
  • Khan, Ahmed
  • Hamdi, Omar
  • López, Juan Carlos
  • Paredes, Diego
  • Zalewski, Krzysztof

Abstract

This study delves into comprehensive randomized trajectory planning within the robot joint-space framework, specifically tailored for articulated mechanisms constrained by task-space requirements. A novel representation of constrained motion is formulated to facilitate joint-space planning, leveraging Long Short-Term Memory (LSTM) networks as a cornerstone methodology. These networks adeptly encapsulate temporal dependencies and non-linear dynamics, enabling robust trajectory prediction and constraint adherence. The framework introduces two pioneering approaches for sampling joint configurations: tangent-space sampling (TS) and first-order retraction (FR), both designed to enhance global sampling efficiency for linear task-space transformations. Theoretical analysis substantiates the efficacy of FR in ensuring convergence to globally optimal solutions. This methodology addresses real-world applications encompassing workspace-coordinated tasks, such as precise rotational movements, guided linear translations, or maintaining stability under transport-induced perturbations. Furthermore, the joint-space approach effectively exploits redundant degrees of freedom (DOFs), ensuring obstacle avoidance and auxiliary goal satisfaction during task execution. Comparative evaluations reveal that the proposed methods, underpinned by LSTM networks, exhibit superior adaptability and reduced sensitivity to parametric variations relative to existing paradigms.

Suggested Citation

  • Rezaei, Ali & Khan, Ahmed & Hamdi, Omar & López, Juan Carlos & Paredes, Diego & Zalewski, Krzysztof, 2026. "Task-Constrained Manipulation Planning in Robot Joint Space Using Long Short-Term Memory Networks," European Journal of AI, Computing & Informatics, Pinnacle Academic Press, vol. 2(1), pages 139-148.
  • Handle: RePEc:dba:ejacia:v:2:y:2026:i:1:p:139-148
    as

    Download full text from publisher

    File URL: https://pinnaclepubs.com/index.php/EJACI/article/view/519/507
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:dba:ejacia:v:2:y:2026:i:1:p:139-148. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Joseph Clark (email available below). General contact details of provider: https://pinnaclepubs.com/index.php/EJACI .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.