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

Similar documents
CS 188: Artificial Intelligence Fall Announcements

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

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 Announcements

CS 188: Artificial Intelligence Spring Announcements

CS 188: Artificial Intelligence Spring 2009

Outline. CSE 473: Artificial Intelligence Spring Types of Agents

CS 188: Artificial Intelligence

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

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

Searching: Deterministic single-agent

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

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

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

Self-Adjusting Top Trees

Search: Cost & Heuristics

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

Problem solving by search

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

Tangram Fractions Overview: Students will analyze standard and nonstandard

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

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

10.3 The Quadratic Formula

1 Introduction to Modulo 7 Arithmetic

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

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

OpenMx Matrices and Operators

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

Lecture 20: Minimum Spanning Trees (CLRS 23)

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

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

Multicast routing algorithm based on Extended Simulated Annealing Algorithm

COMP108 Algorithmic Foundations

Distributed Set Reachability

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

/99 $10.00 (c) 1999 IEEE

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CS 241 Analysis of Algorithms

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

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

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

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

BACKFILLED 6" MIN TRENCH BOTT OF CONT FTG PROVIDE SLEEVE 1" CLR AROUND PIPE - TYP BOTTOM OF TRENCH PIPE SHALL NOT EXTEND BELOW THIS LINE

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

BACKFILLED 6" MIN TRENCH BOTT OF CONT FTG PROVIDE SLEEVE 1" CLR AROUND PIPE - TYP BOTTOM OF TRENCH PIPE SHALL NOT EXTEND BELOW THIS LINE

Chapter 6 Perturbation theory

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

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

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

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

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

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

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

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

Gavilan JCCD Trustee Areas Plan Adopted November 10, 2015

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

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

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

and the ANAVETS Unit Portage Ave, Winnipeg, Manitoba, Canada May 23 to May E L IBSF

In which direction do compass needles always align? Why?

CS 103 BFS Alorithm. Mark Redekopp

7 ACM FOR FRAME 2SET 6 FRAME 2SET 5 ACM FOR MAIN FRAME 2SET 4 MAIN FRAME 2SET 3 POLE ASSLY 1 2 CROWN STRUCTURE ASSLY 1 1 CROWN ASSLY 1

Planar Upward Drawings

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

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

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

CS 188: Artificial Intelligence Spring 2007

Daily Skill Practice

Constructive Geometric Constraint Solving

Winnie flies again. Winnie s Song. hat. A big tall hat Ten long toes A black magic wand A long red nose. nose. She s Winnie Winnie the Witch.

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

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

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

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

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

Three Phase Asymmetrical Load Flow for Four-Wire Distribution Networks

Designing A Uniformly Loaded Arch Or Cable

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

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


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

Rectangular Waveguides

Stable Matching for Spectrum Market with Guaranteed Minimum Requirement

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-

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

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

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

(Minimum) Spanning Trees

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

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

ENGO 431 Analytical Photogrammetry

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

Life After Study Abroad

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

Transcription:

C 88: Atiiil Intllign Fll 009 Ltu : Quu-Bs 9//009 Dn Klin UC Bkly Multil slis om tut Russll, Anw Moo Announmnts Pojt 0: Pyton Tutoil Du tomoow! T is l tomoow om m-3m in o 75 T l tim is otionl, ut P0 itsl is not On sumit, you soul gt mil om t utog Pojt : On t w toy tt ly n sk ustions. It s long tn most! Ot tion 07 ws on u, Fiys -m My OHs Mony w in t l, Tusy k in 7 o I OHs on w sit Agnts tt Pln A Polms Toy Uninom Mtos (t viw o som) Dt-Fist Bt-Fist Uniom-Cost Huisti Mtos (nw o ll) y 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 At on ow t wol I Cn lx gnt tionl? Rlx Agnts [mo: lx otiml / loo ] ol Bs Agnts ol-s gnts: Pln Ask wt i Disions s on (yotsiz) onsuns o tions Must v mol o ow t wol volvs in sons to tions At on ow t wol WOULD BE [mo: ln st / slow ] Polms A s olm onsists o: A stt s A susso untion A stt stt n gol tst N,.0 E,.0 A solution is sun o tions ( ln) wi tnsoms t stt stt to gol stt

