US 7,120,539 B2Grant
Navigation system, method and device with detour algorithm
Issue Date:2006-10-10
•10 Claims
•8 Drawing Sheets
Abstract
Systems, devices and methods are provided for an improved navigational route planning device which provides more understandable, accurate and timely route calculation capabilities. The navigational aid device with route calculation capabilities includes a processor connected to a memory. The memory includes cartographic data and a desired destination, the cartographic data including data indicative of thoroughfares of a plurality of types. A display is connected to the processor and is capable of displaying the cartographic data. The device is adapted to process the device=s location and travel along a planned route. And, the device is adapted to dynamically calculate a new route to the desired destination with a preference for avoiding a particular portion of a thoroughfare or one or more different thoroughfares in a previous route.
Metadata
Assignee
- Garmin Ltd.
Inventors
- Jay Dee Krull
- Michael Childs
- Shane R. Runquist
Application Information
Application Number:US 11/035,243
Filing Date:2005-01-13
Priority Date:2001-12-21
Art Unit:3661
Classifications
IPC:
G01C21/30
Patent Drawings (8 sheets)
Description
Cross-Reference to Related Applications
[0001] This application is a divisional and claims priority benefit of U.S. patent application Ser. No. 10/701,771, filed Nov. 5, 2003, which is a continuation and claimed priority benefit of U.S. patent application Ser. No. 10/028,343, filed Dec. 21, 2001, now U.S. Pat. No. 6,687,615. Thus, this application claims priority benefit of U.S. Pat. No. 6,687,615. Both of the above-identified applications are hereby incorporated by reference.
Field of the Invention
[0002] The present invention relates generally to navigational devices, and in particular to navigational devices with detour route calculation capabilities.
Background of the Invention
[0003] Route planning devices are well known in the field of navigational instruments. The method of route planning implemented by known prior art systems depends on the capabilities of system resources, such as processor speed and the amount and speed of memory. As increased system capability also increases system cost, the method of route planning implemented by a navigation device is a function of overall system cost.
[0004] One feature of increased system capability involves detour route calculation capabilities. Many conventional navigational devices simply do not incorporate a detour route calculation functionality in order to reduce system complexity and maintain a low overall system cost. Some of these devices may alert the user that they are off course when the user makes a detour, but they do not perform any course or route recalculation to accommodate for the intended or unintended detour in route. The intended or unintended detour can be for reasons such as thoroughfare conditions, thoroughfare congestion (e.g. rush hour or road construction), check point delays and the like. Some navigational devices include functionality which allows the device to calculate a new route based on an in route decision to avoid one or more thoroughfares, or sections, of a planned route. However, these devices require the user to point to, highlight, or draw a box around the segment which the user wants to avoid. That is, the decision to calculate a new route is not dynamically tied to the current route on which the user is traveling. Requiring the user to point to, highlight, or draw a box around the segment which the user wants to avoid is also distracting to do while the user is driving or trying to navigate the route.
[0005] In conventional navigational methods and devices the user may have to halt their journey in an attempt to decide upon a new route, or course, and must rely on traditional navigational methods, e.g. asking directions, following detour signs (in the case of a forced detour) or using a conventional map. In some devices, the user may still be able to see the previously planned route, but they will have to employ their own decision making to chart themselves around that portion of the previous route they want to avoid and yet still be headed toward a desired destination. This can be time consuming and provide frustration to a user who is likely unfamiliar with the routes surrounding their current location.
[0006] Clearly, in many cases halting travel to decide upon a new route is not a viable alternative. For example, when the user is traveling on an interstate it is entirely impossible to simply stop. The alternative of pulling off on the shoulder is undesirable and can be dangerous. Stopping travel is equally undesirable since doing so increases travel time and provides an added inconvenience to the user. In other instances, such as navigating downtown city streets, the traffic issues alone may prevent the user from stopping their vehicle to decide upon a new route. As mentioned above, even if the user has the ability to safely stop their vehicle, such as when traveling in a neighborhood, the inconvenience factor is present.
[0007] Another problem is that when a device is used to perform a new route calculation from a new position (off of the originally planned route) to a desired destination, the calculation is not going to take into account the reason for the intended or unintended detour. As a result, the new route calculation will often provide a route which includes travel on the thoroughfare from which the detour was taken. Thus, the new route does not provide any solution to the need for avoiding the thoroughfare from which the detour was taken. As the reader will appreciate the intended or unintended detour may be for reasons of traffic congestion, road construction, the type of thoroughfare, and the like.
[0008] In summary, current prior art systems have created a spectrum of products in which the degree of navigational accuracy is dictated primarily by the cost of the system. The lower cost systems currently offer a low degree of accuracy and functionality that is often inadequate for users. Therefore, there exists a need for a navigational route planning device which is more efficient and accurate than current low cost systems, without requiring more expensive system resources. In addition, there is also a need for a navigational route planning device which provides a user with more dynamic route calculation capabilities.
Summary of the Invention
[0009] The above mentioned problems with navigational devices, as well as other problems, are addressed by the present invention and will be understood by reading and studying the following specification. Systems and methods are provided for a navigational route planning device which is more user intuitive, efficient, timely, and accurate than current low cost systems, without requiring the more expensive system resources. The systems and methods of the present invention offer an improved navigational route planning device which provides a user with more dynamic route calculation capabilities.
[0010] In one embodiment of the present invention, an electronic navigational aid device with improved route calculation capabilities is provided. The navigational aid device includes a processor with a display connected to the processor. A memory is connected to the processor as well. The memory includes cartographic data and a route to a desired destination stored therein. The cartographic data includes data indicative of thoroughfares of a plurality of types. The device processes travel along the route. The device is capable of selecting a detour around one or more portions of a thoroughfare, a group of thoroughfares, or one or more sections in a network of thoroughfares. The device calculates a new route to navigate to the desired destination. In order to calculate the new route, the device performs a route cost analysis.
[0011] These and other embodiments, aspects, advantages, and features of the present invention will be set forth in part in the description which follows, and in part will become apparent to those skilled in the art by reference to the following description of the invention and referenced drawings or by practice of the invention. The aspects, advantages, and features of the invention are realized and attained by means of the instrumentalities, procedures, and combinations particularly pointed out in the appended claims.
Brief Description of the Drawings
[0012] FIG. 1 is a representative view of a Global Positioning System (GPS);
[0013] FIGS. 2A and 2B illustrate views for one embodiment of an electronic navigational device according to the teachings of the present invention;
[0014] FIGS. 3A–3C illustrate views for another embodiment of an electronic navigational device according to the teachings of the present invention;
[0015] FIG. 4A is a block diagram of one embodiment for the electronic components within the hardware of FIGS. 2A–2B according to the teachings of the present invention;
[0016] FIG. 4B is a block diagram of one embodiment for the electronic components within the hardware of FIGS. 3A—3C according to the teachings of the present invention;
[0017] FIG. 5 is a block diagram of a navigation system according to the teachings of the present invention;
[0018] FIG. 6 is a flow diagram of one embodiment of a navigation aid method according to the teachings of the present invention; and
[0019] FIG. 7 is a flow diagram of another embodiment of a navigation aid method according to the teachings of the present invention.
Detailed Description of the Invention
[0020] In the following detailed description of the invention, reference is made to the accompanying drawings which form a part hereof, and in which is shown, by way of illustration, specific embodiments in which the invention may be practiced. The embodiments are intended to describe aspects of the invention in sufficient detail to enable those skilled in the art to practice the invention. Other embodiments may be utilized and changes may be made without departing from the scope of the present invention. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present invention is defined only by the appended claims, along with the full scope of equivalents to which such claims are entitled.
[0021] The present invention is drawn to navigational systems and devices having route calculation capabilities. One type of navigational system includes Global Positioning Systems (GPS). Such systems are known and have a variety of uses. In general, GPS is a satellite-based radio navigation system capable of determining continuous position, velocity, time, and in some instances direction information for an unlimited number of users. Formally known as NAVSTAR, the GPS incorporates a plurality of satellites which orbit the earth in extremely precise orbits. Based on these precise orbits, GPS satellites can relay their location to any number of receiving units.
[0022] The GPS system is implemented when a device specially equipped to receive GPS data begins scanning radio frequencies for GPS satellite signals. Upon receiving a radio signal from a GPS satellite, the device can determine the precise location of that satellite via one of different conventional methods. The device will continue scanning for signals until it has acquired at least three different satellite signals. Implementing geometric triangulation, the receiver utilizes the three known positions to determine its own two-dimensional position relative to the satellites. Additionally, acquiring a fourth satellite signal will allow the receiving device to calculate its three-dimensional position by the same geometrical calculation. The positioning and velocity data can be updated in real time on a continuous basis by an unlimited number of users.
[0023] FIG. 1 is representative of a GPS denoted generally by reference numeral 100. A plurality of satellites 120 are in orbit about the Earth 124. The orbit of each satellite 120 is not necessarily synchronous with the orbits of other satellites 120 and, in fact, is likely asynchronous. A GPS receiver device 140 of the present invention is shown receiving spread spectrum GPS satellite signals 160 from the various satellites 120.
[0024] The spread spectrum signals 160 continuously transmitted from each satellite 120 utilize a highly accurate frequency standard accomplished with an extremely accurate atomic clock. Each satellite 120, as part of its data signal transmission 160, transmits a data stream indicative of that particular satellite 120. It will be appreciated by those skilled in the relevant art that the GPS receiver device 140 must acquire spread spectrum GPS satellite signals 160 from at least three satellites 120 for the GPS receiver device 140 to calculate its two-dimensional position by triangulation. Acquisition of an additional signal 160, resulting in signals 160 from a total of four satellites 120, permits GPS receiver device 140 to calculate its three-dimensional position.
[0025] FIGS. 2A and 2B illustrate views for one embodiment of an electronic navigational device 230 according to the teachings of the present invention. As one of ordinary skill in the art will understand upon reading this disclosure, the device can be portable and can be utilized in any number of implementations such as automobile, personal marine craft, and avionic navigation. In the embodiment of FIG. 2A a front view of the navigational device 230 is provided showing the navigational device has a generally rectangular housing 232. The housing 232 is constructed of resilient material and has been rounded for aesthetic and ergonomic purposes. As shown in FIG. 2A , the control face 234 has access slots for an input key pad 238, other individual keys 239, and a display screen 236. In one embodiment, the display screen 236 is a LCD display which is capable of displaying both text and graphical information. The invention, however, is not so limited. Audio information can likewise be provided in one embodiment.
[0026] In FIG. 2B , a side view of the navigational device 230 is provided. FIG. 2B illustrates that the device's housing 232 is defined by an outer front case 240 and a rear case 242. As shown in FIG. 2B , the outer front case 240 is defined by the control face 234. In the embodiment shown in FIG. 2B , the outer front case 240 and the rear case 242 are made of one molded piece to form the device housing 232 and support input key pad 238, other individual keys 239, and display screen 236 in respective access slots shown in the control face 234 of FIG. 2A .
[0027] FIGS. 3A–3C illustrate views for another embodiment of an electronic navigational device 310 according to the teachings of the present invention. The navigational device 310 shown in FIGS. 3A–3C includes a personal digital assistant (PDA) with integrated GPS receiver and cellular transceiver according to the teachings of the present invention. The GPS integrated PDA operates with an operating system (OS) such as, for example, the well-known Palm or Pocket PC operating systems, or the lesser-used Linux OS. As shown in the top view of FIG. 3A , the GPS integrated PDA 310 includes an internal integrated GPS patch antenna 314 and a cellular transceiver 316 contained in a housing 318. The housing 318 is generally rectangular with a low profile and has a front face 320 extending from a top end 322 to a bottom end 324. Mounted on front face 320 is a display screen 326, which is touch sensitive and responsive to a stylus 330 (shown stored in the side view of FIG. 3B ) or a finger touch. FIGS. 3A–3C illustrate the stylus 330 nested within housing 318 for storage and convenient access in a conventional manner. The embodiment shown in FIG. 3A illustrates a number of control buttons, or input keys 328 positioned toward the bottom end 324. The invention, however, is not so limited and one of ordinary skill in the art will appreciate that the input keys 328 can be positioned toward the top end 322 or at any other suitable location. The end view of FIG. 3C illustrates a map data cartridge bay slot 332 and headphone jack 334 provided at the top end 322 of the housing 318. Again, the invention is not so limited and one of ordinary skill in the art will appreciate that a map data cartridge bay slot 332 and headphone jack 334 can be provided at the bottom end 324, separately at opposite ends, or at any other suitable location.
[0028] It should be understood that the structure of GPS integrated PDA 310 is shown as illustrative of one type of integrated PDA navigation device. Other physical structures, such as a cellular telephone and a vehicle-mounted unit are contemplated within the scope of this invention.
[0029] FIGS. 2A–2B and 3A–3C are provided as illustrative examples of hardware components for a navigational device according to the teachings of the present invention. However, the invention is not limited to the configuration shown in FIGS. 2A–2B and 3A–3C. One of ordinary skill in the art will appreciate other suitable designs for a hardware device which can accommodate the present invention.
[0030] FIG. 4A is a block diagram of one embodiment for the electronic components within the hardware of FIGS. 2A–2B , such as within housing 232 and utilized by the electronic navigational device. In the embodiment shown in FIG. 4A , the electronic components include a processor 410 which is connected to an input 420, such as keypad via line 425. It will be understood that input 420 may alternatively be a microphone for receiving voice commands. Processor 410 communicates with memory 430 via line 435. Processor 410 also communicates with display screen 440 via line 445. An antenna/receiver 450, such as a GPS antenna/receiver is connected to processor 410 via line 455. It will be understood that the antenna and receiver, designated by reference numeral 450, are combined schematically for illustration, but that the antenna and receiver may be separately located components, and that the antenna may be a GPS patch antenna or a helical antenna. The electronic components further include I/O ports 470 connected to processor 410 via line 475.
[0031] FIG. 4B is a block diagram of one embodiment for the electronic components within the hardware of FIGS. 3A–3C and utilized by the GPS integrated PDA 310 according to the teachings of the present invention. The electronic components shown in FIG. 4B include a processor 436 which is connected to the GPS antenna 414 through GPS receiver 438 via line 441. The processor 436 interacts with an operating system (such as PalmOS; Pocket PC) that runs selected software depending on the intended use of the PDA 310. Processor 436 is coupled with memory 442 such as RAM via line 444, and power source 446 for powering the electronic components of PDA 310. The processor 436 communicates with touch sensitive display screen 426 via data line 448.
[0032] The electronic components further include two other input sources that are connected to the processor 436. Control buttons 428 are connected to processor 436 via line 451 and a map data cartridge 433 inserted into cartridge bay 432 is connected via line 452. A serial I/O port 454 is connected to the processor 436 via line 456. Cellular antenna 416 is connected to cellular transceiver 458, which is connected to the processor 436 via line 466. Processor 436 is connected to the speaker/headphone jack 434 via line 462. The PDA 310 may also include an infrared port (not shown) coupled to the processor 436 that may be used to beam information from one PDA to another.
[0033] As will be understood by one of ordinary skill in the art, the electronic components shown in FIGS. 4A and 4B are powered by a power source in a conventional manner. As will be understood by one of ordinary skill in the art, different configurations of the components shown in FIGS. 4A and 4B are considered within the scope of the present invention. For example, in one embodiment, the components shown in FIGS. 4A and 4B are in communication with one another via wireless connections and the like. Thus, the scope of the navigation device of the present invention includes a portable electronic navigational aid device.
[0034] Using the processing algorithms of the present invention, the device is capable of dynamically selecting a detour around one or more portions of a thoroughfare, a group of thoroughfares, or one or more sections in a network of thoroughfares. The device calculates a new route to navigate to the desired destination. In order to calculate the new route, the device performs a route cost analysis. The device then uses those electronic components to calculate a new route to navigate to the desired destination. According to the teachings of the present invention, the device incorporates these and other functions as will be explained in more detail below in connection with FIGS. 6 and 7 .
[0035] FIG. 5 is a block diagram of an embodiment of a navigation system which can be adapted to the teachings of the present invention. The navigation system includes a server 502. According to one embodiment, the server 502 includes a processor 504 operably coupled to memory 506, and further includes a transmitter 508 and a receiver 510 to send and receive data, communication, and/or other propagated signals. The transmitter 508 and receiver 510 are selected or designed according to the communication requirements and the communication technology used in the communication design for the navigation system. The functions of the transmitter 508 and the receiver 510 may be combined into a single transceiver.
[0036] The navigation system further includes a mass data storage 512 coupled to the server 502 via communication link 514. The mass data storage 512 contains a store of navigation data. One of ordinary skill in the art will understand, upon reading and comprehending this disclosure, that the mass data storage 512 can be separate device from the server 502 or can be incorporated into the server 502.
[0037] In one embodiment of the present invention, the navigation system further includes a navigation device 516 adapted to communicate with the server 502 through the communication channel 518. According to one embodiment, the navigation device 516 includes a processor and memory, as previously shown and described with respect to the block diagram of FIGS. 4A and 4B . Furthermore, the navigation device 516 includes a transmitter 520 and receiver 522 to send and receive communication signals through the communication channel 518. The transmitter 520 and receiver 522 are selected or designed according to the communication requirements and the communication technology used in the communication design for the navigation system. The functions of the transmitter 520 and receiver 522 may be combined into a single transceiver.
[0038] Software stored in the server memory 506 provides instructions for the processor 504 and allows the server 502 to provide services to the navigation device 516. One service provided by the server 502 involves processing requests from the navigation device 516 and transmitting navigation data from the mass data storage 512 to the navigation device 516. According to one embodiment, another service provided by the server 502 includes processing the navigation data using various algorithms for a desired application, and sending the results of these calculations to the navigation device 516.
[0039] The communication channel 518 is the propagating medium or path that connects the navigation device 516 and the server 502. According to one embodiment, both the server 502 and the navigation device 516 include a transmitter for transmitting data through the communication channel and a receiver for receiving data that has been transmitted through the communication channel.
[0040] The communication channel 518 is not limited to a particular communication technology. Additionally, the communication channel 518 is not limited to a single communication technology; that is, the channel 518 may include several communication links that use a variety of technology. For example, according to various embodiments, the communication channel is adapted to provide a path for electrical, optical, and/or electromagnetic communications. As such, the communication channel includes, but is not limited to, one or a combination of the following: electrical circuits, electrical conductors such as wires and coaxial cables, fiber optic cables, converters, radio-frequency (RF) waveguides, the atmosphere, and empty space. Furthermore, according to various embodiments, the communication channel includes intermediate devices such as routers, repeaters, buffers, transmitters, and receivers, for example.
[0041] In one embodiment, for example, the communication channel 518 includes telephone and computer networks. Furthermore, in various embodiments, the communication channel 518 is capable of accommodating wireless communication such as radio frequency, microwave frequency and infrared communication, and the like. Additionally, according to various embodiments, the communication channel 518 accommodates satellite communication.
[0042] The communication signals transmitted through the communication channel 518 include such signals as may be required or desired for a given communication technology. For example, the signals may be adapted to be used in cellular communication technology, such as time division multiple access (TDMA), frequency division multiple access (FDMA), code division multiple access (CDMA), global system for mobile communications (GSM), and the like. Both digital and analog signals may be transmitted through the communication channel 518. According to various embodiments, these signals are modulated, encrypted and/or compressed signals as may be desirable for the communication technology.
[0043] The mass data storage includes sufficient memory for the desired navigation application. Examples of mass data storage include magnetic data storage media such as hard drives, optical data storage media such as CD ROMs, charge storing data storage media such as Flash memory, and molecular memory, such as now known or hereinafter developed.
[0044] According to one embodiment of the navigation system, the 502 server includes a remote server accessed by the navigation device 516 through a wireless channel. According to other embodiments of the navigation system, the server 502 includes a network server located on a local area network (LAN), wide area network (WAN), a virtual private network (VPN) and server farms.
[0045] According to another embodiment of the navigation system, the server 502 includes a personal computer such as a desktop or laptop computer. In one embodiment, the communication channel 518 is a cable connected between the personal computer and the navigation device. According to one embodiment, the communication channel 518 is a wireless connection between the personal computer and the navigation device 516.
[0046] FIG. 5 presents yet another embodiment for a collective set of electronic components adapted to the present invention. As one of ordinary skill in the art will understand upon reading and comprehending this disclosure, the navigation system of FIG. 5 is adapted to the present invention in a manner distinguishable from that described and explained in detail in connection with FIGS. 4A and 4B .
[0047] That is, the navigational system 500 of FIG. 5 is likewise adapted to provide an electronic navigational aid device 516 with improved, dynamic route calculation capabilities. In this embodiment, the processor 504 in the server 502 is used to handle the bulk of the system's processing needs. The mass storage device 512 connected to the server can include volumes more cartographic and route data than that which is able to be maintained on the navigational device 516 itself. In this embodiment, the server 502 processes the majority of a device's travel along the route using a set of processing algorithms and the cartographic and route data stored in memory 512 and can operate on signals, e.g. GPS signals, originally received by the navigational device 516. Similar to the navigational device of FIGS. 4A and 4B , the navigation device 516 in system 500 is outfitted with a display 524 and GPS capabilities 526.
[0048] As described and explained in detail in connection with FIGS. 4A and 4B , the navigation system of FIG. 5 uses processing algorithms. In the invention, the device is capable of selecting a detour with a preference for avoiding one or more portions of a thoroughfare, a group of thoroughfares, or one or more sections in a network of thoroughfares. The device calculates a new route to navigate to the desired destination. In order to calculate the new route, the device performs a route cost analysis. The system uses the processing algorithms and the electronic components shown in FIG. 5 to calculate a new route for navigating the device 516 to the desired destination. As one of ordinary skill in the art will understand upon reading and comprehending this disclosure, a user of the navigation device 516 can be proximate to or accompanying the navigation device 516. The invention however, is not so limited.
[0049] According to the teachings of the present invention, the device is capable of selecting a detour around one or more portions of a thoroughfare, a group of thoroughfares, or one or more sections in a network of thoroughfares. The device calculates a new route to navigate to the desired destination. In order to calculate the new route, the device performs a route cost analysis. In one embodiment, based on the route cost analysis, the new route avoids the one or more portions of a thoroughfare, a group of thoroughfares, or one or more sections in a network of thoroughfares. In one embodiment, based on the route cost analysis, the new route at least partially avoids the one or more portions of a thoroughfare, a group of thoroughfares, or one or more sections in a network of thoroughfares. In still another embodiment, based on the route cost analysis, the new route does not avoid the one or more portions of a thoroughfare, a group of thoroughfares, or one or more sections in a network of thoroughfares. The navigation device 516 of the present invention includes a portable electronic navigational aid device. In one embodiment, the portable electronic navigational aid device includes a personal digital assistant (PDA). In one embodiment, the portable electronic navigational aid device includes a wireless communications device.
[0050] The features and functionality explained and described in detail above in connection with the device of FIGS. 4A and 4B are likewise available in the system 500 of FIG. 5 . That is, in one embodiment the navigation device 516 further provides audio and visual cues to aid the navigation along the route.
[0051] FIG. 6 is a flow diagram of one embodiment of a navigation aid method according to the teachings of the present invention. The navigation aid method includes a method for performing a route calculation within a navigation device or navigation system as described and explained in detail above in connection with FIGS. 4A , 4B, and 5. And, as described above, a processor is used for processing signals which include input data from input devices, e.g. keypads or other input keys, GPS signals from GPS components, and data received from I/O ports in order to perform the methods described herein. In the embodiment shown in FIG. 6 , the navigation aid method for performing a route calculation includes dynamically receiving data in block 610. In one embodiment, as shown in FIG. 6 , dynamically receiving data 610 includes dynamically receiving data relating to a portion of a particular thoroughfare in a route. In the embodiment shown in FIG. 6 , the method includes calculating a new route to a desired destination with a preference for avoiding the particular portion of the thoroughfare in the route in block 620. In one embodiment, the method further includes performing a route cost analysis in order to calculate the new route to the desired destination. And, in one embodiment, the method further includes displaying the new route.
[0052] As one of ordinary skill in the art will understand upon reading this disclosure, in some embodiments the new route, based on a performed route cost analysis, avoids the particular portion of the thoroughfare in the route. In some embodiments, the new route, based on a performed route cost analysis, partially avoids the particular portion of the thoroughfare in the route. And, in some embodiments, the new route, based on a performed route cost analysis, does not avoid the particular portion of the thoroughfare in the route.
[0053] As shown in block 630 of FIG. 6 , the method includes a determination of whether the new route is acceptable. As one of ordinary skill in the art will appreciate upon reading this disclosure, the determination of whether the new route is acceptable can be based upon additionally received dynamic data. By way of example and not by way of limitation, the additionally received dynamic data can include dynamic data input by a user of the device indicating that the user is not satisfied with the new route in which case the method returns to block 610 to dynamically receive data. In one embodiment, the additionally received dynamic input can include instructions to calculate yet another new route using additional data for avoiding a portion of a thoroughfare in a previous route, one or more thoroughfares in the previous route, and/or one or more sections in the previous route. As used herein, the previous route can include a previous detour route and/or an earlier planned route. Additionally, the additionally received dynamic input can include instructions to continue navigating an original route and/or previously planned route.
[0054] As one of ordinary skill in the art will appreciate upon reading and understanding this disclosure the method sequence shown in blocks 610–630 can be repeated as many times as necessary, without limitation, in order to achieve a desired route. According to one embodiment of the teachings of the present invention, all of the dynamically received data is stored in the memory of the device and is operable upon each time the sequence in blocks 610–630 is repeated. Thus, the present invention provides a system, device and method by which information received between re-route, new route, or detour route calculations is maintained.
[0055] As shown in FIG. 6 , if the new route is acceptable, or once a desired route is attained, then the method proceeds to block 640 and navigates the new route.
[0056] In one embodiment according to the teachings of the present invention, the method for calculating a new route in block 620 to a desired destination includes calculating a second new route different from a first new route, wherein the first new route is a first detour route. And, calculating the second new route includes calculating the second new route with a preference for avoiding a particular portion of a thoroughfare in the first detour route and the particular portion of the thoroughfare in the route. One of ordinary skill in the art will appreciate upon reading and understanding this disclosure that other variations on the above scenario are included within the scope of the present invention. That is, calculating the second new route can include calculating the second new route with a preference for avoiding one or more thoroughfares in any previous route, and/or one or more sections in any previous route.
[0057] Thus, as one of ordinary skill in the art will understand upon reading this disclosure, the present invention provides a method by which one or more detours, new route calculations, or re-route calculations can avoid generating a route which re-includes that portion, thoroughfare, or section of a route which is sought to be avoided.
[0058] According to one embodiment of the invention, dynamically receiving data relating to the portion of the particular thoroughfare in the route in block 610 includes dynamically receiving data defining a distance along the portion of the particular thoroughfare. In one embodiment, dynamically receiving data relating to the portion of the particular thoroughfare in the route in block 610 includes assigning a preference for avoiding the portion of the particular thoroughfare. In one embodiment, the dynamically received data includes data relating to a preference level for avoiding the portion of the particular thoroughfare. By way of example, this preference level data can include a high, medium, or low preference level which can be operated upon in a route cost analysis.
[0059] As mentioned above, in one embodiment the method further includes dynamically receiving data relating to one or more thoroughfares in the route and calculating a new route to a desired destination with a preference for avoiding the one or more thoroughfares in the route. In one embodiment, dynamically receiving data relating to one or more thoroughfares in the route includes dynamically receiving data relating to the group consisting of a thoroughfare name, a thoroughfare classification, and a thoroughfare type. As used herein, thoroughfare classification can include a speed classification, e.g. a 25, 55, or 75 mph speed classification. And as used herein, thoroughfare type can includes a designated thoroughfare type such as an interstate, county road, state road, state highway, and the like classification. The invention is not so limited.
[0060] FIG. 7 is a flow diagram of another embodiment of a navigation aid method according to the teachings of the present invention. As shown the embodiment of FIG. 7 , the method begins in block 710 by determining a current position of the navigation device along a route. As one of ordinary skill in the art will understand upon reading this disclosure, determining or calculating a position of the navigation device is achieved in some embodiments using a GPS. The invention, however, is not so limited. It is further readily appreciated that the current position of the navigation device may be displayed on cartographic data and that the current position can be on a previously planned route.
[0061] In block 720, the method includes retrieving a re-route, new route, or detour route data structure based on input data. As one or ordinary skill in the art will understand upon reading this disclosure, one embodiment for retrieving a re-route; new route, or detour route data structure based on input data 710 can include receiving user input data which selects a re-route, new route, or detour route menu option.
[0062] In one embodiment, as shown in block 730 of FIG. 7 , the method includes determining a distance to avoid for a particular portion of a thoroughfare in a route which is currently provided for the device. In one embodiment, determining a distance to avoid for a particular portion of a thoroughfare in a route which is currently provided for the device includes a user selecting a distance to avoid in a current route from among a number of options in a detour route menu. For example, determining a distance to avoid can include determining a distance from a number of integral distances, e.g. 1, 5, 10, and 20 miles. Likewise, determining a distance to avoid can include a user inputting a distance value. The invention, however, is not so limited. One of ordinary skill in the art will further understand that in some embodiments the method includes determining one or more thoroughfares to avoid in a route which is currently provided for the device, and/or determining one or more sections to avoid in a route which is currently provided for the device. As used herein, one or more sections can includes one or more portions of a thoroughfare, one or more portions of one thoroughfare and one or more portions of another thoroughfare, one or more portions of one thoroughfare and one or more other thoroughfares, or any combinations thereof for a route which is currently provided for the device. The invention is not so limited.
[0063] In block 740, the method includes calculating a new route based on the determination made in block 730. Thus, by way of example and not by way of limitation, the method embodiment shown in FIG. 7 includes calculating a new route in block 740 based on the device's determined position and the distance determined in block 730. However in other embodiments, calculating the new route can be performed based on the determined one or more thoroughfares and/or the determined one or more sections to avoid in a route which is currently provided for the device.
[0064] According to one embodiment of the present invention, calculating the new route in block 740 based on the determination made in block 730 includes dynamically calculating the new route based on the determination in block 730 and based on a route cost analysis. One of ordinary skill in the art will understand upon reading and understanding this disclosure, the manner in which a new route can be calculated using the determination made in block 730 and factoring that determination in to a route processing algorithm which performs a route cost analysis. That is, in one embodiment, such as that described in FIG. 7 , the present invention is operable to perform a route calculation which strongly avoids the distance along a particular portion of a thoroughfare determined in block 730, or in other embodiments strongly avoids one or more particular thoroughfares and/or more sections in a route which is currently provided for the device.
[0065] In one embodiment, in order to achieve the above result, the method of the present invention assigns a greater cost to particular nodes in a network of thoroughfares based on the determination made in block 730. As used herein, every places two thoroughfares intersect is termed a node. Thus, every node on a given thoroughfare connects one thoroughfare to another thoroughfare, which can be referred to as an adjacency, or adjacent thoroughfare. The term adjacency information, or adjacencies, is intended to include any thoroughfare which intersects another thoroughfare in a network of thoroughfares which are available for use in a potential route. According to the teachings of the present invention adjacency criteria includes, but is not limited to, the degree of turn angles between one thoroughfare and another, connected by a node in a network of thoroughfares which are available for use in a potential route. The term adjacency can further include can information relating to the thoroughfare on which the device is located and adjacent thoroughfares connected thereto by a node, thoroughfare names, thoroughfare classifications, speed classification of the thoroughfares, and other criteria of the like.
[0066] As one of ordinary skill in the art will understand upon reading this disclosure, data representing the cost assigned to a given node between a given thoroughfare and an adjacency, as well as data representing adjacency criteria are used in performing a route cost analysis. Thus, in one embodiment of the present invention, assigning a greater cost to one or more particular nodes in a network of thoroughfares based on the determination made in block 730 reduces the likelihood of a given portion, thoroughfare, or section being chosen as part of the route from among the network of thoroughfares in cartographic data which are available for use in a potential route.
[0067] Finally, as shown in FIG. 7 , once the new route has been calculate in block 740, the method proceeds to block 750 and navigates the new route. It is will readily be appreciated that the new route for the device can be navigated for the device according to the methods described herein. However, the invention is not limited to a single particular method of navigating the route in block 750.
[0068] In some embodiments, the methods provided above are implemented as a computer data signal embodied in a carrier wave or propagated signal, that represents a sequence of instructions which, when executed by a processor, such as processor 410 in FIGS. 4A and 4B or processor 504 in FIG. 5 , cause the processor to perform the respective method. In other embodiments, methods provided above are implemented as a set of instructions contained on a computer-accessible medium, such as memory 430 in FIGS. 4A and 4B or mass storage device 512 in FIG. 5 , capable of directing a processor, such as processor 410 in FIGS. 4A and 4B or processor 504 in FIG. 5 , to perform the respective method. In varying embodiments, the medium is a magnetic medium, an electronic medium, or an optical medium.
[0069] As one of ordinary skill in the art will understand upon reading this disclosure, the electronic components of device 400 shown in FIGS. 4A and 4B and components of the system 500 shown in FIG. 5 can be embodied as computer hardware circuitry or as a computer-readable program, or a combination of both. In another embodiment, system 500 is implemented in an application service provider (ASP) system.
[0070] The system of the present invention includes software operative on a processor to perform methods according to the teachings of the present invention. One of ordinary skill in the art will understand, upon reading and comprehending this disclosure, the manner in which a software program can be launched from a computer readable medium in a computer based system to execute the functions defined in the software program. One of ordinary skill in the art will further understand the various programming languages which may be employed to create a software program designed to implement and perform the methods of the present invention. The programs can be structured in an object-orientation using an object-oriented language such as Java, Smalltalk or C++, and the programs can be structured in a procedural-orientation using a procedural language such as COBOL or C. The software components communicate in any of a number of means that are well-known to those skilled in the art, such as application program interfaces (A.P.I.) or interprocess communication techniques such as remote procedure call (R.P.C.), common object request broker architecture (CORBA), Component Object Model (COM), Distributed Component Object Model (DCOM), Distributed System Object Model (DSOM) and Remote Method Invocation (RMI). However, as will be appreciated by one of ordinary skill in the art upon reading this disclosure, the teachings of the present invention are not limited to a particular programming language or environment.
Conclusion
[0071] The above systems, devices and methods have been described, by way of example and not by way of limitation, with respect to improving accuracy, processor speed and ease of user interaction with a navigation device. That is, the systems, devices and methods provide for a navigational route planning device which is more efficient and accurate than current low cost systems, without requiring the more expensive system resources. The systems, devices and methods of the present invention offer an improved navigational route planning device which provide dynamic route calculation capabilities. The device is capable of selecting a detour around one or more portions of a thoroughfare, a group of thoroughfares, or one or more sections in a network of thoroughfares. Thus in instances where a thoroughfare may be less desirable for travel, such as for reasons which include accidents, thoroughfare conditions, thoroughfare types, checkpoints and the like, the device calculates a new route to navigate to the desired destination. In order to calculate the new route, the device performs a route cost analysis.
[0072] Although specific embodiments have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that any arrangement which is calculated to achieve the same purpose may be substituted for the specific embodiment shown. This application is intended to cover any adaptations or variations of the present invention. It is to be understood that the above description is intended to be illustrative, and not restrictive. Combinations of the above embodiments, and other embodiments will be apparent to those of skill in the art upon reviewing the above description. The scope of the invention includes any other applications in which the above systems, devices and methods are used. The scope of the invention should be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled.
Claims
What is claimed is:
1. A navigation aid method for performing a detour route calculation, comprising:
receiving data relating to a portion of a particular thoroughfare in a route; and
calculating a new route based on integral re-route distances to a desired destination with a preference for avoiding the particular portion of the thoroughfare in the route.
2. The method of claim 1, wherein the method further includes performing a route cost analysis in order to calculate the new route to the desired destination.
3. The method of claim 1, wherein the method further includes displaying the new route.
4. The method of claim 1, wherein the method includes avoiding the particular portion of the thoroughfare in the route.
5. The method of claim 1, wherein the calculating a new route to a desired destination includes calculating a second new mute different from a first new route, wherein the first new route is a first detour route, and calculating the second new route includes calculating the second new route with a preference for avoiding a particular portion of a thoroughfare in the first detour route and the particular portion of the thoroughfare in the route.
6. The method of claim 1, wherein receiving data relating to the portion of the particular thoroughfare in the route includes receiving data defining a distance along the portion of the particular thoroughfare.
7. The method of claim 1, wherein the method further includes:
receiving data relating to one or more thoroughfares in the route; and
calculating a new route to a desired destination with a preference for avoiding the one or more thoroughfares in the route.
8. The method of claim 7, wherein receiving data relating to one or more thoroughfares in the route includes receiving data relating to the group consisting of a thoroughfare name and a thoroughfare type.
9. A coded information signal embodied in a carrier wave, the coded information signal representing data, comprising:
data containing preference levels relating to a particular portion of a thoroughfare in a route;
new route data to a desired destination operable to be selected for a route of navigation based on a preference for avoiding the particular portion of the thoroughfare in the route and based on a route cost analysis data; and
wherein the preference levels are maintained between multiple route calculations.
10. A navigation aid method for performing a detour route calculation, comprising:
receiving data relating to at least a portion of a particular thoroughfare in a route; and
calculating a new route to a desired destination, in view of a selection of a preference level from high, medium, and low preference levels, wherein the preference level selected is factored into whether a particular portion of a route is selected.
Patent Citations (228)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3660812(A) | 1972-05-01 | Inose et al. | Applicant |
| US3883847(A) | 1975-05-01 | Frank | Applicant |
| US4811613(A) | 1989-03-01 | Phillips et al. | Applicant |
| US4827419(A) | 1989-05-01 | Selby | Applicant |
| US4831563(A) | 1989-05-01 | Ando et al. | Applicant |
| US4924402(A) | 1990-05-01 | Ando et al. | Applicant |
| US4926336(A) | 1990-05-01 | Yamada | Applicant |
| US4937753(A) | 1990-06-01 | Yamada | Applicant |
| US5208593(A) | 1993-05-01 | Tong et al. | Applicant |
| US5220509(A) | 1993-06-01 | Takemura et al. | Applicant |
| US5243529(A) | 1993-09-01 | Kashiwazaki | Applicant |
| US5272638(A) | 1993-12-01 | Martin et al. | Applicant |
| US5297051(A) | 1994-03-01 | Arakawa et al. | Applicant |
| US5331563(A) | 1994-07-01 | Masumoto et al. | Applicant |
| US5343399(A) | 1994-08-01 | Yokoyama et al. | Applicant |
| US5349530(A) | 1994-09-01 | Odagawa | Applicant |
| US5363306(A) | 1994-11-01 | Kuwahara et al. | Applicant |
| US5365448(A) | 1994-11-01 | Nobe et al. | Applicant |
| US5371497(A) | 1994-12-01 | Nimura et al. | Applicant |
| US5396430(A) | 1995-03-01 | Arakawa et al. | Applicant |
| US5410486(A) | 1995-04-01 | Kishi | Applicant |
| US5422815(A) | 1995-06-01 | Hijikata | Applicant |
| US5424953(A) | 1995-06-01 | Masumoto et al. | Applicant |
| US5442559(A) | 1995-08-01 | Kuwahara et al. | Applicant |
| US5452212(A) | 1995-09-01 | Yokoyama et al. | Applicant |
| US5452217(A) | 1995-09-01 | Kishi | Applicant |
| US5463554(A) | 1995-10-01 | Araki et al. | Applicant |
| US5475599(A) | 1995-12-01 | Yokoyama | Applicant |
| US5506578(A) | 1996-04-01 | Kishi | Applicant |
| US5506774(A) | 1996-04-01 | Nobe et al. | Applicant |
| US5528248(A) | 1996-06-01 | Steiner et al. | Applicant |
| US5537323(A) | 1996-07-01 | Schulte | Applicant |
| US5537324(A) | 1996-07-01 | Nimura et al. | Applicant |
| US5546107(A) | 1996-08-01 | Deretsky et al. | Applicant |
| US5559511(A) | 1996-09-01 | Ito et al. | Applicant |
| US5638279(A) | 1997-06-01 | Kishi et al. | Applicant |
| US5652706(A) | 1997-07-01 | Morimoto et al. | Applicant |
| US5657231(A) | 1997-08-01 | Nobe et al. | Applicant |
| US5712788(A) | 1998-01-01 | Liaw et al. | Applicant |
| US5729109(A) | 1998-03-01 | Kaneko et al. | Applicant |
| US5729458(A) | 1998-03-01 | Poppen | Applicant |
| US5739772(A) | 1998-04-01 | Nanba et al. | Applicant |
| US5742925(A) | 1998-04-01 | Baba | Applicant |
| US5757289(A) | 1998-05-01 | Nimura et al. | Applicant |
| US5774073(A) | 1998-06-01 | Maekawa et al. | Applicant |
| US5787383(A) | 1998-07-01 | Moroto et al. | Applicant |
| US5793631(A) | 1998-08-01 | Ito | Applicant |
| US5809447(A) | 1998-09-01 | Kato | Applicant |
| US5821887(A) | 1998-10-01 | Zhu | Applicant |
| US5845282(A) | 1998-12-01 | Alley et al. | Applicant |
| US5852791(A) | 1998-12-01 | Sato et al. | Applicant |
| US5857196(A) | 1999-01-01 | Angle et al. | Applicant |
| US5862511(A) | 1999-01-01 | Croyle et al. | Applicant |
| US5874905(A) | 1999-02-01 | Nanba et al. | Applicant |
| US5877751(A) | 1999-03-01 | Kanemitsu et al. | Applicant |
| US5878368(A) | 1999-03-01 | DeGraaf | Applicant |
| US5890092(A) | 1999-03-01 | Kato et al. | Applicant |
| US5893081(A) | 1999-04-01 | Poppen | Applicant |
| US5902349(A) | 1999-05-01 | Endo et al. | Applicant |
| US5911773(A) | 1999-06-01 | Mutsuga et al. | Examiner |
| US5925090(A) | 1999-07-01 | Poonsaengsathit | Applicant |
| US5926118(A) | 1999-07-01 | Hayashida et al. | Applicant |
| US5938721(A) | 1999-08-01 | Dussell et al. | Applicant |
| US5946687(A) | 1999-08-01 | Gehani et al. | Applicant |
| US5946692(A) | 1999-08-01 | Faloutsos et al. | Applicant |
| US5951622(A) | 1999-09-01 | Nomura | Applicant |
| US5953722(A) | 1999-09-01 | Lampert et al. | Applicant |
| US5977885(A) | 1999-11-01 | Watanabe | Applicant |
| US5978730(A) | 1999-11-01 | Poppen et al. | Applicant |
| US5995970(A) | 1999-11-01 | Robinson et al. | Applicant |
| US6021406(A) | 2000-02-01 | Kuznetsov | Applicant |
| US6023655(A) | 2000-02-01 | Nomura | Applicant |
| US6035299(A) | 2000-03-01 | White et al. | Applicant |
| US6038509(A) | 2000-03-01 | Poppen et al. | Applicant |
| US6038559(A) | 2000-03-01 | Ashby et al. | Applicant |
| US6040824(A) | 2000-03-01 | Maekawa et al. | Applicant |
| US6047280(A) | 2000-04-01 | Ashby et al. | Applicant |
| US6052645(A) | 2000-04-01 | Harada | Applicant |
| US6061003(A) | 2000-05-01 | Harada | Applicant |
| US6061630(A) | 2000-05-01 | Walgers et al. | Applicant |
| US6073076(A) | 2000-06-01 | Crowley et al. | Applicant |
| US6081803(A) | 2000-06-01 | Ashby et al. | Applicant |
| US6088652(A) | 2000-07-01 | Abe | Applicant |
| US6101443(A) | 2000-08-01 | Kato et al. | Applicant |
| US6108603(A) | 2000-08-01 | Karunanidhi | Applicant |
| US6112153(A) | 2000-08-01 | Schaaf et al. | Applicant |
| US6112200(A) | 2000-08-01 | Livshutz et al. | Applicant |
| US6119066(A) | 2000-09-01 | Sugiura et al. | Applicant |
| US6121314(A) | 2000-09-01 | Richter et al. | Applicant |
| US6121900(A) | 2000-09-01 | Takishita | Applicant |
| US6122593(A) | 2000-09-01 | Friederich et al. | Applicant |
| US6128515(A) | 2000-10-01 | Kabler et al. | Applicant |
| US6128573(A) | 2000-10-01 | Nomura | Applicant |
| US6134501(A) | 2000-10-01 | Oumi | Applicant |
| US6151552(A) | 2000-11-01 | Koizumi et al. | Applicant |
| US6161092(A) | 2000-12-01 | Latshaw | Applicant |
| US6169956(B1) | 2001-01-01 | Morimoto et al. | Applicant |
| US6172641(B1) | 2001-01-01 | Millington | Applicant |
| US6182006(B1) | 2001-01-01 | Meek | Applicant |
| US6182010(B1) | 2001-01-01 | Berstis | Applicant |
| US6184823(B1) | 2001-02-01 | Smith et al. | Applicant |
| US6192314(B1) | 2001-02-01 | Khavakh et al. | Applicant |
| US6199013(B1) | 2001-03-01 | O'Shea | Applicant |
| US6199045(B1) | 2001-03-01 | Giniger et al. | Applicant |
| US6202024(B1) | 2001-03-01 | Yokoyama et al. | Applicant |
| US6202026(B1) | 2001-03-01 | Nimura et al. | Applicant |
| US6219457(B1) | 2001-04-01 | Potu | Applicant |
| US6249740(B1) | 2001-06-01 | Ito et al. | Applicant |
| US6249744(B1) | 2001-06-01 | Morita | Applicant |
| US6256351(B1) | 2001-07-01 | Hong | Applicant |
| US6259988(B1) | 2001-07-01 | Galkowski et al. | Applicant |
| US6263276(B1) | 2001-07-01 | Yokoyama et al. | Applicant |
| US6263277(B1) | 2001-07-01 | Tanimoto et al. | Applicant |
| US6266612(B1) | 2001-07-01 | Dussell et al. | Applicant |
| US6266615(B1) | 2001-07-01 | Jin | Applicant |
| US6278994(B1) | 2001-08-01 | Fuh et al. | Applicant |
| US6285950(B1) | 2001-09-01 | Tanimoto | Applicant |
| US6285951(B1) | 2001-09-01 | Gaskins et al. | Applicant |
| US6292743(B1) | 2001-09-01 | Pu et al. | Applicant |
| US6298303(B1) | 2001-10-01 | Khavakh et al. | Applicant |
| US6298305(B1) | 2001-10-01 | Kadaba et al. | Applicant |
| US6307573(B1) | 2001-10-01 | Barros | Applicant |
| US6308177(B1) | 2001-10-01 | Israni et al. | Applicant |
| US6314365(B1) | 2001-11-01 | Smith | Applicant |
| US6317684(B1) | 2001-11-01 | Roeseler et al. | Applicant |
| US6317687(B1) | 2001-11-01 | Morimoto et al. | Applicant |
| US6321158(B1) | 2001-11-01 | DeLorme et al. | Applicant |
| US6324467(B1) | 2001-11-01 | Machii et al. | Applicant |
| US6349257(B1) | 2002-02-01 | Liu et al. | Applicant |
| US6374177(B1) | 2002-04-01 | Lee et al. | Applicant |
| US6374179(B1) | 2002-04-01 | Smith et al. | Applicant |
| US6381535(B1) | 2002-04-01 | Durocher et al. | Applicant |
| US6388877(B1) | 2002-05-01 | Canova, Jr. et al. | Applicant |
| US6393149(B1) | 2002-05-01 | Friederich et al. | Applicant |
| US6401034(B1) | 2002-06-01 | Kaplan et al. | Applicant |
| US6401035(B1) | 2002-06-01 | Jin | Applicant |
| US6405123(B1) | 2002-06-01 | Rennard et al. | Applicant |
| US6411899(B1) | 2002-06-01 | Dussell et al. | Applicant |
| US6427119(B1) | 2002-07-01 | Stefan et al. | Applicant |
| US6430498(B1) | 2002-08-01 | Maruyama et al. | Applicant |
| US6456234(B1) | 2002-09-01 | Johnson | Applicant |
| US6460046(B1) | 2002-10-01 | Meek | Applicant |
| US6477526(B1) | 2002-11-01 | Hayashi et al. | Applicant |
| US6484093(B1) | 2002-11-01 | Ito et al. | Applicant |
| US6504496(B1) | 2003-01-01 | Mesarovic et al. | Applicant |
| US6505123(B1) | 2003-01-01 | Root et al. | Applicant |
| US6510379(B1) | 2003-01-01 | Hasegawa et al. | Applicant |
| US6512525(B1) | 2003-01-01 | Capps et al. | Applicant |
| US6522875(B1) | 2003-02-01 | Dowling et al. | Applicant |
| US6526351(B1) | 2003-02-01 | Whitham | Applicant |
| US6532152(B1) | 2003-03-01 | White et al. | Applicant |
| US6535743(B1) | 2003-03-01 | Kennedy et al. | Applicant |
| US6542814(B1) | 2003-04-01 | Polidi et al. | Applicant |
| US6563440(B1) | 2003-05-01 | Kangas | Applicant |
| US6567743(B1) | 2003-05-01 | Mueller et al. | Applicant |
| US6574553(B1) | 2003-06-01 | Beesley et al. | Applicant |
| US6574554(B1) | 2003-06-01 | Beesley et al. | Applicant |
| US6581003(B1) | 2003-06-01 | Childs et al. | Applicant |
| US6594666(B1) | 2003-07-01 | Biswas et al. | Applicant |
| US6615130(B1) | 2003-09-01 | Myr | Applicant |
| US6615131(B1) | 2003-09-01 | Rennard et al. | Applicant |
| US6633809(B1) | 2003-10-01 | Aizono et al. | Applicant |
| US6650996(B1) | 2003-11-01 | Beesley et al. | Applicant |
| US6674849(B1) | 2004-01-01 | Froeberg | Applicant |
| US6675093(B1) | 2004-01-01 | Childs et al. | Applicant |
| US6687615(B1) | 2004-02-01 | Krull et al. | Examiner |
| US6694256(B1) | 2004-02-01 | Childs et al. | Applicant |
| US6704645(B1) | 2004-03-01 | Beesley et al. | Applicant |
| US6708112(B1) | 2004-03-01 | Beesley et al. | Applicant |
| US6725155(B1) | 2004-04-01 | Takahashi et al. | Applicant |
| US6768942(B1) | 2004-07-01 | Chojnacki | Applicant |
| US6775612(B1) | 2004-08-01 | Kao et al. | Applicant |
| US6782318(B1) | 2004-08-01 | Beesley et al. | Applicant |
| US6789012(B1) | 2004-09-01 | Childs et al. | Applicant |
| US6799115(B1) | 2004-09-01 | Childs et al. | Applicant |
| US6807483(B1) | 2004-10-01 | Chao et al. | Applicant |
| US6823256(B1) | 2004-11-01 | Burt | Applicant |
| US6834230(B1) | 2004-12-01 | Childs et al. | Applicant |
| US6839624(B1) | 2005-01-01 | Beesley et al. | Applicant |
| US6845322(B1) | 2005-01-01 | Chao et al. | Applicant |
| US6847890(B1) | 2005-01-01 | Childs et al. | Applicant |
| US6850842(B1) | 2005-02-01 | Park | Applicant |
| US6856893(B1) | 2005-02-01 | Beesley et al. | Applicant |
| US6856900(B1) | 2005-02-01 | Childs et al. | Applicant |
| US6892135(B1) | 2005-05-01 | Krull et al. | Applicant |
| US6898520(B1) | 2005-05-01 | Kao et al. | Applicant |
| US6899138(B1) | 2005-05-01 | Lundman | Applicant |
| US6948043(B1) | 2005-09-01 | Barr et al. | Applicant |
| US6975940(B1) | 2005-12-01 | Childs et al. | Applicant |
| US6980906(B1) | 2005-12-01 | Kao et al. | Applicant |
| US6999873(B1) | 2006-02-01 | Krull et al. | Applicant |
| US2001/0043745(A1) | 2001-11-01 | Frederich et al | Applicant |
| US2001/0045949(A1) | 2001-11-01 | Chithambaram et al. | Applicant |
| US2001/0056327(A1) | 2001-12-01 | Jin | Applicant |
| US2002/0038316(A1) | 2002-03-01 | Onyon et al. | Applicant |
| US2002/0040271(A1) | 2002-04-01 | Park et al. | Applicant |
| US2002/0091527(A1) | 2002-07-01 | Shiau | Applicant |
| US2002/0102988(A1) | 2002-08-01 | Myllymaki | Applicant |
| US2002/0120753(A1) | 2002-08-01 | Levanon et al. | Applicant |
| US2002/0164998(A1) | 2002-11-01 | Younis | Applicant |
| US2002/0173905(A1) | 2002-11-01 | Jin | Applicant |
| US2003/0006913(A1) | 2003-01-01 | Joyce et al. | Applicant |
| US2003/0006918(A1) | 2003-01-01 | Barnett | Applicant |
| US2003/0013483(A1) | 2003-01-01 | Ausems et al. | Applicant |
| US2003/0045301(A1) | 2003-03-01 | Wollrab | Applicant |
| US2003/0045998(A1) | 2003-03-01 | Medi | Applicant |
| US2003/0048599(A1) | 2003-03-01 | Martin | Applicant |
| US2003/0069029(A1) | 2003-04-01 | Dowling et al. | Applicant |
| US2003/0069899(A1) | 2003-04-01 | Brown | Applicant |
| US2003/0105845(A1) | 2003-06-01 | Leermakers | Applicant |
| US2003/0131023(A1) | 2003-07-01 | Bassett et al. | Applicant |
| US2003/0131059(A1) | 2003-07-01 | Brown et al | Applicant |
| US2003/0139150(A1) | 2003-07-01 | Rodriguez et al. | Applicant |
| US2004/0220726(A1) | 2004-11-01 | Jin | Applicant |
| AT209809(T) | 2002-12-01 | Applicant | |
| CN1391687(T) | 2003-10-01 | Applicant | |
| EP61674 | 1982-06-01 | Applicant | |
| EP123562 | 1984-04-01 | Applicant | |
| EP242099 | 1987-10-01 | Applicant | |
| FR2541801 | 1983-02-01 | Applicant | |
| FR2818414 | 2002-06-01 | Applicant | |
| JP8-221694 | 1996-08-01 | Applicant | |
| JP10-132594 | 1998-05-01 | Applicant | |
| WO1/23839 | 2001-04-01 | Applicant | |
| WO20/060157 | 2003-11-01 | Applicant | |
| WO1/61276 | 2004-03-01 | Applicant | |
| WO2/103291 | 2004-03-01 | Applicant | |
| WO3/058170 | 2004-10-01 | Applicant |
Non-Patent Literature (35)
- U.S. Appl. No. 10/701,771, filed Nov. 5, 2003, Krull et al.Applicant
- “An optimal pathfinder for vehicles in real-world digital terrain maps” http://www.nease.net/jamsoft/shortestpath/pathfinder/4.html, 11 pages, 1999.Applicant
- “Informed Search Methods”, Artificial Intelligence, A Modern Approach, Prentice Hall, Inc., pp. 92-115 (1995).Applicant
- “Real-Time Vehicle Routing in Dynamic and Stochastic Urban Traffic Networks”, http://www/gpu.srv.ualberta.ca/lfu/research.htm, pp. 1-3, 1997.Applicant
- Ahuja, R., et al., “Faster Algorithms for the Shortest Path Problem”, Journal of the Association for Computing Machinery, 37(2), pp. 213-223, 1990.Applicant
- Chung, V., et al., “An Efficient Implementation of Parallel A”, CFPAR, Montreal, Canada, pp. 153-167, 1994.Applicant
- Fredman, M. et al., “Fibonacci heaps and their uses in improved network optimization algorithms” Journal of the ACM, 34(3), 2 pages, 1987.Applicant
- 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.Applicant
- Ikeda, T., et al., “A Fast Algorithm for Finding Better Routes by Al Search Techniques”, Vehicle Navigation and Information Systems Conference Proceedings, pp. 291-296, 1994.Applicant
- Kaindl, H. et al., “Memory-Bounded Bi-directional Search”, Proceedings of the 12th National Conference on Art, AAAI Press, Seattle, WA, pp. 1359-1364, 1994.Applicant
- Laporte, G., “The Vehicle Routing Problem: An overview of exact and approximate algorithms”, European Journal of Operational Research, 59, pp. 345-358, 1992.Applicant
- Myers, B., “Data Structures for Best-First Search” http://www4.ncsu.edu/jbmyers/dsai.htm., pp. 1-6, 1997.Applicant
- Ronngren, R. et al., “Parallel land Sequential Priority Queue Algorithms”, ACM Transactions on Modeling and Computer Simulation, 7(2), pp. 1-11, 1997.Applicant
- Stout, B., “Smart Moves: Intelligent Pathfinding”, Gamasutra, http://www.gamasutra.com/features/programming/080197/pathfinding.htm, pp. 1-11, 1997.Applicant
- Wai, L., et al., “Comparative Study of Shortest Path Algorithms for Transport Network”, USRP Report 2, http://www.comp.nus.edu.sg/leonghee/USRPreport-txt.html, pp. 1-10, 1999.Applicant
- 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, 11 pages, 1997.Applicant
- Zaho, 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.Applicant
- U.S. Appl. No. 10/032,250, filed Dec. 21, 2001, Childs et al.Applicant
- U.S. Appl. No. 10/086,370, filed Feb. 18, 2002, Childs et al.Applicant
- U.S. Appl. No. 10/269,573, filed Oct. 11, 2002, Childs et al.Applicant
- U.S. Appl. No. 10/962,700, filed Oct. 12, 2004, Childs et al.Applicant
- U.S. Appl. No. 10/976,998, filed Oct. 29, 2004, Childs et al.Applicant
- U.S. Appl. No. 10/993,174, filed Nov. 19, 2004, Krull et al.Applicant
- U.S. Appl. No. 10/993,189, filed Nov. 19,. 2004, Childs et al.Applicant
- U.S. Appl. No. 11/035,242, filed Jan. 13, 2005, Beesley et al.Applicant
- U.S. Appl. No. 11/035,243, filed Nov. 5, 2003, Krull et al.Applicant
- Booten, A., “The Automatic Position Reporting System”, http:/www.oarc.net/aprs.htm, 5pages, (2002).Applicant
- Bourrie, S. “Tendler Updates FoneFinder”, Wireless Week p. 24, Jun. 28, 1999.Applicant
- Bravman, J.S. et al., “Automatic Vehicle Monitoring”, 10 pages.Applicant
- Chung et al.; Level-Compressed Huffman Decoding; IEEE-Transaction on Communication; Oct. 1999;vol. 47, No. 10; pp. 1455-1457.Applicant
- Microsoft Press Computer Dictionary, Third Edition, Microsoft Press, p. 281 (1997).Applicant
- Nekritch, Y.; Byte-oriented decoding of canonical Huffman codes; IEEE-Information Theory 2000; Jun 2000; p. 371.Applicant
- Nilsen, P., “Application of the Global-Positioning System (GPS) to Automatic Vehicle Monitoring”, 1981 Camahan Conference on Crime Countermeasures, University of Kentucky, pp. 7-11, (1981).Applicant
- Oberhauser et al.; Fast data structures for shortest path routing: a comparative evaluation; 1995 IEEE International Confernece on Gateway to Globalization, Jun. 1995; vol. 3, pp. 1597-1601.Applicant
- Rosenbert, J. M. Dictionary of Computers, Information Processing and Telecommunications, Second Edition, Aug. 1990.Applicant