Mobile Robot Control 2023 Group 4: Difference between revisions

From Control Systems Technology Group
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 neighbour can be removed. Since the speed of the algorithm is O(m x n)
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.
 
https://drive.google.com/file/d/1gs1zY2n_CzXNi-n-qDaOphr56CVLH2zs/view?usp=share_link


<br />
<br />

Revision as of 15:08, 9 May 2023

New grid optimized.png

Group members:

Group 04
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.