• Keine Ergebnisse gefunden

Foundations of Artificial Intelligence 4. Introduction: Environments and Problem Solving Methods Malte Helmert

N/A
N/A
Protected

Academic year: 2022

Aktie "Foundations of Artificial Intelligence 4. Introduction: Environments and Problem Solving Methods Malte Helmert"

Copied!
33
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Foundations of Artificial Intelligence

4. Introduction: Environments and Problem Solving Methods

Malte Helmert

University of Basel

March 8, 2021

(2)

Environments Problem Solving Methods Classification of AI Topics Summary

Introduction: Overview

Chapter overview: introduction 1. What is Artificial Intelligence?

2. AI Past and Present 3. Rational Agents

4. Environments and Problem Solving Methods

(3)

Environments Problem Solving Methods Classification of AI Topics Summary

Environments of Rational Agents

(4)

Environments Problem Solving Methods Classification of AI Topics Summary

AI Problems

AI Problems

AI problem: performance measure + agent model + environment

German: Performance-Mass, Agentenmodell, Umgebung agent model:

Which actions are at the agent’s disposal?

Which observations can it make?

environment:

Which aspects of the world are relevant for the agent?

How does the world react to the agent’s actions?

Which observations does it send to the agent?

(5)

Environments Problem Solving Methods Classification of AI Topics Summary

Example Problem: Autonomous Taxi

Example (Autonomous Taxi) environment:

streets, vehicles, pedestrians, weather, . . . performance measure:

punctuality, safety, profit, legality, comfort, . . . agent model:

actions: steering, accelerating, braking, changing gears, honking, . . .

observations: cameras, acceleration sensors, GPS, touchpad, . . .

(6)

Environments Problem Solving Methods Classification of AI Topics Summary

Example Problem: Web Shopping Bot

Example (Web Shopping Bot) environment:

web pages, products, sellers, . . . performance measure:

cost and quality of bought products, shipping time, . . . agent model:

actions: querying the user, following links, filling in forms, . . . observations: HTML pages (text, images, scripts, metadata), user input, . . .

(7)

Environments Problem Solving Methods Classification of AI Topics Summary

Classification of Environments

properties of environment determine character of an AI problem

classify according to criteria such as:

staticvs.dynamic

deterministicvs.non-deterministic vs.stochastic fullyvs.partiallyvs.notobservable

discretevs.continuous single-agentvs.multi-agent

(8)

Environments Problem Solving Methods Classification of AI Topics Summary

Properties of Environments

Example (Properties of Environments)

Rubik’s Cube backgammon shopping bot taxi static

yes (yes) (yes) no

deterministic

yes stochastic (yes) no

observability

fully fully partially partially

discrete

yes yes yes no

agents

1 2 (adversaries) (1) many

static vs. dynamic

Does the state of the environment remain the same while the agent is contemplating its next action?

German: statisch, dynamisch

(9)

Environments Problem Solving Methods Classification of AI Topics Summary

Properties of Environments

Example (Properties of Environments)

Rubik’s Cube backgammon shopping bot taxi

static yes (yes) (yes) no

deterministic

yes stochastic (yes) no

observability

fully fully partially partially

discrete

yes yes yes no

agents

1 2 (adversaries) (1) many

static vs. dynamic

Does the state of the environment remain the same while the agent is contemplating its next action?

German: statisch, dynamisch

(10)

Environments Problem Solving Methods Classification of AI Topics Summary

Properties of Environments

Example (Properties of Environments)

Rubik’s Cube backgammon shopping bot taxi

static yes (yes) (yes) no

deterministic

yes stochastic (yes) no

observability

fully fully partially partially

discrete

yes yes yes no

agents

1 2 (adversaries) (1) many

deterministic vs. non-deterministic vs. stochastic

Is the next state of the environment fully determined by the current state and the agent’s next action?

If not: is the next state affected by randomness?

German: deterministisch, nichtdeterministisch, stochastisch

(11)

Environments Problem Solving Methods Classification of AI Topics Summary

Properties of Environments

Example (Properties of Environments)

Rubik’s Cube backgammon shopping bot taxi

static yes (yes) (yes) no

deterministic yes stochastic (yes) no

observability

fully fully partially partially

discrete

yes yes yes no

agents

1 2 (adversaries) (1) many

deterministic vs. non-deterministic vs. stochastic

Is the next state of the environment fully determined by the current state and the agent’s next action?

If not: is the next state affected by randomness?

German: deterministisch, nichtdeterministisch, stochastisch

(12)

Environments Problem Solving Methods Classification of AI Topics Summary

Properties of Environments

Example (Properties of Environments)

Rubik’s Cube backgammon shopping bot taxi

static yes (yes) (yes) no