Exml: Romni tt s tt s: Citis usso untion: o to j ity wit ost = ist tt stt: A ol tst: Is stt == Bust? olution? tt s g: A mtmtil snttion o s olm Fo vy s olm, t s osoning stt s g T susso untion is snt y s W n ly uil tis g in mmoy (so w on t) Riiulously tiny s g o tiny s olm tt izs? Ts Polm: Et ll o t oo Pmn ositions: 0 x = 0 Foo ount: 30 ost ositions: Pmn ing: u, own, lt, igt N,.0 E,.0 A s t: Tis is wt i t o lns n outoms tt stt t t oot no Ciln oson to sussos Nos ontin stts, oson to PLAN to tos stts Fo most olms, w n nv tully uil t wol t Anot T nl T : Exn out ossil lns Mintin ing o unxn lns Ty to xn s w t nos s ossil Imotnt is: Fing Exnsion Exlotion sttgy Dtil suoo is in t ook! Min ustion: wi ing nos to xlo?

Exml: T tt s vs. Ts E NODE in in t s t is n nti PATH in t olm g. W onstut ot on mn n w onstut s littl s ossil. tts vs. Nos Rviw: Dt Fist Nos in stt s gs olm stts Rsnt n stt stt o t wol Hv sussos, n gol / non-gol, v multil ssos Nos in s ts lns Rsnt ln (sun o tions) wi sults in t no s stt Hv olm stt n on nt, t lngt, t & ost T sm olm stt my iv y multil s t nos Polm tts Nos Pnt Dt 5 ttgy: xn st no ist Imlmnttion: Fing is LIFO stk No Ation Dt 6 Rviw: Bt Fist Algoitm Potis ttgy: xn sllowst no ist Imlmnttion: Fing is FIFO uu Tis Comlt? unt to in solution i on xists? Otiml? unt to in t lst ost t? Tim omlxity? omlxity? Vils: n Num o stts in t olm T vg ning to B (t vg num o sussos) C* Cost o lst ost solution s Dt o t sllowst solution m Mx t o t s t 3

DF Algoitm Comlt Otiml Tim DF Dt Fist N N N N O(B Ininit LMAX ) O(LMAX) Ininit DF Wit yl king, DF is omlt.* m tis no nos nos TART OAL m nos Ininit ts mk DF inomlt How n w ix tis? Algoitm Comlt Otiml Tim DF w/ Pt Cking Y N O( m+ ) O(m) Wn is DF otiml? * O g s nxt ltu. BF Algoitm Comlt Otiml Tim DF BF w/ Pt Cking Y N O( m+ ) O(m) Y N* O( s+ ) O( s ) Comisons Wn will BF outom DF? s tis no nos nos Wn will DF outom BF? s nos m nos Wn is BF otiml? Ittiv Dning Ittiv ning uss DF s suoutin:. Do DF wi only ss o ts o lngt o lss.. I il, o DF wi only ss ts o lngt o lss. 3. I il, o DF wi only ss ts o lngt 3 o lss..n so on. Algoitm Comlt Otiml Tim DF BF ID w/ Pt Cking Y N O( m+ ) O(m) Y N* O( s+ ) O( s ) Y N* O( s+ ) O(s) TART 3 Costs on Ations 5 8 OAL Noti tt BF ins t sotst t in tms o num o tnsitions. It os not in t lst-ost t. W will uikly ov n lgoitm wi os in t lst-ost t. 9 8 4 4 3 4

Uniom Cost Pioity Quu Rs Exn st no ist: Fing is ioity uu Cost ontous 4 6 3 9 5 3 7 0 8 8 3 9 8 5 7 0 6 A ioity uu is t stutu in wi you n inst n tiv (ky, vlu) is wit t ollowing otions:.us(ky, vlu).o() insts (ky, vlu) into t uu. tuns t ky wit t lowst vlu, n movs it om t uu. You n s ky s ioity y using it gin Unlik gul uu, instions n t onstnt tim, usully O(log n) W ll n ioity uus o ost-snsitiv s mtos Uniom Cost Uniom Cost Issus Algoitm Comlt Otiml Tim DF BF UC w/ Pt Cking Y N O( m+ ) O(m) Y N O( s+ ) O( s ) Y* Y O( C*/ε ) O( C*/ε ) Rmm: xlos insing ost ontous T goo: UC is omlt n otiml! 3 C*/ε tis * UC n il i tions n gt itily T : Exlos otions in vy ition No inomtion out gol lotion tt ol [mo: s mo mty] Huistis Huistis Any stimt o ow los stt is to gol Dsign o tiul s olm Exmls: Mnttn istn, Eulin istn 0 5. 5

Bst Fist / y Bst Fist / y Exn t no tt sms losst A ommon s: Bst-ist tks you stigt to t (wong) gol Wost-s: lik lygui DF in t wost s Cn xlo vyting Cn gt stuk in loos i no yl king Wt n go wong? [mo: gy] Lik DF in omltnss (init stts w/ yl king) on Wong? 6