课题基金 / 基金详情

Collaborative Research: EAGER: Foundations of Secure Multi-Robot Computation

Collaborative Research: EAGER: Foundations of Secure Multi-Robot Computation
协作研究:EAGER:安全多机器人计算的基础
批准号:
2034097
负责人:
Dylan Shell
金额:
$9.75万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2020
资助国家:
美国
项目状态:
已结题
起止时间:
2020-08-01 至 2023-07-31

项目摘要

项目成果

Dylan Shell的其他基金

相似基金

相关文献

中文摘要
翻译
随着人们开始面对机器人成为我们日常生活一部分的前景,越来越明显的是,机器人可以收集的信息既敏感又有价值。但机器人可能需要收集这些信息才能正常工作:就像我们生活中的其他地方一样,我们需要了解如何最好地协调效用和隐私之间的紧张关系。到目前为止,在多机器人系统的规划、控制和协调的算法方面取得了巨大的科学进步,但它也太少关注“谁知道是什么”。这项研究的目的是了解在系统中其他元素的完整性存在一些疑问的情况下,如何安全地完成许多常见机器人任务背后的基本计算操作,包括是否可以相信它们永远不会泄露信息。这对于在社会敏感环境中运行的自主机器人以及在竞争或敌对场景中运行的机器人来说至关重要。除了对机器人研究的预期影响外,该项目还将通过解决具有战略意义的国家利益问题来造福社会,并有助于促进隐私保护。它包括为代表不足的群体服务的教育和外联活动,首先是通过直接接触佛罗里达国际大学和德克萨斯农工大学的本科生和研究生,其次是与高中教师合作和指导。该项目将通过一个多部分研究议程进行理论和实证研究,该议程将通过安全的多方计算方法在多机器人场景中实现隐私保护过滤和规划。这项研究的努力代表了与目前对机器人的计算假设的根本背离:它的目标是引入抽象、算法和系统来解决以相互不信任的机器人之间的协作为特征的场景中的机器人任务,这是第一次这样做的系统性努力。这项研究将允许多个机器人协调它们对共享资源的使用,而不会泄露每个机器人拥有的敏感信息,尽管它们的有效合作实际上依赖于这些敏感信息。该研究计划将产生:(1)一组新的几何基元,允许以隐私保护的方式解决运动规划(和相关)问题;(2)为保护隐私而构建的新过滤器;以及(3)用于计算和查询计算拓扑属性的结构,受共享信息的限制。这些成果共同奠定了基础,确立了安全多机器人计算的研究领域。这一奖项反映了NSF的法定使命,并通过使用基金会的智力优势和更广泛的影响审查标准进行评估,被认为值得支持。
英文摘要
As people are starting to face the prospect of robots becoming part of our everyday lives, it has become increasingly clear that the information robots could gather can be both sensitive and valuable. But the robots may need to gather this information in order to function properly: as elsewhere in our lives, we need to understand how to best reconcile the tension between utility and privacy. The scientific progress made to date on algorithms for planning, control, and coordination of multi-robot systems has been enormous, but it also has paid too little attention to "who knows what." This research effort sets out to understand how the essential computational operations underlying many common robotic tasks can be safely accomplished in circumstances where there is some doubt about the integrity of other elements in the system, including whether they can be trusted to never expose information. This is crucial for autonomous robots operating within socially sensitive settings, as well as contested or adversarial scenarios. Beyond the anticipated impact on robotics research, the project will benefit society by addressing questions of strategic national interest and help facilitate privacy protections. It includes education and outreach activities that serve underrepresented groups, firstly via direct engagement with undergraduate and graduate students at Florida International University and Texas A&M, and secondly, in working with and mentoring high school teachers. The project will conduct both theoretical and empirical research, through a multi-part research agenda that will enable privacy-preserving filtering and planning in multi-robot scenarios via secure multi-party computation methods. This research endeavor represents a radical departure from present computational assumptions for robots: it aims to introduce abstractions, algorithms, and systems to solve robot tasks in scenarios characterized by collaboration between mutually distrusting robots, this is the first systematic effort to do so. The research will allow multiple robots to coordinate their use of shared resources, without divulging sensitive information that each robot possesses, despite their effective cooperation actually depending on that sensitive information. The research program will produce: (1) a new set of geometric primitives that allow the solution of motion planning (and related) problems in a privacy-preserving fashion; (2) novel filters, constructed to preserve privacy; and (3) constructions for calculating and querying computational topology properties, subject to limits on information shared. Together, these pieces lay groundwork, establishing the research area of secure multi-robot computation.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(7)
专著(0)
科研奖励(0)
会议论文
On nondeterminism in combinatorial filters
组合滤波器中的非确定性
DOI: 10.1109/icra46639.2022.9812371
发表时间: 2022
期刊: IEEE
影响因子: --
作者: [Zhang, Yulin, Shell, Dylan A.]
通讯作者: Shell, Dylan A.
A general class of combinatorial filters that can be minimized efficiently
一类可以有效最小化的通用组合滤波器
DOI: 10.1109/icra48891.2023.10160479
发表时间: 2023
期刊: IEEE
影响因子: --
作者: [Zhang, Yulin, Shell, Dylan A.]
通讯作者: Shell, Dylan A.
DOI: 10.1109/cdc45484.2021.9683202
发表时间: 2021-12
期刊: 2021 60th IEEE Conference on Decision and Control (CDC)
影响因子: --
作者: [William E. Curran;Cesar A. Rojas;Leonardo Bobadilla;Dylan A. Shell]
通讯作者: William E. Curran;Cesar A. Rojas;Leonardo Bobadilla;Dylan A. Shell
Infrastructure to support robots: a practical, scalable model for comparative evaluation of design choices
支持机器人的基础设施:用于比较评估设计选择的实用、可扩展模型
DOI: --
发表时间: 2023
期刊: IEEE
影响因子: --
作者: [McFassel, Grace, Shell, Dylan A.]
通讯作者: Shell, Dylan A.
6
    The 14th International Workshop on the Algorithmic Foundations of Robotics (WAFR'20) Student Travel Awards
    S&AS: FND: COLLAB: Planning Coordinated Event Observation for Structured Narratives
    RI: Small: Collaborative Research: Why is Automating the Design of Robot Controllers Hard, and What Can Be Done About It
    CAREER: Bridging Self-Organized and Algorithmic Approaches to Multi-Robot Systems
    国内基金
    海外基金
    Research on Quantum Field Theory without a Lagrangian Description
    • 批准号:
      24ZR1403900
    • 项目类别:
      省市级项目
    • 资助金额:
      --
    • 批准年份:
      2024
    • 负责人:
      SATOSHI NAWATA
    • 依托单位:
    Cell Research
    Cell Research
    Cell Research (细胞研究)