CS 188: Artificial Intelligence

Similar documents
Today. CS 232: Ar)ficial Intelligence. Search. Agents that Plan. September 3 rd, 2015 Search Problems. Uninformed Search Methods

Outline. CSE 473: Artificial Intelligence Spring Types of Agents

Announcements. CS 188: Artificial Intelligence Fall Reflex Agents. Today. Goal Based Agents. Search Problems

CS 188: Artificial Intelligence Fall 2011

Announcements. CS 188: Artificial Intelligence Fall Today. Reflex Agents. Goal Based Agents. Search Problems

CS 188: Artificial Intelligence Spring Announcements

CS 188: Artificial Intelligence Fall Announcements

CS 188: Artificial Intelligence Fall Announcements

CS 188: Artificial Intelligence Spring Announcements

CS 188: Artificial Intelligence Spring Announcements

Announcements. CS 188: Artificial Intelligence Spring More Announcements. Today. From Last Time: Reflex Agents.

CS 188: Artificial Intelligence Spring 2009

Reminder. CS 188: Artificial Intelligence. A reflex agent for pacman. Reflex Agent. A reflex agent for pacman (3) A reflex agent for pacman (2)

CSE 573: Artificial Intelligence Autumn Search thru a. Goal Based Agents 9/28/2012. Agent vs. Environment. Example: N Queens

A search problem. Formalizing a search problem. Our Search Problem. Our Search Problem. Overview

Searching: Deterministic single-agent

Course Logistics Textbook: Artificial Intelligence: A Modern Approach, Russell and Norvig (3 rd ed) Topics

Announcements. CS 188: Artificial Intelligence Fall Office hours, Section. Today. DFS and BFS. Recap: Search. Lecture 3: A* Search 9/3/2009

Self-Adjusting Top Trees

Exam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms

Problem solving by search

Announcements. CS 188: Artificial Intelligence. Costs on Actions. Recap: Search. Lecture 3: A* Search

Chapter 6 Perturbation theory

d e c b a d c b a d e c b a a c a d c c e b

Search: Cost & Heuristics

Easy Steps to build a part number... Tri-Start Series III CF P

Weighted Graphs. Weighted graphs may be either directed or undirected.

T h e C S E T I P r o j e c t

OpenMx Matrices and Operators

10.3 The Quadratic Formula

Problem 1. Solution: = show that for a constant number of particles: c and V. a) Using the definitions of P

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

( ) ( ) ( ) 0. Conservation of Energy & Poynting Theorem. From Maxwell s equations we have. M t. From above it can be shown (HW)

P a g e 3 6 of R e p o r t P B 4 / 0 9

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017

DATA Search I 魏忠钰. 复旦大学大数据学院 School of Data Science, Fudan University. March 7 th, 2018

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

Multicast routing algorithm based on Extended Simulated Annealing Algorithm

176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s

P a g e 5 1 of R e p o r t P B 4 / 0 9

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Tangram Fractions Overview: Students will analyze standard and nonstandard

Appendix. In the absence of default risk, the benefit of the tax shield due to debt financing by the firm is 1 C E C

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

(Minimum) Spanning Trees

Rectangular Waveguides

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Three Phase Asymmetrical Load Flow for Four-Wire Distribution Networks

Lecture 20: Minimum Spanning Trees (CLRS 23)

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

LWC 434 East First Street 4440 Garwood Place

Planar convex hulls (I)

n gativ b ias to phap s 5 Q mou ntd ac oss a 50 Q co-a xial l, i t whn bias no t back-bia s d, so t hat p ow fl ow wi ll not b p ositiv. Th u s, if si

Series III, TV Breakaway Fail-Safe Connectors Quick-Disconnect with an Axial Pull of Lanyard

Trade Patterns, Production networks, and Trade and employment in the Asia-US region

Who is this Great Team? Nickname. Strangest Gift/Friend. Hometown. Best Teacher. Hobby. Travel Destination. 8 G People, Places & Possibilities

NUCON NRNON CONRNC ON CURRN RN N CHNOOGY, 011 oo uul o w ul x ol volv y y oll. y ov,., - o lo ll vy ul o Mo l u v ul (G) v Gl vlu oll. u 3- [11]. 000

Call for Applications

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

I N A C O M P L E X W O R L D

The local orthonormal basis set (r,θ,φ) is related to the Cartesian system by:

A TYP A-602 A-304 A-602 A-302 GRADE BEAM SEE 95% COMPACTED STRUCTURAL FILL A '-0"

Functions and Graphs 1. (a) (b) (c) (f) (e) (d) 2. (a) (b) (c) (d)

1 Introduction to Modulo 7 Arithmetic

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

PLAYGROUND SALE Take up to 40% off. Plus FREE equipment * with select purchase DETAILS INSIDE

In which direction do compass needles always align? Why?

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

Uninformed Search Lecture 4

CS 241 Analysis of Algorithms

