Data processing: vehicles – navigation – and relative location – Navigation – Employing position determining equipment
Reexamination Certificate
2005-05-24
2005-05-24
Beaulieu, Yonel (Department: 3661)
Data processing: vehicles, navigation, and relative location
Navigation
Employing position determining equipment
C701S213000
Reexamination Certificate
active
06898520
ABSTRACT:
Systems, devices and methods are provided for more efficient use of RAM and other resources in connection with a route calculation algorithm which quickly obtains a best or reasonable best path between two locations. The navigational aid device includes forced layer switching capabilities. The navigational aid device includes a processor and a memory adapted to communicate with the processor. The memory has cartographic data including any number of locations and data indicative of thoroughfares of a plurality of types connecting certain ones of the locations. The plurality of thoroughfares are organized in a hierarchy of detail levels. The processor operates on a route calculation algorithm to find a path between any two of the number of locations and the route calculation algorithm dynamically forces switching between different levels in the hierarchy of detail levels based on a set of criteria.
REFERENCES:
patent: 5978730 (1999-11-01), Poppen et al.
patent: 6073076 (2000-06-01), Crowley et al.
patent: 6128515 (2000-10-01), Kabler et al.
patent: 6317684 (2001-11-01), Roeseler et al.
patent: 6317687 (2001-11-01), Morimoto et al.
patent: 6321158 (2001-11-01), DeLorme et al.
“An optimal pathfinder for vehicles in real-world digital terrain maps”, http://www.nease.net/jamsoft/shortestpath/pathfinder/4.html, 11 pages, (1999).
“Informed Search Methods”,Artificial Intelligence, A Modern Approach, Prentice Hall, Inc., pp. 920115, (1995).
“Real-Time Vehicle Routing in Dynamic and Stochastic Urban Traffic Networks”, http://www.gpu.srv.ualberta.ca/,lfu/research.htm, pp. 103, (1997).
Ahuja, R., et al., “Faster Algorithms for the Shortest Path Problem”,Journal of the Association for Computing Machinery, 37(2) pp. 213-223, (1990).
Chung, V. et al., “An Efficient Implementation of Parallel A *”,CFPAR, Montreal, Canada, pp. 153-167, (1994).
Fredman, M., et al., “Fibonacci heaps and their uses in improved network optimization algorithms”,Journal of the ACM, 34(3), 2 pages, (1987).
Fu, L., “Heuristic Shortest Path Algorithms and their Potential IVHS Applications”,Proceedings of the Fourth University of Alberta—University of Calgary, Joint Graduate Student Symposium in Transportation Engineering, pp. 83-109, (1995).
Ikeda, T., et al., “A Fast Algorithm for Finding Better Routes by AI Search Techniques”,Vehicle Navigation and Information Systems Conference Proceedings, pp. 291-296, (1994).
Kaindl, H. et al., “Memory-Bounded Bidirectional Search”,Proceedings of the 12thNational Conference on Art, AAAI Press, Seattle, WA, pp. 1359-1364, (1994).
Laporte, G., “The Vehicle Routing Problem: An overview of exact and approximate algorithms”,European Journal of Operational Research, 59, pp. 345-358, (1992).
Myers, B., “Data Structures for Best-First Search”, http://www4.ncsu.edu/jbmyers/dsai.htm, pp. 1-6, (1997).
Ronngren, R., et al., “Parallel and Sequential Priority Queue Algorithms”,ACM Transactions on Modeling and Computer Simulation, 7(2), pp. 168-172, 198, 199, (1997).
Stout, B., “Smart Moves: Intelligent Pathfinding”,Gamasutra, http://www.gamasutra.com/features/programming/080197/pathfinding.htm, pp. 1-11, (1997).
Wai, L., et al., “Comparative Study of Shortest Path Algorithm for Transport Network”,USRP Report 2, http://www/comp.nus.edu.sg/.leonghoe/USRPreport-txt.html, pp. 1010, (1999).
Zhan, F.B., “Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures”,Journal of Geographic Information and Decision Analysis, 1(1), http://www.geog.uwo.ca/qimda/journal/vol1.1/Zhan/Zhan.htm, 11 pages, (1997).
Zhao, Y., et al., “An Adaptive Route-Guidance Algorithm for Intelligent Vehicle Highway Systems”,American Control Conference, Boston, MA, Department of Electrical Engineering and Computer Science, The University of Michigan, pp. 2568-2573, (1991).
Beesley Darin J.
Childs Michael
Kao Min H.
Garmin Ltd.
Rolf Devon A.
LandOfFree
Systems and methods for a navigational device with forced... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Systems and methods for a navigational device with forced..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and methods for a navigational device with forced... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3422955