See this document in CiteSeerX!

Path-Planning Algorithms for Public Transportation Systems (2001)  (Make Corrections)  (2 citations)
Chao-Lin Liu, Tun-Wen Pai, Chun-Tien Chang, Chang-Ming Hsieh



  Home/Search   Context   Related

 
View or download:
nccu.edu.tw/~chaolin/paper...itsc01.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  nccu.edu.tw/~chaol...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Computing travel plans for desired trips in public transportation systems is not exactly the same as finding a shortest driving path in a given area. Path planning in the context of public transportation systems must consider the route constraint that public vehicles serve on particular paths and that passengers cannot order the drivers to change the bus routes. Explicit representation of the route constraint helps us to design efficient algorithms that focus on viable routes for computing... (Update)

Similar documents based on text:   More   All
0.6:   ITS Deployment Guidance for Transit Systems Executive Edition - Prepared For Department   (Correct)
0.6:   Institutional and Policy Issues in Adopting Advanced.. - Final Report September   (Correct)
0.6:   Application of Advanced Transportation Technology Within.. - Prepared By The   (Correct)

Related documents from co-citation:   More   All
2:   Using stochastic-dominance relationships for bounding travel times in stochastic.. - Liu, Wellman - 1999
2:   Hierarchical encoded path views for path query processing: An optimal model and .. - Jing, Huang et al. - 1998
2:   Artificial Intelligence: A modern approach (context) - Russell, Norvig - 1995

BibTeX entry:   (Update)

C.-L. Liu, T.-W. Pai, C.-T. Chang, and C.-M. Hsieh. Path-planning algorithms for public transportation systems. In Proceedings of the Fourth International IEEE Conference on Intelligent Transportation Systems, 1061--1066, 2001. http://citeseer.ist.psu.edu/liu01pathplanning.html   More

@misc{ liu01pathplanning,
  author = "C. Liu and T. Pai and C. Chang and C. Hsieh",
  title = "Path-planning algorithms for public transportation systems",
  text = "C.-L. Liu, T.-W. Pai, C.-T. Chang, and C.-M. Hsieh. Path-planning algorithms
    for public transportation systems. In Proceedings of the Fourth International
    IEEE Conference on Intelligent Transportation Systems, 1061--1066, 2001.",
  year = "2001",
  url = "citeseer.ist.psu.edu/liu01pathplanning.html" }
Citations (may not include all citations):
370   Network Flows: Theory (context) - Ahuja, Magnanti et al. - 1993
250   Artificial Intelligence: A Modern Approach (context) - Russell, Norvig - 1995
13   Path planning under timedependent uncertainty - Wellman, Ford et al. - 1995
11   Fastest paths in time-dependent networks for intelligent veh.. (context) - Kaufman, Smith - 1993
9   Hierarchical encoded path views for path query processing: A.. - Jing, Huang et al. - 1998
5   Using stochastic-dominance relationships for bounding travel.. - Liu, Wellman - 1999
3   Optimal factory scheduling using stochastic dominance - Wurman, Wellman - 1996
2   IRIS: Integrated route information service for multimodal pu.. (context) - Liu, Pai et al. - 2000
2   Service management systems for public transport--the German .. (context) - Elkins - 1993
2   An advanced public transportation systems application: Feasi.. (context) - Bae - 1995
2   Public transportation priority system using optical bus dete.. (context) - Koga - 1999

Documents on the same site (http://www.cs.nccu.edu.tw/~chaolin/nested/publications.html):   More
State-Space Abstraction for Anytime Evaluation of.. - Wellman, Liu (1994)   (Correct)
Using Qualitative Relationships for Bounding Probability.. - Liu, Wellman (1998)   (Correct)
Using Stochastic-Dominance Relationships for Bounding Travel.. - Liu, Wellman (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC