The teams are preparing a small mobile ground robot (s), which must be localized on the map, travel along a given route, recognize and move objects on the polygon according to the assignment.
Your robot is considered intelligent if it performs a task:
subject to previously unknown conditions
qualitatively
steadily
1-3 students
JUNIOR
13-15 years
SENIOR
16-18 years
any hardware
any materials
any software
Presenting a map of a known area
Localization according to the embedded map
Consideration of various options for the direction of the robot
Graph representation
Graph traversal algorithms
Finding a path in a graph
Route planning
Finding the optimal path
Discrete space navigation
Building a map of an unknown area
Graph representation
Graph traversal algorithms
Finding a path in a graph
Route planning
Finding the optimal path
Discrete space navigation
Black line controllers
Odometry
Barcode reading
Implementation of a multi-agent system
Passing numeric information between agents
Synchronizing agent states
In today's world, mobility and efficiency are very important. The faster the goods are delivered from one point to another, the faster the goods will be sent to the store.
Imagine that there is an area in a forest park with roads that allow mobile robots to move along them. The movement of robots is possible only on roads, since in other places mobile robots cannot pass due to the presence of plantings.
The main task of the Olympiad is to make a robot and program it to transport goods from the "Warehouse" area to the "Stores" area. There is one warehouse and two shops in the area.
The map is known in advance.
Requirements for the robot: size up to 250x250x250 mm during the entire attempt, material - any safe.
The Internet has become a part of our life: hotels, cafes, warehouses. In order to have high-quality access to the network from anywhere in the room or area, it is necessary to deploy a network of access points. However, the network is needed not only for the communication of people, but also to ensure the connection of technical devices, for example, for robots to exchange data.
Imagine that there is an area in a forest park with roads that allow mobile robots to move along them. The movement of robots is possible only on roads, since in other places mobile robots cannot pass due to the presence of plantings.
The company is faced with the task of deploying a wireless communication system in this territory. This requires the location of the base station and access points. The coordinates of these objects are transmitted to the installer from the command center.
A robot encoder must be placed in the command center, which will transmit the coordinates to the robot installer. The installation robot is preloaded with the necessary objects: base station (1 piece) and access point (2 pieces).
The area map may not be known in advance.
Requirements for the robot: two robots up to 250x250x250 mm in size during the entire attempt, any material is safe.
subscribe and stay tuned!
Olympiad Regulations
Olympiad profile Regulations
Organize a team of like-minded people under the guidance of a coach. Pay attention to the requirements for the team and the coach in the Olympiad Regulations.
Ask the coach to register your team on our website. To do this, fill in registration form.
Find out how you can get to the final stage. To do this, study how the teams are selected for the final stage.
All information about the event you can get in the FINAL menu.
At the webinars, we will tell you what the Olympiad will look like, how to take part and how to prepare. You can ask your questions directly to the organizers and experts!
Coming events:
We also run robotics schools several times a year.
Coming events:
We also run courses for teachers several times a year.
Coming events:
Have questions? We are ready to answer your questions on our forum . There you can also exchange experiences with other participants or ask mentors for advice. And also you can get answers to your questions about the rules for completing the task and conducting the Olympiad.