首页 > 最新文献

Robotics science and systems : online proceedings最新文献

英文 中文
Toward Certifiable Motion Planning for Medical Steerable Needles. 医用导向针的可认证运动规划
Pub Date : 2021-07-01 DOI: 10.15607/rss.2021.xvii.081
Mengyu Fu, Oren Salzman, Ron Alterovitz

Medical steerable needles can move along 3D curvilinear trajectories to avoid anatomical obstacles and reach clinically significant targets inside the human body. Automating steerable needle procedures can enable physicians and patients to harness the full potential of steerable needles by maximally leveraging their steerability to safely and accurately reach targets for medical procedures such as biopsies and localized therapy delivery for cancer. For the automation of medical procedures to be clinically accepted, it is critical from a patient care, safety, and regulatory perspective to certify the correctness and effectiveness of the motion planning algorithms involved in procedure automation. In this paper, we take an important step toward creating a certifiable motion planner for steerable needles. We introduce the first motion planner for steerable needles that offers a guarantee, under clinically appropriate assumptions, that it will, in finite time, compute an exact, obstacle-avoiding motion plan to a specified target, or notify the user that no such plan exists. We present an efficient, resolution-complete motion planner for steerable needles based on a novel adaptation of multi-resolution planning. Compared to state-of-the-art steerable needle motion planners (none of which provide any completeness guarantees), we demonstrate that our new resolution-complete motion planner computes plans faster and with a higher success rate.

