File Name: automated planning theory and practice .zip
- Principles of Artificial Intelligence
- ACAI Summer School on Automated Planning and Scheduling
- Automated planning and scheduling
- [PDF] Automated Planning: Theory & Practice [PDF] Online
Principles of Artificial Intelligence
Automated planning and scheduling , sometimes denoted as simply AI planning ,  is a branch of artificial intelligence that concerns the realization of strategies or action sequences, typically for execution by intelligent agents , autonomous robots and unmanned vehicles.
Unlike classical control and classification problems, the solutions are complex and must be discovered and optimized in multidimensional space. Planning is also related to decision theory. In known environments with available models, planning can be done offline. Solutions can be found and evaluated prior to execution. In dynamically unknown environments, the strategy often needs to be revised online.
Models and policies must be adapted. Solutions usually resort to iterative trial and error processes commonly seen in artificial intelligence. These include dynamic programming , reinforcement learning and combinatorial optimization. Languages used to describe planning and scheduling are often called action languages. Given a description of the possible initial states of the world, a description of the desired goals, and a description of a set of possible actions, the planning problem is to synthesize a plan that is guaranteed when applied to any of the initial states to generate a state which contains the desired goals such a state is called a goal state.
The difficulty of planning is dependent on the simplifying assumptions employed. Several classes of planning problems can be identified depending on the properties the problems have in several dimensions. The simplest possible planning problem, known as the Classical Planning Problem, is determined by:. Since the initial state is known unambiguously, and all actions are deterministic, the state of the world after any sequence of actions can be accurately predicted, and the question of observability is irrelevant for classical planning.
Further, plans can be defined as sequences of actions, because it is always known in advance which actions will be needed. With nondeterministic actions or other events outside the control of the agent, the possible executions form a tree, and plans have to determine the appropriate actions for every node of the tree. Discrete-time Markov decision processes MDP are planning problems with:. When full observability is replaced by partial observability, planning corresponds to partially observable Markov decision process POMDP.
If there are more than one agent, we have multi-agent planning , which is closely related to game theory. In AI planning, planners typically input a domain model a description of a set of possible actions which model the domain as well as the specific problem to be solved specified by the initial state and goal, in contrast to those in which there is no input domain specified. Such planners are called "domain independent" to emphasize the fact that they can solve planning problems from a wide range of domains.
Typical examples of domains are block-stacking, logistics, workflow management, and robot task planning. Hence a single domain-independent planner can be used to solve planning problems in all these various domains. On the other hand, a route planner is typical of a domain-specific planner. Each possible state of the world is an assignment of values to the state variables, and actions determine how the values of the state variables change when that action is taken.
Since a set of state variables induce a state space that has a size that is exponential in the set, planning, similarly to many other computational problems, suffers from the curse of dimensionality and the combinatorial explosion. An alternative language for describing planning problems is that of hierarchical task networks , in which a set of tasks is given, and each task can be either realized by a primitive action or decomposed into a set of other tasks.
This does not necessarily involve state variables, although in more realistic applications state variables simplify the description of task networks.
Temporal planning can be solved with methods similar to classical planning. The main difference is, because of the possibility of several, temporally overlapping actions with a duration being taken concurrently, that the definition of a state has to include information about the current absolute time and how far the execution of each active action has proceeded. Further, in planning with rational or real time, the state space may be infinite, unlike in classical planning or planning with integer time.
Temporal planning is closely related to scheduling problems. Temporal planning can also be understood in terms of timed automata. Probabilistic planning can be solved with iterative methods such as value iteration and policy iteration , when the state space is sufficiently small.
With partial observability, probabilistic planning is similarly solved with iterative methods, but using a representation of the value functions defined for the space of beliefs instead of states. In preference-based planning, the objective is not only to produce a plan but also to satisfy user-specified preferences.
A difference to the more common reward-based planning, for example corresponding to MDPs, preferences don't necessarily have a precise numerical value. Action names are ordered in a sequence and this is a plan for the robot. Hierarchical planning can be compared with an automatic generated behavior tree. That means, the notation of a behavior graph contains action commands, but no loops or if-then-statements. Conditional planning overcomes the bottleneck and introduces an elaborated notation which is similar to a control flow , known from other programming languages like Pascal.
It is very similar to program synthesis , which means a planner generates sourcecode which can be executed by an interpreter. It has to do with uncertainty at runtime of a plan.
The idea is that a plan can react to sensor signals which are unknown for the planner. The planner generates two choices in advance. For example, if an object was detected, then action A is executed, if an object is missing, then action B is executed. This helps to reduce the state space and solves much more complex problems.
We speak of "contingent planning" when the environment is observable through sensors, which can be faulty. It is thus a situation where the planning agent acts under incomplete information. For a contingent planning problem, a plan is no longer a sequence of actions but a decision tree because each step of the plan is represented by a set of states rather than a single perfectly observable state, as in the case of classical planning.
For example, if it rains, the agent chooses to take the umbrella, and if it doesn't, they may choose not to take it. Michael L. Conformant planning is when the agent is uncertain about the state of the system, and it cannot make any observations. The agent then has beliefs about the real world, but cannot verify them with sensing actions, for instance. These problems are solved by techniques similar to those of classical planning,   but where the state space is exponential in the size of the problem, because of the uncertainty about the current state.
A solution for a conformant planning problem is a sequence of actions. From Wikipedia, the free encyclopedia. This article includes a list of general references , but it remains largely unverified because it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations.
January Learn how and when to remove this template message. Major goals. Knowledge reasoning Planning Machine learning Natural language processing Computer vision Robotics Artificial general intelligence. Symbolic Deep learning Bayesian networks Evolutionary algorithms.
Timeline Progress AI winter. Applications Projects Programming languages. Further information: State space search. This section needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. February Learn how and when to remove this template message.
See also: Sussman anomaly. Main articles: Markov decision process and Partially observable Markov decision process. Main article: Preference-based planning. Short-term human robot interaction through conditional planning and execution.
Conditional nonlinear planning PDF. Artificial Intelligence Planning Systems. Conditional progressive planning under uncertainty. A survey of planning in intelligent agents: from externally motivated to internally motivated systems Technical report. Probabilistic Propositional Planning: Representations and Complexity. Fourteenth National Conference on Artificial Intelligence.
MIT Press. Retrieved Automated Planning and Scheduling. Journal of Artificial Intelligence Research. Effective heuristics and belief tracking for planning with incomplete information.
Recent Advances in AI Planning. Lecture Notes in Computer Science. Springer Berlin Heidelberg. Categories : Automated planning and scheduling.
Hidden categories: CS1 maint: multiple names: authors list Articles lacking in-text citations from January All articles lacking in-text citations Articles needing additional references from February All articles needing additional references All articles with unsourced statements Articles with unsourced statements from February Namespaces Article Talk. Views Read Edit View history. Help Learn to edit Community portal Recent changes Upload file.
Download as PDF Printable version. Major goals Knowledge reasoning Planning Machine learning Natural language processing Computer vision Robotics Artificial general intelligence. Approaches Symbolic Deep learning Bayesian networks Evolutionary algorithms. History Timeline Progress AI winter. Technology Applications Projects Programming languages.
ACAI Summer School on Automated Planning and Scheduling
This stuff was just too hot, and not just because it derived from the work of a Nazi. It was hot because of its incredible, almost limitless implications. Never mind making millions from smart homes. Had that black Mercedes been following him all the way from Dublin. And I did not know whether to laugh or cry.
Scheduling has been the "little brother" of planning since scheduling started being studied within AI in roughly the early s. Modern scheduling, even within AI, increasingly reflects the integration of theory and high-performance algorithmic techniques from Operations Research where scheduling has studied since at least the s. This tutorial is designed to provide an introduction to the core algorithmic technologies in scheduling research, a glimpse of the state-of-the-art, and some wild speculations about the place of scheduling within AI research. In two talks about non-deterministic planning, I plan to cover the most relevant aspects for planning of the underlying mathematical models used for casting probabilistic planning problems, the standard and novel algorithms to solve these models, and the current limitations and challenges that lay ahead for developing successful planners capable of tackling large and complex problems. As we will see, the underlying mathematical models are complex and well understood, there are many algorithms for computing solutions, but very few heuristics.
Automated planning and scheduling , sometimes denoted as simply AI planning ,  is a branch of artificial intelligence that concerns the realization of strategies or action sequences, typically for execution by intelligent agents , autonomous robots and unmanned vehicles. Unlike classical control and classification problems, the solutions are complex and must be discovered and optimized in multidimensional space. Planning is also related to decision theory. In known environments with available models, planning can be done offline. Solutions can be found and evaluated prior to execution. In dynamically unknown environments, the strategy often needs to be revised online.
Here are my lecture slides for Automated Planning: Theory and Practice. I've posted both PDF and PPT versions. I used these slides in a one-semester graduate-.
Automated planning and scheduling
His main interests lay at the intersection of robotics and AI, in the robust integration of perception, action, and reasoning capabili- ties within autonomous robots. He contributed to topics such as object recognition, scene interpretation, heuristics search, pattern matching and unification algorithms, knowledge compiling for real-time synchronous systems, temporal planning, and supervision systems. His work on the latter topic has been focused on the develop- ment of the IxTeT system for planning and chronicle recognition. IxTeT has been applied to robotics as well as to other domains, example, scheduling and process supervision.
Skip to search form Skip to main content You are currently offline. Some features of the site may not work correctly. Ghallab and D. Nau and P. Ghallab , D.
Automated planning technology now plays a significant role in a variety of demanding applications, ranging from controlling space vehicles and robots to playing the game of bridge. These real-world applications create new opportunities for synergy between theory and practice: observing what works well in practice leads to better theories of planning, and better theories lead to better performance of practical applications. Automated Planning mirrors this dialogue by offering a comprehensive, up-to-date resource on both the theory and practice of automated planning.
Я просто попал на все готовое.
[PDF] Automated Planning: Theory & Practice [PDF] Online
Сьюзан закрыла глаза и начала молиться за Дэвида. Ее молитва была проста: она просила Бога защитить любимого человека. Не будучи религиозной, она не рассчитывала услышать ответ на свою молитву, но вдруг почувствовала внезапную вибрацию на груди и испуганно подскочила, однако тут же поняла: вибрация вовсе не была рукой Божьей - она исходила из кармана стратморовского пиджака. На своем Скайпейджере он установил режим вибрации без звонка, значит, кто-то прислал коммандеру сообщение. Шестью этажами ниже Стратмор стоял возле рубильника. В служебных помещениях ТРАНСТЕКСТА было черно как глубокой ночью. Минуту он наслаждался полной темнотой.
Четыре. Три. Эта последняя цифра достигла Севильи в доли секунды. Три… три… Беккера словно еще раз ударило пулей, выпущенной из пистолета. Мир опять замер. Три… три… три… 238 минус 235.
Automated Planning: Theory and Practice. The web site for the book Automated Planning: Theory and. Practice, by Malik Ghallab, Dana Nau, and Paolo.
- Беккер улыбнулся и достал из кармана пиджака ручку. - Я хотел бы составить официальную жалобу городским властям. Вы мне поможете.
Так в чем же проблема, Фил? - спросил Стратмор, открывая холодильник. - Может, чего-нибудь выпьешь. - Нет, а-а… нет, спасибо, сэр. - Ему трудно было говорить - наверное потому, что он не был уверен, что его появлению рады.
И тут же весь обмяк. - Боже всемилостивый, - прошептал Джабба. Камера вдруг повернулась к укрытию Халохота.