程序代写代做代考 graph AI game COMP90054 AI PLANNING FOR AUTONOMY – PROJECT 2 – PDDL MODELLING

COMP90054 AI PLANNING FOR AUTONOMY – PROJECT 2 – PDDL MODELLING

You must read fully and carefully the assignment specification and instructions detailed in this file. You are NOT to modify this file in any way.

– COURSE: COMP90054 AI Planning for Autonomy @ Semester 2, 2020
– INSTRUCTOR: Dr. Nir Lipovetzky and Prof. Adrian Pearce
– DEADLINE: Sunday 13th September, 2020 @ 11:59pm (end of Week 6)
– COURSE WEIGHT: 5%
– ASSIGNMENT TYPE:: Individual
– ILOS COVERED: 1, 2, and 3
– SUBMISSION METHOD: via git tagging (see Submission Instructions below for instructions)

The AIM OF THIS PROJECT is to improve your understanding of PDDL modelling.

Task

YOUR TASK is to read the description of the the domain below and encode the three planning problem instances specified filling the template files provided in this repository in the folder pddl_template.

The Domain – Real Player Game Scenario

_Help the hero to get out of dungeon!_

A hero woke up in a dungeon full of monsters and traps (perhaps the party last night went wrong…) and needs your help to get out. Here are basic facts for the dungeon domain: – The dungeon contains rooms that are CONNECTED by corridors (dungeon can thus be represented by undirected graph) – each room can be EMPTY, or can have a MONSTER in it, or can have a TRAP in it, or can have a SWORD in it – one of the empty rooms is the GOAL: it has an exit, so the hero can escape

The hero is lucky since she/he has full knowledge about the dungeon. But not that lucky – just after the hero leaves each room s/he visits, the room is DESTROYED and cannot be visited again.

The hero can perform the following actions – but only if s/he is alive! – The hero can MOVE to an adjacent room (connected by a corridor) that has not been destroyed (i.e., the hero has not already visited the room) – PICKUP the sword if present in the room the hero is currently in and the hero is empty handed – DESTROY the sword that the hero currently holds. However, this can have unpleasant effects if done in a room with a trap or a monster: it triggers the trap or invites the monster to eat the hero. – DISARM A TRAP – if there is a trap in the room the hero is in and the hero is empty-handed (does not hold a sword), then the hero can disarm it

However, there are some (dangerous) constraints the hero has to consider: – If the hero enters a room with a monster in it, s/he has to carry a sword (so the monster is afraid of him/her), otherwise the monster kills him/her. Notice that the hero is pacifist, so s/he cannot kill the monster. – If the hero destroys the sword in a room with a monster in it, the monster kills him/her as well. – The only action the hero can safely perform in a room with a trap in it is the DISARM A TRAP action. Any other action (even moving away) triggers the trap which kills the hero.

IMPORTANT: We recommend reading the description carefully several times to make sure you fully understand it before starting coding in PDDL.

Problem 1

The problems are specified such that cells stand for rooms and edges between them represent corridors. I is the hero’s initial position, G is hero’s desired goal position, S_(i) indicates a sword, M is a monster, and T stands for trap. Good luck!

[problem1]

Problem 2

[problem1]

Problem 3

[problem1]

PLANIMATED EXAMPLE SOLUTION

[Planimation]

Marking Criteria

This assignment has a weight of 5% over the final grade. The criteria for marking will be:

– 3 points for encoding the domain correctly. Each correct action counts 0.5 points. If a precondition or effect is missing from an action, the action will earn 0 points.
– 1 point for encoding the 3 problems correctly
– 1 point for generating correct solutions as per the specification of the problem

Your marking will be based on the domain and problem files that you need to complete in the folder pddl_template.

IMPORTANT: Make sure to tag your commit with your updated pddl files inside that folder.

How to get started

Once you clone the files from this repository onto your local machine, watch the following videos on how to get started. Open the pddl_template folder and start modeling.

Upload to Editor.planning.domains, how to save a session and work online

[Editor.planning.domains]

Download session offline with vscode and call the online planner

[Editor.planning.domains]

Work with VScode directly and the online planner

[Editor.planning.domains]

PDDL Tutorials

Live modeling session in PDDL:

[]

VScode PDDL Tutorial:

[]

Submission Instructions

TAG YOUR SUBMISSION to submit your assignment by completing the following three steps:

1. Complete the STUDENT.md file with your details of the submission.
2. Please ensure that your solution does not include personal information, like your student number or name.
3. Tag the commit version you want to be graded with tag submission.
– The commit and tagging should be dated before the deadline.
– Note that a tag is NOT a branch, so do not just create a branch called “submission” as that will not amount to tagging.
4. Fill the Project 2 Certification Form.
– Non-certified submissions will not be marked and will attract zero marks.

