LDR prostate planning optimization: incorporating institutional loading and configuration preferences into an automatic planning algorithm

Brachytherapy ◽  
2008 ◽  
Vol 7 (2) ◽  
pp. 185
Author(s):  
Nick Chng ◽  
Ingrid Spadinger ◽  
William J. Morris ◽  
Tim Salcudean
2021 ◽  
Author(s):  
Qing Yang ◽  
Jian Song ◽  
Chang Cheng ◽  
Chao Shi ◽  
Chendi Liang ◽  
...  

Biomimetics ◽  
2021 ◽  
Vol 6 (4) ◽  
pp. 57
Author(s):  
Yifan Wang ◽  
Zehao Liu ◽  
Akhil Kandhari ◽  
Kathryn A. Daltorio

Worm-like robots have demonstrated great potential in navigating through environments requiring body shape deformation. Some examples include navigating within a network of pipes, crawling through rubble for search and rescue operations, and medical applications such as endoscopy and colonoscopy. In this work, we developed path planning optimization techniques and obstacle avoidance algorithms for the peristaltic method of locomotion of worm-like robots. Based on our previous path generation study using a modified rapidly exploring random tree (RRT), we have further introduced the Bézier curve to allow more path optimization flexibility. Using Bézier curves, the path planner can explore more areas and gain more flexibility to make the path smoother. We have calculated the obstacle avoidance limitations during turning tests for a six-segment robot with the developed path planning algorithm. Based on the results of our robot simulation, we determined a safe turning clearance distance with a six-body diameter between the robot and the obstacles. When the clearance is less than this value, additional methods such as backward locomotion may need to be applied for paths with high obstacle offset. Furthermore, for a worm-like robot, the paths of subsequent segments will be slightly different than the path of the head segment. Here, we show that as the number of segments increases, the differences between the head path and tail path increase, necessitating greater lateral clearance margins.


2020 ◽  
Vol 20 (10) ◽  
pp. 2040025
Author(s):  
XIAOZHAO CHEN ◽  
CHONGNAN YAN ◽  
WEI ZHANG ◽  
BAOGUO JIANG ◽  
JINGHAI ZHANG

Pedicle screw placement is a common internal fixation technology used in spine surgery, with preoperative planning and assessment being one of the most important steps. Preoperative planning mainly refers to determining the path and parameters of screws, and preoperative assessment mainly refers to effects during and after operations (i.e., firmness, etc.). Technologies available at present lack effective quantitative assessments on the firmness of screws. Bone mineral density (BMD) is one of the most important influencing factors for firmness. To address the aforementioned problems, this study aimed to put forward quantitative assessments for the firmness of pedicle screws taking bone mass as the basis. In other words, quantitative assessments of the firmness of screw trajectories were made by computing the total mineral content of the bone supporting screws. Meanwhile, the quantitative assessment results of the firmness were used as the optimized objective functions to put forward and realize an automatic planning optimization method for screw trajectories. The findings of this study might provide more complete and simplified planning schemes for doctors, to enhance the postoperative firmness of screws effectively, prevent from issues such as the loosening of screws due to the low value of a patient’s bone mass, and promote the effects of operations.


2014 ◽  
Vol 494-495 ◽  
pp. 1290-1293 ◽  
Author(s):  
Shi Gang Cui ◽  
Jiang Lei Dong ◽  
Fan Liang

An ant colony algorithm is a stochastic searching optimization algorithm that is based on the heuristic behavior of the biologic colony. Its positive feedback and coordination make it possible to be applied to a distributed system. It has favorable adaptability in solving combinatorial optimization and has great development potential for its connotative parallel property. This study focused on global path planning with an ant colony algorithm in an environment based on grids, which explores a new path planning algorithm. How to present and update the pheromone of an ant system was investigated. The crossover operation of a genetic algorithm was used in the ant system for path optimization. Experimental results show that the algorithm has better path planning optimization ability than other algorithms.


2021 ◽  
Author(s):  
Eliot S. Rudnick-Cohen ◽  
Joshua D. Hodson ◽  
Gregory W. Reich ◽  
Alexander M. Pankonien ◽  
Philip S. Beran

Sign in / Sign up

Export Citation Format

Share Document