A new path planning method for bevel-tip flexible needle insertion in 3D space with multiple targets and obstacles

In this paper, a new bevel-tip flexible needle path planning method based on the bee-foraging learning particle swarm optimization (BFL-PSO) algorithm and the needle retraction strategy in 3D space is proposed to improve the puncture accuracy and shorten the puncture distance in the case of multiple...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Control theory and technology 2022-11, Vol.20 (4), p.525-535
Hauptverfasser: Tan, Zhen, Zhang, Dan, Liang, Hua-geng, Wang, Qing-guo, Cai, Wenjian
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, a new bevel-tip flexible needle path planning method based on the bee-foraging learning particle swarm optimization (BFL-PSO) algorithm and the needle retraction strategy in 3D space is proposed to improve the puncture accuracy and shorten the puncture distance in the case of multiple puncture targets. First, the movement of the needle after penetrating the human body is analyzed, and the objective function which includes puncture path error, puncture path length, and collision function is established. Then, the BFL-PSO algorithm and the needle retraction strategy are analyzed. Finally, medical images of the tissue to be punctured are obtained by medical imaging instruments, i.e., magnetic resonance (MR), and the 3D model of the punctured environment is constructed by 3D Slicer to obtain the environment information on targets and obstacles, and the path of flexible needle is carried out based on the BFL-PSO optimization algorithm and the needle retraction strategy. The simulation results show that, compared with other path planning methods in the related literature, the new path planning method proposed in this paper has higher path planning accuracy, shorter puncture distance, and good adaptability to multi-target path planning problems.
ISSN:2095-6983
2198-0942
DOI:10.1007/s11768-022-00113-y