Swarmathon - NASA Robotics competition
Swarmathon III (2018)
http://nasaswarmathon.com/
Swarmathon is a competition designed to engage students in developing cooperative robotic algorithms to revolutionize space exploration. California State University, Los Angeles’ Swarmathon team is competing in its third year and is a multidisciplinary team consisting of Computer Science, Electrical Engineering and Mechanical Engineering students. During competition, multiple rovers must be able to search for resources, collect and return those resources into a desired location while operating autonomously. The competition is held at the Kennedy Space Center where teams compete against each other or the course of three days. Each day will consist of the preliminary round followed by the semifinal round which ends with the final round.
Students will be challenged to develop search algorithms for robotic swarms. Swarmathon participation will: improve student’s skills in robotics and computer science and further advance technology for future NASA space exploration missions.
The Swarmathon is a cooperative agreement between the NASA Minority University Research and Education Program (MUREP) and the University of New Mexico in partnership with the NASA KSC Swamp Works.
Name |
Associated Team |
Jose Ambrosio | Localization |
Mikey Thong | Localization |
Christopher Portugal | Mapping |
Christian Soltero | Mapping |
Jonathan Sahagun | Algorithms |
Scheduled Meetings
Monday 3:00 - 8:00 and 5:00 - 6:00 with team advisor
Tuesday and Thursday: 11:00 - 4:00
Wednesday 3:00 - 8:00
Friday: 1:30 - 6:00
Saturday: 1:00 - 3:30
- Jose Ambrosio
- Christopher Portugal
- Jonathan Sahagun
- Christian Soltero
- Mikey Thong
- NASA Robotics Competition Software Requirements Specification
- NASARoboticsCompetitionSoftwareRequirementsSpecification word file
- Software Design Document
- Software Design Document (Word Version)
- Swarmathon Fall Presentation
- Swarmathon III Spring 2018 Presentation
- Swarmathon Poster
- Zipped Code (Not public so other school can't find it)