This paper describes a simple route finding system that is not specific to any particular road map and is platform independent. The main features of the system are an easy-to-use graphical user interface and quick response times for finding optimal or near optimal routes. The system can be run on a desktop computer from home or the office, accessed through the internet, or even run on a palmtop computer sitting in a car. To speed up the process of finding an optimal or near optimal route, we evaluated a number of heuristic search strategies. It turned out that heuristic search can give substantial efficiency improvements and that inadmissible heuristics can be appropriate if non-optimal solutions are permitted. Furthermore, it turned out that incorporating heuristic knowledge about commonly used intersections, through subgoal search, can dramatically increase search performance.
CITATION STYLE
Guesgen, H. W., & Mitra, D. (1999). A multiple-platform decentralized route finding system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1611, pp. 707–713). Springer Verlag. https://doi.org/10.1007/978-3-540-48765-4_75
Mendeley helps you to discover research relevant for your work.