+ All Categories
Home > Documents > Course Logistics

Course Logistics

Date post: 09-Feb-2016
Category:
Upload: kimo
View: 34 times
Download: 4 times
Share this document with a friend
Description:
Course Logistics. CS533: Intelligent Agents and Decision Making M, W, F: 1:00—1:50 Instructor: Alan Fern (KEC2071) Office hours: by appointment (see me after class or send email) Course website (link on instructor’s home page) has Lecture notes and Assignments Grade based on projects: - PowerPoint PPT Presentation
Popular Tags:
13
1 Course Logistics CS533: Intelligent Agents and Decision Making M, W, F: 1:00—1:50 Instructor: Alan Fern (KEC2071) Office hours: by appointment (see me after class or send email) Course website (link on instructor’s home page) has Lecture notes and Assignments Grade based on projects: 65% Instructor Assigned Projects (mostly implementation and evaluation) 15% Mid Term (mostly about technical/theoretical material) 20% Student Selected Final Project Assigned Projects (work alone) Generally will be implementing and evaluating one or more algorithms Final Project (teams allowed) Last month of class You select a project related to course content
Transcript
Page 1: Course Logistics

1

Course Logistics CS533: Intelligent Agents and Decision Making

M, W, F: 1:00—1:50 Instructor: Alan Fern (KEC2071) Office hours: by appointment (see me after class or send email) Course website (link on instructor’s home page) has

Lecture notes and Assignments

Grade based on projects: 65% Instructor Assigned Projects (mostly implementation and evaluation) 15% Mid Term (mostly about technical/theoretical material) 20% Student Selected Final Project

Assigned Projects (work alone) Generally will be implementing and evaluating one or more algorithms

Final Project (teams allowed) Last month of class You select a project related to course content

Page 2: Course Logistics

Some AI Planning Problems

Fire & RescueResponse Planning

Solitaire Real-Time Strategy Games

Helicopter Control Legged Robot Control Network Security/Control

Page 3: Course Logistics

3

Some AI Planning Problems

Health Care Personalized treatment planning Hospital Logistics/Scheduling

Transportation Autonomous Vehicles Supply Chain Logistics Air traffic control

Assistive Technologies Dialog Management Automated assistants for elderly/disabled Household robots Personal planner

Page 4: Course Logistics

4

Some AI Planning Problems Sustainability

Smart grid Forest fire management Species Conservation Planning

Personalized Education/Training Intelligent lesson planning Intelligent agents for training simulators

Surveillance and Information Gathering Intelligent sensor networks Semi-Autonomous UAVs

Page 5: Course Logistics

5

Common Elements We have a controllable system that can change state

over time (in some predictable way) The state describes essential information about system

(the visible card information in Solitaire) We have an objective that specifies which states, or

state sequences, are more/less preferred

Can (partially) control the system state transitions by taking actions

Problem: At each moment must select an action to optimize the overall objective Produce most preferred state sequences

Page 6: Course Logistics

6

Observations ActionsWorld

fully observable vs. partially observable

instantaneous vs. durative

deterministic vs. stochastic

Some Dimensions of AI Planning

????

sole sourceof change vs. other sources

Goal

Page 7: Course Logistics

7

Observations Actions

????

World

fully observable

instantaneous

deterministic

Classical Planning Assumptions(primary focus of AI planning until early 90’s)

sole sourceof change

Goal achieve goal condition

Page 8: Course Logistics

8

Observations Actions

????

World

fully observable

instantaneous

deterministic

Classical Planning Assumptions(primary focus of AI planning until early 90’s)

sole sourceof change

Goal achieve goal condition Greatly limits

applicability

Page 9: Course Logistics

9

Observations Actions

????

World

fully observable

instantaneous

stochastic

Stochastic/Probabilistic Planning: Markov Decision Process (MDP) Model

sole sourceof change

Goal maximize expected reward over lifetime

We will primarilyfocus on MDPs

Page 10: Course Logistics

10

World StateAction from finite set????

Stochastic/Probabilistic Planning: Markov Decision Process (MDP) Model

Goal maximize expected reward over lifetime

Probabilistic state transition (depends on action)

Page 11: Course Logistics

11

State describesall visible infoabout cards

Action are the different legalcard movements????

Example MDP

Goal win the game orplay max # of cards

Page 12: Course Logistics

12

Course OutlineCourse is structured around algorithms for solving MDPs

Different assumptions about knowledge of MDP model Different assumptions about prior knowledge of solution Different assumptions about how MDP is represented

1) Markov Decision Processes (MDPs) Basics Basic definitions and solution techniques Assume an exact MDP model is known Exact solutions for small/moderate size MDPs

2) Monte-Carlo Planning Assumes an MDP simulator is available Approximate solutions for large MDPs

Page 13: Course Logistics

13

Course Outline

3) Reinforcement learningMDP model is not known to agentExact solutions for small/moderate MDPsApproximate solutions for large MDPs

4) Planning w/ Symbolic Representations of Huge MDPsSymbolic Dynamic ProgrammingClassical planning for deterministic problems (as time allows)


Recommended