Scoring Functions of Approximation of STRIPS Planning by Linear Programming

被引：0
|
作者：
Galuszka, Adam [1 ]
机构：
[1] Silesian Tech Univ, Akad 16, PL-44100 Gliwice, Poland
来源：
PROCEEDINGS OF THE 9TH WSEAS INTERNATIONAL CONFERENCE ON SIMULATION, MODELLING AND OPTIMIZATION | 2009年
关键词：
STRIPS planning; computational efficiency; linear programming; COMPUTATIONAL-COMPLEXITY;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
STRIPS planning is a problem of finding of a set of actions that transform given initial state to desired goal situation. It is hard computational problem. In this work an approximation of STRIPS block world planning by linear programming is shown. Additionally two scoring functions have been introduced to estimate quality of the plan. Proposed approach is illustrated by exemplary simulation.
引用
收藏
页码：316 / +
页数：3
相关论文
共 50 条
12345