-
Notifications
You must be signed in to change notification settings - Fork 10
Challenge 7: Calculate velocities towards path traversing
Go to your repository, return in master
branch and create a new one:
git checkout master
cd ~/catkin_ws/src/autonomous_systems_architectures/
git checkout -b challenge_7
Go to the autonomous_exploration/config/autonomous_explo.yaml
and change these:
calculate_target: True
velocities_architecture: 'motor_schema'
The task is to fill the velocitiesToNextSubtarget
function located here using the robot pose (x,y,theta) and the pose of the next subtarget (x,y). Obviously basic mathematics and trigonometry is required. The robot must constantly produce velocities for the next subtarget, except the final target has been reached.
Hints for coding assistance:
Also fill the produceSpeedsMotorSchema
here and assign the final velocities equal to [l_goal, a_goal] (the velocities produced by the velocitiesToNextSubtarget
function).
The robot must follow the produced path as faithfully as possible. You will check this in rviz.
10 out of 100
- Installation / setup
- Modules description
- How to execute the code
- Challenge 1 [15 pts]: Obstacle avoidance using the sonars sensors
- Challenge 2 [15 pts]: Obstacle avoidance using the laser sensor
- Challenge 3 [10 pts]: Obstacle avoidance using sonar and laser sensors via a subsumption architecture
- Challenge 4 [10 pts]: Obstacle avoidance using sonar and laser sensors via a motor schema architecture
- Challenge 5 [5 pts]: Publish the robot path
- Challenge 6 [10 pts]: Update the coverage field
- Challenge 7 [15 pts]: Calculate velocities towards path traversing
- Challenge 8 [10 pts]: Calculate velocities towards path traversing, including the sonars and the laser measurements via a subsumption architecture
- Challenge 9 [10 pts]: Calculate velocities towards path traversing, including the sonars and the laser measurements via a motor schema architecture
- Challenge 10 [5 pts]: Improve the subgoal visitation check
- Challenge 11 [10 pts]: Create a smart target selection technique
- Challenge 12 [10 pts]: Improve the A* algorithm's efficiency
- Challenge 13 [up to 25 pts]: Surprise us!