User Tools

Site Tools


public:t-622-arti-14-1:main

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Next revision
Previous revision
public:t-622-arti-14-1:main [2014/01/15 08:33] – created stephanpublic:t-622-arti-14-1:main [2024/04/29 13:33] (current) – external edit 127.0.0.1
Line 1: Line 1:
 ======T-622-ARTI, Introduction to Artificial Intelligence, Spring 2014===== ======T-622-ARTI, Introduction to Artificial Intelligence, Spring 2014=====
- 
-===== Course Schedule (subject to change) ===== 
- 
-^Week^Date^Chapters^Topic^ 
-|  1|Jan 14|    1,2|Introduction, History, Agents| 
-|:::|Jan 15|    Lab|[[Lab 1 - Agents]]   | 
-|:::|Jan 16|      2|Intelligent Agents   | 
- 
- 
-/*  
- 
-===== Basic Info ===== 
- 
-  * **Instructor: ** [[http://www.ru.is/staff/stephans|Stephan Schiffel]] (stephans+ru.is) 
-  * **Office: ** 3rd floor, Venus, 695-2998 
-  * **Lectures: ** Mondays 12:20-13:55 (M104), Fridays 12:20-13:05 (M124)  
-  * **Labs: ** Group 1: Thursdays 13:10-14:45 (M106), Group 2: Thursdays 17:25-19:00 (M110), you can pick whichever suits you best 
-  * **Online Forum:**   [[http://ruclasses.proboards.com/index.cgi?board=arti2013]] 
  
 ===== Description ===== ===== Description =====
Line 31: Line 13:
 ===== Book ===== ===== Book =====
  
-The textbook for this class is: //"Artificial Intelligence: A Modern Approach"// by Stuart Russell and Peter Norvig. This book has a [[http://aima.cs.berkeley.edu/|very good web site]] full of useful AI resources.+The textbook for this class is: //"Artificial Intelligence: A Modern Approach"// by Stuart Russell and Peter Norvig. This book has a [[http://aima.cs.berkeley.edu/|good web site]] full of useful AI resources.
  
  
 ===== Coursework Overview ===== ===== Coursework Overview =====
  
-==== Assignments/Labs (15%) ====+==== Assignments/Labs (25%) ====
 You hand in the (almost) weekly assignments and finish the labs. The assignments will mainly consist of small exercises in which you have to apply what you should have learned in the lecture. The questions should give you an indication of the questions that may be asked in the final exam. The labs are more practical applications of the material, often in the form of small programming tasks. You hand in the (almost) weekly assignments and finish the labs. The assignments will mainly consist of small exercises in which you have to apply what you should have learned in the lecture. The questions should give you an indication of the questions that may be asked in the final exam. The labs are more practical applications of the material, often in the form of small programming tasks.
  
 ==== Programming assignments (2 x 10%) ==== ==== Programming assignments (2 x 10%) ====
 You complete two programming assignments. This can be done as a group project (up to 4 people). Make sure you clearly indicate who is part of the group and that every group member clearly understands the solution.  You complete two programming assignments. This can be done as a group project (up to 4 people). Make sure you clearly indicate who is part of the group and that every group member clearly understands the solution. 
- 
    
-The [[public:t-622-arti-13-1:prog1|first programming assignment]] is to use search to find a good solution for a vacuum cleaning robot.+The [[public:t-622-arti-14-1:prog1|first programming assignment]] is to use search to find a good solution for a vacuum cleaning robot.
  
-The [[public:t-622-arti-13-1:prog2|second programming assignment]] is to program a Connect-4 agent.+The [[public:t-622-arti-14-1:prog2|second programming assignment]] is to program a Connect-4 agent.
  
  
-==== T-622-ARTI. Spring 2013 - Final Project (25%) ==== +==== Final Project (20%) ==== 
-You can choose a topic for the final programming project (discuss topics and find a group in the [[http://ruclasses.proboards.com/index.cgi?board=arti2013&action=display&thread=118|forum]]). Like the programming assignments, this can be done as a group project (up to 4 people). +You can choose a topic for the final programming project (discuss topics and find a group on the Piazza page. Like the programming assignments, this can be done as a group project (up to 4 people). 
-You have to hand in a 1-2 page description of the project goal and some ideas on how to achieve it approx. in week 8 (5% of the final grade) and a report and demonstration in week 12 (20% of the final grade).+You have to hand in a 1-2 page description of the project goal and some ideas on how to achieve it approx. in week 8 (5% of the final grade) and a report /* and demonstration */ in the last week (15% of the final grade).
  
