Systems, functional data, and methods to bias map matching

Details Systems, functional data, and methods to bias map matching Systems, functional data, and methods to bias map matching

2005-01-18

2005-01-18

Black, Thomas G. (Department: 3661)

Data processing: vehicles, navigation, and relative location

Navigation

Employing position determining equipment

C701S211000, C701S209000, C340S991000, C340S993000, C340S995190, C073S17800T

Reexamination Certificate

active

06845320

ABSTRACT:
Devices, systems, functional data and methods are provided for biasing an active location to an acceptable location within a planned route of a map. The navigational device with map biasing capabilities includes a processor communicating with a memory. In biasing a map, an active position and a planned position are received, and an active score and a planned score are associated with each position, respectively. The active position is checked to ensure it falls within a second range, and if it does the active score is made to fall within a first range associated with the planned score, such that the active position is biased to appear as if it were the planned position.

REFERENCES:
patent: 5422815 (1995-06-01), Hijikata
patent: 5442559 (1995-08-01), Kuwahara et al.
patent: 5528248 (1996-06-01), Steiner et al.
patent: 5659476 (1997-08-01), LeFebvre et al.
patent: 5938721 (1999-08-01), Dussell et al.
patent: 5948043 (1999-09-01), Mathis
patent: 6108603 (2000-08-01), Karunanidhi
patent: 6205398 (2001-03-01), Kobayashi et al.
patent: 6266612 (2001-07-01), Dussell et al.
patent: 6317684 (2001-11-01), Roeseler et al.
patent: 6317687 (2001-11-01), Morimoto
patent: 6321158 (2001-11-01), DeLorme et al.
patent: 6411899 (2002-06-01), Dussell et al.
patent: 6546335 (2003-04-01), Tompkins et al.
patent: 20010047242 (2001-11-01), Ohta
2001/0047242 Ohta -route searching device.*
“An optimal pathfinder for vehicles in real-world digital terrain maps”, http://www.nease.net/jamsoft/shortespath/pathfinder/4.html, (1999),11 pages.
“An optimal pathfinder for vehicles in real-world digital terrain maps”, http://www.nease.net/jamsoft/shortestpath/pathfinder/4.html, (1999),11 pages.
“Informed Search Methods”,Artificial Intelligence, A Modern Approach, Prentice Hall, Inc.,(1995),92-115.
“Informed Search MEthods”,Artifical Intelligence, A Modern Approach, Prentice Hall, Inc,(1995),pp. 92-115.
“Real-Time Vehicle Routing in Dynamic and Stochastic Urban Traffic Networks”, www.gpu.srv.ualberta.ca/lfu/research.htm, (1997),pp. 1-3.
“Real-Time Vehicle Routing in Dynamic and Stochastic Urban Traffic Networks”, http:www/gpu.srv.ualberta.ca/lfu/research.htm, (1997),1-3.
Ahuja, R..,“Faster Algorithms for the Shortest Path Problem”,Journal of the Association for Computing Machinery, 37(2), (1990),pp. 213-223.
Cung, V..,“An Efficient Implementation of Parallel A *”,CFPAR, Montreal, Canada,(1994),pp. 153-167.
Cung, V.., et al. ,“An Efficient Implementation of Parallel A*”,CFPAR, Montreal, Canada,(1994),pp. 153-167.
Fredman, M..,“Fibonacci heaps and their uses in improved network optimization algorithms”,Journal of ACM, (1987),2 pages.
Fu, L..,“Heuristic Shortest Path Algorithms and their Potential IVHS Applications”,Proceedings of the 4th University of Alberta—University of Calgary, Joint Graduate Student Symposium in Transportation Engineering, (1995),pp. 83-109.
Ikeda, T..,“A Fast Algorithm for Finding Better Routes by AI Search Techniques”,Vehicle Navigation and Information Systems Conference Proceedings, (1994),pp. 291-296.
Kaindl, H..,“Memory-Bounded Bidirectional Search”,Proceedings of the 12th National Conference on Art, AAAI Press, Seattle WA,(1994),pp. 1359-1364.
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.
Ronngren, R..,et al. ,“Parallel and Sequential Priority Queue Algorithms”,ACM Transactions on Modeling and Computer Simulation, 7(2), (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.
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,(1999),pp. 1-10.
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/vol1.1/Zhan/Zhan.htm,(1997),11 pages.
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.

Affiliated with

Also associated with

Rating

Systems, functional data, and methods to bias map matching 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, functional data, and methods to bias map matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems, functional data, and methods to bias map matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3416547