完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Zeng, Yi-Chong | |
| dc.date.accessioned | 2011-04-01T00:16:10Z | |
| dc.date.accessioned | 2020-05-18T03:23:03Z | - |
| dc.date.available | 2011-04-01T00:16:10Z | |
| dc.date.available | 2020-05-18T03:23:03Z | - |
| dc.date.issued | 2011-04-01T00:16:10Z | |
| dc.date.submitted | 2009-11-28 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/30295 | - |
| dc.description.abstract | This paper presents a method to solve route planning problem in maze game and waste collection using Euler path transform, the core technique is mixed-integer linear programming (MILP). There are three issues are considered in the transformation, including, the direction of edge, the limited number of edge, and the user-defined starting and ending vertices. The experiment results show that the proposed method is capable of finding the optimal result for route planning. | |
| dc.description.sponsorship | National Taipei University,Taipei | |
| dc.format.extent | 8p. | |
| dc.relation.ispartofseries | NCS 2009 | |
| dc.subject | Euler path | |
| dc.subject | route planning | |
| dc.subject | mixed-integer linear programming | |
| dc.subject.other | Workshop on Image Processing, Computer Graphics, and Multimedia Technologies | |
| dc.title | Solving Route Planning Using Euler Path Transform | |
| 分類: | 2009年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ICM 8-4.pdf | 549.9 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。