B-8-43 Research on Parallel Bidirectional A* Algorithm in Road Networks

スポンサーリンク

概要

• 論文の詳細を見る

• To lock road map (Map-Matching) guidance with positioning devices to provide drivers the journey from the beginning to the destination reference line, so-called the shortest path algorithm, can be said the most well-known navigation system issues. This study attempts to define the mathematical model of the bidirectional A* algorithm for several steps to calculate the quickest ETA (Estimated Time of Arrival) when best meet points had been found by useful factors. Also, it try to offer the best route according to the Convergence Parallel Bidirectional A* heuristic algorithm and figure out the better decision points to meet.

• 2012-03-06

著者

• Tsai Chia-sheng

  Department Of Computer Science And Engineering Tatung University

• Lee Shu-heng

  Department Of Computer Science And Engineering Tatung University

関連論文

• B-5-7 Study of Packet Delivery for DSRC-Based Vehicle-to-Vehicle Communications
• B-8-25 Improvement of HARQ Using Stopping Sets of LDPC Codes in 802.16 Systems
• BS-12-1 An Enhanced Load Balancing Policy for Multimedia Networks Using SCTP
• B-8-27 Simply Biometric Verification and Parsing from Recording of Human Communications
• B-8-43 Research on Parallel Bidirectional A* Algorithm in Road Networks

スポンサーリンク