CS 380: ARTIFICIAL INTELLIGENCE RATIONAL AGENTS. Santiago Ontañón

Similar documents
CS 380: ARTIFICIAL INTELLIGENCE

Intelligent Agents p.1/25. Intelligent Agents. Chapter 2

Agent. Pengju Ren. Institute of Artificial Intelligence and Robotics

HIT3002: Introduction to Artificial Intelligence

Administrivia. CS 188: Artificial Intelligence Spring Agents and Environments. Today. Vacuum-Cleaner World. A Reflex Vacuum-Cleaner

Plan for the 2nd hour. What is AI. Acting humanly: The Turing test. EDAF70: Applied Artificial Intelligence Agents (Chapter 2 of AIMA)

Outline. Agents and environments Rationality PEAS (Performance measure, Environment, Actuators, Sensors) Environment types Agent types

Artificial Intelligence

Overview Agents, environments, typical components

COMP9414/ 9814/ 3411: Artificial Intelligence. Week 2. Classifying AI Tasks

Inf2D 01: Intelligent Agents and their Environments

Course Info. CS 486/686 Artificial Intelligence. Outline. Artificial Intelligence (AI)

CS 486/686 Artificial Intelligence

Intelligent Agents & Search Problem Formulation. AIMA, Chapters 2,

Structure of Intelligent Agents. Examples of Agents 1. Examples of Agents 2. Intelligent Agents and their Environments. An agent:

CISC 1600 Lecture 3.4 Agent-based programming

Artificial Intelligence: Definition

CMSC 372 Artificial Intelligence What is AI? Thinking Like Acting Like Humans Humans Thought Processes Behaviors

Introduction to Multiagent Systems

Outline. Introduction to AI. Artificial Intelligence. What is an AI? What is an AI? Agents Environments

CPS331 Lecture: Intelligent Agents last revised July 25, 2018

CPS331 Lecture: Agents and Robots last revised April 27, 2012

Last Time: Acting Humanly: The Full Turing Test

COMP9414/ 9814/ 3411: Artificial Intelligence. 2. Environment Types. UNSW c Alan Blair,

Introduction to Multi-Agent Systems. Michal Pechoucek & Branislav Bošanský AE4M36MAS Autumn Lect. 1

CPS331 Lecture: Agents and Robots last revised November 18, 2016

Informatics 2D: Tutorial 1 (Solutions)

Our 2-course meal for this evening

Artificial Intelligence

2. Environment Types. COMP9414/ 9814/ 3411: Artificial Intelligence. Agent Model. Agents as functions. The PEAS model of an Agent

Artificial Intelligence (Introduction to)

What is Artificial Intelligence? Alternate Definitions (Russell + Norvig) Human intelligence

Artificial Intelligence: An overview

100 Years of Shannon: Chess, Computing and Botvinik

Instructor. Artificial Intelligence (Introduction to) What is AI? Introduction. Dr Sergio Tessaris

3.1 Agents. Foundations of Artificial Intelligence. 3.1 Agents. 3.2 Rationality. 3.3 Summary. Introduction: Overview. 3. Introduction: Rational Agents

CSC384: Introduction to Artificial Intelligence. Game Tree Search

Outline. Game Playing. Game Problems. Game Problems. Types of games Playing a perfect game. Playing an imperfect game

CS 730/830: Intro AI. Prof. Wheeler Ruml. TA Bence Cserna. Thinking inside the box. 5 handouts: course info, project info, schedule, slides, asst 1

Introduction to Artificial Intelligence

CHEKMO-II. CHEKMO-II will run on any PDP-8 family computer with a minimum of 4k of memory, and an ASR33 Teletype or equivalent terminal.

CS:4420 Artificial Intelligence

Solving Problems by Searching

Adversarial Search. CS 486/686: Introduction to Artificial Intelligence

CITS3001. Algorithms, Agents and Artificial Intelligence. Semester 1, 2015

Artificial Intelligence

Game Tree Search. CSC384: Introduction to Artificial Intelligence. Generalizing Search Problem. General Games. What makes something a game?

CS 440 / ECE 448 Introduction to Artificial Intelligence Spring 2010 Lecture #5

ARTIFICIAL INTELLIGENCE (CS 370D)

Integrating Learning in a Multi-Scale Agent

Adversarial Search. CS 486/686: Introduction to Artificial Intelligence

Planning in autonomous mobile robotics

CSE 573: Artificial Intelligence

CS 188: Artificial Intelligence. Overview

CS 188: Artificial Intelligence Spring Announcements

CS 480: GAME AI INTRODUCTION TO GAME AI. 4/3/2012 Santiago Ontañón

Game playing. Chapter 5, Sections 1 6

CSE 40171: Artificial Intelligence. Adversarial Search: Games and Optimality

Robotics and Autonomous Systems

Artificial Intelligence: Implications for Autonomous Weapons. Stuart Russell University of California, Berkeley

CS 380: ARTIFICIAL INTELLIGENCE INTRODUCTION. Santiago Ontañón

