CourseWare Wiki
Switch Term
Winter 2020 / 2021
Winter 2019 / 2020
Winter 2018 / 2019
Older
Search
Log In
b191
courses
b4m36uir
labs
lab07
Warning
This page is located in archive. Go to the latest version of this
course pages
.
Differences
This shows you the differences between two versions of the page.
View differences:
Side by Side
Inline
Go
Link to this comparison view
Both sides previous revision
Previous revision
2019/11/10 23:28 pragrmi1
2019/11/10 23:27 pragrmi1
2019/11/10 23:22 pragrmi1
2019/11/10 23:22 pragrmi1
2019/09/22 19:14 pragrmi1
2019/09/20 22:28 pragrmi1
2019/09/19 13:31 external edit
Go
Next revision
Previous revision
2019/11/10 23:28 pragrmi1
2019/11/10 23:27 pragrmi1
2019/11/10 23:22 pragrmi1
2019/11/10 23:22 pragrmi1
2019/09/22 19:14 pragrmi1
2019/09/20 22:28 pragrmi1
2019/09/19 13:31 external edit
Go
Last revision
Both sides next revision
courses:b4m36uir:labs:lab07 [2019/11/10 23:22]
pragrmi1
courses:b4m36uir:labs:lab07 [2019/11/10 23:27]
pragrmi1
Line 1:
Line 1:
-
======
Lab06
- Dubins Traveling Salesman Problem with Neighborhoods - Decoupled Approach ======
+
======
Lab07
- Dubins Traveling Salesman Problem with Neighborhoods - Decoupled Approach ======
^ Motivations and Goals ^
^ Motivations and Goals ^
Line 6:
Line 6:
| Become familiar with its decoupled solution |
| Become familiar with its decoupled solution |
^ Tasks ([[courses:b4m36uir:internal:instructions:lab07|teacher]]) ^
^ Tasks ([[courses:b4m36uir:internal:instructions:lab07|teacher]]) ^
-
| [[courses:b4m36uir:hw:
t2a
-
tspn
|
T2a
-
tspn
]] **(5 Points)** Implement the decoupled solution for DTSPN |
+
| [[courses:b4m36uir:hw:
t2b
-
dtspn
|
T2b
-
dtspn
]] **(5 Points)** Implement the decoupled solution for DTSPN |
^ Lab resources ^
^ Lab resources ^
| {{ :courses:b4m36uir:hw:uir-t2b-dtspn.zip |T2b-dtspn resource package}} |
| {{ :courses:b4m36uir:hw:uir-t2b-dtspn.zip |T2b-dtspn resource package}} |
Line 13:
Line 13:
\\
\\
-
===
Solving TSPN with Self-organizing Map
===
+
====
Dubins Maneuver
==
==
+
[[https://cw.fel.cvut.cz/wiki/_media/courses/b4m36uir/lectures/b4m36uir-lec06-slides.pdf|Lecture 06]]
-
Slide 15 from the [[https://cw.fel.cvut.cz/wiki/_media/courses/b4m36uir/lectures/b4m36uir-lec05-slides.pdf|Lecture 05]]:
+
\\
-
+
-
{{:courses:b4m36uir:labs:som.png?700|}}
+
-
+
-
Utilize 'alternate goal' concept for solving TSP with neighborhoods (TSPN). In each epoch, the neurons are adapted towards the goals which inhibits them. But, in the TSPN, the neurons are adapted to the closes point in the specific goal neighborhood. Therefore, this concept enables to find shorter solutions, see the right image and the following GIF with SOM evolution.
+
-
+
-
{{:courses:b4m36uir:labs:som_tspn_orig.png?400|}}
+
-
{{:courses:b4m36uir:labs:som_tspn.png?400|}}
+
-
Click on the following image to see the SOM evolution
in
GIF
.
+
==== Decoupled Approach ====
+
Slide 36
in
[[https://cw
.
fel.cvut.cz/wiki/_media/courses/b4m36uir/lectures/b4m36uir-lec06-slides.pdf|Lecture 06]]
-
{{:courses:b4m36uir:labs:myimage
.
gif?300|}}
+
The decoupled approach comprises the following basic steps
+
- Estimate sequence of visits by Euclidean TSP connecting centers of the regions.
+
- For each region, sample boundary points and heading angles.
+
- Find the shortest feasible tour comprising Dubins maneuvers connecting the regions, where the sequence of visits is estimated from the ETSP
.
courses/b4m36uir/labs/lab07.txt
· Last modified: 2019/11/10 23:28 by
pragrmi1