This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
teaching:is:main_is [2024/03/04 14:46] Franconi Enrico |
teaching:is:main_is [2024/04/23 09:48] Franconi Enrico [Lab] |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== Foundations of Artificial Intelligence | + | ====== Foundations of Artificial Intelligence ====== |
===== Watch the page ===== | ===== Watch the page ===== | ||
Line 35: | Line 35: | ||
/* The striked-through text (i.e., < | /* The striked-through text (i.e., < | ||
- | * Slides: {{lect.1.0.pdf|Welcome Aboard}} | + | * Slides: {{ : |
- | * Slides: Artificial Intelligence and Agents | + | * Slides: Artificial Intelligence and Agents {{ : |
* Material: chapter 1 of //Poole and Mackworth// | * Material: chapter 1 of //Poole and Mackworth// | ||
- | | + | * Slides: States and Searching {{: |
- | * Material: chapter 2 of //Poole and Mackworth// | + | |
- | | + | |
* Material: chapter 3 of //Poole and Mackworth// | * Material: chapter 3 of //Poole and Mackworth// | ||
- | * Slides: Features and Constraints | + | * Slides: Features and Constraints {{: |
* Material: chapter 4 of //Poole and Mackworth// | * Material: chapter 4 of //Poole and Mackworth// | ||
* Slides: Propositions and Inference /* {{: | * Slides: Propositions and Inference /* {{: | ||
Line 54: | Line 52: | ||
===== Lab ===== | ===== Lab ===== | ||
- | * xxx | + | * <color # |
+ | * Manuals: | ||
+ | * {{ : | ||
+ | * {{ : | ||
+ | * Tutorial 1: {{ : | ||
+ | * Tutorial 2: {{ : | ||
+ | * Tutorial 3: {{ : | ||
+ | * Tutorial 4: {{ : | ||
+ | * Explore with the search applet the **Delivery Robot (Acyclic)**, | ||
+ | * Do the [[http:// | ||
+ | * Exercise: practicing different search strategies with the graph in this {{teaching: | ||
+ | * Create your own problem graph for a delivery robot starting from a map with edge costs. | ||
+ | * Create a problem graph for a simple problem chosen by you. | ||
+ | * IMPORTANT: learn how to write on paper the frontier evolution for each search. | ||
+ | * <color # | ||
+ | * Explore the **Delivery Robot (Acyclic)**, | ||
+ | * Do the [[http:// | ||
+ | * Exercise: [[http:// | ||
+ | * IMPORTANT: | ||
+ | * learn how to write on paper the frontier evolution for each search; | ||
+ | * check whether the heuristics are admissible and monotone. | ||
+ | * <color # | ||
+ | * [[http:// | ||
+ | * Explore with the CSP applet the sample problems: Simple Problem 1, Simple Problem 2, Scheduling Problem 1, Crossword Problem 1, Crossword Problem 2. These sample problems have been seen already in the course lectures; for the crossword problems, try to reconstruct the crossword graphical structure. | ||
+ | * Do the [[http:// | ||
+ | * Exercises: [[http:// | ||