首页 /研究 /Toward task oriented localization
OTHER

Toward task oriented localization

Patric Jensfelt, David Austin, Henrik I. Christensen

发表年份
2000
引用次数
3

摘要

In the course of building a fully autonomous robot platform it is important to look at the computational resources spent by the indi- vidual modules. Each of them cannot be greedy, or the overall demand for computational power will be beyond what can be handled on-board. Maintaining an estimate of the pose of a mobile robot is a typical exam- ple where we might not always need to run the algorithm at the highest possible rate. This paper deals with the problem of determining how much e ort is needed in order to accomplish the localization part of a task. The approach we have taken to the problem is to optimize a cost function that accounts for the cost of sensing and the growth of the uncertainty.

关键词

Task (project management)Computer scienceMobile robotRobotGreedy algorithmFunction (biology)Order (exchange)Computational complexity theoryArtificial intelligenceEngineering

相关论文

查看 OTHER 分类全部论文