课题基金 / 基金详情

Searching, algorithms and complexity

Searching, algorithms and complexity
搜索、算法和复杂性
批准号:
124570-2013
负责人:
Dymond, Patrick
金额:
$1.09万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2013
资助国家:
加拿大
项目状态:
已结题
起止时间:
2013-01-01 至 2014-12-31

项目摘要

项目成果

Dymond, Patrick的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
This proposal for research in Computer Science deals with parallel computing and complexity as applied to problems in the area of multi-agent mobile robotics. The challenge of computing using parallel computers now faces almost every area of computing. Past economic advances due to progress in computing have depended in large part on continuing improvements in individual processor speeds, but processor speeds are no longer increasing as rapidly as before. Instead, computing in parallel is becoming the main direction for progress. The challenge is to make effective use of parallel hardware in many new contexts. The research proposed here is principally focused on parallel and distributed computing problems that are related to mobile robotics. This area of research focuses on finding methods for using multiple moving robots. (1) The simultaneous location and mapping (SLAM) problem deals with the question of "where am I'' for robots trying to create a map of their local world. This problem is important for the deployment of robots in unknown environments, such as unexplored terrain or severely hazardous locations. We will study sensor requirements and algorithms needed to solve this SLAM problem in different environments. (2) Leader election is another key problem in distributed computing, important as a basis for many other problems. We consider a set of independent robots with very limited communication capabilities, each one executing an algorithm in order for them together to jointly complete some task. We will further develop methods for the agents to quickly find a leader, and other basic tasks, by simple one-to-one communications when they meet, even not knowing the actual number of robots involved. (3) High-dimensional robot path planning is important in moving robots to perform tasks. We plan work on a probabilistic approach to this problem. One place where this could be used is planning motions necessary to efficiently move a complicated tentacle-like robot arm with many joints.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Searching, algorithms and complexity
  • 批准号:
    124570-2013
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.09万
  • 财政年份:
    2019
  • 负责人:
    Dymond, Patrick
  • 依托单位:
Searching, algorithms and complexity
  • 批准号:
    124570-2013
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.09万
  • 财政年份:
    2017
  • 负责人:
    Dymond, Patrick
  • 依托单位:
Searching, algorithms and complexity
  • 批准号:
    124570-2013
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.09万
  • 财政年份:
    2014
  • 负责人:
    Dymond, Patrick
  • 依托单位:
Complexity and parallel algorithms
  • 批准号:
    124570-2010
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.09万
  • 财政年份:
    2012
  • 负责人:
    Dymond, Patrick
  • 依托单位:
国内基金
海外基金
固定参数可解算法在平面图问题的应用以及和整数线性规划的关系
  • 批准号:
    60973026
  • 项目类别:
    面上项目
  • 资助金额:
    32.0万元
  • 批准年份:
    2009
  • 负责人:
    鲁道夫
  • 依托单位:
Computational Methods for Analyzing Toponome Data