A Totally Astar-based Multi-path Algorithm for the Recognition of Reasonable Route Set in Vehicle Navigation Systems

Compared with a Dijkstra-based or partially Astar-based one, a totally Astar-based algorithm is proposed in the paper for vehicle navigation systems. It has a better performance such as computing speed and veracity in a large-scale road network than a Dijkstra-based one because the computational complexity of Astar algorithm has little connection with the overall scale of a road network. To recognize all the reasonable routes between a specific origin-detination (OD) pair, this algorithm takes all the geometrically reasonable routes into account and considers several constraints that meet the drivers’ preferences like circuitous route, the number of turning and traffic control strategy like no left turn as well. Two numerical examples demonstrate the operation and efficiency of the algorithm.

  • Supplemental Notes:
    • Abstract reprinted with permission from Intelligent Transportation Society of America.
  • Corporate Authors:

    ITS America

    1100 17th Street, NW, 12th Floor
    Washington, DC  United States  20036
  • Authors:
    • Yin, Wei
    • Yang, Xiaoguang
  • Conference:
  • Publication Date: 2012


  • English

Media Info

  • Media Type: Digital/other
  • Features: CD-ROM; Figures; References; Tables;
  • Pagination: 10p
  • Monograph Title: 19th ITS World Congress, Vienna, Austria, 22 to 26 October 2012

Subject/Index Terms

Filing Info

  • Accession Number: 01499047
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Nov 21 2013 9:14AM