Team maus
Download
1 / 6

Team Maus - PowerPoint PPT Presentation


  • 79 Views
  • Uploaded on

Team Maus. Team Members Joe Malo Josh Mele Alaric Bobby Faizaan Mustafa. Project Goals. Search or wander the maze. Build a map of what it sees. Drop cargo at the end point. Return to start using the shortest path. Commands, Output, Scoring. 0   -   Go forward one unit

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Team Maus' - kyria


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Team maus
Team Maus

  • Team Members

  • Joe Malo

  • Josh Mele

  • Alaric Bobby

  • Faizaan Mustafa


Project goals
Project Goals

  • Search or wander the maze.

  • Build a map of what it sees.

  • Drop cargo at the end point.

  • Return to start using the shortest path.


Commands output scoring
Commands, Output, Scoring

  • 0   -   Go forward one unit

  • 1   -   Turn left 90o

  • 2   -   Turn right 90o

  • 4   -   Play sound

  • Getting to the top right corner and then back to bottom left with lowest number of moves


Strategy
Strategy

  • Assigned specific preferences for the robot to follow.

  • Used three difference preference loops to tackle the random mazes.

  • After the robot encountered a box three times it would back track.

  • After five times it would return to the beginning.

  • The idea is to avoid the robot from going in circles.


Mapping
Mapping

  • The robot starts off by making a 5 x 7 matrix of zeros.

  • Makes a one for every box it goes in.

  • Whenever it goes in the same box, it will add another one to that number.

  • For example, if the robot went into a box 3 times, it would be mapped “3.”


Conclusion
Conclusion

  • After trying several codes and methods, we found this one to be the most accurate and the fewest moves.

  • The problem we encountered with our other methods, was the preferences didn’t guarantee a successful run.

  • Our robot will always return to the start in the least moves possible.


ad