Artificial Intelligence: A Modern Approach
3rd Edition
ISBN: 9780136042594
Author: Stuart Russell, Peter Norvig
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 3, Problem 26E
Program Plan Intro
State space problem:
- One general formulation of intelligent action is in terms of state space.
- A state includes all the necessary information to predict the result of an action and to determine whether it is a target state.
- The state-space search assumes that,
- The agent knows the state space well and can observe the state in which it is.
- The agent has a set of actions proven to have deterministic effects.
- Several states are target/goal state, the agent wants to enter one of these target state and the agent may identify a target state.
- A solution is a series of acts that will turn the agent in to a target state from its current state.
Branching factor:
- The branching factor is the outdegree, the number of children at each node.
- If the branching factor is not uniform, it is possible to calculate an average branching factor.
- The average branching factor can be determined easily as the number of non-root nodes divided by the number of non-leaf nodes. Where the number of root node is determined by as the size of the tree, minus one.
Program Plan Intro
States:
- The set of states forms a graph that connects two states when there is an operation that can be performed to turn the first state into the second.
- A state includes all the necessary information to predict the result of an action and to determine whether it is a target state.
Program Plan Intro
c.
Breadth first search(BFS):
- The breadth first search
algorithm is the most commonly used algorithm to traverse on a graph. - In BFS, the traversing starts from a user selected node then traverse the graph layer wise for exploring the neighbour nodes. The neighbour nodes are the nodes that are directly connected to the source node. After this, move towards the next-level neighbour nodes.
- The breadth first search algorithm has a strategy that it expands the root node first, then it expands the successor nodes of root, and then expands their successors and so on.
- In BFS, the traversing done as follows,
- First, go horizontally to visit all the nodes of current layer.
- Move to the next layer.
Program Plan Intro
d.
Breadth first search(BFS):
- The breadth first search algorithm is the most commonly used algorithm to traverse on a tree or a graph.
- In BFS, the traversing starts from a user selected node then traverse the graph layer wise for exploring the neighbour nodes. The neighbour nodes are the nodes that are directly connected to the source node. After this, move towards the next-level neighbour nodes.
- The breadth first search algorithm has a strategy that it expands the root node first, then it expands the successor nodes of root, and then expands their successors and so on.
- In BFS, the traversing done as follows,
- First, go horizontally to visit all the nodes of current layer.
- Move to the next layer.
Explanation of Solution
e.
“Yes”, because “h = |u − x| + |v − y|” is Manhattan Distance Metric. The Manhattan Distance
is admissible heuristic for the state (u,v).
Manhattan Distance Metric:
- The Manhattan Distance is a metric in which the distance between two points is the sum of their Cartesian coordinates’ absolute differences...
Program Plan Intro
A* search algorithm:
- The A* search algorithm is a search algorithm used to search a particular node of a graph.
- A* algorithm is a variant of the best-first algorithm based on the use of heuristic methods to achieve optimality and completeness.
- The algorithm A* is an example of a best-first search algorithm.
- If a search algorithm has the property of optimality, it means that the best possible solution is guaranteed to be found. Here, the user wants the shortest path to the final state.
Program Plan Intro
Admissible heuristic:
- In path related algorithms, it is said that a heuristic function is admissible if it never overestimates the cost of achieving the goal.
- That is the cost of achieving the goal is not higher than the lowest possible cost from the current point of the route.
- The estimated cost must always be lower than or equal to the actual cost of reaching the goal state in order for a heuristic to be admissible to the search problem.
- The search algorithm uses the admissible heuristic to find the optimal path from the current node to the target node.
Program Plan Intro
Admissible heuristic:
- In path related algorithms, it is said that a heuristic function is admissible if it never overestimates the cost of achieving the goal.
- That is the cost of achieving the goal is not higher than the lowest possible cost from the current point of the route.
- The estimated cost must always be lower than or equal to the actual cost of reaching the goal state in order for a heuristic to be admissible to the search problem.
- The search algorithm uses the admissible heuristic to find the optimal path from the current node to the target node.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Given a graph that is a tree (connected and acyclic). (I) Pick any vertex v.(II) Compute the shortest path from v to every other vertex. Let w be the vertex with the largest shortest path distance.(III) Compute the shortest path from w to every other vertex. Let x be the vertex with the largest shortest path distance. Consider the path p from w to x. Which of the following are truea. p is the longest path in the graphb. p is the shortest path in the graphc. p can be calculated in time linear in the number of edges/vertices
Given N cities represented as vertices V₁, V2, un on an undirected graph (i.e., each edge can be traversed
in both directions). The graph is fully-connected where the edge eij connecting any two vertices vį and vj
is the straight-line distance between these two cities. We want to search for the shortest path from v₁ (the
source) to VN (the destination).
...
Assume that all edges have different values, and €₁,7 has the largest value among the edges. That is, the
source and destination have the largest straight-line distance. Compare the lists of explored vertices
when we run the uniform-cost search and the A* search for this problem.
Hint: The straight-line distance is the shortest path between any two cities. If you do not know how to
start, try to run the algorithms by hand on some small cases first; but remember to make sure your graphs
satisfy the conditions in the question.
Given a graph data structure: G = (V,E) where,
V = {A, B, C, D, E }
E
=
{ (A,B), (A,D), (B,D), (B,C), (D,E) }
a) Draw the graph G.
b) Draw all spanning trees of the graph G, which are also “linear” (each graph node has no more
than two neighbors).
Chapter 3 Solutions
Artificial Intelligence: A Modern Approach
Ch. 3 - Explain why problem formulation must follow goal...Ch. 3 - Prob. 2ECh. 3 - Prob. 3ECh. 3 - Prob. 4ECh. 3 - Prob. 5ECh. 3 - Prob. 6ECh. 3 - Prob. 8ECh. 3 - Prob. 9ECh. 3 - Prob. 10ECh. 3 - Prob. 11E
Ch. 3 - Prob. 12ECh. 3 - Prob. 13ECh. 3 - Prob. 14ECh. 3 - Prob. 15ECh. 3 - Prob. 16ECh. 3 - Prob. 17ECh. 3 - Prob. 18ECh. 3 - Prob. 20ECh. 3 - Prob. 21ECh. 3 - Prob. 22ECh. 3 - Trace the operation of A search applied to the...Ch. 3 - Prob. 24ECh. 3 - Prob. 25ECh. 3 - Prob. 26ECh. 3 - Prob. 27ECh. 3 - Prob. 28ECh. 3 - Prob. 29ECh. 3 - Prob. 31ECh. 3 - Prob. 32E
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- In the figure below there is a weighted graph, dots represent vertices, links represent edges, and numbers represent edge weights. S 2 1 2 1 2 3 T 1 1 2 4 (a) Find the shortest path from vertex S to vertex T, i.e., the path of minimum weight between S and T. (b) Find the minimum subgraph (set of edges) that connects all vertices in the graph and has the smallest total weight (sum of edge weights). 2. 3.arrow_forwardYou are given a graph G = (V, E) with positive edge weights, and a minimum spanning tree T = (V, E') with respect to these weights; you may assume G and T are given as adjacency lists. Now suppose the weight of a particular edge e in E is modified from w(e) to a new value w̃(e). You wish to quickly update the minimum spanning tree T to reflect this change, without recomputing the entire tree from scratch. There are four cases. In each case give a linear-time algorithm for updating the tree. Note, you are given the tree T and the edge e = (y, z) whose weight is changed; you are told its old weight w(e) and its new weight w~(e) (which you type in latex by widetilde{w}(e) surrounded by double dollar signs). In each case specify if the tree might change. And if it might change then give an algorithm to find the weight of the possibly new MST (just return the weight or the MST, whatever's easier). You can use the algorithms DFS, Explore, BFS, Dijkstra's, SCC, Topological Sort as…arrow_forwardImplementation PartUse appropriate data structure for the given search space and heuristic values. Finding the child nodes (neighbors).Using correct formula to compute the path cost. Appropriately usage of frontier set (open/priority queue) and explore set (closed/ visited). Show the results.arrow_forward
- Consider the following descriptions for one sample of six zones: Z1 matches B or D; Z2 matches C, E, or F; Z3 matches A or F; Z4 matches B or D; Z5 matches C or F; and Z6 matches D. (a) (A-F). Draw the bipartite graph that models the zones (Z1-Z6) and the letters they match (b) district layout. Use Hall's theorem to determine if algorithm will be able to successfully create aarrow_forwardA graph is a collection of vertices and edges G(V, E). A weighted graph has weights (numbers, etc.) on every edge. A multigraph can have more than one edges between any vertices. Explain why a person should use a weighted graph instead of a multigraph. Give examplesarrow_forwardRun Dijkstra's algorithm on the graph and node D. show the work please. write down the process (not in words) but like when you update things around.arrow_forward
- Given: 13-Node Graph. Generate the A* from Node A to Node B. Solve the f(n) = g(n) + h(n) from Node A to Node B where n = Node RV. Give the value of f(n) based on the generated A* from Node A to Node B. A 71 Dz 75/ 118 T O 140 70 75 D 151 OM S 120 80 Straight-Line Distance to Node B A to B - 360 B to B-0 C to B-150 D to B-240 F to B-170 L to B-240 M to B-240 O to B-380 P to B-100 RV to B-190 S to B-250 T to B-325 Z to B-370 99 RV 97 146 C D 138 F e d P 101 211 Barrow_forwardThe Graph Data Structure is made up of nodes and edges. (A Tree Data Structure is a special kind of a Graph Data Structure). A Graph may be represented by an Adjacency Matrix or an Adjacency List. Through this exercise, you should be able to have a better grasp the Adjacency Matrix concept. You are expected to read about the Adjacency Matrix concept as well as the Adjacency List concept. Suppose the vertices A, B, C, D, E, F, G and H of a Graph are mapped to row and column indices(0,1,2,3,4,5,6,and 7) of a matrix (i.e. 2-dimensional array) as shown in the following table. Vertex of Graph Index in the 2-D Array Adjacency Matrix Representation of Graph A B 2 F 6. H 7 Suppose further, that the following is an Adjacency Matrix representing the Graph. 3 4 5. 6. 7 0. 1 1 1 1 01 1 01 1. 3 14 1 1 1 6. 1 Exercise: Show/Draw the Graph that is represented by the above Adjacency matrix. Upload the document that contains your result. (Filename: AdjacencyMatrixExercise.pdf) Notes: -The nodes of the…arrow_forwardAssume you are to write a program to analyze the social connection between students in MTSU. Each student is a node in a undirected graph. An edge is added between two nodes if these two students have close social connections, i.e., in the same club, or in the same department. Which would be a better representation for this graph? Question 45 options: adjacency matrix representation adjacency list representationarrow_forward
- Consider the state space graph shown above. A is the start state and G is the goal state. The paths that could be returned by traversed the Graph using Depth first search are: 8. 9. F A->C->D->G A->B->D->E->G A->B->C->D->F->G A->C->D->F->G A->B->D->G A->C->B->D-F->E->G Consider the search graph shownarrow_forwardSuppose you have a graph G with 6 vertices and 7 edges, and you are given the following information: The degree of vertex 1 is 3. The degree of vertex 2 is 4. The degree of vertex 3 is 2. The degree of vertex 4 is 3. The degree of vertex 5 is 2. The degree of vertex 6 is 2. What is the minimum possible number of cycles in the graph G?arrow_forwardMark Zuckerberg, the CEO of Facebook, has hired you to lead the Facebook Algorithms Group. He has asked you to use various graph algorithms to analyze the world's largest social network. The Facebook Graph has 2.8 billion vertices, with each vertex being a Facebook user. Two vertices are connected provided those two users are "friends". The first decision you need to make is how you want to model the Facebook graph. Determine whether you should use an adjacency-list representation or an adjacency-matrix representation.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education