靶向给药:利用均匀外力收集颗粒群的算法方法

Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist, Dominik Krupke, Christian Rieck, Arne Schmidt
{"title":"靶向给药:利用均匀外力收集颗粒群的算法方法","authors":"Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist, Dominik Krupke, Christian Rieck, Arne Schmidt","doi":"arxiv-2408.09729","DOIUrl":null,"url":null,"abstract":"We investigate algorithmic approaches for targeted drug delivery in a\ncomplex, maze-like environment, such as a vascular system. The basic scenario\nis given by a large swarm of micro-scale particles (''agents'') and a\nparticular target region (''tumor'') within a system of passageways. Agents are\ntoo small to contain on-board power or computation and are instead controlled\nby a global external force that acts uniformly on all particles, such as an\napplied fluidic flow or electromagnetic field. The challenge is to deliver all\nagents to the target region with a minimum number of actuation steps. We provide a number of results for this challenge. We show that the\nunderlying problem is NP-complete, which explains why previous work did not\nprovide provably efficient algorithms. We also develop several algorithmic\napproaches that greatly improve the worst-case guarantees for the number of\nrequired actuation steps. We evaluate our algorithmic approaches by numerous\nsimulations, both for deterministic algorithms and searches supported by deep\nlearning, which show that the performance is practically promising.","PeriodicalId":501570,"journal":{"name":"arXiv - CS - Computational Geometry","volume":"6 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces\",\"authors\":\"Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist, Dominik Krupke, Christian Rieck, Arne Schmidt\",\"doi\":\"arxiv-2408.09729\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate algorithmic approaches for targeted drug delivery in a\\ncomplex, maze-like environment, such as a vascular system. The basic scenario\\nis given by a large swarm of micro-scale particles (''agents'') and a\\nparticular target region (''tumor'') within a system of passageways. Agents are\\ntoo small to contain on-board power or computation and are instead controlled\\nby a global external force that acts uniformly on all particles, such as an\\napplied fluidic flow or electromagnetic field. The challenge is to deliver all\\nagents to the target region with a minimum number of actuation steps. We provide a number of results for this challenge. We show that the\\nunderlying problem is NP-complete, which explains why previous work did not\\nprovide provably efficient algorithms. We also develop several algorithmic\\napproaches that greatly improve the worst-case guarantees for the number of\\nrequired actuation steps. We evaluate our algorithmic approaches by numerous\\nsimulations, both for deterministic algorithms and searches supported by deep\\nlearning, which show that the performance is practically promising.\",\"PeriodicalId\":501570,\"journal\":{\"name\":\"arXiv - CS - Computational Geometry\",\"volume\":\"6 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Computational Geometry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.09729\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.09729","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们研究了在复杂的迷宫般环境(如血管系统)中进行靶向给药的算法方法。基本场景是在一个通道系统中,由一大群微尺度粒子("药剂")和特定目标区域("肿瘤")组成。由于微粒太小,无法搭载动力或计算能力,因此需要通过均匀作用于所有微粒的全局外力(如外加流体流或电磁场)进行控制。我们面临的挑战是以最少的驱动步骤将所有试剂输送到目标区域。我们为这一挑战提供了一系列结果。我们证明了基本问题是 NP-完全的,这也解释了为什么以前的工作没有提供可证明的高效算法。我们还开发了几种算法方法,大大提高了对所需执行步骤数的最坏情况保证。我们通过大量的模拟来评估我们的算法方法,包括确定性算法和深度学习支持的搜索,结果表明这些算法的性能是切实可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
We investigate algorithmic approaches for targeted drug delivery in a complex, maze-like environment, such as a vascular system. The basic scenario is given by a large swarm of micro-scale particles (''agents'') and a particular target region (''tumor'') within a system of passageways. Agents are too small to contain on-board power or computation and are instead controlled by a global external force that acts uniformly on all particles, such as an applied fluidic flow or electromagnetic field. The challenge is to deliver all agents to the target region with a minimum number of actuation steps. We provide a number of results for this challenge. We show that the underlying problem is NP-complete, which explains why previous work did not provide provably efficient algorithms. We also develop several algorithmic approaches that greatly improve the worst-case guarantees for the number of required actuation steps. We evaluate our algorithmic approaches by numerous simulations, both for deterministic algorithms and searches supported by deep learning, which show that the performance is practically promising.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Minimum Plane Bichromatic Spanning Trees Evolving Distributions Under Local Motion New Lower Bound and Algorithms for Online Geometric Hitting Set Problem Computing shortest paths amid non-overlapping weighted disks Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing
×
引用
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