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
Expert Solution & Answer
Chapter 4, Problem 12E
Explanation of Solution
a.
Viewing online search problem as offline search problem:
- The online search is equivalent to the offline search in belief state space. In that each and every action in a belief state can have multiple successor belief states. For each percept the agent is able to observe after the action.
- A successor belief-state is created by taking the previous belief-state, itself a collection of states, replacing each state in this belief-state with successor state under the action, and eliminating all successor states that are incompatible with the definition.
- This is similar to the AND-OR search and can be used to solve this search problem.
- The initial belief state has 210 = 1024 states in it, and as the user knows whether the two edges have wall or not but nothing more...
Explanation of Solution
b.
Justification:
Assume that the external walls ...
Explanation of Solution
c.
Branches of a contingency plan:
- Consider the above figure, the initial null action leads to four possible belief states, as shown in the figure. From each belief state, the agent chooses a single action which can lead to up to 8 belief states (on entering the middle square)...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
the knowledge-based agent is not an arbitrary program for calculating actions. It is amenable to a description at the knowledge level, where we need specify only what the agent knows and what it goains are, in order to fix its behavior. Give an Example:
Correct answer will be upvoted else Multiple Downvoted. Computer science.
The train framework can be addressed as directions on a 2D plane. The I-th train beginning at the base end is at first at (i,0) and will be at (i,T) after T minutes, and the I-th train beginning at the left end is at first at (0,i) and will be at (T,i) after T minutes. All trains show up at their objections following 101 minutes.
In any case, Gildong observed that a few trains booked to leave at a particular time, at the same time, are extremely hazardous. As of now, n trains are planned to leave from the base end and m trains are booked to withdraw from the left end. In the event that two trains are both at (x,y) simultaneously for some x and y, they will collide with one another. In this way, he is requesting you to observe the base number from trains that ought to be dropped to forestall every such accident.
Input
Each test contains at least one experiments. The main line contains the number of…
the knowledge-based agent is not an arbitrary program for calculating actions. It is amenable to a description at the knowledge level, where we need specify only what the agent knows and what its goals are, in order to fix its behavior. Give an Example ?
Chapter 4 Solutions
Artificial Intelligence: A Modern Approach
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
- Correct answer will be upvoted else Multiple Downvoted. Computer science. one maneuver, the robot should move one cell to the left or right, given that it doesn't move beyond the field of play. As such, if the robot was in the cell I, it should move to either the cell i−1 or the cell i+1, as long as it lies among 1 and n (endpoints comprehensive). The cells, in the request they are visited (counting the cell the robot is set), together make a decent way. Every cell I has a worth computer based intelligence related with it. Let c0,c1,… ,ck be the succession of cells in a decent way in the request they are visited (c0 is the cell robot is at first positioned, c1 is the cell where the robot is after its first move, etc; all the more officially, ci is the cell that the robot is at after I moves). Then, at that point, the worth of the way is determined as ac0+ac1+⋯+ack. Your errand is to work out the amount of qualities over all conceivable great ways. Since this number can be…arrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Computer science. There is an endless 2-dimensional framework. The robot remains in cell (0,0) and needs to arrive at cell (x,y). Here is a rundown of potential orders the robot can execute: move north from cell (i,j) to (i,j+1); move east from cell (i,j) to (i+1,j); move south from cell (i,j) to (i,j−1); move west from cell (i,j) to (i−1,j); stay in cell (i,j). The robot needs to arrive at cell (x,y) in as couple of orders as could really be expected. In any case, he can't execute a similar order at least twice in succession. What is the base number of orders needed to reach (x,y) from (0,0)? Input The main line contains a solitary integer t (1≤t≤100) — the number of testcases. Every one of the following t lines contains two integers x and y (0≤x,y≤104) — the objective directions of the robot. Output For each testcase print a solitary integer — the base number of orders needed for the robot to…arrow_forwardIn attached image, there are 5 states, a, b, c, d, e. Two actions are available for each state: East, West except for the exit states a and e, where the only action available is “Exit”. The transition is deterministic. The rewards of the exit states are given as shown in Image. A) For γ= 1, what is the true utility ? (Please fill the form completely) Example response format: 10 10 10 10 10 (Please note the space!) B) For γ = 0.1, what is the true utility? Example response format: 10 0.1 10 10 0.1 (Please pay attention to the space!) C) For which γ are West and East equally good at state d? (please take to the fourth decimal place)Example response format: γ = 0.1234 (take to the fourth decimal place, please pay attention to the space!)arrow_forward
- . The vacuum cleaner problem is a well-known search problem for a vacuum cleaner robot that works on Artificial Intelligence. In this problem to clean up the whole area. In the superficial world, the vacuum cleaner agent has a location sensor and a dirt sensor to know where it is (room A, room B, or any n room) and whether the room is dirty. Also, the robot needs to avoid the obstacle (stool) and find a new path. A possible performance measure is to maximize the number of clean rooms over a certain period. For this problem, four main conditions should be considered: in(x,y) means a robot at (x,y) dirt(x,y) means there is a dirt at(x,y) facing(d) means the robot is facing direction d, where d ={north, east, south, west} • hit(s) means the robot hits the obstacle s possible actions the robot can do - turn, forward, suck-dirt, avoid a) Write possible rules that can be used to perform the room cleaning plan b) Execute this plan…arrow_forwardFor problem 2, you should provide two answers for each of the search strategies: the states expanded and the solution. Problem 2 Alice the agent wants to go skiing right after AI class is over. She starts in the lecture hall (the "Start" state below) and wants to make it to Alta (the "Goal" state) as soon as possible. There are several possible paths she can take denoted in the graph below ( refer to image ): The available actions at each state are denoted by arrows with a path cost label above each arrow. For each of the following graph search strategies, figure out the order in which states are expanded as well as the path returned by graph search. When choosing an arbitrary order of state expansions (to break ties), use alphabetical ordering. Remember that in graph search, states are expanded only once. Depth-first search Breadth-first search Uniform cost search A* searcharrow_forwardConsider the case when several persons play the wireless phone game. They send a message from the first person until the last one and the message gets distorted. Simulate this process according to your own distortion rules.arrow_forward
- Develop a simulation that shows the actions you can run an intelligent agent on a System based on the learned knowledge. For this model you must use a language high-level programming.arrow_forwardNeurons compute? The activation function and the linear function, which is represented by the equation z = Wx + b, are both calculated by neurons. Both a linear function, represented by the equation z = Wx + b, and an activation function are computed by neurons. When g is present in a neuron, the input x is scaled linearly (Wx + b). Before using the result in an activation function, neurons perform a calculation to get the mean of all of their features.arrow_forwardAn agent can learn to play chess by supervised learning-by being given examples of game situations along with the best moves for those situations. But there is no friendly teacher providing examples. What can the agent do in such situationarrow_forward
- A produce dealer has a warehouse that stores a variety of fruits. He wants a machine capable of sorting the fruit according to the type. There is a conveyor belt on which the fruit is loaded. It is then passed through a set of sensors which measure 3 properties of the fruit: shape, texture, and weight. The sensor system is somehow rather primitive: Shape sensor: -1 if the fruit is round and 1 if it is more elliptical Texture sensor: -1 if the surface is smooth, 1 if it is rough Weight sensor: -1 if the fruit is > 500g, 1 if is < 500g The sensor output will then be input to a Neural Networks based classifying system. As an AI Engineer you are supposed to design (draw the architecture and determine the optimal weight Wand bias b) a simple neural network (could be a single perceptron) that can be used to recognize the fruit so that it can be directed to the correct storage bin. As a startup case, the simple network will only be used for two type of fruit i.e. banana and apple.…arrow_forwardGiven a maze arena as shown below. Design a Position Identification algorithm so that the robot can find out which position in the maze above, with a robot size of 450mm x 420mm and a wall width of 45mm. a) Algorithms and methods used are free. b) Explain the reasons for choosing the algorithm. c) Algorithm is designed and explained using Structure English or Description Algorithm (with descriptive sentences).arrow_forwardWrite a Java program to simulate the behaviour of a model-based agent for a vacuum cleaner environment based on the following conditions: The vacuum cleaner can move to one of 4 squares: A, B, C, or D as shown in Table 1. Table 1: vacuum cleaner environment A B C D The vacuum cleaner checks the status of all squares and takes action based on the following order: If all squares are clean, the vacuum cleaner stays in its current location. If the current location is not clean, the vacuum cleaner stays in its current location to clean it up. The vacuum cleaner can only move horizontally or vertically (cannot move diagonally). The vacuum cleaner moves only one square at a time. Horizontal moves have the highest priority over vertical moves. The vacuum cleaner moves to another square only when it needs to be cleaned up. If a diagonal square needs to be cleaned up, the vacuum cleaner moves to its neighbour vertical square first. The vacuum cleaner action is…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