医用导向针可以沿着三维曲线轨迹运动,避开解剖障碍,到达人体内部具有临床意义的目标。自动化可操控针头操作可以使医生和患者充分利用可操控针头的全部潜力,最大限度地利用其可操控性,安全、准确地达到医疗程序的目标,如活组织检查和癌症的局部治疗递送。为了使医疗程序的自动化在临床上被接受,从患者护理、安全和监管的角度来看,证明过程自动化中涉及的运动规划算法的正确性和有效性是至关重要的。在本文中,我们迈出了重要的一步,为可操纵针创建可认证的运动规划器。我们介绍了第一个可操纵针头的运动规划器,它提供了一个保证,在临床适当的假设下,它将在有限的时间内计算出一个精确的、避开障碍物的运动计划到指定的目标,或者通知用户不存在这样的计划。基于一种新的多分辨率规划方法,提出了一种高效、全分辨率的定向针运动规划方法。与最先进的可操纵针运动规划器(它们都不提供任何完整性保证)相比,我们证明了我们的新分辨率完整运动规划器计算计划的速度更快,成功率更高。
{"title":"Toward Certifiable Motion Planning for Medical Steerable Needles.","authors":"Mengyu Fu,&nbsp;Oren Salzman,&nbsp;Ron Alterovitz","doi":"10.15607/rss.2021.xvii.081","DOIUrl":"https://doi.org/10.15607/rss.2021.xvii.081","url":null,"abstract":"<p><p>Medical steerable needles can move along 3D curvilinear trajectories to avoid anatomical obstacles and reach clinically significant targets inside the human body. Automating steerable needle procedures can enable physicians and patients to harness the full potential of steerable needles by maximally leveraging their steerability to safely and accurately reach targets for medical procedures such as biopsies and localized therapy delivery for cancer. For the automation of medical procedures to be clinically accepted, it is critical from a patient care, safety, and regulatory perspective to certify the correctness and effectiveness of the motion planning algorithms involved in procedure automation. In this paper, we take an important step toward creating a certifiable motion planner for steerable needles. We introduce the first motion planner for steerable needles that offers a guarantee, under clinically appropriate assumptions, that it will, in finite time, compute an exact, obstacle-avoiding motion plan to a specified target, or notify the user that no such plan exists. We present an efficient, resolution-complete motion planner for steerable needles based on a novel adaptation of multi-resolution planning. Compared to state-of-the-art steerable needle motion planners (none of which provide any completeness guarantees), we demonstrate that our new resolution-complete motion planner computes plans faster and with a higher success rate.</p>","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"2021 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9612400/pdf/nihms-1786703.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40656353","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Latent Belief Space Motion Planning under Cost, Dynamics, and Intent Uncertainty 成本、动力学和意图不确定性下的潜在信念空间运动规划
Pub Date : 2020-07-12 DOI: 10.15607/rss.2020.xvi.069
D. Qiu, Yibiao Zhao, Chris L. Baker
Autonomous agents are limited in their ability to observe the world state. Partially observable Markov decision processes (POMDPs) model planning under world state uncertainty, but POMDPs with multimodal beliefs, continuous actions, and nonlinear dynamics suitable for robotics applications are challenging to solve. We present a dynamic programming algorithm for planning in the belief space over discrete latent states in POMDPs with continuous states, actions, observations, and nonlinear dynamics. Unlike prior belief space motion planning approaches which assume unimodal Gaussian uncertainty, our approach constructs a novel tree-structured representation of possible observations and multimodal belief space trajectories, and optimizes a contingency plan over this structure. We apply our method to problems with uncertainty over the reward or cost function (e.g., the configuration of goals or obstacles), uncertainty over the dynamics, and uncertainty about interactions, where other agents’ behavior is conditioned on latent intentions. Three experiments show that our algorithm outperforms strong baselines for planning under uncertainty, and results from an autonomous lane changing task demonstrate that our algorithm can synthesize robust interactive trajectories.
自主主体观察世界状态的能力有限。部分可观察马尔可夫决策过程(pomdp)是世界状态不确定性下的规划模型,但具有多模态信念、连续动作和非线性动力学的pomdp是机器人应用中的一个挑战。我们提出了一种动态规划算法,用于在具有连续状态、动作、观察和非线性动力学的pomdp的离散潜在状态的信念空间中进行规划。与先前假设单模态高斯不确定性的信念空间运动规划方法不同,我们的方法构建了一种新的树状结构表示可能的观测值和多模态信念空间轨迹,并在此结构上优化了应急计划。我们将我们的方法应用于奖励或成本函数的不确定性(例如,目标或障碍的配置),动态的不确定性以及交互的不确定性问题,其中其他代理的行为取决于潜在意图。三个实验表明,该算法在不确定条件下的规划中优于强基线,一个自主变道任务的结果表明,该算法可以合成鲁棒的交互轨迹。
{"title":"Latent Belief Space Motion Planning under Cost, Dynamics, and Intent Uncertainty","authors":"D. Qiu, Yibiao Zhao, Chris L. Baker","doi":"10.15607/rss.2020.xvi.069","DOIUrl":"https://doi.org/10.15607/rss.2020.xvi.069","url":null,"abstract":"Autonomous agents are limited in their ability to observe the world state. Partially observable Markov decision processes (POMDPs) model planning under world state uncertainty, but POMDPs with multimodal beliefs, continuous actions, and nonlinear dynamics suitable for robotics applications are challenging to solve. We present a dynamic programming algorithm for planning in the belief space over discrete latent states in POMDPs with continuous states, actions, observations, and nonlinear dynamics. Unlike prior belief space motion planning approaches which assume unimodal Gaussian uncertainty, our approach constructs a novel tree-structured representation of possible observations and multimodal belief space trajectories, and optimizes a contingency plan over this structure. We apply our method to problems with uncertainty over the reward or cost function (e.g., the configuration of goals or obstacles), uncertainty over the dynamics, and uncertainty about interactions, where other agents’ behavior is conditioned on latent intentions. Three experiments show that our algorithm outperforms strong baselines for planning under uncertainty, and results from an autonomous lane changing task demonstrate that our algorithm can synthesize robust interactive trajectories.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"71 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72746908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Efficient Parametric Multi-Fidelity Surface Mapping 高效参数化多保真曲面映射
Pub Date : 2020-07-12 DOI: 10.15607/rss.2020.xvi.073
A. Dhawale, Nathan Michael
{"title":"Efficient Parametric Multi-Fidelity Surface Mapping","authors":"A. Dhawale, Nathan Michael","doi":"10.15607/rss.2020.xvi.073","DOIUrl":"https://doi.org/10.15607/rss.2020.xvi.073","url":null,"abstract":"","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91397051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Learning of Sub-optimal Gait Controllers for Magnetic Walking Soft Millirobots. 磁行走软机器人次优步态控制器的学习。
Pub Date : 2020-01-01 DOI: 10.15607/RSS.2020.XVI.070
Utku Culha, Sinan O Demir, Sebastian Trimpe, Metin Sitti

Untethered small-scale soft robots have promising applications in minimally invasive surgery, targeted drug delivery, and bioengineering applications as they can access confined spaces in the human body. However, due to highly nonlinear soft continuum deformation kinematics, inherent stochastic variability during fabrication at the small scale, and lack of accurate models, the conventional control methods cannot be easily applied. Adaptivity of robot control is additionally crucial for medical operations, as operation environments show large variability, and robot materials may degrade or change over time, which would have deteriorating effects on the robot motion and task performance. Therefore, we propose using a probabilistic learning approach for millimeter-scale magnetic walking soft robots using Bayesian optimization (BO) and Gaussian processes (GPs). Our approach provides a data-efficient learning scheme to find controller parameters while optimizing the stride length performance of the walking soft millirobot robot within a small number of physical experiments. We demonstrate adaptation to fabrication variabilities in three different robots and to walking surfaces with different roughness. We also show an improvement in the learning performance by transferring the learning results of one robot to the others as prior information.

不受束缚的小型软体机器人在微创手术、靶向药物输送和生物工程应用方面有很好的应用前景,因为它们可以进入人体的狭窄空间。然而,由于软连续体变形运动学的高度非线性、小尺度制造过程中固有的随机变异性以及缺乏精确的模型,传统的控制方法难以应用。机器人控制的适应性对于医疗手术来说也至关重要,因为手术环境具有很大的可变性,机器人材料可能会随着时间的推移而退化或改变,这将对机器人的运动和任务性能产生日益恶化的影响。因此,我们提出了一种基于贝叶斯优化(BO)和高斯过程(GPs)的毫米级磁性步行软机器人概率学习方法。我们的方法提供了一种数据高效的学习方案,可以在少量物理实验中找到控制器参数,同时优化步行软微机器人的步长性能。我们演示了对三种不同机器人的制造变化和不同粗糙度的行走表面的适应。通过将一个机器人的学习结果作为先验信息传递给其他机器人,我们也展示了学习性能的提高。
{"title":"Learning of Sub-optimal Gait Controllers for Magnetic Walking Soft Millirobots.","authors":"Utku Culha,&nbsp;Sinan O Demir,&nbsp;Sebastian Trimpe,&nbsp;Metin Sitti","doi":"10.15607/RSS.2020.XVI.070","DOIUrl":"https://doi.org/10.15607/RSS.2020.XVI.070","url":null,"abstract":"<p><p>Untethered small-scale soft robots have promising applications in minimally invasive surgery, targeted drug delivery, and bioengineering applications as they can access confined spaces in the human body. However, due to highly nonlinear soft continuum deformation kinematics, inherent stochastic variability during fabrication at the small scale, and lack of accurate models, the conventional control methods cannot be easily applied. Adaptivity of robot control is additionally crucial for medical operations, as operation environments show large variability, and robot materials may degrade or change over time, which would have deteriorating effects on the robot motion and task performance. Therefore, we propose using a probabilistic learning approach for millimeter-scale magnetic walking soft robots using Bayesian optimization (BO) and Gaussian processes (GPs). Our approach provides a data-efficient learning scheme to find controller parameters while optimizing the stride length performance of the walking soft millirobot robot within a small number of physical experiments. We demonstrate adaptation to fabrication variabilities in three different robots and to walking surfaces with different roughness. We also show an improvement in the learning performance by transferring the learning results of one robot to the others as prior information.</p>","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"2020 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7610446/pdf/EMS104319.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"25536396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Toward Asymptotically-Optimal Inspection Planning via Efficient Near-Optimal Graph Search. 基于高效近最优图搜索的渐近最优检测规划。
Pub Date : 2019-06-01 DOI: 10.15607/rss.2019.xv.057
Mengyu Fu, Alan Kuntz, Oren Salzman, Ron Alterovitz

Inspection planning, the task of planning motions that allow a robot to inspect a set of points of interest, has applications in domains such as industrial, field, and medical robotics. Inspection planning can be computationally challenging, as the search space over motion plans grows exponentially with the number of points of interest to inspect. We propose a novel method, Incremental Random Inspection-roadmap Search (IRIS), that computes inspection plans whose length and set of successfully inspected points asymptotically converge to those of an optimal inspection plan. IRIS incrementally densifies a motion planning roadmap using sampling-based algorithms, and performs efficient near-optimal graph search over the resulting roadmap as it is generated. We demonstrate IRIS's efficacy on a simulated planar 5DOF manipulator inspection task and on a medical endoscopic inspection task for a continuum parallel surgical robot in cluttered anatomy segmented from patient CT data. We show that IRIS computes higher-quality inspection plans orders of magnitudes faster than a prior state-of-the-art method.

检查计划,即规划运动的任务,允许机器人检查一组感兴趣的点,在工业、现场和医疗机器人等领域都有应用。检查计划在计算上具有挑战性,因为运动计划的搜索空间随着要检查的兴趣点的数量呈指数级增长。我们提出了一种新的方法——增量随机检查路线图搜索(IRIS),它计算出成功检查点的长度和集合渐近收敛于最优检查计划的长度和集合。IRIS使用基于采样的算法逐步强化运动规划路线图,并在生成结果路线图时对其执行高效的近最优图搜索。我们展示了IRIS在模拟平面5DOF机械臂检测任务和连续平行手术机器人的医学内窥镜检查任务中的有效性,该任务是在从患者CT数据中分割的混乱解剖中进行的。我们表明,IRIS计算更高质量的检查计划的数量级比先前的最先进的方法快。
{"title":"Toward Asymptotically-Optimal Inspection Planning via Efficient Near-Optimal Graph Search.","authors":"Mengyu Fu,&nbsp;Alan Kuntz,&nbsp;Oren Salzman,&nbsp;Ron Alterovitz","doi":"10.15607/rss.2019.xv.057","DOIUrl":"https://doi.org/10.15607/rss.2019.xv.057","url":null,"abstract":"<p><p>Inspection planning, the task of planning motions that allow a robot to inspect a set of points of interest, has applications in domains such as industrial, field, and medical robotics. Inspection planning can be computationally challenging, as the search space over motion plans grows exponentially with the number of points of interest to inspect. We propose a novel method, Incremental Random Inspection-roadmap Search (IRIS), that computes inspection plans whose length and set of successfully inspected points asymptotically converge to those of an optimal inspection plan. IRIS incrementally densifies a motion planning roadmap using sampling-based algorithms, and performs efficient near-optimal graph search over the resulting roadmap as it is generated. We demonstrate IRIS's efficacy on a simulated planar 5DOF manipulator inspection task and on a medical endoscopic inspection task for a continuum parallel surgical robot in cluttered anatomy segmented from patient CT data. We show that IRIS computes higher-quality inspection plans orders of magnitudes faster than a prior state-of-the-art method.</p>","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"2019 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7172008/pdf/nihms-1576709.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"37857617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 24
Differentiable Physics and Stable Modes for Tool-Use and Manipulation Planning 工具使用和操作规划的可微分物理和稳定模式
Pub Date : 2018-06-26 DOI: 10.15607/RSS.2018.XIV.044
Marc Toussaint, Kelsey R. Allen, Kevin A. Smith, J. Tenenbaum
We propose to formulate physical reasoning and manipulation planning as an optimization problem that integrates first order logic, which we call Logic-Geometric Programming.
我们建议将物理推理和操作规划作为集成一阶逻辑的优化问题,我们称之为逻辑几何规划。
{"title":"Differentiable Physics and Stable Modes for Tool-Use and Manipulation Planning","authors":"Marc Toussaint, Kelsey R. Allen, Kevin A. Smith, J. Tenenbaum","doi":"10.15607/RSS.2018.XIV.044","DOIUrl":"https://doi.org/10.15607/RSS.2018.XIV.044","url":null,"abstract":"We propose to formulate physical reasoning and manipulation planning as an optimization problem that integrates first order logic, which we call Logic-Geometric Programming.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"67 5 1","pages":"6231-6235"},"PeriodicalIF":0.0,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83431270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 280
Set-labelled filters and sensor transformations 集合标记滤波器和传感器变换
Pub Date : 2016-06-18 DOI: 10.15607/RSS.2016.XII.015
Fatemeh Zahra Saberifar, S. Ghasemlou, J. O’Kane, Dylan A. Shell
For a given robot and a given task, this paper addresses questions about which modifications may be made to the robot’s suite of sensors without impacting the robot’s behavior in completing its task. Though this is an important design-time question, few principled methods exist for providing a definitive answer in general. Utilizing and extending the language of combinatorial filters, this paper aims to fill that lacuna by introducing theoretical tools for reasoning about sensors and representations of sensors. It introduces new representations for sensors and filters, exploring the relationship between those elements and the specific information needed to perform a task. It then shows how these tools can be used to algorithmically answer questions about changes to a robot’s sensor suite. The paper substantially expands the expressiveness of combinatorial filters so that, where they were previously limited to quite simple sensors, our richer filters are able to reasonably model a much broader variety of real devices. We have implemented the proposed algorithms, and describe their application to an example instance involving a series of simplifications to the sensors of a specific, widely deployed mobile robot.
对于给定的机器人和给定的任务,本文解决了在不影响机器人完成任务的行为的情况下对机器人的传感器套件进行哪些修改的问题。虽然这是一个重要的设计时问题,但通常很少有原则性的方法可以提供明确的答案。利用和扩展组合滤波器的语言,本文旨在通过引入关于传感器和传感器表示的推理理论工具来填补这一空白。它引入了传感器和过滤器的新表示,探索这些元素与执行任务所需的特定信息之间的关系。然后展示了如何使用这些工具通过算法来回答有关机器人传感器套件变化的问题。本文极大地扩展了组合滤波器的表达能力,因此,在它们以前仅限于相当简单的传感器的地方,我们更丰富的滤波器能够合理地模拟更广泛的实际设备。我们已经实现了所提出的算法,并描述了它们在一个示例实例中的应用,该实例涉及对特定的、广泛部署的移动机器人的传感器的一系列简化。
{"title":"Set-labelled filters and sensor transformations","authors":"Fatemeh Zahra Saberifar, S. Ghasemlou, J. O’Kane, Dylan A. Shell","doi":"10.15607/RSS.2016.XII.015","DOIUrl":"https://doi.org/10.15607/RSS.2016.XII.015","url":null,"abstract":"For a given robot and a given task, this paper addresses questions about which modifications may be made to the robot’s suite of sensors without impacting the robot’s behavior in completing its task. Though this is an important design-time question, few principled methods exist for providing a definitive answer in general. Utilizing and extending the language of combinatorial filters, this paper aims to fill that lacuna by introducing theoretical tools for reasoning about sensors and representations of sensors. It introduces new representations for sensors and filters, exploring the relationship between those elements and the specific information needed to perform a task. It then shows how these tools can be used to algorithmically answer questions about changes to a robot’s sensor suite. The paper substantially expands the expressiveness of combinatorial filters so that, where they were previously limited to quite simple sensors, our richer filters are able to reasonably model a much broader variety of real devices. We have implemented the proposed algorithms, and describe their application to an example instance involving a series of simplifications to the sensors of a specific, widely deployed mobile robot.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"63 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91398153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Closed Loop Control of a Tethered Magnetic Capsule Endoscope. 系留磁胶囊内窥镜的闭环控制。
Pub Date : 2016-06-01 DOI: 10.15607/RSS.2016.XII.018
Addisu Z Taddese, Piotr R Slawinski, Keith L Obstein, Pietro Valdastri

Magnetic field gradients have repeatedly been shown to be the most feasible mechanism for gastrointestinal capsule endoscope actuation. An inverse quartic magnetic force variation with distance results in large force gradients induced by small movements of a driving magnet; this necessitates robotic actuation of magnets to implement stable control of the device. A typical system consists of a serial robot with a permanent magnet at its end effector that actuates a capsule with an embedded permanent magnet. We present a tethered capsule system where a capsule with an embedded magnet is closed loop controlled in 2 degree-of-freedom in position and 2 degree-of-freedom in orientation. Capitalizing on the magnetic field of the external driving permanent magnet, the capsule is localized in 6-D allowing for both position and orientation feedback to be used in a control scheme. We developed a relationship between the serial robot's joint parameters and the magnetic force and torque that is exerted onto the capsule. Our methodology was validated both in a dynamic simulation environment where a custom plug-in for magnetic interaction was written, as well as on an experimental platform. The tethered capsule was demonstrated to follow desired trajectories in both position and orientation with accuracy that is acceptable for colonoscopy.

磁场梯度已多次被证明是胃肠胶囊内窥镜驱动的最可行的机制。磁力随距离的反四次变化导致驱动磁体的微小运动产生较大的力梯度;这就需要机器人驱动磁铁来实现对设备的稳定控制。一个典型的系统包括一个串行机器人,它的末端执行器有一个永磁体,驱动一个嵌有永磁体的胶囊。我们提出了一种系留胶囊系统,其中嵌入磁铁的胶囊在位置和方向上具有2个自由度的闭环控制。利用外部驱动永磁体的磁场,胶囊定位在6-D中,允许在控制方案中使用位置和方向反馈。我们开发了串联机器人的关节参数与施加在胶囊上的磁力和扭矩之间的关系。我们的方法在动态仿真环境中得到了验证,其中编写了用于磁相互作用的自定义插件,以及在实验平台上。系留胶囊被证明在位置和方向上都遵循期望的轨迹,其精度可用于结肠镜检查。
{"title":"Closed Loop Control of a Tethered Magnetic Capsule Endoscope.","authors":"Addisu Z Taddese,&nbsp;Piotr R Slawinski,&nbsp;Keith L Obstein,&nbsp;Pietro Valdastri","doi":"10.15607/RSS.2016.XII.018","DOIUrl":"https://doi.org/10.15607/RSS.2016.XII.018","url":null,"abstract":"<p><p>Magnetic field gradients have repeatedly been shown to be the most feasible mechanism for gastrointestinal capsule endoscope actuation. An inverse quartic magnetic force variation with distance results in large force gradients induced by small movements of a driving magnet; this necessitates robotic actuation of magnets to implement stable control of the device. A typical system consists of a serial robot with a permanent magnet at its end effector that actuates a capsule with an embedded permanent magnet. We present a tethered capsule system where a capsule with an embedded magnet is closed loop controlled in 2 degree-of-freedom in position and 2 degree-of-freedom in orientation. Capitalizing on the magnetic field of the external driving permanent magnet, the capsule is localized in 6-D allowing for both position and orientation feedback to be used in a control scheme. We developed a relationship between the serial robot's joint parameters and the magnetic force and torque that is exerted onto the capsule. Our methodology was validated both in a dynamic simulation environment where a custom plug-in for magnetic interaction was written, as well as on an experimental platform. The tethered capsule was demonstrated to follow desired trajectories in both position and orientation with accuracy that is acceptable for colonoscopy.</p>","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"2016 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5345944/pdf/nihms851663.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"34806511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Representing and Learning Complex Object Interactions. 表示和学习复杂对象交互。
Pub Date : 2016-06-01 DOI: 10.15607/RSS.2016.XII.039
Yilun Zhou, George Konidaris

We present a framework for representing scenarios with complex object interactions, in which a robot cannot directly interact with the object it wishes to control, but must instead do so via intermediate objects. For example, a robot learning to drive a car can only indirectly change its pose, by rotating the steering wheel. We formalize such complex interactions as chains of Markov decision processes and show how they can be learned and used for control. We describe two systems in which a robot uses learning from demonstration to achieve indirect control: playing a computer game, and using a hot water dispenser to heat a cup of water.

我们提出了一个框架来表示具有复杂对象交互的场景,其中机器人不能直接与它希望控制的对象交互,而是必须通过中间对象进行交互。例如,学习驾驶汽车的机器人只能通过旋转方向盘间接地改变姿态。我们将这种复杂的相互作用形式化为马尔可夫决策过程链,并展示如何学习和使用它们进行控制。我们描述了两个系统,其中机器人通过从演示中学习来实现间接控制:玩电脑游戏,以及使用热水机加热一杯水。
{"title":"Representing and Learning Complex Object Interactions.","authors":"Yilun Zhou,&nbsp;George Konidaris","doi":"10.15607/RSS.2016.XII.039","DOIUrl":"https://doi.org/10.15607/RSS.2016.XII.039","url":null,"abstract":"<p><p>We present a framework for representing scenarios with complex object interactions, in which a robot cannot directly interact with the object it wishes to control, but must instead do so via intermediate objects. For example, a robot learning to drive a car can only indirectly change its pose, by rotating the steering wheel. We formalize such complex interactions as chains of Markov decision processes and show how they can be learned and used for control. We describe two systems in which a robot uses learning from demonstration to achieve indirect control: playing a computer game, and using a hot water dispenser to heat a cup of water.</p>","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"2016 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5459359/pdf/nihms859882.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35070620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Theoretical Limits of Speed and Resolution for Kinodynamic Planning in a Poisson Forest 泊松森林动力学规划的速度和分辨率的理论极限
Pub Date : 2015-07-13 DOI: 10.15607/RSS.2015.XI.005
Sanjiban Choudhury, S. Scherer, J. Bagnell
The performance of a state lattice motion planning algorithm depends critically on the resolution of the lattice to ensure a balance between solution quality and computation time. There is currently no theoretical basis for selecting the resolution because of its dependence on the robot dynamics and the distribution of obstacles. In this paper, we examine the problem of motion planning on a resolution constrained lattice for a robot with non-linear dynamics operating in an environment with randomly generated disc shaped obstacles sampled from a homogeneous Poisson process. We present a unified framework for computing explicit solutions to two problems i) the critical planning resolution which guarantees the existence of an infinite collision free trajectory in the search graph ii) the critical speed limit which guarantees infinite collision free motion. In contrast to techniques used by Karaman and Frazzoli [11], we use a novel approach that maps the problem to parameters of directed asymmetric hexagonal lattice bond percolation. Since standard percolation theory offers no results for this lattice, we map the lattice to an infinite absorbing Markov chain and use results pertaining to its survival to obtain bounds on the parameters. As a result, we are able to derive theoretical expressions that relate the non-linear dynamics of a robot, the resolution of the search graph and the density of the Poisson process. We validate the theoretical bounds using Monte-Carlo simulations for single integrator and curvature constrained systems and are able to validate the previous results presented by Karaman and Frazzoli [11] independently using the novel connections introduced in this paper.
状态点阵运动规划算法的性能主要取决于点阵的分辨率,以确保求解质量和计算时间之间的平衡。由于分辨率的选择依赖于机器人的动力学特性和障碍物的分布,目前尚无理论依据。在本文中,我们研究了一个具有非线性动力学的机器人在一个分辨率约束格上的运动规划问题,该机器人在一个随机生成的圆盘状障碍物的环境中工作,这些障碍物来自齐次泊松过程。我们提出了一个统一的框架,用于计算两个问题的显式解:(1)保证搜索图中存在无限无碰撞轨迹的关键规划分辨率;(2)保证无限无碰撞运动的临界速度限制。与Karaman和Frazzoli[11]使用的技术相反,我们使用了一种新的方法,将问题映射到定向不对称六边形晶格键渗透的参数。由于标准的渗透理论没有给出这个格的结果,我们将格映射到一个无限吸收马尔可夫链,并使用有关其生存的结果来获得参数的界。因此,我们能够推导出与机器人的非线性动力学、搜索图的分辨率和泊松过程的密度相关的理论表达式。我们使用蒙特卡罗模拟验证了单积分器和曲率约束系统的理论边界,并且能够使用本文引入的新连接独立验证Karaman和Frazzoli[11]先前提出的结果。
{"title":"Theoretical Limits of Speed and Resolution for Kinodynamic Planning in a Poisson Forest","authors":"Sanjiban Choudhury, S. Scherer, J. Bagnell","doi":"10.15607/RSS.2015.XI.005","DOIUrl":"https://doi.org/10.15607/RSS.2015.XI.005","url":null,"abstract":"The performance of a state lattice motion planning algorithm depends critically on the resolution of the lattice to ensure a balance between solution quality and computation time. There is currently no theoretical basis for selecting the resolution because of its dependence on the robot dynamics and the distribution of obstacles. In this paper, we examine the problem of motion planning on a resolution constrained lattice for a robot with non-linear dynamics operating in an environment with randomly generated disc shaped obstacles sampled from a homogeneous Poisson process. We present a unified framework for computing explicit solutions to two problems i) the critical planning resolution which guarantees the existence of an infinite collision free trajectory in the search graph ii) the critical speed limit which guarantees infinite collision free motion. In contrast to techniques used by Karaman and Frazzoli [11], we use a novel approach that maps the problem to parameters of directed asymmetric hexagonal lattice bond percolation. Since standard percolation theory offers no results for this lattice, we map the lattice to an infinite absorbing Markov chain and use results pertaining to its survival to obtain bounds on the parameters. As a result, we are able to derive theoretical expressions that relate the non-linear dynamics of a robot, the resolution of the search graph and the density of the Poisson process. We validate the theoretical bounds using Monte-Carlo simulations for single integrator and curvature constrained systems and are able to validate the previous results presented by Karaman and Frazzoli [11] independently using the novel connections introduced in this paper.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"43 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91386620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
期刊
Robotics science and systems : online proceedings
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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