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 [2024/05/24 12:08] Franconi Enrico [Slides & Reference Material] |
teaching:is:main_is [2025/04/30 10:27] (current) Franconi Enrico [Lab] |
||
---|---|---|---|
Line 6: | Line 6: | ||
To do that, click the [[https:// | To do that, click the [[https:// | ||
===== Official course presentation form ===== | ===== Official course presentation form ===== | ||
- | * The course | + | * The course |
===== Timetable ===== | ===== Timetable ===== | ||
- | The official week-by-week Faculty timetable: [[https:// | + | The official week-by-week Faculty timetable: [[https:// |
- | Note that a LAB may be transformed into a LECTURE and vice-versa. | + | Note that a LAB slot may be transformed into a LECTURE |
Office hours: anytime, by previous appointment by email to the lecturer ([[mailto: | Office hours: anytime, by previous appointment by email to the lecturer ([[mailto: | ||
Line 35: | Line 35: | ||
/* The striked-through text (i.e., < | /* The striked-through text (i.e., < | ||
- | * 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// | ||
Line 53: | Line 53: | ||
* Material {{http:// | * Material {{http:// | ||
* < | * < | ||
- | * Material {{http:// | + | * <del>Material {{http:// |
* < | * < | ||
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 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 # | ||
Line 110: | Line 111: | ||
* [[http:// | * [[http:// | ||
* [[http:// | * [[http:// | ||
- | * Exercises: [[http:// | + | * Exercises: [[http:// |
* <color # | * <color # | ||
- | * Do {{ : | + | * Do {{ : |
* Using the {{ : | * Using the {{ : | ||
* NOTE: the translator from STRIPS to CSP is buggy: use {{: | * NOTE: the translator from STRIPS to CSP is buggy: use {{: | ||
Line 118: | Line 119: | ||
* find the original STRIPS definition from the CSP version of it | * find the original STRIPS definition from the CSP version of it | ||
* find **all** the plans giving a (partial) starting state, or giving a (partial) end state, or both, with an horizon of 3. | * find **all** the plans giving a (partial) starting state, or giving a (partial) end state, or both, with an horizon of 3. | ||
+ | * <color # | ||
+ | * Keep using [[https:// | ||
+ | * Go through Section 8 of the [[http:// | ||
+ | * Understand the bottom-up and top-down derivations with the relational representation of the [[https:// | ||
+ | * Do the following | ||
+ | /* * [[http:// | ||
+ | * [[http:// | ||
+ | * [[http:// | ||
+ | * [[http:// | ||
+ | /* * ([[teaching: | ||
+ | |||
+ | =====Final Exam===== | ||
+ | |||
+ | The exam paper will contain problem solving, verification, | ||
+ | |||
+ | The exam is evaluated based on correctness of answers, clarity of answers, ability to summarise, evaluate, and establish relationships between topics, skills in critical thinking, quality of argumentation, | ||
+ | |||
+ | The questions will be mirroring the exercises done in the lab and the exercises from the main course book. | ||
+ | Answers to questions should be formulated precisely and completely, of course. Regarding the topic that have been done during the lab using simulation software, the written answer in the exam paper should contain the information relevant to the question as it would be provided by the simulation, and as it is discussed in the book and during the lectures and labs. You can bring your own written notes to the exam, and nothing else. | ||
+ | |||
+ | No " | ||
+ | |||