-[[public:t-622-arti-13-1:final_project|List of chosen topics]]+/* [[public:t-622-arti-13-1:final_project|List of chosen topics]] */
  
-==== Exam (40%) ====+==== Exam (35%) ====
 There will be a final exam (3h) with questions similar to the ones in the assignments. There will be a final exam (3h) with questions similar to the ones in the assignments.
 +
 +===== Grading =====
 +
 +^Part of Course^Total Weight^
 +|Assignments, Labs |  25%|
 +|2 Programming Assignments (2*10%) |  20%|
 +|Final Project  |  20%|
 +|Final Written Exam |  35%|
 +^Total  ^  100%^
  
 ===== Course Schedule (subject to change) ===== ===== Course Schedule (subject to change) =====
Line 61: Line 51:
 ^Week^Date^Chapters^Topic^ ^Week^Date^Chapters^Topic^
 |  1|Jan 14|    1,2|Introduction, History, Agents| |  1|Jan 14|    1,2|Introduction, History, Agents|
-|:::|Jan 17|    Lab|[[Lab 1 - Agents]]   | +|:::|Jan 15|    Lab|[[Lab 1 - Agents]]   | 
-|:::|Jan 18|      2|Intelligent Agents   |+|:::|Jan 16|      2|Intelligent Agents   |
 |  2|Jan 21|      3|Search Problems, Blind Search      | |  2|Jan 21|      3|Search Problems, Blind Search      |
-|:::|Jan 24|    Lab|[[public:t-622-arti-13-1:prog1|Programming Assignment 1]]                | +|:::|Jan 22|    Lab|[[public:t-622-arti-14-1:prog1|Programming Assignment 1 - Search]]                | 
-|:::|Jan 25|      3|Blind Search, Heuristic Search         |+|:::|Jan 23|      3|Blind Search, Heuristic Search         |
 |  3|Jan 28|      3|Heuristic Search     | |  3|Jan 28|      3|Heuristic Search     |
-|:::|Jan 31|    Lab|[[Lab 2 - Formulating Search Problems]]   | +|:::|Jan 29|    Lab|[[Lab 2 - Hashing States]]   | 
-|:::|Feb 01|      3|Heuristic Search     | +|:::|Jan 30|      5|Adversarial Search (Minimax, Alpha-Beta) 
-|  4|Feb 04|      5|Adversarial Search (Minimax, Alpha-Beta) + 4|Feb 04|      5,6|Adversarial Search (Algorithms), CSPs  | 
-|:::|Feb 07|    Lab|[[Lab 3 - Hashing States]]       | +|:::|Feb 05|    Lab|[[public:t-622-arti-14-1:prog2|Programming Assignment 2 - Connect 4]]       
-|:::|Feb 08|      5|Adversarial Search (Algorithms)         | +|:::|Feb 06|      6|CSPs         
-|  5|Feb 11|       |Monte-Carlo SearchGeneral Game Playing  | +|  5|Feb 11|      7|Propositional Logic         
-|:::|Feb 14|    Lab|[[public:t-622-arti-13-1:prog2|Programming Assignment 2]]    +|:::|Feb 12|    Lab|[[Lab CSPs]]    
-|:::|Feb 15|      7|Propositional Logic  +|:::|Feb 13|      7|Propositional Logic, Logical Agents 
-|  6|Feb 18|      7|Propositional Logic, Logical Agents  +|  6|Feb 18|  7,8,9|Logical Agents, First Order Logic  | 
-|:::|Feb 21|    Lab|[[Lab Propositional Logic]]     +|:::|Feb 19|    Lab|[[Lab 4 Propositional Logic]]     
-|:::|Feb 22|      7|Logical Agents +|:::|Feb 20| 8,9,10|First Order Logic, Planning  | 
-|  7|Feb 25|  7,8,9|Logical Agents, FOL  | +|  7|Feb 25|     10|Planning | 
-|:::|Feb 28|    Lab|time limits and caching with Alpha-Beta Search      +|:::|Feb 26|    Lab|Programming Assignment 2 - Competition      
-|:::|Mar 01   8,9|FOL  | +|:::|Feb 2713, 14|Uncertainty, Bayesian Networks  
-|  8|Mar 04|     10|Planning | +|  8|Mar 04| 13, 14|Bayesian Networks | 
-|:::|Mar 07|    Lab|[[public:t-622-arti-13-1:prog2|Programming Assignment 2 - Competition]]         +|:::|Mar 05|    Lab|[[Lab 5 - Bayesian Networks]]         
-|:::|Mar 08    10|Planning      +|:::|Mar 06|  18-21|Machine Learning      
-|  9|Mar 11    13, 14|Uncertainty, Bayesian Networks  +|  9|Mar 11  18.3|Learning Decision Trees  | 
-|:::|Mar 14|    Lab|[[Lab 5 - Bayesian Networks]]  +|:::|Mar 12|    Lab|[[Lab 6 - Learning Decision Trees]] 
-|:::|Mar 15|  14|Bayesian Networks  +|:::|Mar 13|     25|Robotics 
-|  10|Mar 18 18-21, 18.3|Machine Learning, Learning Decision Trees  | +10|Mar 18|     15|Probabilistic Reasoning over Time  | 
-|:::|Mar 21|    Lab|[[Lab 6 - Learning Decision Trees]] +|:::|Mar 19|    Lab|[[Lab 7 - Particle Filtering]] 
-|:::|Mar 22|     25|Robotics +|:::|Mar 20|     15|Probabilistic Reasoning over Time  | 
- 11|Mar 25|     15|Probabilistic Reasoning over Time  | +| 11|Mar 25|       |??? 
-^ Easter ^^^^ +|:::|Mar 26|    Lab|??? 
- 12|Apr 04|    Lab|[[Lab 7 - Particle Filtering]] +|:::|Mar 27|       |Wrap-Up 
-|:::|Apr 05|       |Wrap-Up +| 13|Apr 01|       |Project Presentations 
- 13|Apr 08|       |Project Presentations +|:::|Apr 02|    Lab|Project Presentations 
-|:::|Apr 11|    Lab|Project Presentations +|:::|Apr 03|       |Project Presentations  |
-|:::|Apr 12|       |Project Presentations  |+
 ^^^^^ ^^^^^
  
-===== Grading =====+/* 
  
-^Part of Course^Total Weight^ +===== Basic Info ===== 
-|Assignments (15*1% 15%| + 
-|2 Programming Assignments (2*10%|  20%| +  * **Instructor: ** [[http://www.ru.is/staff/stephans|Stephan Schiffel]] (stephans+ru.is) 
-|Final Project  25%| +  * **Office: ** 3rd floor, Venus, 695-2998 
-|Final Written Exam |  40%| +  **Lectures: ** Mondays 12:20-13:55 (M104), Fridays 12:20-13:05 (M124)  
-^Total  ^  100%^+  * **Labs: ** Group 1: Thursdays 13:10-14:45 (M106), Group 2: Thursdays 17:25-19:00 (M110), you can pick whichever suits you best 
 +  * **Online Forum:**   [[http://ruclasses.proboards.com/index.cgi?board=arti2013]]
  
 */ */
/var/www/cadia.ru.is/wiki/data/attic/public/t-622-arti-14-1/main.1389774804.txt.gz · Last modified: 2024/04/29 13:32 (external edit)

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki