The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON COMPUTERS
Transactions ID Number: 29-787
Full Name: Adam Galuszka
Position: Assistant Professor
Age: ON
Sex: Male
Address: Akademicka 16, 44-100 Gliwice
Country: POLAND
Tel: 32 237 11 08
Tel prefix: +48
Fax: 32 237 11 65
E-mail address: Adam.Galuszka@polsl.pl
Other E-mails:
Title of the Paper: Scoring Functions of Approximation of STRIPS Planning by Linear Programming ¡V Block World example
Authors as they appear in the Paper: Adam Galuszka
Email addresses of all the authors: Adam.Galuszka@polsl.pl
Number of paper pages: 10
Abstract: 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. The cost of such approach is that algorithm can results in non-interpretable solutions for some initial states (what is followed by assumption P „j NP). This is because the discrete domain (truth or false) is transformed to continuous domain (LP program). Additionally two scoring functions have been introduced to estimate quality of the plan. Proposed approach is illustrated by exemplary simulation.
Keywords: STRIPS planning, Block world, computational efficiency, linear programming
EXTENSION of the file: .pdf
Special (Invited) Session: Scoring Functions of Approximation of STRIPS Planning by Linear
Organizer of the Session: 617-379
How Did you learn about congress:
IP ADDRESS: 123.115.199.19
