返回
Using interpolation to improve path planning:: The field D* algorithm
DOI:10.1002/rob.20109.png)
摘要
En 中文
We present an interpolation-based planning and replanning algorithm for generating low-cost paths through uniform and nonuniform resolution grids. Most grid-based path planners use discrete state transitions that artificially constrain an agent's motion to a small set of possible headings (e.g., 0, pi/4, pi/2, etc.). As a result, even optimal grid-based planners produce unnatural, suboptimal paths. Our approach uses linear interpolation during planning to calculate accurate path cost estimates for arbitrary positions within each grid cell and produce paths with a range of continuous headings. Consequently, it is particularly well suited to planning low-cost trajectories for mobile robots. In this paper, we introduce a version of the algorithm for uniform resolution grids and a version for nonuniform resolution grids. Together, these approaches address two of the most significant shortcomings of grid-based path planning: the quality of the paths produced and the memory and computational requirements of planning over grids. We demonstrate our approaches on a number of example planning problems, compare them to related algorithms, and present several implementations on real robotic systems. (c) 2006 Wiley Periodicals, Inc.
Keyword:
MOBILE ROBOTS
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.2
论文数:
1.7K
被引数:
6.0K
机构
暂无机构信息
引用论文
Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间?
Fuzzy-controlled Localized Route-repair (FLRR) for On-demand Routing Protocols in Mobile Ad hoc Networks移动自组织网络中按需路由协议的模糊控制本地化路由修复 (FLRR)

