COM1005程序辅导、AI Techniques程序写作

” COM1005程序辅导、AI Techniques程序写作Assignment 3: The Warriers Planning GameCOM1005 Machines and IntelligenceSemester 2: Experiments with AI TechniquesHeidi ChristensenUniversity of SheffieldThis assignment carries 18.75% of the marks for COM1005DUE DATE: Friday 29th May 2020 at 23.59 (UK Time)The task for this assignment is to implement and document a STRIPS-based planning systemfor the Warriers game described below.The ProblemIn a computer game, a Warrior at point W has the goal of seizing a treasure chest T which isat the bottom of a pit at point P. The warrior may move from place to place on the surfaceand carry a single object from place to place.The warrior can reach the treasure by moving a ladder at point L to the pit, lowering it intothe pit and climbing down the ladder. However, there may be a poisonous snake S in the1pit. In this case the warrior can safely achieve his goal by attaching a hook at point H to arope at point R, lowering the rope into the pit, hooking the treasure and hauling it up. Ifboth methods are possible, the warrior should prefer to use the ladderIn this assignment you will write and test STRIPS operators for planning a solution to thewarriors problem.Your tasksHere is an overview of the three tasks you need to complete. More detail on each task canbe found below.COM1005作业辅导、AI Techniques作业写作、java语言作业辅导、java程序设计作业调试1. Implement a solution to the Warriors problem using the planning system STRIPS,using the supplied Java STRIPS code.2. Run your code for the two cases: 1) when the snake is in the pit and 2) whenit is not. See CakeStrips.java for an example of how to do this. Present your resultsand experiment with your solution to find its limitations. Suggest improvements tothe planning system based on your experimentation with your initial implementation.3. Produce a report: Finally, you should produce an experimental report using thetemplate provided. The report should include comparison of the performance of yourinitial and improved set of STRIPS operators.Task1: Implement a solutionFor this Assignment, you will have been supplied with: this Assignment brief; a report template; a code base named Strips.The code base Strips has the following structure: pmatch (pattern matching package); StripsDiffFinder.java StripsOperatorFinder.java StripsApplyOperator.java StripsFn.java StripsOp.java StipsOperator.java cakeStrips.javaTo see an example of how to run the STRIPS system, compile and run cakeStrips.java(note: it is compatible with Java 1.8+).2In this assignment we ask you to define a set of STRIPS operators and implement them inthe STRIPS system in a file called warrierStrips.java (use the cakeStrips.java as an example.Your algorithm will be tested by markers against the STRIPS program structure you wereoriginally supplied with. Therefore, other than warrierStrips.java, you are asked notto amend any of the other files in the code base. Your submission should only include thefiles you have changed, and you should check it will run with the original file system beforesubmitting.A complete solution on your machine may look something like: pmatch (unchanged) StripsDiffFinder.java (unchanged) StripsOperatorFinder.java (unchanged) StripsApplyOperator.java (unchanged) StripsFn.java (unchanged) StripsOp.java (unchanged) StipsOperator.java (unchanged) warrierStrips.java (new)(You can use the logger and sheffield packages from the previous assignments, if you like.)Task2: Run your code for the two casesSee cakeStrips.java for an example of how to do this. Note your results and experiment withyour solution to find its limitations.Task3: Produce a reportYour experimental report should describe your STRIPS operators and discuss the performanceof your initial solution for the two scenarios (snake or no snake in the pit) and anyimprovements you have implemented. You should include, at the very least: Description of initial STRIPS planning system to solve the Warrier problem. Discussion of limitations and any suggested improvements to your STRIPS operators. Your own conclusions Printout of your systems workings – see the template for an example of what thatmight look like.A LATEX report template is provided, with compulsory sections specified. You may add moresections if you wish: include in your report what you think is interesting.Note: You must use the LATEX template provided for your report. As with the previousassignment, you will not be marked on your ability to use LATEX to format your report (i.e.there are no extra marks for making it look fancy!). That being said, LATEX is an essentialpiece of software for communicating research and results in engineering and science, so wewant you to get experience using it early on.3Summary of assignment tasks1. Write a set of operators;2. Implement your solution by using the STRIPS code provided.3. Run your code for the two situations of when there is a snake in the pit, and whenthere isnt.4. Complete your report with the results from your experiments including a printout ofthe output of your program to see the workings of your solution.What to submitSubmit your solution, as a zipped file called SURNAME FIRSTNAME.zip, where SURNAME isyour surname (family name), and FIRSTNAME is your first name (given name). This zip fileshould contain: a .pdf copy of your report named SURNAME FIRSTNAME.pdf your STRIPS system code.Marking SchemeRemember: readability is of great importance for coding style. You should therefore takegreat care with line breaks, document your code appropriately and use indentation consistently.Before you hand in your code, ask yourself whether the code is understandable bysomeone marking it.Marks will be awarded according to these criteria:4Percentage points Categories and example score weights60% Implementation and test of STRIPS operators tosolve Warrier game30% Quality of STRIPS operators (high scores for correct and wellorganisedoperators)20% Quality of suggestions of improvements (high scores for suggestionsas to how improvements could be coded)10% Well documented (comments used to ease understanding ofmore complex parts Of the code such as operator behaviour)and well presented code (indentations, brackets and choice ofvariable names. Note, there isnt much code programming todo in this assignment …).20% Documentation – quality Of presentation of your experimentalresults in your report10% Quality of discussion of results (high scores for demonstratingsolutions to the snake and no-snake cases)10% Quality of conclusions (high scores for being comprehensive,well-presented (good choice of tables, graphs etc), and backedby evidence from your tests).20% Experimental results20% Quality of discussion of shortcomings of initial solution for thetwo scenarios and resulting, improved system (high scores foridentification of key issues and suggested, modified STRIPSoperators)100% TotalMarks and feedback will be Returned through MOLE/Blackboard within 3 weeks.RulesUnfair means: This is an individual assignment so you are expected to work on your own.You may discuss the general principles with other students but you must not work togetherto develop your solution. You must write your own code. All code submitted may beexamined using specialized software to identify evidence of code written by another studentor downloaded from online resources.5如有需要，请加QQ：99515681 或邮箱：99515681@qq.com

“