CourseWare Wiki
Switch Term
Winter 2020 / 2021
Winter 2019 / 2020
Winter 2018 / 2019
Older
Search
Log In
b191
courses
b4m36uir
hw
t2b-dtspn
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/22 19:56 pragrmi1
2019/11/22 13:16 pragrmi1
2019/11/08 14:29 pragrmi1
2019/09/22 19:36 faiglj
2019/09/22 18:57 pragrmi1
2019/09/22 18:56 pragrmi1
2019/09/22 05:23 faiglj [T2a-dtspn - Data collection path planning with curvature-constrained trajectory - Dubins TSP with Neighborhoods (DTSPN) - decoupled approach]
2019/09/22 05:23 faiglj created
Go
2019/11/22 19:56 pragrmi1
2019/11/22 13:16 pragrmi1
2019/11/08 14:29 pragrmi1
2019/09/22 19:36 faiglj
2019/09/22 18:57 pragrmi1
2019/09/22 18:56 pragrmi1
2019/09/22 05:23 faiglj [T2a-dtspn - Data collection path planning with curvature-constrained trajectory - Dubins TSP with Neighborhoods (DTSPN) - decoupled approach]
2019/09/22 05:23 faiglj created
Go
Last revision
Both sides next revision
courses:b4m36uir:hw:t2b-dtspn [2019/11/08 14:29]
pragrmi1
courses:b4m36uir:hw:t2b-dtspn [2019/11/22 13:16]
pragrmi1
Line 3:
Line 3:
The main task is to implement two approaches solving the curvature-constrained Traveling Salesman Problem with neighborhoods.
The main task is to implement two approaches solving the curvature-constrained Traveling Salesman Problem with neighborhoods.
-
|**Deadline** | November
23rd
, 2019, 23:59 PST |
+
|**Deadline** | November
30th
, 2019, 23:59 PST |
|**Points** | 5 |
|**Points** | 5 |
|**Label in BRUTE** | T2b-dtspn |
|**Label in BRUTE** | T2b-dtspn |
courses/b4m36uir/hw/t2b-dtspn.txt
· Last modified: 2019/11/22 19:56 by
pragrmi1