.png){kind=icon}
返回
Lifelong planning A
.png){kind=icon}
PRE
AI
DOI：10.1016/j.artint.2003.12.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Heuristic search methods promise to find shortest paths for path-planning problems faster than uninformed search methods. Incremental search methods, on the other hand, promise to find shortest paths for series of similar path-planning problems faster than is possible by solving each path-planning problem from scratch. In this article, we develop Lifelong Planning A* (LPA*) an incremental version of A* that combines ideas from the artificial intelligence and the algorithms literature. It repeatedly finds shortest paths from a given start vertex to a given goal vertex while the edge costs of a graph change or vertices are added or deleted. Its first search is the same as that of a version of A* that breaks ties in favor of vertices with smaller g-values but many of the subsequent searches are potentially faster because it reuses those parts of the previous search tree that are identical to the new one. We present analytical results that demonstrate its similarity to A* and experimental results that demonstrate its potential advantage in two different domains if the path-planning problems change only slightly and the changes are close to the goal. (C) 2004 Published by Elsevier B.V.
Keyword:
A*
continual planning
heuristic search
heuristic search-based planning
incremental search
lifelong planning
plan reuse
replanning
symbolic STRIPS-style planning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
分享收藏Complications of Transperitoneal Laparoscopic Nephrectomy: A Single-center Experience.png)
Urology
UrologyIF0
PREAI
分享收藏
查看更多内容