Data processing: vehicles – navigation – and relative location – Navigation – Employing position determining equipment
Reexamination Certificate
2005-05-03
2005-05-03
Nguyen, Tan Q. (Department: 3661)
Data processing: vehicles, navigation, and relative location
Navigation
Employing position determining equipment
C701S210000, C701S212000, C340S995120, C340S995150
Reexamination Certificate
active
06889138
ABSTRACT:
PDA systems, devices and methods are provided for improved navigational route planning. The PDA provides more understandable, accurate and timely information for negotiating a decision point along a route. The PDA includes a processor operable to communicate with a memory. The memory has cartographic data and a route to a desired destination stored therein. The cartographic data includes data indicative of thoroughfares of a plurality of types. A display is provided which is adapted to communicate with the processor and the memory and which is capable of displaying the cartographic data. The PDA processes travel along the route. The PDA recognizes when the device is approaching a decision point in the route and provides to the display an overlay screen on top of any presently displayed screen, the overlay screen adapted to display a preview of a decision point.
REFERENCES:
patent: 5371497 (1994-12-01), Nimura et al.
patent: 5528248 (1996-06-01), Steiner et al.
patent: 5537323 (1996-07-01), Schulte
patent: 5638279 (1997-06-01), Kishi et al.
patent: 5739772 (1998-04-01), Nanba et al.
patent: 5874905 (1999-02-01), Nanba et al.
patent: 5938721 (1999-08-01), Dussell et al.
patent: 6121900 (2000-09-01), Takishita
patent: 6199013 (2001-03-01), O'Shea
patent: 6202026 (2001-03-01), Nimura et al.
patent: 6266612 (2001-07-01), Dussell 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.
patent: 6411899 (2002-06-01), Dussell 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”,Artifical Intelligence, A Modern Approach, Prentice Hall, Inc., pp. 92-115, (1995).
“Real-Time Vehicle Routing in Dynamic and Stochastic Urban Traffic Networks”, http://www.gpu.srv.ualberta.ca/lfu/research.htm, pp. 1-3, (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).
Cung, 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 12th National 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 Structure 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. 1-10, (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/gimda/journal/vll.1/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).
Laporte, G., “The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms”,European Journal of Operational Research, 59, (1992),pp. 345-358.
Myers, B., “Data Structures for Best-First Search”, http://www.4.ncsu.edu/jbmyers/dsai.htm, (1997), pp. 1-6.
Ronngren, R., et al., “Parallel and Sequential Priority Queue Algorithms”,ACM Transactions on Modeling and Computer Simulation, (1997),pp. 168-172, 198, 199.
Stout, B., “Smart Moves: Intelligent Pathfinding”,Gamasutrahttp://gamasutra.com/features/prgramming/080197/pathfinding.htm, (1997),pp. 1-11.
Wai, Leong.H., et al., “Comparative Study of Shortest Path Algorithm for Transport Network”,USRP Report 2, (1999),pp. 1-10.
Zhan, F., “Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures”,Journal of Geographic Information and Decision Analysis, (1997),11 pages.
Zhao, Y., “An Adaptive Route-Guidance Algorithm for Intelligent Vehicle Highway Systems”,American Control Conference, Boston, MA,(1991),pp. 2568-2573.
Krull Jay Dee
Runquist Shane R.
Tompkins Mark D.
Garmin Ltd.
Nguyen Tan Q.
Rolf Devon A.
LandOfFree
PDA system, method and device with automatic next turn page does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with PDA system, method and device with automatic next turn page, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and PDA system, method and device with automatic next turn page will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3423636