Romania with step costs in km

Slides:



Advertisements
Similar presentations
Lights Out Issues Questions? Comment from me.
Advertisements

1 Search Problems (read Chapters 3 and 4 of Russell and Norvig) Many (perhaps most) AI problems can be considered search problems. This can be modeled.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 4 Jim Martin.
G5BAIM Artificial Intelligence Methods Graham Kendall Blind Searches.
AI Principles, Semester 2, Week 1, Lecture 3, Search Examples of problems which are solved by search Setting the scene: your Romanian holiday search problem.
UNINFORMED SEARCH Problem - solving agents Example : Romania  On holiday in Romania ; currently in Arad.  Flight leaves tomorrow from Bucharest.
Informed search.
Introduction to Artificial Intelligence A* Search Ruth Bergman Fall 2002.
A* Search Introduction to AI. What is an A* Search? A greedy search method minimizes the cost to the goal by using an heuristic function, h(n). It works.
Artificial Intelligence
Cooperating Intelligent Systems Informed search Chapter 4, AIMA.
Oregon State University – CS430 Intro to AI (c) 2003 Thomas G. Dietterich and Devika Subramanian1 Search-Based Agents  Appropriate in Static Environments.
Introduction to Artificial Intelligence Problem Solving Ruth Bergman Fall 2002.
Informed Search Methods How can we make use of other knowledge about the problem to improve searching strategy? Map example: Heuristic: Expand those nodes.
Problem Solving and Search in AI Heuristic Search
Spanning Trees. Spanning trees Suppose you have a connected undirected graph –Connected: every node is reachable from every other node –Undirected: edges.
Pag.1 Artificial Intelligence Informed search algorithms Chapter 4, Sections 1-5.
Rutgers CS440, Fall 2003 Heuristic search Reading: AIMA 2 nd ed., Ch
Artificial Intelligence Problem solving by searching CSC 361 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
Dr.Abeer Mahmoud ARTIFICIAL INTELLIGENCE (CS 461D) Dr. Abeer Mahmoud Computer science Department Princess Nora University Faculty of Computer & Information.
Parallel Search Algorithm
Intelligent Systems (2II40) C2 Alexandra I. Cristea September 2005.
1 CS 2710, ISSP 2610 Chapter 4, Part 1 Heuristic Search.
Intelligent Systems (2II40) C3 Alexandra I. Cristea September 2005.
Problem-Solving by Searching Uninformed (Blind) Search Algorithms.
2013/10/17 Informed search A* algorithm. Outline 2 Informed = use problem-specific knowledge Which search strategies? Best-first search and its variants.
Informed Search Methods. Informed Search  Uninformed searches  easy  but very inefficient in most cases of huge search tree  Informed searches  uses.
Informed Search I (Beginning of AIMA Chapter 4.1)
Artificial Intelligence Problem solving by searching.
1 Kuliah 4 : Informed Search. 2 Outline Best-First Search Greedy Search A* Search.
Solving problems by searching 1. Outline Problem formulation Example problems Basic search algorithms 2.
1 CS 2710, ISSP 2160 Chapter 3, Part 2 Heuristic Search.
Informed search algorithms This lecture topic Chapter Next lecture topic Chapter (Please read lecture topic material before and after each.
Heuristic Search Foundations of Artificial Intelligence.
Introduction to Artificial Intelligence (G51IAI)
SEARCH Heng Ji Feb 02/05, Search We will consider the problem of designing goal- based agents in fully observable, deterministic, discrete,
Search Methodologies Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Best-first search is a search algorithm which explores a graph by expanding the most promising node chosen according to a specified rule.
Romania. Romania Problem Initial state: Arad Goal state: Bucharest Operators: From any node, you can visit any connected node. Operator cost, the.
Uninformed Search ECE457 Applied Artificial Intelligence Spring 2008 Lecture #2.
Chapter 3.5 Heuristic Search. Learning Objectives Heuristic search strategies –Best-first search –A* algorithm Heuristic functions.
Solving problems by searching Chapter 3. Types of agents Reflex agent Consider how the world IS Choose action based on current percept Do not consider.
Informed Search Methods
Solving problems by searching
Problem Solving Agents
Artificial Intelligence (CS 370D)
Heuristic Search Introduction to Artificial Intelligence
ECE 448 Lecture 4: Search Intro
Introduction to Artificial Intelligence
Artificial Intelligence
Minimum Spanning Tree.
A much More useful approach now that computation is fast
Informed Search II.
A* Example Newly generated node s, but OLD on OPEN has the same state.
Breadth First Search 11/21/ s
COMP 8620 Advanced Topics in AI
Spanning Trees.
Informed search algorithms
Artificial Intelligence
Artificial Intelligence
Informed search algorithms
(1) Breadth-First Search  S Queue S
Breadth First Search s
Solving problems by searching
Breadth First Search s
The Rich/Knight Implementation
Artificial Intelligence
Solving problems by searching
CS440/ECE 448 Lecture 4: Search Intro
The Rich/Knight Implementation
Presentation transcript:

Romania with step costs in km

Open List: Arad A* search example We start with our initial state Arad. We make a node and add it to the open list. Since it’s the only thing on the open list, we expand the node. Think of the open list as a priority queue (or heap) that sorts the nodes inside of it according to their g()+h() score.

A* search example We add the three nodes we found to the open list. Sibiu Timisoara Zerind A* search example We add the three nodes we found to the open list. We sort them according to the g()+h() calculation.

Open List: Rimricu Vicea Fagaras Timisoara Zerind Arad Oradea A* search example We’ve been to Arad before. Don’t list it again on the open list. When we expand Sibiu, we run into Arad again. But we’ve already expanded this node once; so, we don’t add it to the open list again.

Open List: Rimricu Vicea Fagaras Timisoara Zerind Oradea A* search example We see that Rimricu Vicea is at the top of the open list; so, it’s the next node we will expand.

Open List: Fagaras Pitesti Timisoara Zerind Craiova Sibiu Oradea A* search example When we expand Rimricu Vicea, we run into Sibiu again. But we’ve already expanded this node once; so, we don’t add it to the open list again.

Open List: Fagaras Pitesti Timisoara Zerind Craiova Oradea A* search example Fagaras will be the next node we should expand – it’s at the top of the sorted open list.

Open List: Pitesti Timisoara Zerind Bucharest Craiova Sibiu Oradea A* search example When we expand Fagaras, we find Sibiu again. We don’t add it to the open list. We also find Bucharest, but we’re not done. The algorithm doesn’t end until we “expand” the goal node – it has to be at the top of the open list.

Open List: Pitesti Timisoara Zerind Bucharest Craiova Oradea A* search example It looks like Pitesti is the next node we should expand.

Open List: Bucharest Timisoara Zerind Craiova Rimricu Vicea Oradea A* search example We just found a better value for Bucharest; so, it got moved higher in the list. We also found a worse value for Craiova – we just ignore this. And of course, we ran into Rimricu Vicea again. Since it’s already been expanded once, we don’t re-add it to the Open List.

Open List: Bucharest Timisoara Zerind Craiova Oradea A* search example Now it looks like Bucharest is at the top of the open list…

A* search example Now we “expand” the node for Bucharest. Open List: Bucharest Timisoara Zerind Craiova Oradea A* search example Now we “expand” the node for Bucharest. We’re done! (And we know the path that we’ve found is optimal.)