运动规划
随机树
路径(计算)
树(集合论)
路径长度
计算机科学
任意角度路径规划
避障
障碍物
算法
快速通道
数学优化
人工智能
数学
机器人
移动机器人
计算机网络
数学分析
法学
政治学
作者
Jing Xiong,Xia Li,Yangzhou Gan,Zeyang Xia
标识
DOI:10.1109/icinfa.2015.7279532
摘要
Path planning is one of the most important parts in the research on flexible needle insertion. Based on the Improved Rapidly-exploring Random Tree (I-RRT), the path planning for flexible needle insertion is studied in this paper. Traditional RRT algorithm can generate paths which can avoid obstacle and reach the target precisely, but the path is not continuously differentiable and cannot match the physical constraints of the flexible needle inserting into soft tissue. Aiming at solving this problem, the I-RRT algorithm is proposed to generate paths for minimally invasive treatment and meanwhile guarantee the continuity and effectiveness of the path. The path evaluation function is designed to implement path selection based on path length, obstacle avoidance and the number of arcs. Then the simulation of the flexible needle path is performed in the environment with obstacles. Results show that the I-RRT is more practical and effective for flexible needle insertion path planning.
科研通智能强力驱动
Strongly Powered by AbleSci AI