Mobile Robot Control 2024 Robocop

Group members:

Caption

Name	student ID
Matijs van Kempen	2060256
Luc Manders	1729225
Marc Quelle	2044749
Marijn Ruiter	1489496
Luke Alkemade	1581643
Arif Ashworth	1544632
Abhidnya Kadu	1859234

Exercise 1

Method 1 - Arif

Screenshot of final result for Method 1.

In this method the LaserData struct is used to track the measured distances from the walls to the robot. To make the robot drive forward the sendBaseReference command is used, and the robot moves in the x direction at a speed of 0.2. Once it reaches the wall in front of it and the range values drop to below 0.2, motion is halted and a message is printed to the screen before exiting the program.

Some experimentation was done to test different speeds and thresholds for the stopping range values. When the speed was higher than the stopping range value the robot would actually crash into the wall first before stopping, and if it was lower then the robot would stop slightly farther away from the wall. However, this only seemed to be the case when the stopping value was very low (e.g. 0.1), but increasing it to 0.2, for example, allowed the speed to be increased to 0.4 without any crashing.

Exercise 2

Method 1 - Arif

Method 1 on Map 1.

Method 1 on Map 2.

The previously described method was tested on the two provided maps with input speeds of (0.3, 0, +-0.3) and a stopping value of 0.2. With both maps the robot successfully came to a stop before crashing, although it struggled when driving into a corner and stopped much closer to the wall than it did in previous tests.

Practical Exercises 1

Local Navigation

Dynamic Window Approach

The approach

The approach can be divided in the following sequential steps:

1. Calculate the union between the Possible (angular) Velocities (Vs, Ws) and the Reachable (angular) Velocities (Vd, Wd)
   • EXPLAIN HOW
2. Iterate through the discretized values (v, w) of the union of Vs, Vd and Ws and Wd:
   1. Calculate the Admissable (angular) Velocities (Va,Wa) using v and w
      • EXPLAIN HOW
   2. Check if v and w are also in Va and Wa, if this is the case:
      • Calculate the optimization function value. If this value is higher than the previous optimization value, set the current v and w to v_final and w_final
        • EXPLAIN HOW
3. Return v_final, w_final

Our approach for the Dynamic Window Approach (DWA) is that we first make a list of samples that fit inside the possible velocity limit (Vs) and reachable velocity and acceleration constraints (Vd). After which we

Questions

1. What are the advantages and disadvantages of your solutions?

Advantages:

1. By constantly calculating possible trajectories it is able to avoid dynamic and static obstacles.
2. By including the robot acceleration and deceleration constraints it ensures for a smooth navigation without abrupt movements.

Disadvantages:

1. DWA may get trapped in a local minima.
2. There is a high computational load in calculating the multiple trajectories in real-time

2. What are possible scenarios which can result in failures?

Like mentioned in question 1 DWA can get trapped in a local minima. We also encounter some problems when the robot is driving to a straight wall and can't decide with direction to take.

3. How would you prevent these scenarios from happening?

4. How are the local and global planner linked together?