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

Similar documents
CS 188: Artificial Intelligence

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

CS 188: Artificial Intelligence Spring Announcements

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

CS 188: Artificial Intelligence Fall Announcements

CS 188: Artificial Intelligence Fall Announcements

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

CS 188: Artificial Intelligence Spring 2009

CS 188: Artificial Intelligence Spring Announcements

CS 188: Artificial Intelligence Spring Announcements

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

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

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

Self-Adjusting Top Trees

Problem solving by search

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

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

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

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

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

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

Chapter 6 Perturbation theory

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

10.3 The Quadratic Formula

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

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

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

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

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

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

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

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

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

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

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

(Minimum) Spanning Trees

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

CS 103 BFS Alorithm. Mark Redekopp

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

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

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

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

OpenMx Matrices and Operators

Lecture 20: Minimum Spanning Trees (CLRS 23)

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

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

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

Three Phase Asymmetrical Load Flow for Four-Wire Distribution Networks

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

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

Tangram Fractions Overview: Students will analyze standard and nonstandard

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

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

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

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

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

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

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

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

Planar convex hulls (I)

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

In which direction do compass needles always align? Why?

/99 $10.00 (c) 1999 IEEE

Search: Cost & Heuristics

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

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

Beechwood Music Department Staff

Polygons POLYGONS.

Form and content. Iowa Research Online. University of Iowa. Ann A Rahim Khan University of Iowa. Theses and Dissertations

Introduction to Inertial Dynamics

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

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

Rectangular Waveguides

Gavilan JCCD Trustee Areas Plan Adopted November 10, 2015

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

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

12. Traffic engineering

1 Introduction to Modulo 7 Arithmetic

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

LWC 434 East First Street 4440 Garwood Place

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

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

INFLUENCE OF ANTICLIMBING DEVICE ON THE VARIATION OF LOADS ON WHEELS IN DIESEL ELECTRIC 4000 HP

Ash Wednesday. First Introit thing. * Dómi- nos. di- di- nos, tú- ré- spi- Ps. ne. Dó- mi- Sál- vum. intra-vé-runt. Gló- ri-

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

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

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

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

Planar Upward Drawings

CATAVASII LA NAȘTEREA DOMNULUI DUMNEZEU ȘI MÂNTUITORULUI NOSTRU, IISUS HRISTOS. CÂNTAREA I-A. Ήχος Πα. to os se e e na aș te e e slă ă ă vi i i i i

Call for Applications

SHT 1 OF 3 SHT 2 AND 3 ARE -A- SIZE

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

Theory of Spatial Problems

KEB INVERTER L1 L2 L3 FLC - RELAY 1 COMMON I1 - APPROACH CLOSE 0V - DIGITAL COMMON FLA - RELAY 1 N.O. AN1+ - ANALOG 1 (+) CRF - +10V OUTPUT

Transcription:

1 C 232: A)iil Intllign Toy tm 3, 2015 Agnts tt Pln A Polms Uninom Mtos Dt- Fist Bt- Fist Uniom- Cost [Ts slis w t y Dn Klin n Pit Al o C188 Into to AI t UC Bkly. All C188 mtils vill t M://i.kly.u.] Agnts tt Pln Rlx Agnts Rlx gnts: Coos )on 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 )ons Consi ow t wol I Cn lx gnt )onl? [Dmo: lx o)ml (L2D1)] [Dmo: lx o)ml (L2D2)]

2 Vio o Dmo Rlx O)ml Vio o Dmo Rlx O Plnning gnts: Ask wt i Disions s on (yotsiz) onsuns o )ons Must v mol o ow t wol volvs in sons to )ons Must omult gol (tst) Consi ow t wol WOULD BE i tin )on is om O)ml vs. omlt lnning O)ml: in t st solu)on Comlt lnning: ins solu)on Plnning Agnts Polms Plnning vs. lnning nts on singl ln vs. lns t vy st o t wy [Dmo: lnning (L2D3)] [Dmo: mstmin (L2D4)]

