课题基金 / 基金详情

CRII:IIS:Topology Aware Configuration Spaces

CRII:IIS:Topology Aware Configuration Spaces
CRII:IIS:拓扑感知配置空间
批准号:
1850319
负责人:
Chinwe Ekenna
金额:
$17.41万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2019
资助国家:
美国
项目状态:
已结题
起止时间:
2019-06-01 至 2022-05-31

项目摘要

项目成果

Chinwe Ekenna的其他基金

相似基金

相关文献

中文摘要
翻译
运动规划是机器人学中的一个重要概念,定义很简单--为机器人找到一条从起点到目标位置的路径,其中起点和目标由机器人预期执行的任务确定,例如,在工厂里导航,操纵手臂拿起物体等。然而,这很难建模和计算。要有效地规划运动,必须事先拥有关于机器人环境的完整信息,然后建立有效的算法来生成机器人可以利用的轨迹;不幸的是,事实证明这很难实现。为了缓解这一缺点,基于采样的算法被开发出来,这些算法近似地给出了关于环境的信息。对这些算法的分析表明,如果存在轨迹,这些采样算法就会找到这样的轨迹。然而,出现的问题是,环境信息的近似程度如何才能确保高成功率。这个项目将开发更好地近似环境信息规划空间的算法,通过使用基于拓扑学和几何的公式为这种近似产生一个度量。该项目将给予采样算法更多的控制,以帮助确定环境中哪些区域需要更多的关注和表示,这反过来将改善执行运动规划所需的时间。由于对即使在接近规划空间时也是快速和准确的运动规划算法的日益增长的需求,以及对这种近似的测量以便更好地操纵和控制规划过程的需要,该项目旨在设计一组形式表示和算法来a)更好地表征规划空间的拓扑,b)结合形式方法来规划和近似规划空间,C)提供这种近似的测量,并利用该信息更好地指导困难地区的规划,以及d)随后减少规划时间和内存使用,这将潜在地导致更实时的规划算法。此外,本项目中开发的算法和定理将适用于任何类型的环境(动态、复杂或异质)中的任何规划方法。因此,这项研究消除了目前运动规划实践中的一个主要障碍,在那里,近似技术是最先进的。该项目将极大地提高运动规划算法的可扩展性,因为它在拓扑上丰富了信息,测量了规划空间中的采样近似,并随后对这些规划空间进行了更全面的描述。这个项目将以一种独特和新颖的方式捕捉规划空间的拓扑结构,使用数学公式,如Vietoris Rips Complex,图形“粘合”,并创新地使用规划算法中的单纯折叠。该奖项反映了NSF的法定使命,并通过使用基金会的智力价值和更广泛的影响审查标准进行评估,被认为值得支持。
英文摘要
Motion planning is an important concept in robotics with a simple definition - find a path for a robot from its start to a goal position, where the start and goal is determined by the task the robot is expected to perform e.g., navigate a factory floor, manipulate an arm to pick up an object etc. This however is difficult to model and compute. To efficiently plan motions neccessitates having complete information about the robot's environment beforehand, then building efficient algorithms that produces a trajectory the robot can utilize; unfortunately, this has proven difficult to achieve. To mitigate this shortcoming, sampling-based algorithms were developed that approximate the information given about the environment. Analysis of these algorithms shows that if a trajectory exists, these sampling algorithms will find such trajectory. The question that arises, though, is how well was the environment information approximated to ensure a high success rate. This project will develop algorithms that better approximate the environment information planning space by producing a measure for this approximation using topology and geometric based formulations. This project will give more control to sampling algorithms to help determine what areas in the environment needs more attention and representation, which will in turn improve on the time needed to perform motion planning.Motivated by the increasing need for motion planning algorithms that are fast and accurate even when they approximate the planning space, and a need to also measure such approximations so as to better manipulate and control the planning process, this project aims to devise a set of formal representations and algorithms to a) better characterize the topology of the planning space, b) combine formal methods to plan and approximate the planning space, c) provide a measure of such approximations and utilize this information to better guide planning in difficult regions, and d) subsequently reduce planning time and memory use which will potentially lead to more real time planning algorithms. In addition, the algorithms and theorems developed in this project will be adaptable to any planning method in any type of environment (dynamic, complex or heterogeneous). This research thus removes a major barrier in the current practice of motion planning where approximate techniques are the state of the art. This project will greatly increase the scalability of motion planning algorithms because it will be topologically rich with information, measure the sampling approximations made in the planning space, and subsequently give a more informed description of these planning spaces. This project will capture in a unique and novel way the topology of the planning space using mathematical formulations such as the Vietoris Rips complex, graph "gluing", and an innovative use of simplicial collapses in planning algorithms.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.
期刊论文(3)
专著(0)
科研奖励(0)
会议论文
DOI: 10.1109/icra40945.2020.9197064
发表时间: 2020-05
期刊: 2020 IEEE International Conference on Robotics and Automation (ICRA)
影响因子: --
作者: [Souravik Dutta;Banafsheh Rekabdar;Chinwe Ekenna]
通讯作者: Souravik Dutta;Banafsheh Rekabdar;Chinwe Ekenna
Identifying Valid Robot Configurations via a Deep Learning Approach
通过深度学习方法识别有效的机器人配置
DOI: 10.1109/iros51168.2021.9636742
发表时间: 2021
期刊: Identifying Valid Robot Configurations via a Deep Learning Approach
影响因子: --
作者: [Tran, Tuan, Ekenna, Chinwe]
通讯作者: Ekenna, Chinwe
Approximating Cfree space topology by constructing Vietoris-Rips complex
通过构造 Vietoris-Rips 复合体近似 Cfree 空间拓扑
DOI: --
发表时间: 2019
期刊: Proceedings of the International Conference on Intelligent Robots and Systems
影响因子: --
作者: [Aakriti, Upadhyay, Weifu, Wang, Chinwe, Ekenna]
通讯作者: Chinwe, Ekenna
Collaborative Research: Conference: Workshop on Computational Structural Biology 2022
  • 批准号:
    2231498
  • 项目类别:
    Standard Grant
  • 资助金额:
    $1.5万
  • 财政年份:
    2022
  • 负责人:
    Chinwe Ekenna
  • 依托单位:
Robotics Science and Systems 2019 Meet the Women in Robotics Workshop
  • 批准号:
    1932641
  • 项目类别:
    Standard Grant
  • 资助金额:
    $1.11万
  • 财政年份:
    2019
  • 负责人:
    Chinwe Ekenna
  • 依托单位:
国内基金
海外基金
高稳定性IIS型限制性内切酶开发
  • 批准号:
  • 项目类别:
    省市级项目
  • 资助金额:
    --
  • 批准年份:
    2026
  • 负责人:
    郝超
  • 依托单位:
营养限制下IIS-TORC1信号通路调控雌性蜜蜂幼虫卵巢细胞凋亡的分子机制
  • 批准号:
    32472969
  • 项目类别:
    面上项目
  • 资助金额:
    50.00万元
  • 批准年份:
    2024
  • 负责人:
    王颖
  • 依托单位:
基于IIS/TOR信号途径探究蜂王浆外泌体lncRNA调控西方蜜蜂级型分化的分子机制
  • 批准号:
    32302811
  • 项目类别:
    青年科学基金项目
  • 资助金额:
    30万元
  • 批准年份:
    2023
  • 负责人:
    郗学鹏
  • 依托单位:
IIS/FoxO通路调控Argopecten属扇贝寿命的分子机制