Classical Theory of Fourier Series : Demystified and Generalised VIVEK V. RANE. The Institute of Science, 15, Madam Cama Road, Mumbai

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

Exhibit 2-9/30/15 Invoice Filing Page 1841 of Page 3660 Docket No

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

L...,,...lllM" l)-""" Si_...,...

Housing Market Monitor

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

CEDAR ISLAND / KEATON BEACH TAYLOR COUNTY, FLORIDA POST-HURRICANE HERMINE EXAMINATION SURVEY FY16 4-FOOT PROJECT

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

C-201 Sheet Bar Measures 1 inch

I M P O R T A N T S A F E T Y I N S T R U C T I O N S W h e n u s i n g t h i s e l e c t r o n i c d e v i c e, b a s i c p r e c a u t i o n s s h o

Beechwood Music Department Staff

c. What is the average rate of change of f on the interval [, ]? Answer: d. What is a local minimum value of f? Answer: 5 e. On what interval(s) is f

Daily Skill Practice

A L A BA M A L A W R E V IE W

Telecommunications BUILDING INTERCOM CALL BUTTON WITH 3/4"C AND PULL STRING TO ACCESSIBLE CEILING SPACE. MOUNT 48" AFF.

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

F102 1/4 AMP +240 VDC SEE FIGURE 5-14 FILAMENT AND OVEN CKTS BLU J811 BREAK-IN TB103 TO S103 TRANSMITTER ASSOCIATED CAL OFF FUNCTION NOTE 2 STANDBY

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

C-Curves. An alternative to the use of hyperbolic decline curves S E R A F I M. Prepared by: Serafim Ltd. P. +44 (0)

Gavilan JCCD Trustee Areas Plan Adopted November 10, 2015

Priority Search Trees - Part I

Theory of Spatial Problems

Transcription:

C 188: Atiiil Intllign Toy Agnts tt Pln A Polms Instuto: Mo Alvz Univsity o Ro Isln (Ts slis w t/moii y Dn Klin, Pit Al, An Dgn o C188 t UC Bkly) Uninom Mtos Dt-Fist Bt-Fist Uniom-Cost Agnts tt Pln Rlx Agnts Rlx gnts: Coos tion s on unt t (n my mmoy) My v mmoy o mol o t wol s unt stt Do not onsi t utu onsuns o ti tions Consi ow t wol I Cn lx gnt tionl? [Dmo: lx otiml (L2D1)] [Dmo: lx otiml (L2D2)]

Vio o Dmo Rlx Otiml Vio o Dmo Rlx O Plnning Agnts Vio o Dmo Mstmin Plnning gnts: Ask wt i Disions s on (yotsiz) onsuns o tions Must v mol o ow t wol volvs in sons to tions Must omult gol (tst) Consi ow t wol WOULD BE Otiml vs. omlt lnning Plnning vs. lnning [Dmo: -lnning (L2D3)] [Dmo: mstmin (L2D4)]

Vio o Dmo Rlnning Polms Polms Polms A Mols A s olm onsists o: A stt s A susso untion (wit tions, osts) A stt stt n gol tst N, 1.0 E, 1.0 A solution is sun o tions ( ln) wi tnsoms t stt stt to gol stt

Exml: Tvling in Romni Wt s in tt? tt s: Citis usso untion: Ros: o to jnt ity wit ost = istn tt stt: A ol tst: Is stt == Bust? olution? T wol stt inlus vy lst til o t nvionmnt A s stt ks only t tils n o lnning (sttion) Polm: Pting tts: (x,y) lotion Ations: NEW usso: ut lotion only ol tst: is (x,y)=end Polm: Et-All-Dots tts: {(x,y), ot oolns} Ations: NEW usso: ut lotion n ossily ot ooln ol tst: ots ll ls tt izs? Quiz: Pssg Wol stt: Agnt ositions: 120 Foo ount: 30 ost ositions: 12 Agnt ing: NEW How mny Wol stts? 120x(2 30 )x(12 2 )x4 tts o ting? 120 tts o t-ll-ots? 120x(2 30 ) Polm: t ll ots wil king t gosts m-s Wt os t stt s v to siy? (gnt osition, ot oolns, ow llt oolns, mining s tim)

tt s n Ts tt s tt s g: A mtmtil snttion o s olm Nos (stt) wol onigutions As snt sussos (tion sults) T gol tst is st o gol nos (my only on) In stt s g, stt ous only on! W n ly uil tis ull g in mmoy (it s too ig), ut it s usul i tt s Ts tt s g: A mtmtil snttion o s olm Nos (stt) wol onigutions As snt sussos (tion sults) T gol tst is st o gol nos (my only on) N, 1.0 E, 1.0 Tis is now / stt Possil utus In s g, stt ous only on! W n ly uil tis ull g in mmoy (it s too ig), ut it s usul i Tiny s g o tiny s olm A s t: A wt i t o lns n ti outoms T stt stt is t oot no Ciln oson to sussos Nos sow stts, ut oson to PLAN tt iv tos stts Fo most olms, w n nv tully uil t wol t

