Newer
Older
{
"cell_type": "markdown",
"metadata": {
"collapsed": true
},
"source": [
"# Planning: planning.py; chapters 10-11"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"This notebook describes the [planning.py](https://github.com/aimacode/aima-python/blob/master/planning.py) module, which covers Chapters 10 (Classical Planning) and 11 (Planning and Acting in the Real World) of *[Artificial Intelligence: A Modern Approach](http://aima.cs.berkeley.edu)*. See the [intro notebook](https://github.com/aimacode/aima-python/blob/master/intro.ipynb) for instructions.\n",
"\n",
"We'll start by looking at `PDDL` and `Action` data types for defining problems and actions. Then, we will see how to use them by trying to plan a trip from *Sibiu* to *Bucharest* across the familiar map of Romania, from [search.ipynb](https://github.com/aimacode/aima-python/blob/master/search.ipynb). Finally, we will look at the implementation of the GraphPlan algorithm.\n",
"\n",
"The first step is to load the code:"
]
},
"outputs": [],
"source": [
"from planning import *"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"To be able to model a planning problem properly, it is essential to be able to represent an Action. Each action we model requires at least three things:\n",
"* preconditions that the action must meet\n",
"* the effects of executing the action\n",
"* some expression that represents the action"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Planning actions have been modelled using the `Action` class. Let's look at the source to see how the internal details of an action are implemented in Python."
]
},
{
"cell_type": "code",
"execution_count": 2,
{
"cell_type": "markdown",
"metadata": {},
"source": [
"It is interesting to see the way preconditions and effects are represented here. Instead of just being a list of expressions each, they consist of two lists - `precond_pos` and `precond_neg`. This is to work around the fact that PDDL doesn't allow for negations. Thus, for each precondition, we maintain a separate list of those preconditions that must hold true, and those whose negations must hold true. Similarly, instead of having a single list of expressions that are the result of executing an action, we have two. The first (`effect_add`) contains all the expressions that will evaluate to true if the action is executed, and the the second (`effect_neg`) contains all those expressions that would be false if the action is executed (ie. their negations would be true).\n",
"\n",
"The constructor parameters, however combine the two precondition lists into a single `precond` parameter, and the effect lists into a single `effect` parameter."
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"The `PDDL` class is used to represent planning problems in this module. The following attributes are essential to be able to define a problem:\n",
"* a goal test\n",
"* an initial state\n",
"* a set of viable actions that can be executed in the search space of the problem\n",
"\n",
"View the source to see how the Python code tries to realise these."
]
},
{
"cell_type": "code",
"execution_count": 3,
"outputs": [],
"source": [
"%psource PDDL"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"The `initial_state` attribute is a list of `Expr` expressions that forms the initial knowledge base for the problem. Next, `actions` contains a list of `Action` objects that may be executed in the search space of the problem. Lastly, we pass a `goal_test` function as a parameter - this typically takes a knowledge base as a parameter, and returns whether or not the goal has been reached."
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Now lets try to define a planning problem using these tools. Since we already know about the map of Romania, lets see if we can plan a trip across a simplified map of Romania.\n",
"\n",
"Here is our simplified map definition:"
]
},
{
"cell_type": "code",
"execution_count": 4,
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
"outputs": [],
"source": [
"from utils import *\n",
"# this imports the required expr so we can create our knowledge base\n",
"\n",
"knowledge_base = [\n",
" expr(\"Connected(Bucharest,Pitesti)\"),\n",
" expr(\"Connected(Pitesti,Rimnicu)\"),\n",
" expr(\"Connected(Rimnicu,Sibiu)\"),\n",
" expr(\"Connected(Sibiu,Fagaras)\"),\n",
" expr(\"Connected(Fagaras,Bucharest)\"),\n",
" expr(\"Connected(Pitesti,Craiova)\"),\n",
" expr(\"Connected(Craiova,Rimnicu)\")\n",
" ]"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Let us add some logic propositions to complete our knowledge about travelling around the map. These are the typical symmetry and transitivity properties of connections on a map. We can now be sure that our `knowledge_base` understands what it truly means for two locations to be connected in the sense usually meant by humans when we use the term.\n",
"\n",
"Let's also add our starting location - *Sibiu* to the map."
]
},
{
"cell_type": "code",
"execution_count": 5,
"outputs": [],
"source": [
"knowledge_base.extend([\n",
" expr(\"Connected(x,y) ==> Connected(y,x)\"),\n",
" expr(\"Connected(x,y) & Connected(y,z) ==> Connected(x,z)\"),\n",
" expr(\"At(Sibiu)\")\n",
" ])"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"We now have a complete knowledge base, which can be seen like this:"
]
},
{
"cell_type": "code",
"execution_count": 6,
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
"outputs": [
{
"data": {
"text/plain": [
"[Connected(Bucharest, Pitesti),\n",
" Connected(Pitesti, Rimnicu),\n",
" Connected(Rimnicu, Sibiu),\n",
" Connected(Sibiu, Fagaras),\n",
" Connected(Fagaras, Bucharest),\n",
" Connected(Pitesti, Craiova),\n",
" Connected(Craiova, Rimnicu),\n",
" (Connected(x, y) ==> Connected(y, x)),\n",
" ((Connected(x, y) & Connected(y, z)) ==> Connected(x, z)),\n",
" At(Sibiu)]"
]
},
"execution_count": 6,
"metadata": {},
"output_type": "execute_result"
}
],
"source": [
"knowledge_base"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"We now define possible actions to our problem. We know that we can drive between any connected places. But, as is evident from [this](https://en.wikipedia.org/wiki/List_of_airports_in_Romania) list of Romanian airports, we can also fly directly between Sibiu, Bucharest, and Craiova.\n",
"\n",
"We can define these flight actions like this:"
]
},
{
"cell_type": "code",
"execution_count": 7,
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
"outputs": [],
"source": [
"#Sibiu to Bucharest\n",
"precond_pos = [expr('At(Sibiu)')]\n",
"precond_neg = []\n",
"effect_add = [expr('At(Bucharest)')]\n",
"effect_rem = [expr('At(Sibiu)')]\n",
"fly_s_b = Action(expr('Fly(Sibiu, Bucharest)'), [precond_pos, precond_neg], [effect_add, effect_rem])\n",
"\n",
"#Bucharest to Sibiu\n",
"precond_pos = [expr('At(Bucharest)')]\n",
"precond_neg = []\n",
"effect_add = [expr('At(Sibiu)')]\n",
"effect_rem = [expr('At(Bucharest)')]\n",
"fly_b_s = Action(expr('Fly(Bucharest, Sibiu)'), [precond_pos, precond_neg], [effect_add, effect_rem])\n",
"\n",
"#Sibiu to Craiova\n",
"precond_pos = [expr('At(Sibiu)')]\n",
"precond_neg = []\n",
"effect_add = [expr('At(Craiova)')]\n",
"effect_rem = [expr('At(Sibiu)')]\n",
"fly_s_c = Action(expr('Fly(Sibiu, Craiova)'), [precond_pos, precond_neg], [effect_add, effect_rem])\n",
"\n",
"#Craiova to Sibiu\n",
"precond_pos = [expr('At(Craiova)')]\n",
"precond_neg = []\n",
"effect_add = [expr('At(Sibiu)')]\n",
"effect_rem = [expr('At(Craiova)')]\n",
"fly_c_s = Action(expr('Fly(Craiova, Sibiu)'), [precond_pos, precond_neg], [effect_add, effect_rem])\n",
"\n",
"#Bucharest to Craiova\n",
"precond_pos = [expr('At(Bucharest)')]\n",
"precond_neg = []\n",
"effect_add = [expr('At(Craiova)')]\n",
"effect_rem = [expr('At(Bucharest)')]\n",
"fly_b_c = Action(expr('Fly(Bucharest, Craiova)'), [precond_pos, precond_neg], [effect_add, effect_rem])\n",
"\n",
"#Craiova to Bucharest\n",
"precond_pos = [expr('At(Craiova)')]\n",
"precond_neg = []\n",
"effect_add = [expr('At(Bucharest)')]\n",
"effect_rem = [expr('At(Craiova)')]\n",
"fly_c_b = Action(expr('Fly(Craiova, Bucharest)'), [precond_pos, precond_neg], [effect_add, effect_rem])"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"And the drive actions like this."
]
},
{
"cell_type": "code",
"execution_count": 8,
"outputs": [],
"source": [
"#Drive\n",
"precond_pos = [expr('At(x)')]\n",
"precond_neg = []\n",
"effect_add = [expr('At(y)')]\n",
"effect_rem = [expr('At(x)')]\n",
"drive = Action(expr('Drive(x, y)'), [precond_pos, precond_neg], [effect_add, effect_rem])"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Finally, we can define a a function that will tell us when we have reached our destination, Bucharest."
]
},
{
"cell_type": "code",
"execution_count": 9,
"outputs": [],
"source": [
"def goal_test(kb):\n",
" return kb.ask(expr(\"At(Bucharest)\"))"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Thus, with all the components in place, we can define the planning problem."
]
},
{
"cell_type": "code",
"execution_count": 10,
"outputs": [],
"source": [
"prob = PDDL(knowledge_base, [fly_s_b, fly_b_s, fly_s_c, fly_c_s, fly_b_c, fly_c_b, drive], goal_test)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"# Air Cargo Problem:"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Air Cargo problem involves loading and unloading of cargo and flying it from place to place. The problem can be with defined with three actions: Load, Unload and Fly. Let us now define an object of `air_cargo` problem:"
]
},
"source": [
"airCargo = air_cargo()"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Now, before taking any actions, we will check the `airCargo` if it has completed the goal it is required to do:"
]
},
{
"cell_type": "code",
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"False\n"
]
}
],
"source": [
"print(airCargo.goal_test())"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"As we can see, it hasn't completed the goal. Now, we define the sequence of actions that it should take in order to achieve\n",
"the goal. Then the `airCargo` acts on each of them."
]
},
{
"cell_type": "code",
"metadata": {},
"outputs": [],
"source": [
"solution = [expr(\"Load(C1 , P1, SFO)\"),\n",
" expr(\"Fly(P1, SFO, JFK)\"),\n",
" expr(\"Unload(C1, P1, JFK)\"),\n",
" expr(\"Load(C2, P2, JFK)\"),\n",
" expr(\"Fly(P2, JFK, SFO)\"),\n",
" expr(\"Unload (C2, P2, SFO)\")] \n",
"\n",
"for action in solution:\n",
" airCargo.act(action)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"As the `airCargo` has taken all the steps it needed in order to achieve the goal, we can now check if it has acheived its goal:"
]
},
{
"cell_type": "code",
"metadata": {},
"outputs": [
{
"data": {
"text/plain": [
"True"
]
},
"metadata": {},
"output_type": "execute_result"
}
],
"source": [
"airCargo.goal_test()"
]
{
"cell_type": "markdown",
"metadata": {},
"source": [
"It has now achieved its goal."
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## The Spare Tire Problem"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Let's consider the problem of changing a flat tire. The goal is to have a good spare tire properly mounted onto the car's axle, where the initial state has a flat tire on the axle and a good spare tire in the trunk. Let us now define an object of `spare_tire` problem:"
]
},
{
"cell_type": "code",
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
"spare_tire = spare_tire()"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Now, before taking any actions, we will check `spare_tire` if it has completed the goal it is required to do"
]
},
{
"cell_type": "code",
"execution_count": 16,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"False\n"
]
}
],
"source": [
"print(spare_tire.goal_test())"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"As we can see, it hasn't completed the goal. Now, we define the sequence of actions that it should take in order to have a good spare tire properly mounted onto the car's axle. Then the `spare_tire` acts on each of them."
]
},
{
"cell_type": "code",
"execution_count": 17,
"metadata": {},
"outputs": [],
"source": [
"solution = [expr(\"Remove(Flat, Axle)\"),\n",
" expr(\"Remove(Spare, Trunk)\"),\n",
" expr(\"PutOn(Spare, Axle)\")]\n",
"\n",
"for action in solution:\n",
" spare_tire.act(action)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"As the `spare_tire` has taken all the steps it needed in order to achieve the goal, we can now check if it has acheived its goal"
]
},
{
"cell_type": "code",
"execution_count": 18,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"True\n"
]
}
],
"source": [
"print(spare_tire.goal_test())"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"It has now successfully achieved its goal i.e, to have a good spare tire properly mounted onto the car's axle."
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Three Block Tower Problem"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"This problem's domain consists of a set of cube-shaped blocks sitting on a table. The blocks can be stacked , but only one block can fit directly on top of another. A robot arm can pick up a block and move it to another position, either on the table or on top of another block. The arm can pick up only one block at a time, so it cannot pick up a block that has another one on it. The goal will always be to build one or more stacks of blocks. In our case, we consider only three blocks. Let us now define an object of `three_block_tower` problem:"
]
},
{
"cell_type": "code",
"execution_count": 19,
"metadata": {},
"outputs": [],
"source": [
"three_block_tower = three_block_tower()"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"Now, before taking any actions, we will check `three_tower_block` if it has completed the goal it is required to do"
]
},
{
"cell_type": "code",
"execution_count": 21,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"False\n"
]
}
],
"source": [
"print(three_block_tower.goal_test())"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"As we can see, it hasn't completed the goal. Now, we define the sequence of actions that it should take in order to build a stack of three blocks. Then the `three_block_tower` acts on each of them."
]
},
{
"cell_type": "code",
"execution_count": 22,
"metadata": {},
"outputs": [],
"source": [
"solution = [expr(\"MoveToTable(C, A)\"),\n",
" expr(\"Move(B, Table, C)\"),\n",
" expr(\"Move(A, Table, B)\")]\n",
"\n",
"for action in solution:\n",
" three_block_tower.act(action)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"As the `three_block_tower` has taken all the steps it needed in order to achieve the goal, we can now check if it has acheived its goal"
]
},
{
"cell_type": "code",
"execution_count": 24,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"True\n"
]
}
],
"source": [
"print(three_block_tower.goal_test())"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"It has now successfully achieved its goal i.e, to build a stack of three blocks."
}
],
"metadata": {
"kernelspec": {
"display_name": "Python 3",
"language": "python",
"name": "python3"
},
"language_info": {
"codemirror_mode": {
"name": "ipython",
"version": 3
},
"file_extension": ".py",
"mimetype": "text/x-python",
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
}
},
"nbformat": 4,