Artificial Intelligence: A Modern Approach
3rd Edition
ISBN: 9780136042594
Author: Stuart Russell, Peter Norvig
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 4, Problem 9E
Explanation of Solution
Finding optimal solutions of A∗:
- Consider a very simple example: an initial belief state {S1,S2}, actions a and b both leading to goal state “G” from either initial state, and
c(S1,a,G) = 3; c(S2,a,G) = 5;
c(S1,b,G) = 2; c(S2,b,G) = 6.
- In the above case, solution “[a]” costs 3 or 5, the solution “[b]” costs 3 or 6. Either is “optimal” case in any obvious sense.
- Consider some other cases to find the optimal solution. Consider the deterministic case, in this case, think that the cost of a plan as mapping from initial physical state to the actual cost of executing plan.
- In this example, the cost of “[a]” is {S1:3,S2:5}. The cost of “[b]” is {S1:2,S2:6}.
- Here, the plan “p1” weakly dominates plan “p2”. The cost of “p1” is less than the cost of “p2”.
- If a plan “p” dominates all other plans, the user can say that it is optimal.
- Here note that the definition reduces to ordinary optimality in the observable case where every belief state is a singleton.
- So the above example does not have the optimal solutions. And the acceptable version of A* would be that whose solution do not dominate on another solution.
- To understand whether the “A*” is possible to apply or not its dependence on Bellman’s (1957) principle of optimality.
- principle of optimality:
“An optimal policy has the property that whatever the initial state and initial decision are, the remaining decisions must constitute an optimal policy with regard to the state resulting from the first decision”
- the user must understand that this is a restriction on performance measures designed to facilitates efficient
algorithm , not general definition of what it means to be optimal...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
In the context of evolutionary computing the goal function is known as the fitnessfunction and the problem is to maximize it. The typical formulation has to be changedin a simple way.min f (x) = − max[− f (x)] (4.9)Another requirement is that the goal function is positive.Phenotype evolution treats x as a phenotype and the goal function as the fitnessfunction. The typical framework for the method is as follows:
Correct answer will be upvoted else downvoted. Computer science.
Positions I and j are chosen by the robot (researchers can't handle it). He will apply this activity while p isn't a character stage. We can show that the robot will make close to n activities paying little heed to the decision of I and j on every activity.
Researchers requested that you discover the most extreme conceivable time it will take the robot to get done with making p a character stage (I. e. most dire outcome imaginable), so they can conclude whether they should build another lunar meanderer or simply rest and pause. They will have a hard time believing you without evidence, so you should fabricate an illustration of p and robot's activities that amplifies the appropriate response.
For a superior comprehension of the assertion, read the example depiction.
Input
The principal line of input contains a solitary integer t (1≤t≤104) — the number of experiments.
Each of next t lines contains the…
Correct answer will be upvoted else downvoted.
You can play out the activity: select two diverse lists i,j (1≤i,j≤n, i≠j) and two integers x,y (1≤x,y≤2⋅109) so that min(ai,aj)=min(x,y). Then, at that point, change computer based intelligence to x and aj to y.
The young lady requests that you make the exhibit great utilizing all things considered n activities.
It tends to be demonstrated that this is consistently conceivable.
Input
The main line contains a solitary integer t (1≤t≤10000) — the number of experiments.
The main line of each experiment contains a solitary integer n (1≤n≤105) — the length of the exhibit.
The second line of each experiment contains n integers a1,a2,… ,an (1≤ai≤109) — the exhibit which Nastia has gotten as a gift.
It's dependable that the amount of n in one test doesn't surpass 2⋅105.
Output
For every one of t experiments print a solitary integer k (0≤k≤n) — the number of tasks. You don't have to limit this number.
In every one…
Chapter 4 Solutions
Artificial Intelligence: A Modern Approach
Knowledge Booster
Similar questions
- Hi please answer the following follow up questions as well, posted them as another question. Question 4 For the 9-tile soring problem, assume that you start from this initial state 7 2 4 5 6 8 3 1 The Goal State is: 1 2 3 4 5 6 7 8 The cost of moving any tile is 1. Let the heuristic function h(n) = number of misplaced tiles. For the shown configuration, there are four options for the next move: Move 5 to the right Move 6 to the left Move 2 down Move 3 up Each of these moves has a value f(n) = h(n) + g(n). If we choose to Move 5 to the right, then g(n) = 1. That is, it took us one step to reach this state from the initial state. h(n) = number of misplaced tiles. The misplaced tiles are {7,4,8,3,1}. So the number of misplaced tiles = h(n) = 5. If we choose to Move 6 to the left, g(n) is still = 1, but h(n) will change because the number of misplaced tiles is different. A* works by computing f(n) = h(n) + g(n) for each of these possible moves. Then it…arrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Computer science. The j-th companion can be set before the I-th companion on the photograph if his square shape is lower and smaller than the square shape of the I-th companion. Officially, somewhere around one of the accompanying conditions should be satisfied: hj<hi and wj<wi (the two companions are standing or both are lying); wj<hi and hj<wi (one of the companions is standing and the other is lying). For instance, on the off chance that n=3, h=[3,5,3] and w=[4,4,3]: the main companion can be set before the second: w1<h2 and h1<w2 (one of the them is standing and the other one is lying); the third companion can be put before the second: h3<h2 and w3<w2 (the two companions are standing or both are lying). In different cases, the individual in the closer view will cover the individual behind the scenes. Help Polycarp for every I find any j, with the end goal that the j-th…arrow_forwardThe supervised classification algorithm you pick will usually output a real-valued score, and you will decide upon to select out a threshold or thresholds above which to block the exercise or exhibit off increased friction. How do you select out out this threshold? Now replicate onconsideration on that you have two versions of your mannequin with one-of-a-kind parameters(e.g., extraordinarily correct regularization) or even special mannequin households (e.g., logistic regression versus random forest). Which one is better?arrow_forward
- A problem with optimization is specified:The input is one instance as a prerequisite.Postconditions: The result is one of the acceptable solutions in this situation, with the best (minimum or maximum, as appropriate) success metric. (The outputted solution need not be original.)arrow_forwardConsider a world with two species, emotional and unemotional. In this world emotional beings are deemed weaker than their unemotional counterparts. However, emotional beings are necessary for the overall population to survive. Using genetic algorithm, maintain a balance between these two species in such a way that the overall population is stronger, and its chances of survival are better collectively. Marks will be awarded based on the completeness, clarity and correctness of your solution.arrow_forwardc. Analyze your DFA simulator pseudo-code to show its worst-case asymptotic complexity. Give your final answer in Big-Oh notation, and be sure to explain why it is so (e.g. by referring to lines in your pseudo-code).arrow_forward
- Answer this questions True or False : Q1:lf the learning rate is too small, then gradient descent may take a very long time to converge. Q2: If 00 and 01 are initialized at a local minimum, then one iteration will not change their values Q3: If 00 and 01 are initialized so that 00=01, then by symmetry (because we do simultaneous updates to the two parameters), after one iteration of gradient descent, we will still have 00=01arrow_forwardSimulated annealing is an extension of hill climbing, which uses randomness to avoid getting stuck in local maxima and plateaux. a) For what types of problems will hill climbing work better than simulated annealing? In other words, when is the random part of simulated annealing not necessary? b) For what types of problems will randomly guessing the state work just as well as simulated annealing? In other words, when is the hill-climbing part of simulated annealing not necessary? c) Reasoning from your answers to parts (a) and (b) above, for what types of problems is simulated annealing a useful technique? In other terms, what assumptions about the shape of the value function are implicit in the design of simulated annealing? d) As defined in your textbook, simulated annealing returns the current state when the end of the annealing schedule is reached and if the annealing schedule is slow enough. Given that we know the value (measure of goodness) of each state we visit,…arrow_forwardThe Night Owls Society is arranging a conference. To minimize costs, they want to schedule as many sessions as possible in the main ballroom. Since night owls go to bed late and wake up late, they want sessions to begin as late as possible and don't care how late they run. Each session has a fixed start time and a fixed end time, though sessions may overlap. For example, the sessions may be as follows. (In a realistic version of this problem, there may be many more sessions.) Session Name Basket weaving Floral arrangements Cake decoration Cookie baking Pasta making Start time End time 10:30 AM 11:45 AM 10:45 AM 12:30 PM 12:15 AM 2:00 PM 12:45 PM 3:00 PM 2:15 PM 4:30 PM Table decoration 3:30 PM 5:45 PM a. Define what it means for this problem to have optimal substructure. b. Show that this problem does have optimal substructure. c. What algorithmic strategy can one use to solve a problem with optimal substructure? (Do not write out the algorithm.) d. What does it mean for a problem to…arrow_forward
- Correct answer will be upvoted else Multiple Downvoted. Computer science. make the succession arranged, you might play out the accompanying activity quite a few times you need (perhaps zero): pick an integer I with the end goal that 1≤i≤n and ai>x, and trade the upsides of computer based intelligence and x. For instance, if a=[0,2,3,5,4], x=1, the accompanying arrangement of activities is conceivable: pick i=2 (it is conceivable since a2>x), then, at that point, a=[0,1,3,5,4], x=2; pick i=3 (it is conceivable since a3>x), then, at that point, a=[0,1,2,5,4], x=3; pick i=4 (it is conceivable since a4>x), then, at that point, a=[0,1,2,3,4], x=5. Ascertain the base number of activities you need to perform so that a becomes arranged, or report that it is unimaginable. Input The main line contains one integer t (1≤t≤500) — the number of experiments. Each experiment comprises of two lines. The main line contains two integers n and x (1≤n≤500, 0≤x≤500) — the…arrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Computer science. You are given an integer n (n>1). Your assignment is to find a succession of integers a1,a2,… ,ak with the end goal that: every simulated intelligence is completely more prominent than 1; a1⋅a2⋅… ⋅ak=n (I. e. the result of this grouping is n); ai+1 is separable by simulated intelligence for every I from 1 to k−1; k is the most extreme conceivable (I. e. the length of this grouping is the greatest conceivable). In case there are a few such groupings, any of them is adequate. It tends to be demonstrated that somewhere around one substantial grouping consistently exists for any integer n>1. You need to answer t autonomous experiments. Input The primary line of the input contains one integer t (1≤t≤5000) — the number of experiments. Then, at that point, t experiments follow. The main line of the experiment contains one integer n (2≤n≤1010). It is ensured that the amount of n…arrow_forwardConsider the challenge of determining whether a witness questioned by a law enforcement agency is telling the truth. An innovative questioning system pegs two individuals against each other. A reliable witness can determine whether the other individual is telling the truth. However, an unreliable witness's testimony is questionable. Given all the possible outcomes from the given scenarios, we obtain the table below. This pairwise approach could then be applied to a larger pool of witnesses. Answer the following: 1) If at least half of the K witnesses are reliable, the number of pairwise tests needed is Θ(n). Show the recurrence relation that models the problem. Provide a solution using your favorite programming language, that solves the recurrence, using initial values entered by the user.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