Follow Line Formula 1

Follow line

In this practice we will use PIDs in order to create a program which will allow us to drive a formula 1 car efficiently following a line.


What are we going to use?

1) A color filter for getting the line position
 
   We are going to use the opencv library to get the position of the center pixel of the line but, we are not going to use all the line, we will just use the top part of the line in order to get a pixel which will give us more info for the turning and speeds PIDs

2) Two PIDs

-Linear_pid: This pid is jut going to give us a proportional output linear speed that we will subtract to out maximum linear speed using the center pixel of the color filter that we defined before.

 -Angular_pid: This pid is going to give us an angular speed but this time we well use the kp, ki and kd components

3) A recovery condition

An extra condition that basically will search the line turning to the last direction at it was and will reduce our speed to the minimum that we want if we lost the line.


What is the result?

Better that I expected.

In order to compare my solution with a real example, we will use the Montmelo circuit.

The fastest lap in this circuit is 1:18.149 completed by Max Verstappen in 2021, but, what time we got using my program?

Montmelo demo

1:28 !!!!!! just ten seconds under the fastest lap. 


Its true that is could be more stable. I will also give you a "safer implementation" which have the same logic but just use slower speeds.
Montmelo safe demo

2:08 !!! not bad for a safe implementation of the code.





Comentarios

Publicar un comentario

Entradas populares de este blog

OMPL Amazon warehouse

Imagen
 OPML AMAZON WAREHOUSE The objective of this exercise is to empower our robot to transfer a designated shelf from its initial location to a distinct area, utilizing a supplied map and shelf locations as points of reference. In my scenario, I have chosen the initial point as the destination. Additionally, it is crucial to highlight that we were constrained to crafting movement paths solely through the utilization of the OMPL library, a factor that has notably streamlined the entire task. How have I achieved it? First version The initial step involved configuring the robot to generate routes using OMPL. To achieve this, it was necessary to establish bidirectional mappings between the map and real-world coordinates, enabling seamless coordinate base transformations. Subsequently, I approximated the robot as a point (or pixel, in this context) and applied erosion to the map using a kernel size equivalent to the robot's pixel size plus an inflated area, akin to the approach employed by ...
Leer más

Autonomous drone for search and rescue mission

Imagen
Autonomous drone for search and rescue mission For this exercise, we will design the control system for a drone intended for search and rescue missions. To assess the effectiveness of our program, we will simulate a shipwreck scenario. In this hypothetical situation, we will be informed of the presence of shipwreck survivors (with an unknown number of individuals) at specific coordinates. Our drone will need to navigate to the designated area, sweep the vicinity for survivors, report to the rescue team, and ultimately return to the takeoff zone. Drone behavior: For the fulfillment of our mission, we will implement a state machine in which our drone will start from the 'disarmed' state, needing to arm and take off before transitioning to the 'go to survivors' state. Once the drone is in the last sighting zone, it will switch to the 'search' state, where it will perform a spiral sweep and record the location of any spotted survivor. Finally, upon completing the se...
Leer más

Localized Vacuum Cleaner

Imagen
Localized Vacuum Cleaner For this practice, we are going to design the control system for a high-end vacuum cleaner. High-end vacuum cleaners stand out from the rest due to their more powerful sensors, which are required to enable the use of more optimal home cleaning algorithms. In this case, the algorithm we are going to use is the Backtracking Spiral Algorithm (BSA) for coverage. Backtracking Spiral Algorithm (BSA): This algorithm involves dividing the provided simulation world map into cells. The size of these cells will depend on the dimensions of the robot, and it is recommended that they have a slightly smaller size than the robot's diameter to prevent the robot from passing over the same area of the world multiple times, which would be represented by different cells in our auxiliary map. We will also classify our cells into three types: obstacle, already visited, and dirty. We will also expand the obstacles on the map using erosion to avoid getting too close to them and to ...
Leer más