tt s vs. Ts Quiz: tt s vs. Ts tt E NODE in in t s t is n nti PATH in t stt s g. W onstut ot on mn n w onstut s littl s ossil. T Consi tis 4-stt g: How ig is its s t (om )? Imotnt: Lots o t stutu in t s t! T Exml: Romni

ing wit T nl T : Exn out otntil lns (t nos) Mintin ing o til lns un onsition Ty to xn s w t nos s ossil Imotnt is: Fing Exnsion Exlotion sttgy Min ustion: wi ing nos to xlo? Exml: T Dt-Fist

Dt-Fist Algoitm Potis ttgy: xn st no ist Imlmnttion: Fing is LIFO stk Algoitm Potis Dt-Fist (DF) Potis Comlt: unt to in solution i on xists? Otiml: unt to in t lst ost t? Tim omlxity? omlxity? Ctoon o s t: is t ning to m is t mximum t solutions t vious ts m tis 1 no nos 2 nos Wt nos DF xn? om lt ix o t t. Coul oss t wol t! I m is init, tks tim O( m ) How mu s os t ing tk? Only s silings on t to oot, so O(m) Is it omlt? m oul ininit, so only i w vnt yls (mo lt) m tis 1 no nos 2 nos m nos Num o nos in nti t? 1 + + 2 +. m = O( m ) m nos Is it otiml? No, it ins t ltmost solution, glss o t o ost

Bt-Fist Bt-Fist ttgy: xn sllowst no ist Imlmnttion: Fing is FIFO uu Tis Bt-Fist (BF) Potis Quiz: DF vs BF Wt nos os BF xn? Posss ll nos ov sllowst solution Lt t o sllowst solution s tks tim O( s ) s tis 1 no nos 2 nos How mu s os t ing tk? Hs ougly t lst ti, so O( s ) s nos Is it omlt? s must init i solution xists, so ys! m nos Is it otiml? Only i osts ll 1 (mo on osts lt)

Quiz: DF vs BF Vio o Dmo Mz Wt DF/BF (t 1) Wn will BF outom DF? Wn will DF outom BF? [Dmo: s/s mz wt (L2D6)] Vio o Dmo Mz Wt DF/BF (t 2) Ittiv Dning I: gt DF s s vntg wit BF s tim / sllow-solution vntgs Run DF wit t limit 1. I no solution Run DF wit t limit 2. I no solution Run DF wit t limit 3... Isn t tt wstully unnt? nlly most wok ns in t lowst lvl s, so not so!

Cost-nsitiv Uniom Cost TART 2 3 1 1 2 3 8 2 9 8 2 4 4 15 OAL 2 2 BF ins t sotst t in tms o num o tions. It os not in t lst-ost t. W will now ov simil lgoitm wi os in t lst-ost t. Uniom Cost Uniom Cost (UC) Potis ttgy: xn st no ist: Fing is ioity uu (ioity: umultiv ost) 2 1 8 2 3 9 8 2 1 15 2 1 Wt nos os UC xn? Posss ll nos wit ost lss tn st solution! I tt solution osts C* n s ost t lst ε, tn t tiv t is ougly C*/ε Tks tim O( C*/ε ) (xonntil in tiv t) C*/ε tis 1 2 3 Cost ontous 4 6 0 3 9 1 5 17 11 16 11 13 7 8 11 10 How mu s os t ing tk? Hs ougly t lst ti, so O( C*/ε ) Is it omlt? Assuming st solution s init ost n minimum ost is ositiv, ys! Is it otiml? Ys! (Poo nxt ltu vi A*)

Uniom Cost Issus Vio o Dmo Emty UC Rmm: UC xlos insing ost ontous T goo: UC is omlt n otiml! 1 2 3 T : Exlos otions in vy ition No inomtion out gol lotion W ll ix tt soon! tt ol [Dmo: mty gi UC (L2D5)] [Dmo: mz wit /sllow wt DF/BF/UC (L2D7)] Vio o Dmo Mz wit D/llow Wt --- DF, BF, o UC? (t 1) Vio o Dmo Mz wit D/llow Wt --- DF, BF, o UC? (t 2)

Vio o Dmo Mz wit D/llow Wt --- DF, BF, o UC? (t 3) T On Quu All ts s lgoitms t sm xt o ing sttgis Contully, ll ings ioity uus (i.. olltions o nos wit tt ioitis) Ptilly, o DF n BF, you n voi t log(n) ov om n tul ioity uu, y using stks n uus Cn vn o on imlmnttion tt tks vil uuing ojt n Mols on Wong? ots ov mols o t wol T gnt osn t tully ty ll t lns out in t l wol! Plnning is ll in simultion You s is only s goo s you mols