首页 /研究 /A path-space search algorithm for motion planning with uncertainties
OTHER

A path-space search algorithm for motion planning with uncertainties

Lance Page, Arthur C. Sanderson

发表年份
2002
引用次数
11

摘要

This paper describes an algorithm for adjusting a robot motion plan in order to make it feasible in spite of control and sensing uncertainties in the robot configuration. The type of motion plan considered consists of a nominal commanded path, augmented by sensing mode specifications. The algorithm uses a bounding-set representation of uncertainties, which is also described. The control uncertainty is history independent, but the sensing uncertainty at one point in a plan depends on the prior sensing actions and the path traversed. The algorithm is a path-space algorithm, because it adjusts the entire plan simultaneously as it carries out the search.

关键词

Motion planningBounding overwatchPlan (archaeology)Path (computing)Computer scienceRepresentation (politics)Set (abstract data type)AlgorithmPoint (geometry)Robot

相关论文

查看 OTHER 分类全部论文