Five Years of Tractable Planning
نویسندگان
چکیده
We summarize the results from the rst ve years of a project aiming at identifying tractable classes of planning problems and investigate sources of computational diiculties in planning. The paper is a non-formal survey, including also historical remarks on the background of the project as well as discussion and motivation of the underlying assumptions, the methodology and the intended applications.
منابع مشابه
Forecasting and retrospection analysis of Tehran Municipality’s five years plan in human resource sector
Tehran Municipality has had two five-year plans so far and the third one is being formulated these days. However, investigating the sector relating to the human resources shows that there is a gap between present condition and the optimal situation in several domains. This article is an attempt to investigate the five-year plans in the domain of human resources via a practical model of forecast...
متن کاملComplexity Results for Planning
I describe several computational complexity results for planning, some of which identify tractable planning problems. The model of planning, called "propositional planning," is simple—conditions within operators are literals with no variables allowed. The different plan ning problems are defined by different restrictions on the preconditions and postconditions of operators. The main results ar...
متن کاملTractable Classes of a Problem of Finding Supporting Actions for a Goal in AI Planning
We are studying tractable classes of a problem of finding supporting actions for a goal using projection global consistency. The projection consistency is a recent technique designed to prune the search space along the search for supports for a sub-goal in AI planning context. The problem of finding supporting actions for a sub-goal (briefly supports problem) is exactly what the GraphPlan plann...
متن کاملTractable Planning with State Variables by Exploiting Structural Restrictions
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is probably necessary to study also structural restrictions on the state-transition graph. Such restrictions are typically computationally hard to test, though, since this graph is of exponential size. Hence, we take an i...
متن کاملStructural Patterns of Tractable Sequentially-Optimal Planning
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting numerous structural characteristics of planning problems, and a constructive proof technique that connects between certain tools from planning and tractable constraint optimization. In particular, we believe that struc...
متن کامل