Mobile Robot Control 2023 Group 4: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 21: | Line 21: | ||
===Exercise 2:=== | ===Exercise 2:=== | ||
The middle nodes in a straight line without more than one | The middle nodes in a straight line without more than one neighbor can be removed. Since the speed of the algorithm is O(n) with n the size of the grid, removing cells from the grid will improve the performance of the algorithm. | ||
<br /> | <br /> | ||
Revision as of 15:08, 9 May 2023
Group members:
| Name | student ID |
|---|---|
| Lowe Blom | 1266020 |
| Rainier Heijne | 1227575 |
| Tom Minten | 1372300 |
Exercise 1 Video link:
https://drive.google.com/file/d/1zgMMQwU3ZrADZJuFCLglQiefVecF3_95/view?usp=sharing
Exercise 2:
The middle nodes in a straight line without more than one neighbor can be removed. Since the speed of the algorithm is O(n) with n the size of the grid, removing cells from the grid will improve the performance of the algorithm.