This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
teaching:is:main_is [2025/03/05 10:27] Franconi Enrico [Slides & Reference Material] |
teaching:is:main_is [2025/06/22 18:12] (current) Franconi Enrico [Final Exam] |
||
|---|---|---|---|
| Line 36: | Line 36: | ||
| * Slides: {{ : | * Slides: {{ : | ||
| - | * Slides: Artificial Intelligence and Agents {{ : | + | * Slides: Artificial Intelligence and Agents {{ : |
| - | * Material: chapter 1 of //Poole and Mackworth// | + | * Material: |
| * Slides: States and Searching {{: | * Slides: States and Searching {{: | ||
| - | * Material: chapter 3 of //Poole and Mackworth// | + | * Material: |
| - | * 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 {{: | ||
| * Material: chapter 5 of //Poole and Mackworth// | * Material: chapter 5 of //Poole and Mackworth// | ||
| - | * Slides: Deterministic Planning {{ : | + | * <del>Slides: Deterministic Planning {{ : |
| - | * Material: chapter 6 of //Poole and Mackworth// | + | * <del>Material: chapter 6 of //Poole and Mackworth// |
| /* * Slides: Multiagent Systems and Games {{ : | /* * Slides: Multiagent Systems and Games {{ : | ||
| * Material: chapter 10 of //Poole and Mackworth// */ | * Material: chapter 10 of //Poole and Mackworth// */ | ||
| Line 68: | Line 68: | ||
| * Explore with the search applet the **Delivery Robot (Acyclic)**, | * Explore with the search applet the **Delivery Robot (Acyclic)**, | ||
| * Do the [[http:// | * Do the [[http:// | ||
| - | * Exercise: practicing different search strategies with the graph in this {{teaching: | + | * 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 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. | * Create a problem graph for a simple problem chosen by you. | ||
| * IMPORTANT: learn how to write on paper the frontier evolution for each search. | * IMPORTANT: learn how to write on paper the frontier evolution for each search. | ||
| + | * describe a search on a graph by writing the frontier (i.e., a set of paths) at each step of the search, and by specifying the selected path from the frontier in one step leading to the next step. | ||
| * <color # | * <color # | ||
| * Explore the **Delivery Robot (Acyclic)**, | * Explore the **Delivery Robot (Acyclic)**, | ||
| * Do the [[http:// | * Do the [[http:// | ||
| - | * Exercise: [[http:// | + | * Exercise: [[http:// |
| * IMPORTANT: | * IMPORTANT: | ||
| * learn how to write on paper the frontier evolution for each search; | * learn how to write on paper the frontier evolution for each search; | ||
| Line 83: | Line 84: | ||
| * 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. | * 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:// | * Do the [[http:// | ||
| - | * Exercises: [[http:// | + | * Exercises: [[http:// |
| * <color # | * <color # | ||
| * Getting started with [[https:// | * Getting started with [[https:// | ||
| Line 94: | Line 95: | ||
| * Mac: < | * Mac: < | ||
| * Play with the [[https:// | * Play with the [[https:// | ||
| - | * Do Exercises [[http:// | + | * Do Exercises [[http:// |
| * Find other AILog knowledge base examples[[https:// | * Find other AILog knowledge base examples[[https:// | ||
| * <color # | * <color # | ||
| - | * Excercises {{ : | + | * Excercises {{ : |
| - | * <color # | + | * <color # |
| * Keep using [[https:// | * Keep using [[https:// | ||
| * Go through Sections 6, 7, 9 of the [[http:// | * Go through Sections 6, 7, 9 of the [[http:// | ||
| Line 108: | Line 109: | ||
| * [[http:// | * [[http:// | ||
| * [[http:// | * [[http:// | ||
| - | * [[http:// | + | * [[http:// |
| - | * [[http:// | + | * [[http:// |
| - | * Exercises: [[http:// | + | * Exercises: [[http:// |
| - | * <color # | + | * <del><color # |
| * Do {{ : | * Do {{ : | ||
| * Using the {{ : | * Using the {{ : | ||
| Line 127: | Line 128: | ||
| * [[http:// | * [[http:// | ||
| * [[http:// | * [[http:// | ||
| - | /* * ([[teaching: | + | * ([[teaching: |
| =====Final Exam===== | =====Final Exam===== | ||
| Line 140: | Line 141: | ||
| No " | No " | ||
| + | **Modular Course** | ||
| + | This course, // | ||
| + | |||
| + | There is formally a unique final exam for the // | ||
| + | sessions of the academic year. | ||