A New Shortest Path Algorithm Generalized on Dynamic Graph for Commercial Intelligent Navigation for Transportation Management
share
Dynamic graph research is an essential subject in Computer Science. The shortest path problem is still the central in this field; moreover there is a variety of applications in practical projects. In this paper, we select the transportation activity as a paradigm to study. Of course there exists the most clear and appealing practical application over the intelligent navigation, also which is an important part in intelligent transportation system (ITS). Totally speaking, this activity is fairly simple and well-behavior under our consideration, for which, there is a lot of sophisticated theories and techniques to motivate our researches although this problem relates to interdisciplinary; so that we can be dedicated to computing aspect. Below, a host of practical problems will by the way be discussed in theory and empiricism including correctness, sampling, accuracy, compatibility, quick query and the application into other research; therein some have been scarcely argued intentionally or not in literatures before. Through these contents, we are able to have a smart system built which easy to incorporate other modules to realize a sophisticated industrial system.
READ FULL TEXT
