Obstacle Avoidance

Obstacle avoidance

In this practice we have an avoiding obstacle formula 1 using the VFF algorithm as objective.
The VFF algorithm consist on getting repulsive and attractive forces that will represent the mobility system of our robot; getting a final force as result which will represent the angular and linear velocity for a safe navigation. 

The attractive force:

For the attractive force, we will get the relative position of the goal to our robot. This will represent a vector which we will normalize and use as the attractive force. 

The repulsive force:

This was the hard one.

For getting this force, firstly we must parse the 180 measures that the laser give us in order to get the information that we want and delete the noise; then, we will transform that treated measures to a normalized vector that will have the opposite direction and sense to the object that we want to avoid.

The total force:

This is the final force that will have the form (lineal_velocity,angular_velocity).

In order to get it, we have to sum our 2 previous vectors, component by component, but multiplying before each of their component by a constant that will change depending on the implementation; having the following form:

Total_force = (lineal_velocity, angular_velocity);

Lineal_velocity = A * attractive_force_x + B * repulsive_force_x

Angular_velocity = C * attractive_force_y + D * repulsive_force_y


And that's all!!!


Do you want to see a demo?
















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