The present work proposes an obstacle avoidance path planning algorithm for virtual simulations of hyper-redundant manipulators, with the possibility to customize the optimization criteria to select the best trajectory given in output. For test purposes, the effectiveness of the proposed Inverse Kinematic algorithm has been tested by simulating the Remote Maintenance (RM) tasks conducted by the HyRMan: the Hyper Redundant Manipulator developed for the Divertor Tokamak Test (DTT) project. The algorithm has been employed to simulate some critical handling tasks of the First Wall (FW) modules, with a specific optimization criterion as an example of its potentialities.
An obstacle avoidance path planning algorithm to simulate hyper redundant manipulators for tokamaks maintenance / Buonocore, Sara; Zoppoli, Andrea; Di Gironimo, Giuseppe. - In: FUSION ENGINEERING AND DESIGN. - ISSN 0920-3796. - 202:(2024), pp. 1-9. [10.1016/j.fusengdes.2024.114334]
An obstacle avoidance path planning algorithm to simulate hyper redundant manipulators for tokamaks maintenance
Buonocore, Sara
;Zoppoli, Andrea;Di Gironimo, Giuseppe
2024
Abstract
The present work proposes an obstacle avoidance path planning algorithm for virtual simulations of hyper-redundant manipulators, with the possibility to customize the optimization criteria to select the best trajectory given in output. For test purposes, the effectiveness of the proposed Inverse Kinematic algorithm has been tested by simulating the Remote Maintenance (RM) tasks conducted by the HyRMan: the Hyper Redundant Manipulator developed for the Divertor Tokamak Test (DTT) project. The algorithm has been employed to simulate some critical handling tasks of the First Wall (FW) modules, with a specific optimization criterion as an example of its potentialities.File | Dimensione | Formato | |
---|---|---|---|
1-s2.0-S092037962400187X-main.pdf
accesso aperto
Licenza:
Non specificato
Dimensione
10.94 MB
Formato
Adobe PDF
|
10.94 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.