首页 /研究 /Decision-Theoretic Planning in the Graphplan Framework
OTHER

Decision-Theoretic Planning in the Graphplan Framework

Gilbert L. Peterson, Diane J. Cook

发表年份
2000
引用次数
3

摘要

We have developed a decision-theoretic planner based upon the Graphplan planning algorithm, DT-Graphplan. DT-Graphplan reasons about probabilities, costs, and rewards at a propositional level, reconstructing limited state information. We are applying the planner to our robot task architecture to function on a miniature golf domain. By incorporating decision theory into planning, we seek to reduce the representational gap between behavior-based robotic controllers and constraint-based symbolic planners. Introduction This paper discusses DT-Graphplan, a decision-theoretic planner that we use as the planning and sequencing layers for a layered robotic architecture. By using a planner at both the symbolic planner level and the sequencer level we hope for a reduction of the work needed to reconfigure a robot for a new task. We will verify this by creating one set of behavior controllers for our robots and demonstrating the effectiveness of the controllers on multiple diverse plans...

关键词

PlannerConstraint (computer-aided design)Task (project management)Domain (mathematical analysis)Artificial intelligenceFunction (biology)Mathematical optimizationState (computer science)Representation (politics)Computer science

相关论文

查看 OTHER 分类全部论文