Optimal Path Algorithm Analysis of GPS Navigation Based on A* Algorithm

Ming Li Ding

doi:10.4028/www.scientific.net/AMM.484-485.982

Paper Titles

Remote Data Acquisition System Based on ARM-Linux
p.963

Research on Energy Decision System Based on Network Technology
p.967

Video Segmentation Based on Area Selection
p.972

Blind Estimation of Long Code DSSS Signal Based on Subspace Tracking
p.976

Optimal Path Algorithm Analysis of GPS Navigation Based on A* Algorithm
p.982

An Indirect Fingerprint Authentication Scheme in Cloud Computing
p.986

Human Face Recognition Based on the Core Characteristics under the Condition of Illumination
p.991

Study on Factors of College Student's Network Service Time Based on Bayesian Networks
p.996

Research on Recognition Method of Handwritten Numerals Segmentation Based on B-P Neural Network
p.1001

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 484-485Optimal Path Algorithm Analysis of GPS Navigation...

Optimal Path Algorithm Analysis of GPS Navigation Based on A* Algorithm

Abstract:

The optimal path algorithm analysis of GPS navigation in taxi management system based on A* algorithm was introduced in this paper. Through improving the traditional Dijkstra algorithm and avoiding problems such as time-consuming and low efficiency in Dijkstra algorithm with traversal search for each node, A* algorithm could help the taxi find the optimal path and bring convenience for traffic management.

You might also be interested in these eBooks

Green Power, Materials and Manufacturing Technology and Applications III

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 484-485)

Pages:

982-985

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.484-485.982

Citation:

Cite this paper

Online since:

January 2014

Authors:

Ming Li Ding

Keywords:

A* Algorithm, Dijkstra Algorithm, GPS Navigation, Optimal Path

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Wu W, Ruan Q Q. A gene-constrained genetic algorithmfor solving shortest path problem. Proceedings of the7th Inter-national Conference on Signal Processing . (2004).

DOI: 10.1109/icosp.2004.1442291

Google Scholar

[2] Gen M, Cheng R W, Wang D W. Genetic algorithms for solving shortest path problems. Proceedings of the1997IEEEInternational Conference on Evolutionary Computation . (1997).

DOI: 10.1109/icec.1997.592343

Google Scholar

[3] Richard Kimmel, Allen Bruckstein. Finding shortest paths on surfaces using level sets propagation. IEEE Transactions on Pattern Analysis and Machine Intelligence . (1995).

DOI: 10.1109/34.387512

Google Scholar

[4] Stout B. Smart Moves: Intelligent Path-finding. Game Developer Magazine . 1996 Donald Hearn. Computer Graphic. . (2005).

Google Scholar

[5] Kenneth Rosen. Discrete Mathematics and Its Application. . (2002).

Google Scholar

[6] Mark Weiss. Data Structures & Algorithm Analysis in C. . (2003).

Google Scholar

[7] Hart PE, Nilsson NJ, Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics . (1968).

DOI: 10.1109/tssc.1968.300136

Google Scholar