1. Homepage
  2. Programming
  3. CS465/CS565: Introduction to Artificial Intelligence - Project 1: Search

CS465/CS565: Introduction to Artificial Intelligence - Project 1: Search

Engage in a Conversation
BinghamtonCS465CS565Introduction to Artificial IntelligenceSearchPython

Project 1: Search


All those colored walls,
Mazes give Pacman the blues,
So teach him to search.


In this project, your Pacman agent will find paths through his maze world, both to reach a particular location and to collect food efficiently. You will build general search algorithms and apply them to Pacman scenarios. CourseNana.COM

As in Project 0, this project includes an autograder for you to grade your answers on your machine. This can be run with the command: CourseNana.COM

python autograder.py

See the autograder tutorial in Project 0 for more information about using the autograder. CourseNana.COM

The code for this project consists of several Python files, some of which you will need to read and understand in order to complete the assignment, and some of which you can ignore. You can download all the code and supporting files as a zip archive. CourseNana.COM

Files you'll edit:
search.pyWhere all of your search algorithms will reside.
searchAgents.pyWhere all of your search-based agents will reside.
Files you might want to look at:
pacman.pyThe main file that runs Pacman games. This file describes a Pacman GameState type, which you use in this project.
game.pyThe logic behind how the Pacman world works. This file describes several supporting types like AgentState, Agent, Direction, and Grid.
util.pyUseful data structures for implementing search algorithms.
Supporting files you can ignore:
graphicsDisplay.pyGraphics for Pacman
graphicsUtils.pySupport for Pacman graphics
textDisplay.pyASCII graphics for Pacman
ghostAgents.pyAgents to control ghosts
keyboardAgents.pyKeyboard interfaces to control Pacman
layout.pyCode for reading layout files and storing their contents
autograder.pyProject autograder
test_cases/Directory containing the test cases for each question
searchTestClasses.pyProject 1 specific autograding test classes

Files to Edit and Submit: You will fill in portions of search.py and searchAgents.py during the assignment. Once you have completed the assignment, you will submit a token generated by submission_autograder.py. Please do not change the other files in this distribution or submit any of our original files other than these files. CourseNana.COM

Evaluation: Your code will be autograded for technical correctness. Please do not change the names of any provided functions or classes within the code, or you will wreak havoc on the autograder. However, the correctness of your implementation – not the autograder’s judgements – will be the final judge of your score. If necessary, we will review and grade assignments individually to ensure that you receive due credit for your work. CourseNana.COM

Academic Dishonesty: We will be checking your code against other submissions in the class for logical redundancy. If you copy someone else’s code and submit it with minor changes, we will know. These cheat detectors are quite hard to fool, so please don’t try. 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. CourseNana.COM

Getting Help: You are not alone! If you find yourself stuck on something, contact the course staff for help. Office hours, section, and the discussion forum are there for your support; please use them. If you can’t make our office hours, let us know and we will schedule more. We want these projects to be rewarding and instructional, not frustrating and demoralizing. But, we don’t know when or how to help unless you ask. CourseNana.COM

Discussion: Please be careful not to post spoilers. CourseNana.COM

Welcome to Pacman

After downloading the code (search.zip), unzipping it, and changing to the directory, you should be able to play a game of Pacman by typing the following at the command line: CourseNana.COM

python pacman.py

Pacman lives in a shiny blue world of twisting corridors and tasty round treats. Navigating this world efficiently will be Pacman’s first step in mastering his domain. CourseNana.COM

The simplest agent in searchAgents.py is called the GoWestAgent, which always goes West (a trivial reflex agent). This agent can occasionally win: CourseNana.COM

python pacman.py --layout testMaze --pacman GoWestAgent

But, things get ugly for this agent when turning is required: CourseNana.COM

python pacman.py --layout tinyMaze --pacman GoWestAgent

Also, all of the commands that appear in this project also appear in commands.txt, for easy copying and pasting. In UNIX/Mac OS X, you can even run all these commands in order with bash commands.txt. CourseNana.COM

New Syntax

You may not have seen this syntax before: CourseNana.COM

def my_function(a: int, b: Tuple[int, int], c: List[List], d: Any, e: float=1.0):

This is annotating the type of the arguments that Python should expect for this function. In the example below, a should be an int -- integer, b should be a tuple of 2 ints, c should be a List of Lists of anything -- therefore a 2D array of anything, d is essentially the same as not annotated and can by anything, and e should be a floate is also set to 1.0 if nothing is passed in for it, i.e.: CourseNana.COM

my_function(1, (2, 3), [['a', 'b'], [None, my_class], [[]]], ('h', 1))

The above call fits the type annotations, and doesn't pass anything in for e. Type annotations are meant to be an adddition to the docstrings to help you know what the functions are working with. Python itself doesn't enforce these. When writing your own functions, it is up to you if you want to annotate your types; they may be helpful to keep organized or not something you want to spend time on. CourseNana.COM

In searchAgents.py, you’ll find a fully implemented SearchAgent, which plans out a path through Pacman’s world and then executes that path step-by-step. The search algorithms for formulating a plan are not implemented – that’s your job. CourseNana.COM

First, test that the SearchAgent is working correctly by running: CourseNana.COM

python pacman.py -l tinyMaze -p SearchAgent -a fn=tinyMazeSearch

The command above tells the SearchAgent to use tinyMazeSearch as its search algorithm, which is implemented in search.py. Pacman should navigate the maze successfully. CourseNana.COM

Now it’s time to write full-fledged generic search functions to help Pacman plan routes! Pseudocode for the search algorithms you’ll write can be found in the lecture slides. Remember that a search node must contain not only a state but also the information necessary to reconstruct the path (plan) which gets to that state.Hint: Each algorithm is very similar. Algorithms for DFS, BFS, UCS, and A* differ only in the details of how the fringe is managed. So, concentrate on getting DFS right and the rest should be relatively straightforward. Indeed, one possible implementation requires only a single generic search method which is configured with an algorithm-specific queuing strategy. (Your implementation need not be of this form to receive full credit). CourseNana.COM

Implement the depth-first search (DFS) algorithm in the depthFirstSearch function in search.py. To make your algorithm complete, write the graph search version of DFS, which avoids expanding any already visited states. CourseNana.COM

Your code should quickly find a solution for: CourseNana.COM

python pacman.py -l tinyMaze -p SearchAgent
python pacman.py -l mediumMaze -p SearchAgent
python pacman.py -l bigMaze -z .5 -p SearchAgent

The Pacman board will show an overlay of the states explored, and the order in which they were explored (brighter red means earlier exploration). Is the exploration order what you would have expected? Does Pacman actually go to all the explored squares on his way to the goal? CourseNana.COM

Hint: If you use a Stack as your data structure, the solution found by your DFS algorithm for mediumMaze should have a length of 130 (provided you push successors onto the fringe in the order provided by getSuccessors; you might get 246 if you push them in the reverse order). Is this a least cost solution? If not, think about what depth-first search is doing wrong. CourseNana.COM

Grading: Please run the below command to see if your implementation passes all the autograder test cases. CourseNana.COM

python autograder.py -q q1

Implement the breadth-first search (BFS) algorithm in the breadthFirstSearch function in search.py. Again, write a graph search algorithm that avoids expanding any already visited states. Test your code the same way you did for depth-first search. CourseNana.COM

python pacman.py -l mediumMaze -p SearchAgent -a fn=bfs
python pacman.py -l bigMaze -p SearchAgent -a fn=bfs -z .5

Does BFS find a least cost solution? If not, check your implementation. CourseNana.COM

Hint: If Pacman moves too slowly for you, try the option --frameTime 0. CourseNana.COM

Note: If you’ve written your search code generically, your code should work equally well for the eight-puzzle search problem without any changes. CourseNana.COM

python eightpuzzle.py

Grading: Please run the below command to see if your implementation passes all the autograder test cases. CourseNana.COM

python autograder.py -q q2

Question 3 (3 points): Varying the Cost Function

While BFS will find a fewest-actions path to the goal, we might want to find paths that are “best” in other senses. Consider mediumDottedMaze and mediumScaryMaze. CourseNana.COM

By changing the cost function, we can encourage Pacman to find different paths. For example, we can charge more for dangerous steps in ghost-ridden areas or less for steps in food-rich areas, and a rational Pacman agent should adjust its behavior in response. CourseNana.COM

Implement the uniform-cost graph search algorithm in the uniformCostSearch fuctation. You should now observe successful behavior in all three of the following layouts, where the agents below are all UCS agents that differ only in the cost function they use (the agents and cost functions are written for you): CourseNana.COM

python pacman.py -l mediumMaze -p SearchAgent -a fn=ucs
python pacman.py -l mediumDottedMaze -p StayEastSearchAgent
python pacman.py -l mediumScaryMaze -p StayWestSearchAgent

Note: You should get very low and very high path costs for the StayEastSearchAgent and StayWestSearchAgent respectively, due to their exponential cost functions (see searchAgents.py for details). CourseNana.COM

Grading: Please run the below command to see if your implementation passes all the autograder test cases. CourseNana.COM

python autograder.py -q q3

Implement A* graph search in the empty function aStarSearch in search.py. A* takes a heuristic function as an argument. Heuristics take two arguments: a state in the search problem (the main argument), and the problem itself (for reference information). The nullHeuristic heuristic function in search.py is a trivial example. CourseNana.COM

You can test your A* implementation on the original problem of finding a path through a maze to a fixed position using the Manhattan distance heuristic (implemented already as manhattanHeuristic in searchAgents.py). CourseNana.COM

python pacman.py -l bigMaze -z .5 -p SearchAgent -a fn=astar,heuristic=manhattanHeuristic

You should see that A* finds the optimal solution slightly faster than uniform cost search (about 549 vs. 620 search nodes expanded in our implementation, but ties in priority may make your numbers differ slightly). What happens on openMaze for the various search strategies? CourseNana.COM

Grading: Please run the below command to see if your implementation passes all the autograder test cases. CourseNana.COM

python autograder.py -q q4

Question 5 (3 points): Finding All the Corners

The real power of A* will only be apparent with a more challenging search problem. Now, it’s time to formulate a new problem and design a heuristic for it. CourseNana.COM

In corner mazes, there are four dots, one in each corner. Note that for some mazes like tinyCorners, the shortest path does not always go to the closest food first! Hint: the shortest path through tinyCorners takes 28 steps. CourseNana.COM

Note: Make sure to complete Question 2 before working on Question 5, because Question 5 builds upon your answer for Question 2. CourseNana.COM

Implement the CornersProblem search problem in searchAgents.py. You will need to choose a state representation that encodes all the information necessary to detect whether all four corners have been reached. Now, your search agent should solve: CourseNana.COM

python pacman.py -l tinyCorners -p SearchAgent -a fn=bfs,prob=CornersProblem
python pacman.py -l mediumCorners -p SearchAgent -a fn=bfs,prob=CornersProblem

To receive full credit, you need to define an abstract state representation that does not encode irrelevant information (like the position of ghosts, where extra food is, etc.). In particular, do not use a Pacman GameState as a search state. Your code will be very, very slow if you do (and also wrong). CourseNana.COM

Hint 1: The only parts of the game state you need to reference in your implementation are the starting Pacman position and the location of the four corners. CourseNana.COM

Hint 2: When coding up getSuccessors, make sure to add children to your successors list with a cost of 1. CourseNana.COM

Our implementation of breadthFirstSearch expands just under 2000 search nodes on mediumCorners. However, heuristics (used with A* search) can reduce the amount of searching required. CourseNana.COM

Grading: Please run the below command to see if your implementation passes all the autograder test cases. CourseNana.COM

python autograder.py -q q5

Question 6 (3 points): Corners Problem: Heuristic

Note: Make sure to complete Question 4 before working on Question 6, because Question 6 builds upon your answer for Question 4. CourseNana.COM

Implement a non-trivial, consistent heuristic for the CornersProblem in cornersHeuristic. CourseNana.COM

python pacman.py -l mediumCorners -p AStarCornersAgent -z 0.5

Note: AStarCornersAgent is a shortcut for CourseNana.COM

-p SearchAgent -a fn=aStarSearch,prob=CornersProblem,heuristic=cornersHeuristic

Admissibility vs. Consistency: Remember, heuristics are just functions that take search states and return numbers that estimate the cost to a nearest goal. More effective heuristics will return values closer to the actual goal costs. To be admissible, the heuristic values must be lower bounds on the actual shortest path cost to the nearest goal (and non-negative). To be consistent, it must additionally hold that if an action has cost c, then taking that action can only cause a drop in heuristic of at most c. CourseNana.COM

Remember that admissibility isn’t enough to guarantee correctness in graph search – you need the stronger condition of consistency. However, admissible heuristics are usually also consistent, especially if they are derived from problem relaxations. Therefore it is usually easiest to start out by brainstorming admissible heuristics. Once you have an admissible heuristic that works well, you can check whether it is indeed consistent, too. The only way to guarantee consistency is with a proof. However, inconsistency can often be detected by verifying that for each node you expand, its successor nodes are equal or higher in in f-value. Moreover, if UCS and A* ever return paths of different lengths, your heuristic is inconsistent. This stuff is tricky! CourseNana.COM

Non-Trivial Heuristics: The trivial heuristics are the ones that return zero everywhere (UCS) and the heuristic which computes the true completion cost. The former won’t save you any time, while the latter will timeout the autograder. You want a heuristic which reduces total compute time, though for this assignment the autograder will only check node counts (aside from enforcing a reasonable time limit). CourseNana.COM

Grading: Your heuristic must be a non-trivial non-negative consistent heuristic to receive any points. Make sure that your heuristic returns 0 at every goal state and never returns a negative value. Depending on how few nodes your heuristic expands, you’ll be graded: CourseNana.COM

Number of nodes expandedGrade
more than 20000/3
at most 20001/3
at most 16002/3
at most 12003/3

Remember: If your heuristic is inconsistent, you will receive no credit, so be careful! CourseNana.COM

Grading: Please run the below command to see if your implementation passes all the autograder test cases. CourseNana.COM

python autograder.py -q q6

[Optional] Question 7 (4 points): Eating All The Dots

Now we’ll solve a hard search problem: eating all the Pacman food in as few steps as possible. For this, we’ll need a new search problem definition which formalizes the food-clearing problem: FoodSearchProblem in searchAgents.py (implemented for you). A solution is defined to be a path that collects all of the food in the Pacman world. For the present project, solutions do not take into account any ghosts or power pellets; solutions only depend on the placement of walls, regular food and Pacman. (Of course ghosts can ruin the execution of a solution! We’ll get to that in the next project.) If you have written your general search methods correctly, A* with a null heuristic (equivalent to uniform-cost search) should quickly find an optimal solution to testSearch with no code change on your part (total cost of 7). CourseNana.COM

python pacman.py -l testSearch -p AStarFoodSearchAgent

Note: AStarFoodSearchAgent is a shortcut for CourseNana.COM

-p SearchAgent -a fn=astar,prob=FoodSearchProblem,heuristic=foodHeuristic

You should find that UCS starts to slow down even for the seemingly simple tinySearch. As a reference, our implementation takes 2.5 seconds to find a path of length 27 after expanding 5057 search nodes. CourseNana.COM

Note: Make sure to complete Question 4 before working on Question 7, because Question 7 builds upon your answer for Question 4. CourseNana.COM

Fill in foodHeuristic in searchAgents.py with a consistent heuristic for the FoodSearchProblem. Try your agent on the trickySearch board: CourseNana.COM

python pacman.py -l trickySearch -p AStarFoodSearchAgent

Our UCS agent finds the optimal solution in about 13 seconds, exploring over 16,000 nodes. CourseNana.COM

Any non-trivial non-negative consistent heuristic will receive 1 point. Make sure that your heuristic returns 0 at every goal state and never returns a negative value. Depending on how few nodes your heuristic expands, you’ll get additional points: CourseNana.COM

Number of nodes expandedGrade
more than 150001/4
at most 150002/4
at most 120003/4
at most 90004/4 (full credit; medium)
at most 70005/4 (optional extra credit; hard)

Remember: If your heuristic is inconsistent, you will receive no credit, so be careful! Can you solve mediumSearch in a short time? If so, we’re either very, very impressed, or your heuristic is inconsistent. CourseNana.COM

Grading: Please run the below command to see if your implementation passes all the autograder test cases. CourseNana.COM

python autograder.py -q q7

Sometimes, even with A* and a good heuristic, finding the optimal path through all the dots is hard. In these cases, we’d still like to find a reasonably good path, quickly. In this section, you’ll write an agent that always greedily eats the closest dot. ClosestDotSearchAgent is implemented for you in searchAgents.py, but it’s missing a key function that finds a path to the closest dot. CourseNana.COM

Implement the function findPathToClosestDot in searchAgents.py. Our agent solves this maze (suboptimally!) in under a second with a path cost of 350: CourseNana.COM

python pacman.py -l bigSearch -p ClosestDotSearchAgent -z .5

Hint: The quickest way to complete findPathToClosestDot is to fill in the AnyFoodSearchProblem, which is missing its goal test. Then, solve that problem with an appropriate search function. The solution should be very short! CourseNana.COM

Your ClosestDotSearchAgent won’t always find the shortest possible path through the maze. Make sure you understand why and try to come up with a small example where repeatedly going to the closest dot does not result in finding the shortest path for eating all the dots. CourseNana.COM

Grading: Please run the below command to see if your implementation passes all the autograder test cases. CourseNana.COM

python autograder.py -q q8

Get in Touch with Our Experts

Wechat WeChat
Whatsapp Whatsapp
Binghamton代写,CS465代写,CS565代写,Introduction to Artificial Intelligence代写,Search代写,Python代写,Binghamton代编,CS465代编,CS565代编,Introduction to Artificial Intelligence代编,Search代编,Python代编,Binghamton代考,CS465代考,CS565代考,Introduction to Artificial Intelligence代考,Search代考,Python代考,Binghamtonhelp,CS465help,CS565help,Introduction to Artificial Intelligencehelp,Searchhelp,Pythonhelp,Binghamton作业代写,CS465作业代写,CS565作业代写,Introduction to Artificial Intelligence作业代写,Search作业代写,Python作业代写,Binghamton编程代写,CS465编程代写,CS565编程代写,Introduction to Artificial Intelligence编程代写,Search编程代写,Python编程代写,Binghamtonprogramming help,CS465programming help,CS565programming help,Introduction to Artificial Intelligenceprogramming help,Searchprogramming help,Pythonprogramming help,Binghamtonassignment help,CS465assignment help,CS565assignment help,Introduction to Artificial Intelligenceassignment help,Searchassignment help,Pythonassignment help,Binghamtonsolution,CS465solution,CS565solution,Introduction to Artificial Intelligencesolution,Searchsolution,Pythonsolution,