3 Polms Polms A Mols A s olm onsists o: A stt s A mol o t wol t givn oint in tim. A susso un)on (wit )ons, osts) A stt stt n gol tst N, 1.0 E, 1.0 How t wol volvs in sons to gnt s tions. A solu)on is sun o )ons ( ln) wi tnsoms t stt stt to gol stt Imotnt: Fin t igt lvl o sttion, so tt you mol is goo mol o t wol. Exml: Tvling in Romni Wt s in tt? tt s: Ci)s usso un)on: Ros: o to jnt ity wit ost = istn tt stt: A ol tst: Is stt == Bust? olu)on? T wol stt inlus vy lst til o t nvionmnt A s stt ks only t tils n o lnning (st)on) Polm: Pting tts: (x,y) lo)on A)ons: NEW usso: ut lo)on only ol tst: is (x,y)=end Polm: Et- All- Dots tts: {(x,y), ot oolns} A)ons: NEW usso: ut lo)on n ossily ot ooln ol tst: ots ll ls

4 tt izs? Quiz: Pssg Wol stt: Agnt osi)ons: 120 Foo ount: 30 ost osi)ons: 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? olu)on: tt s n Ts tt s tt s g: A mtm)l snt)on o s olm Nos (stt) wol onigu)ons As snt sussos ()on 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

5 tt s Ts tt s g: A mtm)l snt)on o s olm Nos (stt) wol onigu)ons As snt sussos ()on sults) T gol tst is st o gol nos (my only on) 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 0ny s olm N, 1.0 E, 1.0 Tis is now / stt Possil utus 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 n0 PATH in t stt s g. W onstut ot on mn n w onstut s li:l s ossil. T Consi tis 4- stt g: How ig is its s t (om )? Imotnt: Lots o t stutu in t s t!

6 T Exml: Romni ing wit T nl T : Exn out otn)l lns (t nos) Mintin ing o )l lns un onsi)on Ty to xn s w t nos s ossil Imotnt is: Fing Exnsion Exlo)on sttgy Min us)on: wi ing nos to xlo?

7 Dt- Fist Dt- Fist ttgy: xn st no ist Imlmnt0on: Fing is LIFO stk Algoitm Po)s Dt- Fist (DF) Po)s Comlt: unt to in solu)on i on xists? O)ml: unt to in t lst ost t? Tim omlxity? omlxity? Ctoon o s t: is t ning to m is t mximum t solu)ons t vious ts Num o nos in n) t? 1 + + 2 +. m = O( m ) m tis 1 no nos 2 nos m nos Wt nos DF xn? om l ix o t t. Coul oss t wol t! I m is init, tks )m 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) Is it o)ml? No, it ins t lmost solu)on, glss o t o ost m tis 1 no nos 2 nos m nos

8 Bt- Fist Bt- Fist ttgy: xn sllowst no ist Imlmnt0on: Fing is FIFO uu Tis Bt- Fist (BF) Po)s Quiz: DF vs BF Wt nos os BF xn? Posss ll nos ov sllowst solu)on Lt t o sllowst solu)on s tks )m O( s s tis ) 1 no nos 2 nos How mu s os t ing tk? Hs ougly t lst ), so O( s ) s nos Is it omlt? s must init i solu)on xists, so ys! m nos Is it o)ml? Only i osts ll 1 (mo on osts lt) Wn will BF outom DF? Wn will DF outom BF? [Dmo: s/s mz wt (L2D6)]

9 Cost- nsi)v 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 )ons. 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) Po)s ttgy: xn st no ist: Fing is ioity uu (ioity: umultiv ost) 2 1 8 2 3 9 8 1 15 2 2 1 Wt nos os UC xn? Posss ll nos wit ost lss tn st solu)on! I tt solu)on osts C* n s ost t lst ε, tn t )v t is ougly C*/ε Tks )m O( C*/ε ) (xonn)l in )v t) C*/ε tis 1 2 3 0 3 9 1 How mu s os t ing tk? Hs ougly t lst ), so O( C*/ε ) Cost ontous 4 6 11 5 17 11 13 7 8 11 10 16 Is it omlt? Assuming st solu)on s init ost n minimum ost is osi)v, ys! Is it o)ml? Ys! (Poo nxt ltu vi A*)

10 Uniom Cost Issus T On Quu Rmm: UC xlos insing ost ontous T goo: UC is omlt n o)ml! T : Exlos o)ons in vy i)on No inom)on out gol lo)on W ll ix tt soon! tt 1 2 3 ol [Dmo: mty gi UC (L2D5)] [Dmo: mz wit /sllow wt DF/BF/UC (L2D7)] All ts s lgoitms t sm xt o ing sttgis Contully, ll ings ioity uus (i.. oll)ons o nos wit M ioi)s) P)lly, 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 imlmnt)on 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 simul)on You s is only s goo s you mols