最大覆盖脑出血引流管式机器人优化算法比较

J. Granna, Yi Guo, K. Weaver, J. Burgner-Kahrs
{"title":"最大覆盖脑出血引流管式机器人优化算法比较","authors":"J. Granna, Yi Guo, K. Weaver, J. Burgner-Kahrs","doi":"10.1142/S2424905X17500040","DOIUrl":null,"url":null,"abstract":"Intracerebral hemorrhage evacuation (ICH) using a tubular aspiration robot promises benefits over conventional approaches to release the pressure of an hemorrhage within the brain. The blood of the hemorrhage is evacuated through preplanned, coordinated motion of a flexible, curved, concentric tube that aspirates from within the hemorrhage. To achieve maximum decompression, the curvature of the inner aspirator tube has to be selected such that its workspace covers the hemorrhage. As the use of multiple aspiration tubes sequentially is advisable, one can perform an exhaustive search over all possible aspiration tube shapes as has been previously proposed in the literature. In this paper, we introduce a new optimization algorithm which is computationally more efficient and thus allows for quick optimization during surgery. To demonstrate its performance and compare it to the previously proposed exhaustive search algorithm, we present experimental evaluation results on 175 simulated patient trials.","PeriodicalId":447761,"journal":{"name":"J. Medical Robotics Res.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Comparison of Optimization Algorithms for a Tubular Aspiration Robot for Maximum Coverage in Intracerebral Hemorrhage Evacuation\",\"authors\":\"J. Granna, Yi Guo, K. Weaver, J. Burgner-Kahrs\",\"doi\":\"10.1142/S2424905X17500040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Intracerebral hemorrhage evacuation (ICH) using a tubular aspiration robot promises benefits over conventional approaches to release the pressure of an hemorrhage within the brain. The blood of the hemorrhage is evacuated through preplanned, coordinated motion of a flexible, curved, concentric tube that aspirates from within the hemorrhage. To achieve maximum decompression, the curvature of the inner aspirator tube has to be selected such that its workspace covers the hemorrhage. As the use of multiple aspiration tubes sequentially is advisable, one can perform an exhaustive search over all possible aspiration tube shapes as has been previously proposed in the literature. In this paper, we introduce a new optimization algorithm which is computationally more efficient and thus allows for quick optimization during surgery. To demonstrate its performance and compare it to the previously proposed exhaustive search algorithm, we present experimental evaluation results on 175 simulated patient trials.\",\"PeriodicalId\":447761,\"journal\":{\"name\":\"J. Medical Robotics Res.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-02-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Medical Robotics Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S2424905X17500040\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Medical Robotics Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S2424905X17500040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

使用管状抽吸机器人的脑出血清除(ICH)有望比传统方法更有效地释放颅内出血的压力。出血的血液通过一个灵活的、弯曲的同心管的预先计划的、协调的运动从出血中抽吸出来。为了达到最大程度的减压,必须选择内吸引管的曲率,使其工作空间覆盖出血。由于顺序使用多个抽吸管是可取的,因此可以像以前在文献中提出的那样,对所有可能的抽吸管形状进行详尽的搜索。在本文中,我们介绍了一种新的优化算法,该算法计算效率更高,从而允许在手术过程中快速优化。为了证明其性能并将其与先前提出的穷举搜索算法进行比较,我们给出了175个模拟患者试验的实验评估结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Comparison of Optimization Algorithms for a Tubular Aspiration Robot for Maximum Coverage in Intracerebral Hemorrhage Evacuation
Intracerebral hemorrhage evacuation (ICH) using a tubular aspiration robot promises benefits over conventional approaches to release the pressure of an hemorrhage within the brain. The blood of the hemorrhage is evacuated through preplanned, coordinated motion of a flexible, curved, concentric tube that aspirates from within the hemorrhage. To achieve maximum decompression, the curvature of the inner aspirator tube has to be selected such that its workspace covers the hemorrhage. As the use of multiple aspiration tubes sequentially is advisable, one can perform an exhaustive search over all possible aspiration tube shapes as has been previously proposed in the literature. In this paper, we introduce a new optimization algorithm which is computationally more efficient and thus allows for quick optimization during surgery. To demonstrate its performance and compare it to the previously proposed exhaustive search algorithm, we present experimental evaluation results on 175 simulated patient trials.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Calibration and Evaluation of a Motion Measurement System for PET Imaging Studies Automatic Detection of Out-of-body Frames in Surgical Videos for Privacy Protection Using Self-supervised Learning and Minimal Labels A Novel Mechanical Design of a Wearable Fingertip Haptic Device for Remote Meniscus Palpation A Surgical Robotic Framework for Safe and Autonomous Data-Driven Learning and Manipulation of an Unknown Deformable Tissue with an Integrated Critical Space Development and Testing of a Durable and Novel Breast Phantom for Robotic Autonomous Ultrasound Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1