Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
In the following question, we assume that the wind comes from the east . The cost of one step is defined as follows: 1 for moving along the wind direction; 3 for moving against the wind direction; 2 for moving with the side wind cases. The reward will be the negative of the cost. We consider Value Iteration for this MDP problem. Since the reward function R(s, a) here depends on both the state and the action taken at this state, all utility equations are written as: U(s) – maxa (R(s,a) + y Es' P(s"ls,a) U(s')) We choose y=1. We assume that the current utility at each state is shown in the following table. -1 -5 -20 -20 b -1 -50 -100 a -1 50 75 +100 1 2 3 4 We perform an update of the utility of State b3. Use the following question framework to show the intermediate step for each action, then give the updated utility and identify the latest optimal action at State b3. Note: Keep in mind that R(s, a) = 0 for any (s, a). • T: : • U(b3): • Latest optimal action at b3:

In the following question, we assume that the wind comes from the east . The cost of one step is defined as follows: 1 for moving along the wind direction; 3 for moving against the wind direction; 2 for moving with the side wind cases. The reward will be the negative of the cost. We consider Value Iteration for this MDP problem. Since the reward function R(s, a) here depends on both the state and the action taken at this state, all utility equations are written as: U(s) – maxa (R(s,a) + y Es' P(s"ls,a) U(s')) We choose y=1. We assume that the current utility at each state is shown in the following table. -1 -5 -20 -20 b -1 -50 -100 a -1 50 75 +100 1 2 3 4 We perform an update of the utility of State b3. Use the following question framework to show the intermediate step for each action, then give the updated utility and identify the latest optimal action at State b3. Note: Keep in mind that R(s, a) = 0 for any (s, a). • T: : • U(b3): • Latest optimal action at b3:

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

6

 

In the following question, we assume that the wind comes from the eastE. The cost of one step is defined as follows: 1 for moving along the wind direction; 3 for moving against the wind direction; 2 for moving with the side wind cases. The reward will be the negative of the cost. We consider Value Iteration for this MDP problem. Since the reward function R(s, a) here depends on both the state and the action taken at this state, all utility equations are written as: U(s) + maxa (R(s,a) + y Es' P(s'ls,a) U(s')) We choose y=1. We assume that the current utility at each state is shown in the following table. -1 -5 -20 -20 b -1 -50 -100 a -1 50 75 +100 1 2 4 We perform an update of the utility of State b3. Use the following question framework to show the intermediate step for each action, then give the updated utility and identify the latest optimal action at State b3. Note: Keep in mind that R(s, a) + 0 for any (s, a). • 1: • >: • U(b3): Latest optimal action at b3:
Transcribed Image Text:In the following question, we assume that the wind comes from the eastE. The cost of one step is defined as follows: 1 for moving along the wind direction; 3 for moving against the wind direction; 2 for moving with the side wind cases. The reward will be the negative of the cost. We consider Value Iteration for this MDP problem. Since the reward function R(s, a) here depends on both the state and the action taken at this state, all utility equations are written as: U(s) + maxa (R(s,a) + y Es' P(s'ls,a) U(s')) We choose y=1. We assume that the current utility at each state is shown in the following table. -1 -5 -20 -20 b -1 -50 -100 a -1 50 75 +100 1 2 4 We perform an update of the utility of State b3. Use the following question framework to show the intermediate step for each action, then give the updated utility and identify the latest optimal action at State b3. Note: Keep in mind that R(s, a) + 0 for any (s, a). • 1: • >: • U(b3): Latest optimal action at b3:
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Bellman operator
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
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS