Mobile Robot Control 2023 Group 4: Difference between revisions
Jump to navigation
Jump to search
(Added Video link for exercise 1) |
No edit summary |
||
| Line 13: | Line 13: | ||
|} | |} | ||
=== Exercise 1 Video link: === | ===Exercise 1 Video link:=== | ||
https://drive.google.com/file/d/1zgMMQwU3ZrADZJuFCLglQiefVecF3_95/view?usp=sharing | https://drive.google.com/file/d/1zgMMQwU3ZrADZJuFCLglQiefVecF3_95/view?usp=sharing | ||
<br /> | |||
===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) | |||
https://drive.google.com/file/d/1gs1zY2n_CzXNi-n-qDaOphr56CVLH2zs/view?usp=share_link | |||
<br /> | |||
Revision as of 16:02, 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 neighbour can be removed. Since the speed of the algorithm is O(m x n)
https://drive.google.com/file/d/1gs1zY2n_CzXNi-n-qDaOphr56CVLH2zs/view?usp=share_link