On the complexity of blocks-world planning
Artificial Intelligence
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Computational complexity of planning and approximate planning in the presence of incompleteness
Artificial Intelligence
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
Hi-index | 0.00 |
Planning belongs to fundamental AI domains. Examples of planning applications are manufacturing, production planning, logistics and agentics. In real world applications knowledge about environment is incomplete, uncertain and approximate. It implies that planning in the presence of different kind of uncertainty is more complex than classical planning. Aim of this paper is to show the way of reasoning basing on the incomplete information about the initial state of planning problem. The proper reasoning about the state of the problem can reduce such understood uncertainty and then increase efficiency of planning. The article presents an algorithm created in order to reason the state of scene from block world basing on incomplete information from two cameras observing the scene from top and side. The algorithm is explained using an example. Additionally, possible types of uncertainties are presented.