deterministic yes stochastic (yes) no

observability

fully fully partially partially

discrete

yes yes yes no

agents

1 2 (adversaries) (1) many

fully vs. partially vs. not observable

Do the agent’s observations completely determine the state of the environment?

If not: can the agent at least determine some aspects of the state of the environment?

German: vollst¨andig/teilweise/nicht beobachtbar

(13)

Environments Problem Solving Methods Classification of AI Topics Summary

Properties of Environments

Example (Properties of Environments)

Rubik’s Cube backgammon shopping bot taxi

static yes (yes) (yes) no

deterministic yes stochastic (yes) no

observability fully fully partially partially

discrete

yes yes yes no

agents

1 2 (adversaries) (1) many

fully vs. partially vs. not observable

Do the agent’s observations completely determine the state of the environment?

If not: can the agent at least determine some aspects of the state of the environment?

German: vollst¨andig/teilweise/nicht beobachtbar

(14)

Environments Problem Solving Methods Classification of AI Topics Summary

Properties of Environments

Example (Properties of Environments)

Rubik’s Cube backgammon shopping bot taxi

static yes (yes) (yes) no

deterministic yes stochastic (yes) no

observability fully fully partially partially

discrete

yes yes yes no

agents

1 2 (adversaries) (1) many

discrete vs. continuous

Is the environment’s state given by discrete or by continuous parameters?

also applies to: actions of the agent, observations, elapsing time German: diskret, stetig

(15)

Environments Problem Solving Methods Classification of AI Topics Summary

Properties of Environments

Example (Properties of Environments)

Rubik’s Cube backgammon shopping bot taxi

static yes (yes) (yes) no

deterministic yes stochastic (yes) no

observability fully fully partially partially

discrete yes yes yes no

agents

1 2 (adversaries) (1) many

discrete vs. continuous

Is the environment’s state given by discrete or by continuous parameters?

also applies to: actions of the agent, observations, elapsing time German: diskret, stetig

(16)

Environments Problem Solving Methods Classification of AI Topics Summary

Properties of Environments

Example (Properties of Environments)

Rubik’s Cube backgammon shopping bot taxi

static yes (yes) (yes) no

deterministic yes stochastic (yes) no

observability fully fully partially partially

discrete yes yes yes no

agents

1 2 (adversaries) (1) many

single-agent vs. multi-agent Must other agents be considered?

If yes: do the agents behave cooperatively, selfishly, or are they adversaries?

German: ein/mehrere Agenten; Gegenspieler

(17)

Environments Problem Solving Methods Classification of AI Topics Summary

Properties of Environments

Example (Properties of Environments)

Rubik’s Cube backgammon shopping bot taxi

static yes (yes) (yes) no

deterministic yes stochastic (yes) no

observability fully fully partially partially

discrete yes yes yes no

agents 1 2 (adversaries) (1) many

single-agent vs. multi-agent Must other agents be considered?

If yes: do the agents behave cooperatively, selfishly, or are they adversaries?

German: ein/mehrere Agenten; Gegenspieler

(18)

Environments Problem Solving Methods Classification of AI Topics Summary

Properties of Environments

Example (Properties of Environments)

Rubik’s Cube backgammon shopping bot taxi

static yes (yes) (yes) no

deterministic yes stochastic (yes) no

observability fully fully partially partially

discrete yes yes yes no

agents 1 2 (adversaries) (1) many

suitable problem solving algorithms

Environments of different kinds(according to these criteria) usually requiredifferent algorithms.

The “real world” combines all unpleasant (in the sense of: difficult to handle) properties.

(19)

Environments Problem Solving Methods Classification of AI Topics Summary

Problem Solving Methods

(20)

Environments Problem Solving Methods Classification of AI Topics Summary

Three Approaches to Problem Solving

We can solve aconcrete AI problem (e.g., backgammon) in several ways:

Three Problem Solving Methods

1 problem-specific: implement algorithm “by hand”

2 general: create problem description + use general algorithm (solver)

3 learning: learn(aspects of) algorithm from experience German: problemspezifisch, allgemein, lernend

all three approaches have strengths and weaknesses (which?) combinations are possible

we will mostly focus on generalalgorithms, but also consider other approaches

(21)

Environments Problem Solving Methods Classification of AI Topics Summary

General Problem Solvers

General problem solving:

problem instance =⇒language =⇒solver=⇒solution

1 modelsto classify, define and understand problems What is a probleminstance?

What is asolution?

What is agood/optimalsolution?

2 languages to represent problem instances

3 algorithms to find solutions

German: Probleminstanz, Sprache, Solver/L¨oser, L¨osung, Modelle

(22)

Environments Problem Solving Methods Classification of AI Topics Summary

