Abstract
STRIPS language is a convenient representation for artificial intelligence planning problems. Planning is a task of coming up with a sequence of actions that will achieve a goal. In this work a heuristic of polynomial transformation of STRIPS planning problem to linear programming problem (LP) is presented. This is done because planning problems are hard computational problems (PSPACE- complete in general case) and LP problems are known to be computational easy. Representation of STRIPS planning as a set of equalities and inequalities based on the transformation is also proposed. The exemplary simulation shows the computational efficiency of solving planning problem with proposed transformation.
| Original language | English |
|---|---|
| Pages (from-to) | 243-267 |
| Number of pages | 25 |
| Journal | Archives of Control Sciences |
| Volume | 21 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2011 |
Keywords
- Block world
- Computational complexity
- Linear programming
- Planning
- Problem solving
- Uncertainty
ASJC Scopus subject areas
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization
Fingerprint
Dive into the research topics of 'On transformation of STRIPS planning to linear programming'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver