22K - views

# The Top Men

## The Top Men

Download Presentation - The PPT/PDF document "The Top Men" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

## Presentation on theme: "The Top Men"— Presentation transcript:

Slide1

The Top MenChristian Dell, Joe Hall, Alex Reeser, Landon Rogge, Jason Todd, Jared Whitaker

A-mAIze-in

Slide2

Abstract

MazesFind a particular location in a maze and discover a path to the location.Use different h(x) with A* to determine best of the code

Slide3

Implementation

Java using awt/swingSelect which test maze to useSelect the heustric to useWill run the selected mode and output raw data on left

Slide4

Slide5

Slide6

Slide7

A General PEAS

Agent: Maze Traversing Agent

Performance: Number of moves it takes to solve the maze or find cheese

Environment: Maze

Actuators:

performMovement

function

Sensors:

examineEnvironment

function

Slide8

Rules

A* with various h(x)From a starting point, find a path to another pointCannot walk through walls

Slide9

Maze Solving

Fully Observable: YesDeterministic: YesEpisodic: YesStatic: YesDiscrete: YesMulti-agent: No

Slide10

A* Heuristics Implemented

EuclideanManhattanNumber of Walls (Method 1)Number of Walls (Method 2)Last in List (f(x) = 0; udlr)Dijkstra’s (h(x) = 0)Random Numbers (0-15)

Slide11

Number of Walls (Method 1)

Take starting position x1 and y1, take ending position x2 and y2, set wall = 0

Repeat until x1 = x2 and y1 = y2

If x1 > x2, x1 – 1; if x1 < x2, x1 + 1; else x1

If y1 > y2, y1 – 1; if y1 < y2, y1 + 1; else y1

If a wall exists at the new (x1, y1), wall + 1

Slide12

S

***

***

***

***

***

X

Slide13

Number of Walls (Method 2)

Take starting position x1 and y1, take ending position x2 and y2, set wall = 0

Repeat until x1 =

x2

If x1 > x2, x1

1; if x1 < x2, x1 + 1; else x1

If

a wall exists at the new (x1, y1), wall +

1

Repeat until

y1

= y2

If

y1 > y2, y1 – 1; if y1 < y2, y1 + 1; else y1

If a wall exists at the new (x1, y1), wall + 1

Slide14

***

***

***

***

S

***

***

***

***

***

X

Slide15

Last in List

Chooses the last member of the closed set (most recently added)

Results in a unique order – find the most recent expanded node with adjacent unexpanded nodes and select the top, bottom, left, right node to continue down in that order.

Bizzare

, efficient results in some cases. Similar to depth first search. Accidental

mis

-implementation of

Dijkstra’s

which occurs when f(x) = 0 instead of h(x) = 0.

Slide16

---

***

***

***

---

---

***

---

S

---

---

***

---

---

---

***

---

---

***

---

---

***

---

---

***

---

X

***

***

---

Slide17

Some Results

Euclidean

Manhattan

Walls

1

Walls 2

Last

in List

Dijkstra

Random

89+2

88+2

65+4

57+4

76+2

95+1

94 (100

Avg

)

85+5

87+3

82+8

87+6

59+5

97+4

95

57+2

56+2

40+5

58+4

52+5

75+2

74

Slide18

Some images

Maze 1 Maze 1 Solution

Slide19

Some images

Maze 1 Random Maze 1 Wall Method 2

Slide20

Some images

Maze 2 Maze 2 Solution

Slide21

Some images

Maze 2 Last in List Maze 2 Wall Method 2

Slide22

Some images

Maze 3 Maze 3 Solution

Slide23

Some images

Maze 3 Euclidean Maze 3 Wall

Method 1

Slide24

A graph of some sort

Slide25

A graph of some sort

Slide26

Maze Conclusions

Random Heuristics are useless in generalDijkstra’s fared even worse than random heuristics?Euclidian/Manhattan performance depended on maze, usually not well, many misleading paths in mazesNumber of walls did relatively okayDepth first did well, but likely because of good random positioning of thestarting locationand the cheese

Slide27

Slide28

Slide29

Slide30

Slide31

Slide32

Slide33

Slide34

Slide35

Slide36

Slide37

Slide38

Slide39