Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist, Dominik Krupke, Christian Rieck, Arne Schmidt
{"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}
引用次数: 0
Abstract
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.