This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
en:dydaktyka:planning:intro [2018/04/16 11:50] msl [Solutions] |
en:dydaktyka:planning:intro [2020/04/14 11:26] (current) msl |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Automated Planning: 101 ====== | ====== Automated Planning: 101 ====== | ||
| + | |||
| + | <WRAP center round important 60%> | ||
| + | Due to the COVID-19 outbreak, all files related to this class are stored in the [[https://gitlab.com/agh-krr/2019-2020/labs-planning|Gitlab repository]]. This class uses files stored in the ''00_intro'' folder. Please refer to the ''Readme.md'' on how to submit the solutions. | ||
| + | </WRAP> | ||
| This class is an introduction to a very important and omnipresent (i.e.: industry, robotics, video games etc.) discipline of AI – planning. Planning consists in finding a series of actions (called “a plan”), which used on a initial state S will conclude in achieving goal state G. Every action has conditions in which it can be executed, and effects of its application. Planning is difficult: without adequate constraints on actions, the complexity reaches the ''PSPACE''-complete class (worse than ''NP'' problems class, which includes the problems of discrete optimization). Furthermore, real (not toylike) problems may contain additional factors increasing their difficulty: | This class is an introduction to a very important and omnipresent (i.e.: industry, robotics, video games etc.) discipline of AI – planning. Planning consists in finding a series of actions (called “a plan”), which used on a initial state S will conclude in achieving goal state G. Every action has conditions in which it can be executed, and effects of its application. Planning is difficult: without adequate constraints on actions, the complexity reaches the ''PSPACE''-complete class (worse than ''NP'' problems class, which includes the problems of discrete optimization). Furthermore, real (not toylike) problems may contain additional factors increasing their difficulty: | ||
| Line 28: | Line 32: | ||
| == Assignments == | == Assignments == | ||
| - | - Please define admissible heuristics for the blocks world | + | - Please define an [[https://en.wikipedia.org/wiki/Admissible_heuristic|admissible heuristics]] for the blocks world |
| === Encoding as a Discrete Optimization Problem === | === Encoding as a Discrete Optimization Problem === | ||
| Line 78: | Line 82: | ||
| {{ :en:dydaktyka:planning:dont-panic.jpg?nolink&200|}} | {{ :en:dydaktyka:planning:dont-panic.jpg?nolink&200|}} | ||
| - | - Check [[ https://swish.swi-prolog.org/p/blocks_strips_planner.pl |a simple STRIPS planner for the blocks worlds]]. If you know Prolog, read the last lines of the file to understand how the planner works. If you haven't seen Prolog before, don't panic, keep calm and go to the next assignments. | + | - Check [[ https://swish.swi-prolog.org/p/block_strips_player_v2.pl |a simple STRIPS planner for the blocks worlds]]. If you know Prolog, read the last lines of the file to understand how the planner works. If you haven't seen Prolog before, don't panic, keep calm and go to the next assignments. |
| - Fill ''%TODO:'' sections: | - Fill ''%TODO:'' sections: | ||