Autonomous Agents and MultiAgent Systems* Lecture 2

Adversarial Search and Game Playing. Russell and Norvig: Chapter 5

CS 480: GAME AI DECISION MAKING AND SCRIPTING

Agents and Introduction to AI

Artificial Intelligence

Artificial Intelligence. Topic 5. Game playing

CS510 \ Lecture Ariel Stolerman

Ar#ficial)Intelligence!!

Discussion of Emergent Strategy

Artificial Intelligence. Minimax and alpha-beta pruning

CS343 Artificial Intelligence

CS 680: GAME AI INTRODUCTION TO GAME AI. 1/9/2012 Santiago Ontañón

Adversarial Search. Hal Daumé III. Computer Science University of Maryland CS 421: Introduction to Artificial Intelligence 9 Feb 2012

Logical Agents (AIMA - Chapter 7)

11/18/2015. Outline. Logical Agents. The Wumpus World. 1. Automating Hunt the Wumpus : A different kind of problem

What is AI? AI is the reproduction of human reasoning and intelligent behavior by computational methods. an attempt of. Intelligent behavior Computer

Announcements. CS 188: Artificial Intelligence Spring Game Playing State-of-the-Art. Overview. Game Playing. GamesCrafters

CSC384 Intro to Artificial Intelligence* *The following slides are based on Fahiem Bacchus course lecture notes.

CS 380: ARTIFICIAL INTELLIGENCE

Game Playing AI Class 8 Ch , 5.4.1, 5.5

Game-playing AIs: Games and Adversarial Search I AIMA

Introduction to Artificial Intelligence: cs580

Foundations of AI. 3. Solving Problems by Searching. Problem-Solving Agents, Formulating Problems, Search Strategies

DIT411/TIN175, Artificial Intelligence. Peter Ljunglöf. 2 February, 2018

Foundations of AI. 3. Solving Problems by Searching. Problem-Solving Agents, Formulating Problems, Search Strategies

Announcements. Homework 1. Project 1. Due tonight at 11:59pm. Due Friday 2/8 at 4:00pm. Electronic HW1 Written HW1

Agent-Based Systems. Agent-Based Systems. Agent-Based Systems. Five pervasive trends in computing history. Agent-Based Systems. Agent-Based Systems

INTRODUCTION TO GAME AI

Adversarial Search (Game Playing)

INTRODUCTION TO GAME AI

Multi-Robot Teamwork Cooperative Multi-Robot Systems

Introduction to Computer Science

CS 188: Artificial Intelligence Spring Game Playing in Practice

CS 4700: Foundations of Artificial Intelligence

CS 380: ARTIFICIAL INTELLIGENCE ADVERSARIAL SEARCH. Santiago Ontañón

LECTURE 26: GAME THEORY 1

CS 4700: Foundations of Artificial Intelligence

CS343 Introduction to Artificial Intelligence Spring 2012

Adversarial Search Lecture 7

Transcription:

CS 380: ARTIFICIAL INTELLIGENCE RATIONAL AGENTS Santiago Ontañón so367@drexel.edu

Outline What is an Agent? Rationality Agents and Environments Agent Types (these slides are adapted from Russel & Norvig s official slides)

What is an Agent? Agent: autonomous entity which observes and acts upon an environment and directs its activity towards achieving goals. Example agents: Humans Robots Software agents ATMs etc.

What is an Agent? Theoretically: f : P! A In practice: the agent runs on a physical system (e.g. a computer) to produce f

What is an Agent? Theoretically: f : P! A Maps sequences of percepts to actions In practice: the agent runs on a physical system (e.g. a computer) to produce f

Example: Vacuum Cleaner Room A Room B Percepts: Location sensor and Dirt sensor Actions: Left, Right, Suck, Wait

Example: Vacuum Cleaner Room A Room B [A, Clean] Percepts: Location sensor and Dirt sensor Actions: Left, Right, Suck, Wait

Example: Vacuum Cleaner

Example: Vacuum Cleaner Two questions: What is the function? Can it be implemented as a computer program? (How?)

Outline What is an Agent? Rationality Agents and Environments Agent Types (these slides are adapted from Russel & Norvig s official slides)

Rationality As we discussed last class, intelligence is an ill-defined concept. Let us assume a performance measure, that is given (usually external) to the agent. For example: $1 per room cleaned $10 per room cleaned minus $1 per each movement etc. Rational agent: Chooses actions that maximize the expected value of the performance measure given the current percept sequence.

Rationality Imagine two agents A and B whose performance measure is defined by how many $ they make at the casino. A and B play one game of Black Jack A plays the move that probabilistically has the highest chance of winning B plays a different, more risky move B ends up winning Which agent is rational?

Rationality Imagine two agents A and B whose performance measure is defined by how many $ they make at the casino. A and B play one game of Black Jack A plays the move that probabilistically has the highest chance of winning B plays a different, more risky move B ends up winning Which agent is rational? A is the rational agent Rationality does not imply clairvoyance Rationality does not imply omniscient Thus, rational does not mean successful

Outline What is an Agent? Rationality Agents and Environments Agent Types (these slides are adapted from Russel & Norvig s official slides)

How do we Design a Rational Agent? To design a rational agent, we first need to define its environment, performance measure, etc. PEAS: Performance Environment Actions Sensors (percepts)

Example (informal): Automated Taxi Performance: Environment: Actions: Sensors:

Example (informal): Automated Taxi Performance: profit, safety, legality, Environment: streets, pedestrians, cars, weather, traffic lights/signs, Actions: steering, throttle, break, horn, display, Sensors: GPS, video, sonar, keyboard, accelerometers, microphones,

Example: Chess Agent Performance: Environment: Actions: Sensors:

Example: Chess Agent Performance: Environment: Chess board, and opponent, chess rules. Actions: Sensors:

Example: Chess Agent Performance: Once reached a terminal state (draw, win): -1 for losing, 0 for draw, 1 for winning. Environment: Chess board, and opponent. Actions: Sensors:

Example: Chess Agent Performance: Once reached a terminal state (draw, win): -1 for losing, 0 for draw, 1 for winning. Environment: Chess board, and opponent. Actions: Pairs of coordinates: (x1,y1) à (x2, y2). Specify the source piece and the target position (for castling, the king s move is specified). Sensors:

Example: Chess Agent Performance: Once reached a terminal state (draw, win): -1 for losing, 0 for draw, 1 for winning. Environment: Chess board, and opponent. Actions: Pairs of coordinates: (x1,y1) à (x2, y2). Specify the source piece and the target position (for castling, the king s move is specified). Sensors: Board perceived as a 8x8 matrix. Each element in the matrix can take one of the following values: E, BP, WP, BB, WB, BK, WN, BR, WN, BQ, WK, BK, WK

Example: Chess Agent Performance: Once reached a terminal state (draw, win): -1 for losing, 0 for draw, 1 for winning. Environment: Chess board, and opponent. Actions: Pairs of coordinates: (x1,y1) à (x2, y2). Specify the source piece and the target position (for castling, the king s move is specified). Sensors: Board perceived as a 8x8 matrix. Each element in the matrix can take one of the following values: E, BP, WP, BB, WB, BN, WN, BR, WR, BQ, WQ, BK, WK The environment might have lots of features (piece size and material, opponent s facial expression, sunny vs. raining etc.) For rational agents we only need to build sensors for the information that is necessary to maximize the performance measure.

Example: Chess Agent WR WN WB WK WQ WB WN WR WP WP WP WP WP WP WP WP BP BP BP BP BP BP BP BP BR BN BB BK BQ BB BN BR Environment Percept

Properties of Environments Observable: The agent can sense the entire state of the environment. Deterministic: The outcome of actions is determined by the state of the board and the action executed. Sequential: Actions outcomes can be effected by prior actions (alternative to episodic). Static: State of the world doesn t change during deliberation (between actions). Discrete: Actions can only be performed in a small fixed number of ways. Single-Agent: There is only one agent of change.

Environment Types Observable Deterministic Sequential Static Discrete Single-Agent Solitaire Chess Backgammon Taxi StarCraft Real Life

Environment Types Observable Deterministic Sequential Static Discrete Single-Agent Solitaire No Yes Yes Yes Yes Yes Chess Backgammon Taxi StarCraft Real Life

Environment Types Observable Deterministic Sequential Static Discrete Single-Agent Solitaire No Yes Yes Yes Yes Yes Chess Yes Yes Yes Yes Yes No Backgammon Taxi StarCraft Real Life

Environment Types Observable Deterministic Sequential Static Discrete Single-Agent Solitaire No Yes Yes Yes Yes Yes Chess Yes Yes Yes Yes Yes No Backgammon Yes No Yes Yes Yes No Taxi StarCraft Real Life

Environment Types Observable Deterministic Sequential Static Discrete Single-Agent Solitaire No Yes Yes Yes Yes Yes Chess Yes Yes Yes Yes Yes No Backgammon Yes No Yes Yes Yes No Taxi No No Yes No No No StarCraft Real Life

Environment Types Observable Deterministic Sequential Static Discrete Single-Agent Solitaire No Yes Yes Yes Yes Yes Chess Yes Yes Yes Yes Yes No Backgammon Yes No Yes Yes Yes No Taxi No No Yes No No No StarCraft No Almost Yes No Yes No Real Life No No (?) Yes No No (?) No

Agent Types We will cover 4 basic types: Reactive agents (reflex agents) State-based agents Goal-based agents Utility-based agents They can all incorporate learning

Reactive Agents

State-based Agents

Goal-based Agents

Utility-based Agents

Learning Agents

What we have covered so far. What is AI? What is a Rational Agent? In the remainder weeks, we will cover: How can rational agents solve problems? How can rational agents represent knowledge? How can rational agents learn?