Block world planning with incomplete information and sensing actions as linear programming problem

In the paper block world environment with STRIPS representation is presented as linear programming problem. It is also assumed that information about state of the problem may be incomplete and its influance to linear programming problem solution is shown. Planning in the presence of incompleteness is much more harder. It causes difficulties in solving real application problems. To increase efficiency of solving such problems a transformation to Linear Programming Problem is proposed. Translation of the STRIPS planning to linear programming is based on assumption of the number of planning steps and mapping conditions and oparators in each planning step to variables. Variables are mapped to values between 0 and 1: it corresponds to truth degree of conditions and operators.