General information
| Team name: | FREDT |
| Institution: | TU Braunschweig |
| Department: | Institut für mobile Maschinen und Nutzfahrzeuge |
| Contact: |
Langer Kamp 19a 38106 Braunschweig |
Team details
| Mentors: | Till- Fabian Minßen |
| Members: |
Danny Behnecke Yannick Hübner Matthias Kemmerling Michaela Pußack Christian Schaub Luke Schneider Tom Schröder Christopher Sontag |
Robot – basic information
| Web page: | www.fredt.de | ||
|
Dimensions: (W ×L ×H) |
350mm x 660mm x 420mm | ||
| Weight: | 20kg | ||
| Num. of wheels: | 4 | Turning radius: | 750mm |
| Rain resistance: | medium | ||
Robot – mechanical details
| Drive concept: |
Drivetrain: 4-wheeled drive, power distributed via central differential and differentials in front and rear axles Chassis suspension: beam axle |
| Steering: | Ackermann steering on front and rear axle |
| Special characteristics: |
Robot – electrical details
| Powered by: | NiMH batteries | |||
| Motors: | dunkermotoren BG 75x20Pl: 3500 U/min, 220W | |||
| Controller: | ||||
| Sensors: | Camera: |
2x Allied Vision Prosilica GC |
Compass: | / |
| Ultrasonic: | / | Gyroscope: | Analog Devices ADIS16300 | |
| Infrared: | / | Accelerometer: | / | |
| Laser: | SICK LMS 100, SICK TIM 310 | Mechanical: | / | |
| Other: | ||||
| Communication: | ||||
Robot – Software
| Operating system: | Ubuntu Linux, ROS |
| Programed in: | C++ |
| Tools: | Netbeans |
| Other: |
Robot – Strategy
| 1st task: | lane detection → path planner → drive |
| 2nd task: | Same procedure as in task 1, because our system tolerates gaps |
| 3rd task: | Same procedure as in task 1 with our map creation component. Our cameras take pictures of the plants and our image processor analyses them. When dried plants are found we only change the colour of the plants in the map |
| Free style: |
Robot – Investment
| Work hours: | Continuous development |
| Components: | New main computer |
| Other: | Software rewrite |
| Sponsored by: |
Problems / Challenges
| Last year we started a complete rewrite of Helios’ software and we aren’t finished this year, because of the big amount of complexity in all areas. We tried new algorithms and faster approaches and this is only the beginning. |
Other
