TIME-CONSTRAINED HEURISTIC SEARCH FOR PRACTICAL ROUTE FINDING

In this paper, the authors present a heuristic search algorithm that can be applied to real-time route finding for automobile navigation systems. By using this algorithm, an accurate estimate for the finishing time of a search is obtained, and optimal solutions are achieved.

• Supplemental Notes:
  • Publication Date: November 1999
• Corporate Authors:

  Tokyo Daigaku

  ,    
• Authors:
  • Hiraishi, H
  • Ohwada, H
  • Mizoguchi, F
• Publication Date: 1999

Language

• Japanese

Media Info

• Pagination: p. 4021-4029
• Serial:
  • Joho Shori Gakkai ronbun shi = Transactions of the Information Processing Society of Japan. Vol. 40, no. 11
  • Publisher: Tokyo Daigaku

Subject/Index Terms

• TRT Terms: Automobile navigation systems; Computer algorithms; Routing

Filing Info

• Accession Number: 00793361
• Record Type: Publication
• Source Agency: UC Berkeley Transportation Library
• Files: PATH
• Created Date: Jun 13 2000 12:00AM