Instructions to Students:
This exam includes a combination of short-answer, long-answer, multiple-choice, and fill-in-the- blank questions. Please answer all questions in the fields provided.
This is a timed quiz. The time remaining is shown in the quiz window and will continue to countAdd down even if you leave the Canvas site.
At the end of the time limit, your answers will be submitted automatically.
Authorised Materials: This exam is open-book. While undertaking this assessment you are permitted to:
make use of your own personal notes and material provided as part of tutorials and practicals in this subject
make use of code that has been provided as part of this subject, or that you have written yourself use calculators, code, or mathematical software to compute numeric answers
While you are undertaking this assessment you must not:
make use of any messaging or communications technology make use of any world-wide web or
internet-based resources such as Wikipedia, Stack Overflow, or Google and other search services
Typesetting math: 100%
act in any manner that could be regarded as providing assistance to another student who is undertaking this assessment, or will in the future be undertaking this assessment.
The work you submit must be based on your own knowledge and skills, without assistance from any other person.
Technical support
This exam is a Canvas Quiz. Technical support for this exam can be accessed at: https://students.unimelb.edu.au/your-course/manage-your-course/exams-assessments-
andresults/exams/technical-support (https://students.unimelb.edu.au/your-course/manageyourcourse/exams-assessments-and-results/exams/technical-support)
Additional information about Canvas Quizzes, including troubleshooting tips, can be found here (https://students.unimelb.edu.au/your-course/manage-your-course/exams-assessmentsandresults/exams/exam-types) (scroll down to the Canvas Quiz section).
By commencing and/or submitting this assessment I agree that I have read and understood the
I also agree that:
1. Unless paragraph 2 applies, the work I submit will be original and solely my own work (cheating);
2. I will not seek or receive any assistance from any other person (collusion) except where the work is for a designated collaborative task, in which case the individual contributions will be indicated;Add and,
4. Where the work I submit is a computer program or code, I will ensure that:
a. any code I have copied is clearly noted by identifying the source of that code at the start of the program or in a header file or, that comments inline identify the start and end of the copied code; and
b. any modifications to code sourced from elsewhere will be commented upon to show the nature of the modification.
Troubleshooting
1. Name your file with your Question number followed by your Name and Student ID e.g. for Q7 for
Jane Bloggs with Student ID 123456 you would upload file: Q7 Jane Bloggs 123456.jpg
2. Upload your files by Typesetting math: 100% opening the OneDrive link below – clicking this link will open a new Tab in your
browserand will prompt you to select your files for upload:
https://unimelbcloudmy.sharepoint.com/:f:/g/personal/adrianrp_unimelb_edu_au/Ehw9ar9QNVtOlN7ql IHLO_oBBEy (https://unimelbcloudmy.sharepoint.com/:f:/g/personal/adrianrp_unimelb_edu_au/Ehw9ar9QNVtOlN7q lIHLO_oBBEyIbGxwxGlw
Late file upload policy: For timed exams, a deduction of 1 mark from the final mark (not exam mark) for each minute late up to 30 minutes. The time stamp on the server will be used as the submission time.
Classical Planning
Add
Question 3 1 pts
Which of the following statements is false?
Question 5 1 pts
Below is the Bellman-Ford Table of hmax(I) for a particular problem where I =
Typ esetting math: 100%{completed(A) , completed(D)} is the initial state of the problem.
Question 6 3 pts
Draw or define a graph such that IW(1) is guaranteed to terminate without expanding the goal.
Write down the order in which IW(1) expands the nodes in your graph, and justify why a node is novel or not.
Typ esetting math: 100%
A robot’s (R) mission is to save planet earth and make sure all carbon mines (M) are closed. The robot can move directly between mines as long as it has a snack (S) for each voyage across mines. The robot can close down a mine only if it is at the same position as the mine. Initially the mines are open, and the goal is to close all the mines.
Describe briefly in STRIPS how to model the domain described. Include a specification of the parameters of the actions, and the preconditions and postconditions of each action. Include a description of the goal state of the problem, and create 1 possible initial state where the goal is reachable, and 1 possible initial state where the goal is not reachable. Your initial states need to have 3 or more snacks and 3 or more mines. Explain clearly any assumption made. You are allowed to use variables as arguments for the actions (action schemes), specifying the values of the variables. Note: it is not compulsory to use PDDL
Typ esetting math:
100%syntax, as on g as you can convey the main ideas.
Add
Markov Decision Proceses (MDPs)
Question 9 1 pts
Consider a policy π that takes a state and action, and returns the probability that action a should be chosen state s.
What type of policy is this?
Question 11 2 pts
Question 13 1 pts Assignment Project Exam Help
extensive form games. Under which circumstances would you choose to use backward induction instead of multi-agent MCTS?
If the game tree is small enough to solve the problem exhaustively
Question 18 5 pts
In a family, there are three siblings: Alice, Bob, and Caroline. They back a cake together, which weighs one kilogram. Alice is given the task of cutting the cakeAssignment Project Exam Help
Assuming that s1 <= s2 <= s3, using game theory, show that the best thing Alice can do to maximise her utility is divide the cake into three equal pieces. Show your working.
Typ esetting math: 100%
Add
Typesetting math: 100%
