Undergraduate Course: Informatics 2D - Reasoning and Agents (INFR08010)
Course Outline
| School | School of Informatics |
College | College of Science and Engineering |
| Credit level (Normal year taken) | SCQF Level 8 (Year 2 Undergraduate) |
Availability | Available to all students |
| SCQF Credits | 20 |
ECTS Credits | 10 |
| Summary | This course focuses on approaches relating to representation, reasoning and planning for solving real world inference. The course illustrates the importance of (i) using a smart representation of knowledge such that it is conducive to efficient reasoning, and (ii) the need for exploiting task constraints for intelligent search and planning. The notion of representing action, space and time is formalized in the context of agents capable of sensing the environment and taking actions that affect the current state. There is also a strong emphasis on the ability to deal with uncertain data in real world scenarios and hence, the planning and reasoning methods are extended to include inference in probabilistic domains. |
| Course description |
1. Intelligent Agents: Introduction
* Nature of agents, performance measures and environments
* Wumpus World Problem : An example thread (Programming environment setup
2. Search based Planning
* Planning as a Search Problem: In deterministic, observable, static and known environments
* Smart Searching 1: Using constraints
* Smart Searching 2: Exploiting subproblems/Memoisation
* Informed Search and Exploration for agents
3. Logical Representation and Planning
* Propositional Logic Revisited (Shortcomings)
* First Order Logic & Encoding facts/rules in FOL
* Inference Rules for Propositional & FOL Calculus
* Unification and Generalized Modus Ponens
* Resolution based Inference and directing search with it
* Knowledge representation : Using FOL to represent action, space, time -- Wumpus Example
* Situation Calculus: Representing time in plans
4. Scaling Planning for Complex Tasks
* Representing States, Goals and Actions in STRIPS
* Partial Order Planning
* Planning and Acting in the Real World
5. Acting in Uncertain (real world) Environments
* Representation with Bayes Net
* Probabilistic Reasoning in Bayes Net
* Planning under Uncertainity : Wumpus world revisited
* Probabilistic Reasoning over Time I: hidden markov models
* Probabilistic Reasoning over Time II: dynamic Bayesian networks
* Markov Decision Processes
Relevant QAA Computing Curriculum Sections: Artificial Intelligence, Human-Computer Interaction (HCI), Intelligent Information Systems Technologies, Simulation and Modelling
|
Information for Visiting Students
| Pre-requisites | None |
| High Demand Course? |
Yes |
Course Delivery Information
|
| Academic year 2017/18, Available to all students (SV1)
|
Quota: None |
| Course Start |
Semester 2 |
Timetable |
Timetable |
| Learning and Teaching activities (Further Info) |
Total Hours:
200
(
Lecture Hours 30,
Seminar/Tutorial Hours 10,
Supervised Practical/Workshop/Studio Hours 8,
Summative Assessment Hours 2,
Programme Level Learning and Teaching Hours 4,
Directed Learning and Independent Learning Hours
146 )
|
| Assessment (Further Info) |
Written Exam
75 %,
Coursework
25 %,
Practical Exam
0 %
|
| Additional Information (Assessment) |
In order to pass the course you must satisfy the following requirement:
* obtain a combined total mark of at least 40%
Assessment
You should expect to spend approximately 50 hours on the coursework for this course. |
| Feedback |
Not entered |
| Exam Information |
| Exam Diet |
Paper Name |
Hours & Minutes |
|
| Main Exam Diet S2 (April/May) | | 2:00 | | | Resit Exam Diet (August) | | 2:00 | |
Learning Outcomes
On completion of this course, the student will be able to:
- Use task constraints to make search efficient
- Perform Inference with First Order Logic and appreciate the strengths and weaknesses of this and other logic representations (eg Propositional)
- Use STRIPS to plan and execute actions using either Propositional or First Order Logic representation
- Create a Bayesian net representation of a non-deterministic planning problem
- Create a basic probabilistic action agent using simulated state transitions and goals
|
Reading List
* Russell, S. & Norvig, P., "AI: A Modern Approach", Prentice Hall or Pearson, 2003. 2nd Edition.
* Thompson, S., "Haskell: The Craft of Functional Programming", Addison Wesley, 1999.
|
Contacts
| Course organiser | Dr Michael Herrmann
Tel: (0131 6)51 7177
Email: |
Course secretary | Ms Kendal Reid
Tel: (0131 6)50 5194
Email: |
|
© Copyright 2017 The University of Edinburgh - 6 February 2017 8:06 pm
|
University Homepage