1. NCCU Academic Hub
  2. 學術產出
  3. College of Informatics
  4. Periodical Articles
  5. Item

學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Methods for path and service planning under route constraints
作者 劉昭麟
Liu,Chao-Lin;Pai,Tun-Wen
貢獻者 資科系
日期 2006-01
上傳時間 11-Sep-2014 10:44:45 (UTC+8)
摘要 We examine methods for a special class of path-planning problems in which the routes are constrained. The scenario could happen, for instance, in transit systems where passengers cannot order drivers to change the routes of public buses to meet individual travel needs. General search algorithms are applicable to this class of problems, but may not find the desired solution as efficiently as possible. This paper reports three different strategies that capture the route constraints for improving efficiency of path planning algorithms. The first strategy applies hierarchical planning, and the rest employs matrices for encoding route constraints. We propose and prove that the Q matrix is instrumental for capturing route constraints and measuring quality of service of the transportation network. Moreover, we discuss how we may apply the Q matrix in designing admissible heuristic functions that are crucial for applying the A* algorithm for best-path planning under route constraints.
關聯 Int. J. of Computer Applications in Technology,25(1),40-49
資料類型 article
DOI http://dx.doi.org/10.1504/IJCAT.2006.008668
dc.contributor 資科系en_US
dc.creator (作者) 劉昭麟zh_TW
dc.creator (作者) Liu,Chao-Lin;Pai,Tun-Wenen_US
dc.date (日期) 2006-01en_US
dc.date.accessioned 11-Sep-2014 10:44:45 (UTC+8)-
dc.date.available 11-Sep-2014 10:44:45 (UTC+8)-
dc.date.issued (上傳時間) 11-Sep-2014 10:44:45 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/69782-
dc.description.abstract (摘要) We examine methods for a special class of path-planning problems in which the routes are constrained. The scenario could happen, for instance, in transit systems where passengers cannot order drivers to change the routes of public buses to meet individual travel needs. General search algorithms are applicable to this class of problems, but may not find the desired solution as efficiently as possible. This paper reports three different strategies that capture the route constraints for improving efficiency of path planning algorithms. The first strategy applies hierarchical planning, and the rest employs matrices for encoding route constraints. We propose and prove that the Q matrix is instrumental for capturing route constraints and measuring quality of service of the transportation network. Moreover, we discuss how we may apply the Q matrix in designing admissible heuristic functions that are crucial for applying the A* algorithm for best-path planning under route constraints.en_US
dc.format.extent 123 bytes-
dc.format.mimetype text/html-
dc.language.iso en_US-
dc.relation (關聯) Int. J. of Computer Applications in Technology,25(1),40-49en_US
dc.title (題名) Methods for path and service planning under route constraintsen_US
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1504/IJCAT.2006.008668en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1504/IJCAT.2006.008668en_US