首页 /研究 /Agent-centered search
OTHER

Agent-centered search

Sven Koenig

发表年份
2001
引用次数
94

摘要

In this article, we describe agent-centered search (sometimes also called real-time search or local search) and illustrate this planning paradigm with examples. Agent-centered search methods interleave planning and plan execution and restrict planning to the part of the domain around the current state of the agent, for example, the current location of a mobile robot or the current board position of a game. They can execute actions in the presence of time constraints and often have a small sum of planning and execution cost, both because they trade-off planning and execution cost and because they allow agents to gather information early in nondeterministic domains, which reduces the amount of planning they have to perform for unencountered situations. These advantages become important as more intelligent systems are interfaced

关键词

Nondeterministic algorithmComputer scienceReinforcement learningVariety (cybernetics)Markov decision processMotion planningAutomated planning and schedulingMobile robotPlan (archaeology)Process (computing)

相关论文

查看 OTHER 分类全部论文