• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Persistence Search - A New Search Strategy for the Dynamic Shortest Path Problem
【24h】

Persistence Search - A New Search Strategy for the Dynamic Shortest Path Problem

机译：持久性搜索 - 动态最短路径问题的一种新搜索策略

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The research reported in this paper deals with the problem of searching throughan unknown terrain by a physical agent such as a robot. The unknown terrain over which the agent will travel is represented by an undirected graph. The agent has no prior knowledge of the graph. It can only learn about its environment by physically roaming it. Given a starting location s, the agent tries to reach a target location t using the minimum amount of physical movement. This problem, which is a natural generalization of the classical shortest path problem, will be referred to as the dynamic shortest path problem. Most of the classical shortest path algorithms perform very poorly in the scenario of a physical agent traversing an initially unknown search space. They do not attempt to minimize the amount of physical movement required by the agent to reach the goal location. In order to overcome the failings of these search algorithms in dealing with searches of this particular nature, a new search strategy, called persistence search, is developed and presented in this paper.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号