-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathai.mm
9556 lines (8528 loc) · 367 KB
/
ai.mm
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
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
194
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
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
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
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<map version="freeplane 1.6.0">
<!--To view this file, download free mind mapping software Freeplane from http://freeplane.sourceforge.net -->
<node TEXT="Artificial Intelligence" LOCALIZED_STYLE_REF="styles.topic" FOLDED="false" ID="ID_1723255651" CREATED="1283093380553" MODIFIED="1447854624745"><hook NAME="MapStyle" background="#fcfce9" zoom="1.5">
<properties fit_to_viewport="false" show_icon_for_attributes="true" show_note_icons="true"/>
<map_styles>
<stylenode LOCALIZED_TEXT="styles.root_node" STYLE="oval" UNIFORM_SHAPE="true" VGAP_QUANTITY="24.0 pt">
<font SIZE="24"/>
<stylenode LOCALIZED_TEXT="styles.predefined" POSITION="right" STYLE="bubble">
<stylenode LOCALIZED_TEXT="default" MAX_WIDTH="600.0 px" STYLE="as_parent">
<font NAME="SansSerif" SIZE="10" BOLD="false" ITALIC="false"/>
</stylenode>
<stylenode LOCALIZED_TEXT="defaultstyle.details"/>
<stylenode LOCALIZED_TEXT="defaultstyle.attributes">
<font SIZE="9"/>
</stylenode>
<stylenode LOCALIZED_TEXT="defaultstyle.note"/>
<stylenode LOCALIZED_TEXT="defaultstyle.floating">
<edge STYLE="hide_edge"/>
<cloud COLOR="#f0f0f0" SHAPE="ROUND_RECT"/>
</stylenode>
</stylenode>
<stylenode LOCALIZED_TEXT="styles.user-defined" POSITION="right" STYLE="bubble">
<stylenode LOCALIZED_TEXT="styles.topic" COLOR="#18898b" STYLE="fork" MAX_WIDTH="300.0 px">
<font NAME="Liberation Sans" SIZE="10" BOLD="true"/>
</stylenode>
<stylenode LOCALIZED_TEXT="styles.subtopic" COLOR="#cc3300" STYLE="fork">
<font NAME="Liberation Sans" SIZE="10" BOLD="true"/>
</stylenode>
<stylenode LOCALIZED_TEXT="styles.subsubtopic" COLOR="#669900">
<font NAME="Liberation Sans" SIZE="10" BOLD="true"/>
</stylenode>
<stylenode LOCALIZED_TEXT="styles.important">
<icon BUILTIN="yes"/>
</stylenode>
<stylenode TEXT="Stichpunkt" COLOR="#000000" STYLE="fork" MAX_WIDTH="300.0 px">
<font NAME="Liberation Sans" SIZE="8" BOLD="true"/>
<richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> </i></font>
</p>
</body>
</html>
</richcontent>
</stylenode>
<stylenode TEXT="Beschreibung" COLOR="#666666" STYLE="fork" MAX_WIDTH="300.0 px">
<font NAME="Liberation Sans" SIZE="8" BOLD="false" ITALIC="true"/>
<richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> </i></font>
</p>
</body>
</html>
</richcontent>
</stylenode>
</stylenode>
<stylenode LOCALIZED_TEXT="styles.AutomaticLayout" POSITION="right" STYLE="bubble">
<stylenode LOCALIZED_TEXT="AutomaticLayout.level.root" COLOR="#000000">
<font SIZE="18"/>
</stylenode>
<stylenode LOCALIZED_TEXT="AutomaticLayout.level,1" COLOR="#0033ff">
<font SIZE="16"/>
</stylenode>
<stylenode LOCALIZED_TEXT="AutomaticLayout.level,2" COLOR="#00b439">
<font SIZE="14"/>
</stylenode>
<stylenode LOCALIZED_TEXT="AutomaticLayout.level,3" COLOR="#990000">
<font SIZE="12"/>
</stylenode>
<stylenode LOCALIZED_TEXT="AutomaticLayout.level,4" COLOR="#111111">
<font SIZE="10"/>
</stylenode>
</stylenode>
</stylenode>
</map_styles>
</hook>
<node TEXT="Introduction" STYLE_REF="Beschreibung" FOLDED="true" POSITION="right" ID="ID_118949594" CREATED="1447854810392" MODIFIED="1447854815768">
<node TEXT="Acting" STYLE_REF="Beschreibung" ID="ID_870847112" CREATED="1447854920289" MODIFIED="1451856860094">
<arrowlink SHAPE="EDGE_LIKE" COLOR="#000000" WIDTH="2" TRANSPARENCY="80" FONT_SIZE="9" FONT_FAMILY="SansSerif" DESTINATION="ID_1275836973" STARTINCLINATION="107;0;" ENDINCLINATION="107;0;" STARTARROW="NONE" ENDARROW="DEFAULT"/>
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="Humanly" STYLE_REF="Beschreibung" ID="ID_1678887786" CREATED="1447854925888" MODIFIED="1451856866118" HGAP_QUANTITY="36.0 px" VSHIFT_QUANTITY="3.0 px">
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="Turing Test" STYLE_REF="Beschreibung" ID="ID_601231286" CREATED="1447855019822" MODIFIED="1447855028504"/>
</node>
</node>
<node TEXT="Thinking" STYLE_REF="Beschreibung" ID="ID_546366502" CREATED="1447854921946" MODIFIED="1451856863242" VSHIFT_QUANTITY="12.0 px">
<arrowlink SHAPE="EDGE_LIKE" COLOR="#000000" WIDTH="2" TRANSPARENCY="80" FONT_SIZE="9" FONT_FAMILY="SansSerif" DESTINATION="ID_1678887786" STARTINCLINATION="88;0;" ENDINCLINATION="88;0;" STARTARROW="NONE" ENDARROW="DEFAULT"/>
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="Rationally" STYLE_REF="Beschreibung" ID="ID_1275836973" CREATED="1447854932581" MODIFIED="1447855029629" HGAP_QUANTITY="23.0 px"/>
</node>
</node>
<node TEXT="Intelligent Agents" STYLE_REF="Stichpunkt" FOLDED="true" POSITION="right" ID="ID_942496829" CREATED="1447855277910" MODIFIED="1447855284522">
<node TEXT="Definition" STYLE_REF="Stichpunkt" FOLDED="true" ID="ID_509325270" CREATED="1447855356266" MODIFIED="1514225177425"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> An intelligent agent is anything that </i></font>
</p>
<p>
<font color="#666666" size="1"><i> - perceives its environment through sensors and </i></font>
</p>
<p>
<font color="#666666" size="1"><i> - acts upon the environment through actuators</i></font>
</p>
</body>
</html>
</richcontent>
<node TEXT="Examples" STYLE_REF="Beschreibung" ID="ID_1395552081" CREATED="1447855435312" MODIFIED="1454491509060">
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="Thermostat" STYLE_REF="Beschreibung" ID="ID_471503924" CREATED="1447855445673" MODIFIED="1447855448842"/>
<node TEXT="Robotic Lawn Mower" STYLE_REF="Beschreibung" ID="ID_1240505491" CREATED="1447855453969" MODIFIED="1447855459226"/>
<node TEXT="Automated Car" STYLE_REF="Beschreibung" ID="ID_1170929723" CREATED="1447855463097" MODIFIED="1447855467009"/>
<node TEXT="Humanoid" STYLE_REF="Beschreibung" ID="ID_966670842" CREATED="1447855470811" MODIFIED="1447855473536"/>
</node>
</node>
<node TEXT="Percept sequence" STYLE_REF="Stichpunkt" ID="ID_992974966" CREATED="1447855570995" MODIFIED="1514225202367"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> An agents percept sequence is the complete history of its perception.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Agent function" STYLE_REF="Stichpunkt" FOLDED="true" ID="ID_1028849346" CREATED="1447855743498" MODIFIED="1514225210004"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> An agent function maps any given percept sequence to an action.</i></font>
</p>
</body>
</html>
</richcontent>
<node TEXT="Tabular agent functions" STYLE_REF="Beschreibung" ID="ID_461436881" CREATED="1447855890312" MODIFIED="1451839464202"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i>- can theoretically describe the behavior of agents. </i></font>
</p>
<p>
<font color="#666666" size="1"><i>- computationally infeasible</i></font>
</p>
</body>
</html>
</richcontent>
</node>
</node>
<node TEXT="Rational Agent" STYLE_REF="Beschreibung" ID="ID_1108555219" CREATED="1447856064124" MODIFIED="1514225244750"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> For each possible percept sequence, a rational agent should select an action that is expected to maximize its performance measure, given the prior percept sequence and its uilt-in-knowledge.</i></font>
</p>
</body>
</html>
</richcontent>
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="Rationality" STYLE_REF="Stichpunkt" ID="ID_29546882" CREATED="1447855980673" MODIFIED="1514225265004"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> A system is rational if it does the "right thing", i.e. has an ideal performance (performance measures are not always available).</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Learning" STYLE_REF="Stichpunkt" ID="ID_359582086" CREATED="1447856577735" MODIFIED="1514225273165"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Rational agents are able to learn from perception, i.e. they improve their knowledge of the environment over time.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Autonomy" STYLE_REF="Stichpunkt" ID="ID_184387550" CREATED="1447856627522" MODIFIED="1514225284868"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> In AI, a rational agent is considered more autonomous if it is less dependent on prior knowledge and uses newly learned abilities instead.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Task Environment" STYLE_REF="Stichpunkt" FOLDED="true" ID="ID_1904297524" CREATED="1447856704957" MODIFIED="1514225398815"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Performance </i></font>
</p>
<p>
<font color="#666666" size="1"><i>Environment </i></font>
</p>
<p>
<font color="#666666" size="1"><i>Actuators </i></font>
</p>
<p>
<font color="#666666" size="1"><i>Sensors</i></font>
</p>
</body>
</html>
</richcontent>
<node TEXT="Fully observable vs. partially observable" STYLE_REF="Beschreibung" ID="ID_354090745" CREATED="1447856807629" MODIFIED="1514225413566"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> An environment is fully observable if the agent can detect the complete state of the environment, and partially observable otherwise.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Single agent vs. multi agent" STYLE_REF="Beschreibung" ID="ID_787203134" CREATED="1447856884066" MODIFIED="1514225431120"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> An environment is a multi agent environment if it contains several agents, and a single agent environment otherwise.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Deterministic vs. stochastic" STYLE_REF="Beschreibung" ID="ID_698664717" CREATED="1447856942696" MODIFIED="1514225454304"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> An environment is deterministic if its next state is fully determined by its current state and the action of the agent, and stochastic otherwise.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Episodic vs. sequential" STYLE_REF="Beschreibung" ID="ID_1158932799" CREATED="1447857012128" MODIFIED="1514225468945"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> An environment is episodic if the actions taken in one episode (in which the robot senses and acts) does not affect later episodes, and sequential otherwise.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Discrete vs. continuous" STYLE_REF="Beschreibung" ID="ID_810521141" CREATED="1447857085544" MODIFIED="1514225541316"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> The discrete/continuous distinction applies to the state and time.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Static vs. dynamic" STYLE_REF="Beschreibung" ID="ID_623576331" CREATED="1447857169157" MODIFIED="1514225551833"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> If an environment only changes based on actions of the agent, it is static, and dynamic otherwise.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Known vs. unknown" STYLE_REF="Beschreibung" ID="ID_1568148415" CREATED="1447857212884" MODIFIED="1514225559282"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> An environment is known if the agent knows the outcome (or outcome probabilities) of its actions, and unknown otherwise. In the latter case, the agent has to learn the environment first.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
</node>
<node TEXT="Agent Types" STYLE_REF="Stichpunkt" FOLDED="true" ID="ID_1061877613" CREATED="1447857634676" MODIFIED="1454491575329">
<node TEXT="Simples reflex agents" STYLE_REF="Beschreibung" ID="ID_1852311707" CREATED="1447857690397" MODIFIED="1454491831698"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Agent selects action on the basis of the current percept.</i></font>
</p>
</body>
</html>
</richcontent>
<hook NAME="AlwaysUnfoldedNode"/>
</node>
<node TEXT="Model-based reflex agents" STYLE_REF="Beschreibung" ID="ID_647207278" CREATED="1447857817408" MODIFIED="1454491832689"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Partial observability is handled by keeping track of the environment the agent cannot perceive.</i></font>
</p>
</body>
</html>
</richcontent>
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="Internal state" STYLE_REF="Beschreibung" ID="ID_759953580" CREATED="1447858333552" MODIFIED="1454491835381"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> The agent keeps an internal state of the previous situation that depends on the percept history and thereby reflects unobservable aspects. It is an art to come up with "good" internal states.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="How the world evolves" STYLE_REF="Beschreibung" ID="ID_1570361809" CREATED="1447858402091" MODIFIED="1454491833995"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> If the agent would not keep in mind that a pedestrian stepped behind a vehicle, it would recognize it too late when reappearing.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="What my actions do" STYLE_REF="Beschreibung" ID="ID_1488808260" CREATED="1447858423292" MODIFIED="1454491834525"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Continuing the pedestrian example: Braking will slow down the vehicle, while accelerating will increase the speed. Depending on the own speed, the relative positions in the "new world" change.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
</node>
<node TEXT="Goal-based agents" STYLE_REF="Beschreibung" ID="ID_1282257198" CREATED="1447857705269" MODIFIED="1454491840205"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> In addition to knowing the current state of the environment, the goal of the agent is explicitly considered.</i></font>
</p>
</body>
</html>
</richcontent>
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="What will it be like if I do action A?" STYLE_REF="Beschreibung" ID="ID_1736838869" CREATED="1447858702867" MODIFIED="1454491838180"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Decision is made by checking which actions help achieving the goal.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Search and Planning" STYLE_REF="Beschreibung" ID="ID_916691710" CREATED="1447858803822" MODIFIED="1452772478717"/>
</node>
<node TEXT="Utility-based agents" STYLE_REF="Beschreibung" ID="ID_1185745299" CREATED="1447857709745" MODIFIED="1454491841102"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> In addition to achieving the goal state of the environment, the goal should be reached with maximum utility, i.e. that maximizes the "happiness" of the agent.</i></font>
</p>
</body>
</html>
</richcontent>
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="How happy will I be in such a state?" STYLE_REF="Beschreibung" ID="ID_298068353" CREATED="1447858926241" MODIFIED="1454491841785"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Decision is made by evaluating the utility function. The outcome will be a tradeoff.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
</node>
<node TEXT="Learning agents" STYLE_REF="Beschreibung" ID="ID_714828444" CREATED="1447859013955" MODIFIED="1454491846249"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Any previous agent can be extended to a learning agent.</i></font>
</p>
</body>
</html>
</richcontent>
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="Performance element" STYLE_REF="Beschreibung" ID="ID_217890094" CREATED="1447859068908" MODIFIED="1454262103332"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> This is a placeholder for any of the previous entire agents and is responsible for selecting the actions.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Learning element" STYLE_REF="Beschreibung" ID="ID_1131793190" CREATED="1447859109214" MODIFIED="1454262102000"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> This element is responsible for making improvements based on gained experience.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Critic" STYLE_REF="Beschreibung" ID="ID_1448211819" CREATED="1447859138582" MODIFIED="1454262096054"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> The critic tells the learning element how well the agent is doing with respect to a fixed performance standard.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Problem generator" STYLE_REF="Beschreibung" ID="ID_166199068" CREATED="1447859181364" MODIFIED="1454262100010"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> The Problem generator suggests actions that will lead to new and informative experiences. If the agent continues doing the same thing,m it will not learn anything new.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
</node>
</node>
</node>
<node TEXT="Omniscient agent" STYLE_REF="Stichpunkt" ID="ID_459344388" CREATED="1447856196454" MODIFIED="1514225443234"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> An omniscient agent knows the actual outcome of its actions, which is impossible in reality.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
</node>
<node TEXT="Solving problems by searching" STYLE_REF="Stichpunkt" FOLDED="true" POSITION="right" ID="ID_804624703" CREATED="1447867357275" MODIFIED="1451839411312">
<node TEXT="Uninformed Search" STYLE_REF="Beschreibung" ID="ID_151700914" CREATED="1447867369435" MODIFIED="1514225949916"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> No additional information besides the problem statement is provided. </i></font>
</p>
<p>
<font color="#666666" size="1"><i>Uninformed search can only produce next states and check whether it is a goal state.</i></font>
</p>
</body>
</html>
</richcontent>
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="Well-defined problems" STYLE_REF="Stichpunkt" FOLDED="true" ID="ID_1823909611" CREATED="1447867463069" MODIFIED="1447867469583">
<node TEXT="Initial state" STYLE_REF="Beschreibung" ID="ID_1683801807" CREATED="1447867491074" MODIFIED="1454196763180"/>
<node TEXT="Actions" STYLE_REF="Beschreibung" ID="ID_1362217762" CREATED="1447867494974" MODIFIED="1454196763734"/>
<node TEXT="Transition model" STYLE_REF="Beschreibung" ID="ID_159836038" CREATED="1447867511522" MODIFIED="1454196764386"/>
<node TEXT="Goal test" STYLE_REF="Beschreibung" ID="ID_1339063519" CREATED="1447867516748" MODIFIED="1454196764819"/>
<node TEXT="Path cost" STYLE_REF="Beschreibung" ID="ID_1835893582" CREATED="1447867524888" MODIFIED="1454196765198"/>
</node>
<node TEXT="" ID="ID_1911006612" CREATED="1447867784999" MODIFIED="1451839358539">
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="Incremental formulation" STYLE_REF="Stichpunkt" ID="ID_837505155" CREATED="1447867789449" MODIFIED="1514225981444"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Add state-dimensions sequentially.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Complete-state formulation" STYLE_REF="Stichpunkt" ID="ID_330468638" CREATED="1447867797664" MODIFIED="1514225983871"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Change full-state formulation.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
</node>
<node TEXT="Graph Search (Avoiding Loops)" STYLE_REF="Beschreibung" ID="ID_1067872371" CREATED="1447868263906" MODIFIED="1514226053308"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Only expand nodes that have not been visited before. Visited states are stored in an explored set or closed list. This idea is referred to as graph search.</i></font>
</p>
</body>
</html>
</richcontent>
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="Breadth-First Search" STYLE_REF="Stichpunkt" FOLDED="true" ID="ID_1455077826" CREATED="1447869285605" MODIFIED="1514226002488"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> All nodes are expanded at a given depth in the search tree before any nodes at the next level are expanded.</i></font>
</p>
</body>
</html>
</richcontent>
<node TEXT="Completeness" STYLE_REF="Stichpunkt" ID="ID_158085256" CREATED="1447869418939" MODIFIED="1454197133526"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Yes, if depth d and branching factor b are finite.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Optimality" STYLE_REF="Stichpunkt" ID="ID_2435886" CREATED="1447869445390" MODIFIED="1454197134708"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Yes, if cost is equal per step; not optimal in general.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Time Complexity" STYLE_REF="Stichpunkt" ID="ID_1746599801" CREATED="1447869473317" MODIFIED="1454492049272"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> The worst case is that each node has b successors. The number of explored nodes sums up to</i></font>
</p>
</body>
</html>
</richcontent>
<hook EQUATION="b + b^2 + b^3 + \cdots + b^d = \mathcal O(b^d)" NAME="plugins/latex/LatexNodeHook.properties"/>
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="depth" STYLE_REF="Beschreibung" ID="ID_1828371847" CREATED="1447870487333" MODIFIED="1447870495065">
<hook EQUATION="d" NAME="plugins/latex/LatexNodeHook.properties"/>
</node>
<node TEXT="branching factor" STYLE_REF="Beschreibung" ID="ID_1328657238" CREATED="1447870498099" MODIFIED="1447870505157">
<hook EQUATION="b" NAME="plugins/latex/LatexNodeHook.properties"/>
</node>
</node>
<node TEXT="Space complexity" STYLE_REF="Stichpunkt" ID="ID_449869875" CREATED="1447869547649" MODIFIED="1454197139055"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> All explored nodes are O(b^d-1) and all nodes in the frontier are O(b^d)</i></font>
</p>
</body>
</html>
</richcontent>
</node>
</node>
<node TEXT="Uniform-Cost Search" STYLE_REF="Stichpunkt" FOLDED="true" ID="ID_1086411667" CREATED="1447869664293" MODIFIED="1514226005148"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Expanding the node with the lowest path cost.This is realized by storing the frontier as a priority queue ordered by path cost.</i></font>
</p>
</body>
</html>
</richcontent>
<node TEXT="Completeness" STYLE_REF="Stichpunkt" ID="ID_1736346902" CREATED="1447869885457" MODIFIED="1454197317381"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Yes, if costs are greater than 0 (otherwise infinite optimal paths of zero cost exist).</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Optimality" STYLE_REF="Stichpunkt" ID="ID_1434686796" CREATED="1447869926749" MODIFIED="1454197318373"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Yes, if costs are positive.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Time complexity" STYLE_REF="Stichpunkt" ID="ID_1462432932" CREATED="1447869945366" MODIFIED="1454492104176"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> The worst case is that the goal branches of a node with huge costs and all other step costs are the minimum step-cost epsilon. The number of explored nodes (for e.g. d=1) sums up to</i></font>
</p>
</body>
</html>
</richcontent>
<hook EQUATION="(b-1) + (b-1)b + (b-1)b^2 + \cdots + (b-1)b^{\lfloor C^*/\epsilon\rfloor} = \mathcal O (b^{1+\lfloor C^* / \epsilon\rfloor})" NAME="plugins/latex/LatexNodeHook.properties"/>
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="Cost of the optimal solution" STYLE_REF="Beschreibung" ID="ID_1724857009" CREATED="1447870193227" MODIFIED="1447870231318">
<hook EQUATION="C^*" NAME="plugins/latex/LatexNodeHook.properties"/>
</node>
<node TEXT="Minimum step-cost" STYLE_REF="Beschreibung" ID="ID_1297882390" CREATED="1447870205698" MODIFIED="1447870227070">
<hook EQUATION="\epsilon" NAME="plugins/latex/LatexNodeHook.properties"/>
</node>
<node TEXT="'+1' since the goal test
is performed after the expansion" STYLE_REF="Beschreibung" ID="ID_139452403" CREATED="1447870260450" MODIFIED="1454197400404"/>
</node>
<node TEXT="Space complexity" STYLE_REF="Stichpunkt" ID="ID_892211967" CREATED="1447870294422" MODIFIED="1454197320709"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Equals time complexity since all nodes are stored.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
</node>
<node TEXT="Depth-First Search" STYLE_REF="Stichpunkt" FOLDED="true" ID="ID_1814286011" CREATED="1447870324251" MODIFIED="1514226006783">
<arrowlink SHAPE="CUBIC_CURVE" COLOR="#000000" WIDTH="2" TRANSPARENCY="80" FONT_SIZE="9" FONT_FAMILY="SansSerif" DESTINATION="ID_1383192166" STARTINCLINATION="0;17;" ENDINCLINATION="0;-10;" STARTARROW="NONE" ENDARROW="DEFAULT"/>
<richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> The deepest node in the current frontier of the search tree is expanded.</i></font>
</p>
</body>
</html>
</richcontent>
<node TEXT="Completeness" STYLE_REF="Stichpunkt" ID="ID_1938898057" CREATED="1447870380011" MODIFIED="1454197491754"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> No, if recursively implemented; Yes, if repeated states are avoided and the state space is finite.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Optimality" STYLE_REF="Stichpunkt" ID="ID_232878830" CREATED="1447870416745" MODIFIED="1454197492759"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> No</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Time Complexity" STYLE_REF="Stichpunkt" ID="ID_1464965838" CREATED="1447870426553" MODIFIED="1454492147150"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> The Worst case is that the goal path is tested last, resulting in</i></font>
</p>
</body>
</html>
</richcontent>
<hook EQUATION="\mathcal O (b^m)" NAME="plugins/latex/LatexNodeHook.properties"/>
<hook NAME="AlwaysUnfoldedNode"/>
<node TEXT="maximum length of any path" STYLE_REF="Beschreibung" ID="ID_177518783" CREATED="1447870508809" MODIFIED="1447870521257">
<hook EQUATION="m" NAME="plugins/latex/LatexNodeHook.properties"/>
</node>
</node>
<node TEXT="Space Complexity" STYLE_REF="Stichpunkt" ID="ID_318377159" CREATED="1447870525888" MODIFIED="1454197498339"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> The advantage of depth-first when recursively implemented is a good space complexity: One only needs to store a single path from the root to the leave plus unexplored sibling nodes. There are at most m nodes to a leaf and b nodes branching off from each node, resulting in #nodes</i></font>
</p>
</body>
</html>
</richcontent>
<hook EQUATION="\mathcal O (bm)" NAME="plugins/latex/LatexNodeHook.properties"/>
</node>
</node>
<node TEXT="Depth-Limited Search" STYLE_REF="Stichpunkt" FOLDED="true" ID="ID_1383192166" CREATED="1447871029411" MODIFIED="1514226008462">
<arrowlink SHAPE="CUBIC_CURVE" COLOR="#000000" WIDTH="2" TRANSPARENCY="80" FONT_SIZE="9" FONT_FAMILY="SansSerif" DESTINATION="ID_1540191781" STARTINCLINATION="-5;18;" ENDINCLINATION="-2;-9;" STARTARROW="NONE" ENDARROW="DEFAULT"/>
<richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i>Problem: Does not terminate in infinite state spaces.  </i></font>
</p>
<p>
<font color="#666666" size="1"><i>Solution: Introduce depth limit I. </i></font>
</p>
<p>
<font color="#666666" size="1"><i>New Issue: How to choose depth-limit?</i></font>
</p>
</body>
</html>
</richcontent>
<node TEXT="Completeness" STYLE_REF="Stichpunkt" ID="ID_806722606" CREATED="1447871180402" MODIFIED="1454197719816"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> No, if I < d.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Optimality" STYLE_REF="Stichpunkt" ID="ID_962713074" CREATED="1447871193685" MODIFIED="1454197721286"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> No, if I > d.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Time Complexity" STYLE_REF="Stichpunkt" ID="ID_382556968" CREATED="1447871208605" MODIFIED="1454197723215"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> As for depth-first search, but with I instead of m:</i></font>
</p>
</body>
</html>
</richcontent>
<hook EQUATION="\mathcal O(b^l)" NAME="plugins/latex/LatexNodeHook.properties"/>
</node>
<node TEXT="Space Complexity" STYLE_REF="Stichpunkt" ID="ID_538218698" CREATED="1447871256948" MODIFIED="1454197724652"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> As for depth-first search, but with I instead of m:</i></font>
</p>
</body>
</html>
</richcontent>
<hook EQUATION="\mathcal O (bl)" NAME="plugins/latex/LatexNodeHook.properties"/>
</node>
</node>
<node TEXT="Iterative Deepening Search" STYLE_REF="Stichpunkt" FOLDED="true" ID="ID_1540191781" CREATED="1447871413949" MODIFIED="1514226010278"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Problem: One typically does not know the depth d of the goal state. </i></font>
</p>
<p>
<font color="#666666" size="1"><i>Solution: Use depth limit search and iteratively increase the depth limit l.</i></font>
</p>
</body>
</html>
</richcontent>
<node TEXT="Completeness" STYLE_REF="Stichpunkt" ID="ID_1826200876" CREATED="1447871538548" MODIFIED="1454197797456"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Yes, if depth d of the goal state is finite.</i></font>
</p>
</body>
</html>
</richcontent>
</node>
<node TEXT="Optimality" STYLE_REF="Stichpunkt" ID="ID_1399296866" CREATED="1447871560608" MODIFIED="1454197798317"><richcontent TYPE="DETAILS">
<html>
<head>
</head>
<body>
<p>
<font color="#666666" size="1"><i> Yes (if cost = 1 per step); not optimal in gerenal.</i></font>
</p>
</body>
</html>