| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2018: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2017: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2016: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2015: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Outline of Final Research Achievements |
This research focusses on the development of efficient algorithms for computing a shortest route that visits a set of geometric objects, in a given or computed order. For the watchman route problem for lines and the traveling salesman problem for rays, we presented O(n exp(6)) and O(n exp(5)) time solutions respectively, improving upon the known results. For the problem of touring a sequence of convex polygons, we developed a simplified version of the so-called last step shortest path maps, which can be used to give new and efficient solutions. For the on-line watchman route and related problems, we gave new on-line strategies, whose competitive factors are far smaller than the known ones. Finally, we also presented efficient algorithms for the coppers and robbers game on a plane graph.
|
