{"id":10820,"date":"2024-02-01T06:00:11","date_gmt":"2024-02-01T11:00:11","guid":{"rendered":"https:\/\/blogs.mathworks.com\/student-lounge\/?p=10820"},"modified":"2024-07-10T13:34:37","modified_gmt":"2024-07-10T17:34:37","slug":"climb-stairs-and-shoot-the-target-a-student-robotics-project","status":"publish","type":"post","link":"https:\/\/blogs.mathworks.com\/student-lounge\/2024\/02\/01\/climb-stairs-and-shoot-the-target-a-student-robotics-project\/","title":{"rendered":"Climb stairs and shoot the target: A Student Robotics Project!"},"content":{"rendered":"
\n
For this week\u2019s blog post, we invited an ABU Robocon<\/a> team, BRACT\u2019s Vishwakarma Institute of Technology, Pune to share their journey to winning 3rd place in the MathWorks Modelling Award at DD Robocon 2023. For the 2023 season, The theme and problem statement<\/a> of the contest was “Casting Flowers over Angkor Wat,” which involves the cooperation of a rabbit robot and an elephant robot. The objective of the game is to toss their team’s colored rings into 11 poles located in the Angkor Wat Area. MathWorks is immensely proud of the team’s achievements, and we hope you also find their insights useful!<\/div>\n
<\/div>\n

Introduction<\/h2>\n
This blog explores the realms of physical modelling and pole identification as required for the challenge. The mechanism verification for the required robots was accomplished using MATLAB and Simulink. Physical modelling allowed us to understand and anticipate the behavior of complex systems. Deployed YOLOv2<\/a>, an algorithm that provides YOU ONLY LOOK ONCE functionality. On the other hand, computer vision technology was used to gain an acceptable amount of accuracy in object detection.<\/div>\n
<\/div>\n

Methodology<\/h2>\n

Modelling of the ring<\/h3>\n
The ring shape is modelled using a revolved solid block. Providing the block with ring dimensions makes it possible to accurately simulate the contact force between the ring shooting mechanism and the ring. The geometry section has two blocks:<\/div>\n