• Sonuç bulunamadı

Yapay Zeka 802600715151

N/A
N/A
Protected

Academic year: 2021

Share "Yapay Zeka 802600715151"

Copied!
11
0
0

Yükleniyor.... (view fulltext now)

Tam metin

(1)

Yapay Zeka 802600715151

Doç. Dr. Mehmet Serdar GÜZEL

Slides are mainly adapted from the following course page:

at http://ai.berkeley.edu created by Dan Klein and Pieter Abbeel for CS188

(2)

Lecturer

Instructor: Assoc. Prof Dr. Mehmet S Güzel

Office hours: Tuesday, 1:30-2:30pm

Open door policy – don’t hesitate to stop by!

Watch the course website

Assignments, lab tutorials, lecture notes

sli d e 2

(3)

Natural Language

Speech technologies (e.g. Siri)

Automatic speech recognition (ASR)

Text-to-speech synthesis (TTS)

Dialog systems

Language processing technologies

Question answering

Machine translation

Web search

Text classification, spam filtering, etc…

(4)

Vision (Perception)

Images from Erik Sudderth (left), wikipedia (right)

 Object and face recognition

 Scene segmentation

 Image classification

Demo1: VISION – lec_1_t2_video.flv Demo2: VISION – lec_1_obj_rec_0.mpg

(5)

Robotics

Robotics

Part mech. eng.

Part AI

Reality much harder than simulations!

Technologies

Vehicles

Rescue

Soccer!

Lots of automation…

In this class:

We ignore mechanical aspects

Methods for planning

Methods for control

Images from UC Berkeley, Boston Dynamics, RoboCup, Google Demo 1: ROBOTICS – soccer.avi Demo 2: ROBOTICS – soccer2.avi Demo 3: ROBOTICS – gcar.avi

Demo 4: ROBOTICS – laundry.avi Demo 5: ROBOTICS – petman.avi

(6)

Logic

 Logical systems

Theorem provers

NASA fault diagnosis

Question answering

 Methods:

Deduction systems

Constraint satisfaction

Satisfiability solvers (huge advances!)

Image from Bart Selman

(7)

Game Playing

Classic Moment: May, '97: Deep Blue vs. Kasparov

First match won against world champion

“Intelligent creative” play

200 million board positions per second

Humans understood 99.9 of Deep Blue's moves

Can do about the same now with a PC cluster

Open question:

How does human cognition deal with the search space explosion of chess?

Or: how can humans compete with computers at all??

1996: Kasparov Beats Deep Blue

“I could feel --- I could smell --- a new kind of intelligence across the table.”

1997: Deep Blue Beats Kasparov

“Deep Blue hasn't proven anything.”

Huge game-playing advances recently, e.g. in Go!

Text from Bart Selman, image from IBM’s Deep Blue pages

(8)

Decision Making

Applied AI involves many kinds of automation

Scheduling, e.g. airline routing, military

Route planning, e.g. Google maps

Medical diagnosis

Web search engines

Spam classifiers

Automated help desks

Fraud detection

Product recommendations

… Lots more!

(9)

Designing Rational Agents

An agent is an entity that perceives and acts.

A rational agent selects actions that maximize its (expected) utility.

Characteristics of the percepts, environment, and action space dictate techniques for selecting

rational actions

This course is about:

 General AI techniques for a variety of problem types

 Learning to recognize when and how a new

problem can be solved with an existing technique

A ge n t

?

Sensors

Actuators

En vir o n m e n t

Percepts

Actions

(10)

Pac-Man as an Agent

Agent

? Sensors

Actuators

Environment

Percepts

Actions

Pac-Man is a registered trademark of Namco-Bandai Games, used here for educational purposes Demo1: pacman-l1.mp4 or L1D2

(11)

Course Topics

Part I: Making Decisions

Fast search / planning

Constraint satisfaction

Adversarial and uncertain search

Part II: Reasoning under Uncertainty

Bayes’ nets

Decision theory

Machine learning

Throughout: Applications

Natural language, vision, robotics, games, …

Referanslar

Benzer Belgeler

• It is called the depth-first search because it starts from the root node and follows each path to its greatest depth node before moving to the next path.. • DFS uses a stack

 Backtracking is an algorithmic-technique for solving problems recursively by trying to build a solution incrementally, one piece at a time, removing those solutions that fail

 Go: Human champions are now starting to be challenged by machines, though the best humans still beat the best machines.. In go, b

each time step, the process is in some state , and the decision maker may choose any action that is available in

Reinforcement learning is an area of machine learning concerned with how software agents ought to take actions in an environment so as to maximize some notion of cumulative

Q-learning is a values-based learning algorithm in reinforcement learning. . Introducing the Q-learning

It is assumed that future states depend only on the current state, not on the events that occurred before it (that is, it assumes the Markov

 Bu nedenle tüm seçilim yöntemlerinde uygunluk değeri fazla olan bireylerin seçilme olasılığı daha yüksektir..  En bilinen seçilim yöntemleri Rulet Seçilimi, Turnuva