1 / 32

Group Member Adrianna Gabriel Sonya Manzoor Andres Portilla Kevin Shaw Cristian Vergara

Group Member Adrianna Gabriel Sonya Manzoor Andres Portilla Kevin Shaw Cristian Vergara. Trojan Horse II The Fully Automated Seed Planting System With Route Optimization Algorithm. Project Objectives.

iorwen
Download Presentation

Group Member Adrianna Gabriel Sonya Manzoor Andres Portilla Kevin Shaw Cristian Vergara

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Group Member Adrianna Gabriel Sonya Manzoor Andres Portilla Kevin Shaw Cristian Vergara Trojan Horse II The Fully Automated Seed Planting System With Route Optimization Algorithm

  2. Project Objectives • Design and construct a system capable of automatically planting seeds according to a user defined layout + =

  3. G.U.I. Server & Controller Planter Routing Algorithm Database System Structure INPUT CALCULATION EXECUTION

  4. Planter Top View Driving Wheels Microcontroller Bluetooth Transceiver Seed Dispenser Main Power Supply

  5. Input

  6. The Idea

  7. Graphical User Interface

  8. 3. Modify Preferences Email Text Message On-Screen

  9. 2. Add Information to Database • Add new seed information manually • Assist Novice Gardeners • Update seed information

  10. Season Flower Type Flower Color 1. Planting

  11. Layout Specification Grid • Location • Color • Planting pattern/design • Obstacles

  12. 1 2 3 4 Load Planter • User needs to load the appropriate chamber with the color designated in the Planting screen.

  13. Position Planter • At this point the user needs to place the planter at the planting start position.

  14. Calculation

  15. Traveling Salesman Problem & Nearest Neighbor Heuristic • Nearest Neighbor Heuristic • Simplest attempt at solution • Route calculation based next nearest point • Calculate routes starting from all cities • Choose the shortest of all • Traveling Salesman Problem • Visit all cities exactly once • Travel the shortest total distance

  16. Limitations of the NNH

  17. 1 2 1 2 1 2 2 2 1 1 1 2 1 1 2 1 2 1 2 1 2 2 1 2 Routing - Layout Matrix 0

  18. Routing - Distance Matrix Distance matrix

  19. Distance matrix 0 4 3.3 1.3 1 1.71 4.12 2.54 3.46 2 2.24 4.47 3.13 3.61 Layout matrix 3.3 3.16 3.91 4.24 5.3 4.3 4.77 5 5.96 4.12 Routing 9999

  20. Distance matrix Routing - Distance Matrix

  21. Distance matrix 2 2 2 2 2 2 0 1 2 2 2 1 1 1 1 1 1 2 2 2 1 1 1 1 Routing 4.12 9999 9999 3.46 1.71 0 1.3 4 2.3 3.3 1 1.41 4.12 2.54 3.16 Layout matrix 1 0 2.3 2.24 3.13 3.61 4.77 3.3 3.91 4.24 5.3 3.16

  22. Dynamic Decision Matrix FIRST SECOND DISTANCE WEIGHTED DISTANCE

  23. Optimization Logic Example    ?

  24. Communication Process

  25. Execution

  26. Demonstration

  27. Demonstration

  28. Demonstration Video

  29. Conclusion

  30. Conclusion: IE Application • Industrial Information Systems • Design of Engineering Systems • Deterministic Models • Elements of Electrical Engineering • Manufacturing Processes • Visual Basic Programming

  31. Conclusion: IE Integration IE

  32. Questions

More Related