From this repository, we will copy _only_ the PDDL files: domain.pddl, problem1.pddl, problem2.pddl, and problem3.pddl. Please do not submit any other file with a different name as part of your solution, we will not be able to mark it. Breaking these instructions breaks our marking scripts, delays marks being returned, and more importantly, gives us a headache. Submissions not compatible with the instructions in this document will attract zero marks and do not warrant a re-submission. Staff will not fix your submission.

Please view the following to learn how to _Tag_ your commit version you want to be graded:

HOW TO CREATE A TAG USING THE COMMAND LINE: https://www.loom.com/share/17ec72b954454bc89bbe1dbb0bd2874f

ANOTHER WAY TO CREATE A TAG USING THE USER INTERFACE: https://www.loom.com/share/3cd39e97919e4b688d9841613aba6973

Important information

CORRECTIONS: From time to time, students or staff find errors (e.g., typos, unclear instructions, etc.) in the assignment specification. In that case, corrected version of this file will be produced, announced, and distributed for you to commit and push into your repository. Because of that, you are NOT to modify this file in any way to avoid conflicts.

LATE SUBMISSIONS & EXTENSIONS: A penalty of 10% of the maximum mark per day will apply to late assignments up to a maximum of five days, and 100% penalty thereafter. Extensions will only be permitted in _exceptional_ circumstances; refer to this question in the course FAQs.

ABOUT THIS REPO: You must ALWAYS keep your fork PRIVATE and NEVER SHARE IT with anybody in or outside the course, except your teammates, _even after the course is completed_. You are not allowed to make another repository copy outside the provided GitHub Classroom without the written permission of the teaching staff.

_PLEASE DO NOT DISTRIBUTE OR POST SOLUTIONS TO ANY OF THE PROJECTS._

ACADEMIC DISHONESTY: This is an advanced course, so we expect full professionalism and ethical conduct. Plagiarism is a serious issue. Please DON’T LET US DOWN AND RISK OUR TRUST. The staff take academic misconduct very seriously. Sophisticated _plagiarism detection_ software (e.g., Codequiry, Turinitin, etc.) will be used to check your code against other submissions in the class as well as resources available on the web for logical redundancy. These systems are really smart, so just do not risk it and keep professional. We trust you all to submit your own work only; please don’t let us down. If you do, we will pursue the strongest consequences available to us according to the UNIVERSITY ACADEMIC INTEGRITY POLICY. For more information on this see file Academic Integrity.

WE ARE HERE TO HELP!: We are here to help you! But we don’t know you need help unless you tell us. We expect reasonable effort from you side, but if you get stuck or have doubts, please seek help. We will ran labs to support these projects, so use them! While you have to be careful to not post spoilers in the forum, you can always ask general questions about the techniques that are required to solve the projects. If in doubt whether a questions is appropriate, post a Private post to the instructors.

SILENCE POLICY: A silence policy will take effect 48 HOURS before this assignment is due. This means that no question about this assignment will be answered, whether it is asked on the newsgroup, by email, or in person. Use the last 48 hours to wrap up and finish your project quietly as well as possible if you have not done so already. Remember it is not mandatory to do all perfect, try to cover as much as possible. By having some silence we reduce anxiety, last minute mistakes, and unreasonable expectations on others.

Please remember to follow all the submission steps as per project specification.

COMP90054 Code of Honour

We expect every UoM student taking this course to adhere to it CODE OF HONOUR under which every learner-student should:

– Submit their own original work.
– Do not share answers with others.
– Report suspected violations.
– Engage in any other activities that will dishonestly improve their results or dishonestly improve or damage the results of others.

Unethical behaviour is extremely serious and consequences are painful for everyone. We expect enrolled students/learners to take full OWNERSHIP of your work and RESPECT the work of teachers and other students.

I HOPE YOU ENJOY THE PROJECT AND LEARN FROM IT, and if you still HAVE DOUBTS ABOUT THE PROJECT AND/OR THIS SPECIFICATION do not hesitate asking in the Piazza Course Discussion Forum and we will try to address it as quickly as we can!

GOOD LUCK AND HAPPY MODELLING!

Acknowledgements

This problem was originally proposed at _The Fifth International Competition on Knowledge Engineering for Planning and Scheduling_ ICKEPS 2016. Author: Lukas Chrpa, Charles University in Prague.

If you want to practice modeling other domains, take a look at the other problems presented in the competition. All but the first one can be modeled using STRIPS and actions costs.