Classification of AI Topics

(23)

Environments Problem Solving Methods Classification of AI Topics Summary

Classification of AI Topics

Many areas of AI are essentially characterized by theproperties of environments they consider and which of the three problem solving approachesthey use.

We conclude the introduction by giving some examples within this course and

beyond the course (“advanced topics”).

(24)

Environments Problem Solving Methods Classification of AI Topics Summary

Examples: Classification of AI Topics

Course Topic: Informed Search Algorithms environment:

static vs. dynamic

deterministic vs. non-deterministicvs. stochastic fully vs.partially vs. notobservable

discrete vs.continuous single-agent vs. multi-agent problem solving method:

problem-specificvs. generalvs. learning

(25)

Environments Problem Solving Methods Classification of AI Topics Summary

Examples: Classification of AI Topics

Course Topic: Constraint Satisfaction Problems environment:

static vs. dynamic

deterministic vs. non-deterministicvs. stochastic fully vs.partially vs. notobservable

discrete vs.continuous single-agent vs. multi-agent problem solving method:

problem-specificvs. generalvs. learning

(26)

Environments Problem Solving Methods Classification of AI Topics Summary

Examples: Classification of AI Topics

Course Topic: Board Games environment:

static vs. dynamic

deterministic vs. non-deterministicvs. stochastic fully vs.partially vs. notobservable

discrete vs.continuous

single-agent vs. multi-agent(adversarial) problem solving method:

problem-specificvs. generalvs. learning

(27)

Environments Problem Solving Methods Classification of AI Topics Summary

Examples: Classification of AI Topics

Advanced Topic: General Game Playing environment:

static vs. dynamic

deterministic vs. non-deterministicvs. (stochastic) fully vs.partially vs. notobservable

discrete vs.continuous

single-agent vs. multi-agent(adversarial) problem solving method:

problem-specificvs. generalvs. learning

(28)

Environments Problem Solving Methods Classification of AI Topics Summary

Examples: Classification of AI Topics

Course Topic: Classical Planning environment:

static vs. dynamic

deterministic vs. non-deterministicvs. stochastic fully vs.partially vs. notobservable

discrete vs.continuous single-agent vs. multi-agent problem solving method:

problem-specificvs. generalvs. learning

(29)

Environments Problem Solving Methods Classification of AI Topics Summary

Examples: Classification of AI Topics

Course Topic: Acting under Uncertainty environment:

static vs. dynamic

deterministic vs. non-deterministicvs. stochastic fully vs.partially vs. notobservable

discrete vs.continuous single-agent vs. multi-agent problem solving method:

problem-specificvs. generalvs. learning

(30)

Environments Problem Solving Methods Classification of AI Topics Summary

Examples: Classification of AI Topics

Advanced Topic: Reinforcement Learning environment:

static vs. dynamic

deterministic vs. non-deterministicvs. stochastic fully vs.partially vs. notobservable

discrete vs.continuous single-agent vs. multi-agent problem solving method:

problem-specificvs. generalvs. learning

(31)

Environments Problem Solving Methods Classification of AI Topics Summary

Summary

(32)

Environments Problem Solving Methods Classification of AI Topics Summary

Summary (1)

AI problem: performance measure + agent model + environment Properties ofenvironmentcritical for choice of suitable algorithm:

static vs. dynamic

deterministic vs. non-deterministicvs. stochastic fully vs.partially vs. notobservable

discrete vs.continuous single-agent vs. multi-agent

(33)

Environments Problem Solving Methods Classification of AI Topics Summary

Summary (2)

Threeproblem solving methods:

problem-specific general

learning

general problem solvers:

modelscharacterize problem instances mathematically languages describe models compactly

algorithms use languages asproblem description and to exploit problem structure

Referenzen

ÄHNLICHE DOKUMENTE

heuristics estimate distance of a state to the goal can be used to focus search on promising states soon: search algorithms that

Dealing with Local Optima Outlook: Simulated Annealing Outlook: Genetic Algorithms Summary.. Combinatorial

tree decomposition: build tree-like meta constraint network meta variables: groups of original variables. that jointly cover all variables

Propositional formulas combine atomic formulas with ¬, ∧, ∨, → to more complex statements. Interpretations determine which atomic formulas are true and which ones

Resolution can be used for general reasoning by reducing to a test for unsatisfiability... Reasoning

basic idea of abstraction heuristics: estimate solution cost by considering a smaller planning task. formally: abstraction function α maps states to abstract states and thus

Hence the objective of our landmark heuristics is to approximate the optimal delete relaxed heuristic h + as accurately as possible.. More advanced landmark techniques work directly

As in classical search problems, the number of positions of (interesting) board games is huge:. Chess: roughly 10 40