The model proposed constitutes a "core" representation that can be adopted as a basis for developing different planning domain description languages it is suitable to be used across different levels of abstraction during the processes of language development and domain knowledge engineering, and it facili- tates the elicitation, maintenance and re-use of planning domain descriptions. A theoretical analysis shows how the representation can be easily encoded using formal languages, and demonstrates that setGraphs are at least as expressive as a standard modern propositional planning domain description language. The problems may have multiple towers in the initial state and in the goal state. Increase the number of blocks present in the container by one and cost for this operation is Y. We generated random Blocks World problems scaling the number of blocks. Through various practical examples, setGraphs are shown to yield simpler and more intuitive domain encodings, and to offer a high degree of elaboration tolerance. Given a number N, the task is to build N blocks from 1 block by performing following operation: Double the number of blocks present in the container and cost for this operation is X. SetGraphs represent actions, states and goals in terms of set- and graph-theoretic constructs. Solution to block world problem in AI Lab using bfs, dfs, depth limited search and iterative deepening - block-world-problem-ai/main. This paper proposes a diagrammatic "meta-language" for planning domain descriptions based on setGraphs as an alternative to sentential languages. The com- plexity of sentential formalisms has been of hindrance to the wider dissemination and take up of planning technology beyond the planning research community. All modern planning domain description languages are sentential.
Sentential descriptions are usually more expres- sive than diagrammatic ones, but tend to present a more complex and less intuitive notation. Sentential and diagrammatic representations are two different formalisms for describing domains and problems.
0 kommentar(er)
