Dynamic Shortest Path Algorithms and their Applications

动态最短路径算法及其应用

• 批准号: RGPIN-2016-06253
• 负责人: Sack, JörgRüdiger
• 金额: $ 2.77万
• 依托单位: Carleton University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2017
• 资助国家: 加拿大
• 起止时间: 2017-01-01 至 2018-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=634908
• 关键词: Dynamic; Shortest; Path; Algorithms; their

In many applications arising e.g., in Robotics, GIS, Navigation, Social Networks, and Sensor Networks, environments are dynamic. Objects/entities may move, disappear, appear and even change shape. Traditional shortest path algorithms, designed for static environments, would either not be applicable or require frequent recomputations and thus become inefficient.

在许多应用中，在机器人、GIS、导航、社交网络和传感器网络中，环境是动态的。物体/实体可以移动、消失、出现，甚至改变形状。针对静态环境设计的传统最短路径算法要么不适用，要么需要频繁的重新计算，从而变得效率低下。