Planning with Uncertainty in Action Outcomes as Linear Programming Problem

Authors:
Adam Galuszka;Andrzej Holdyk
Affiliations:
Silesian University of Technology, Gliwice, Poland 44-100;Silesian University of Technology, Gliwice, Poland 44-100
Venue:
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Year:
2009

Citing 7
Cited 0

On the complexity of blocks-world planning

Artificial Intelligence
The computational complexity of propositional STRIPS planning

Artificial Intelligence
Biometric identification

Communications of the ACM
Computational complexity of planning and approximate planning in the presence of incompleteness

Artificial Intelligence
Blocks World revisited

Artificial Intelligence
A heuristic rule for relocating blocks

Computers and Operations Research
A linear programming heuristic for optimal planning

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Planning is a difficult computational problem. One way to increase efficiency of searching for a solution may be a transformation of a problem to another problem and then search for a solution of the transformed problem. In this work a transformation of STRIPS planning problem with uncertainty of operators outcomes to linear programming is shown. The transformation from planning to Linear Programming is based on mapping of conditions and operators in each plan step to variables. Exemplary simulation shows properties of proposed approach.