Mobile Robot Control 2023 Group 16: Difference between revisions
Tag: 2017 source edit |
Tag: 2017 source edit |
||
Line 28: | Line 28: | ||
===Navigation assignment 1=== | ===Navigation assignment 1=== | ||
To make the A* | To make the A* algorithm more efficient, the amount of nodes should be reduced. This means that only nodes where the route change direction or where a path ends are considered. This is on the corners, T-junction and cross roads. | ||
This would be more efficient, since the nodes in-between do not have to be considered by the A* algorithm. This increases computation speed. | |||
[[File:Maze group16.jpeg|thumb|Fig 1: more efficient Maze map]] | [[File:Maze group16.jpeg|thumb|Fig 1: more efficient Maze map]] |
Revision as of 16:42, 8 May 2023
Group members:
Name | student ID |
---|---|
Marijn van Noije | 1436546 |
Tim van Meijel | 1415352 |
Practical exercise week 1
1. On the robot-laptop open rviz. Observe the laser data. How much noise is there on the laser? What objects can be seen by the laser? Which objects cannot? How do your own legs look like to the robot.
When opening rviz, noise is present on the laser. The noise is evidenced by small fluctuations in the position of the laser points. Objects located at laser height are visible. For example, when there is a small cube in front of the robot that is below the laser height, it is not observed. When we walk in front of the laser, our own legs look like two lines formed by laser points.
2. Go to your folder on the robot and pull your software.
Executed during practical session.
3. Take your example of dont crash and test it on the robot. Does it work like in simulation?
Executed during practical session. The code of dont crash worked immediately on the real robot.
4. Take a video of the working robot and post it on your wiki.
Link to video: https://youtu.be/4mXdJyXXidE
To make the A* algorithm more efficient, the amount of nodes should be reduced. This means that only nodes where the route change direction or where a path ends are considered. This is on the corners, T-junction and cross roads.
This would be more efficient, since the nodes in-between do not have to be considered by the A* algorithm. This increases computation speed.