As the cost of sensors, communications systems and navigational systems has dropped, operators of commercial and fleet vehicles now have the ability to collect a tremendous amount of data about the vehicles that they operate, including geographical position data collected during the operation of the vehicle.
Vehicle fleet operators often operate vehicles along predefined and generally invariant routes. For example, buses frequently operate on predefined routes, according to a predefined time schedule (for example, along a route that is geographically, as well as temporally defined). Preparing a predefined route can be a tedious task. Route planning software is available from a plurality of different vendors. As with any software application, a learning curve is involved. Furthermore, over time such predefined routes must be modified, to take into account changes in local traffic patterns, due to factors such as changes in traffic volumes on certain roads, road closures, and congestion due to road repairs and construction, requiring further use of route planning software to update an optimal route. The task of comparing actual driver performance using data (such as Global Positioning System (GPS) data) collected from vehicles traversing a predefined route with the optimal route can require one or more additional programs be used to perform the comparison.
It would be desirable to provide such fleet operators with additional means for developing optimal routes, to compare actual driver performance with the optimal route, and to update the optimal route in response to changes in traffic patterns.
One aspect of the novel concepts presented herein is a method of using data collected in connection with operation of a vehicle to automatically define an optimal route, instead of using route planning software to define the optimal route. Once the optimal route is defined and stored, future positional data (i.e., actual route data) collected during vehicle operations can be compared to the optimal route data, to evaluate driver performance. As traffic conditions change, actual route data (i.e., positional data collected as a vehicle traverses a specific route) can be used to identify changes to the optimal route that provide a performance improvement. Whenever an improvement (such as a detour to avoid congestion due to an ongoing road construction project) appears to have value over an extended period, actual route data corresponding to the improved route can be used to redefine the optimal route. In this manner, actual route data is used to define the optimal route, so that route planning software is not required.
In at least one exemplary embodiment, the initial optimal route data collected for a route can be generated by equipping a vehicle with a positional tracking unit (such as a GPS tracking system, although it should be recognized that the use of GPS systems for this purpose is intended to be exemplary, rather than limiting), and operating the vehicle over the desired route to generate the optimal route data (i.e., a fingerprint of geographical position data, which may also comprise temporal data). The specific route can be initially planned using maps, local knowledge of traffic routes and conditions, route planning software, or any combination thereof (although one benefit of the concepts disclosed herein is that route planning software is not needed, it should be recognized that the initial route could be defined by route planning software). If desired, an initial route planning period can encompass more than one traverse of the predefined route. For example, route data can be collected during the course of a week (note that the specific time period of a week is intended to be exemplary, not limiting), with the route being varied during the week, so that actual route data from the week can be evaluated to identify the data defining the most efficient or optimal route. Generally, optimal route data represents actual route data collected from a vehicle traversing a route, where that traversal represents completion of the route in the least amount of time, although other factors, such as mileage and engine stress (as measured by factors such as engine revolutions per minute (RPM), oil temperature, and coolant temperature) can be used to determine when actual route data collected from a vehicle traversing a route represents the optimal route.
Once a specific set of positional data is identified as the optimal (or “golden”) route, subsequently collected actual route data are compared with the optimal route data. Such evaluations can be used to identify drivers who deviate from the optimal route. At times, deviations can represent an occurrence that requires some warning or disciplinary action (i.e., a driver deviated from the optimal route for an unacceptable reason, such as to run a personal errand or to take a vehicle home instead of to the fleet yard). In other situations, such deviations may have been necessitated by changes in traffic conditions along the route, such as increased congestion on the route, due to high traffic volumes, an accident, or road construction. In some cases, the deviations may represent an improvement in efficiency over the earlier identified optimal route. When such an improvement occurs, the new and more efficient route can be brought to the attention of a route manager, who may decide that the more efficient actual route data should be used to redefine the golden or optimal route. Based on an evaluation of the new more efficient route, the route manager may offer suggestions to further tweak the route for still greater improvement, and a new route planning period may be enacted, where intentional route variations are implemented to further refine the optimal route. Alternatively, the actual route data representing the more efficient route thus determined can automatically replace the previously identified optimal route.
In other embodiments, such intentional variations are implemented on a regular or periodic basis (for example, intentional variations can be implemented monthly, although this monthly period is intended to be exemplary, and not limiting), and any efficiency improvements derived from the variations can be used to update the optimal route data. Thus, an important aspect of the concepts disclosed herein is that the optimal route evolves dynamically over time based on actual route data, as opposed to theoretical data provided by route planning software.
In an exemplary embodiment, actual route data are collected from vehicles as they traverse a predefined route. The actual route data are used initially to define an optimal route. Thereafter, actual route data are compared to the optimal route data. The actual route data can be collected and evaluated in real time (for example, the route data can be wirelessly transferred to a remote computing device for evaluation), or route data can be collected after the vehicle completes the route. When unjustified deviations from the optimal route by a driver reduce efficiency, disciplinary actions can be initiated where merited. When deviations from the optimal route increase efficiency, the optimal route can be redefined based on the more efficient actual route data.
In general, the actual route will be analyzed by a remote computing device. For example, the remote computing device can be a computing system controlled or accessed by the fleet operator. The remote computing device also can be operating in a networked environment, and in some cases, may be operated by a third party under contract with the fleet operator to perform such services. Thus, the actual route data can be conveyed via a data link with the remote computing device.
The basic elements of the exemplary embodiment include a vehicle that is to be operated by a vehicle operator, a route data collection unit (such as a GPS tracking device), a data link (which can be integrated into the GPS unit), and a remote computing device. In general, the remote computing device can be implemented by a computing system employed by an entity operating a fleet of vehicles. Entities that operate vehicle fleets can thus use such computing systems to track and process data relating to their vehicle fleet. It should be recognized that these basic elements can be combined in many different configurations to achieve the exemplary method discussed above. Thus, the details provided herein are intended to be exemplary, and not limiting on the scope of the concepts disclosed herein.
As noted above, the actual route data can include more than just geographical position data. Vehicle onboard computing devices are often configured to collect data from a variety of sensors integrated into the vehicle. Such sensor data are often communicated to the onboard computer via a J-bus, although such an embodiment is intended to be exemplary, rather than limiting. Sensor data can include brake temperature data, tire pressure data, oil temperature data, engine coolant temperature data, and other data corresponding to operational characteristics or conditions of the vehicle and its engine (or other form of prime mover). The other sensor data and the geographical position data will, in an exemplary embodiment, be combined into a data set unique to a specific operational period for a specific vehicle, to achieve actual route data for a given operational period. Alternatively, the actual route data can simply be data collected by a GPS or other geographical position sensing device.
The actual route data are then conveyed to the remote computing device for subsequent analysis of the actual route data (or initially, to define the optimal route; as noted above, the first set of actual route data for a given route can be used as the default optimal route, to be replaced by subsequently obtained actual route data that represents an improvement over the earlier route data). The analysis can include identifying exceptions (i.e., deviations from the optimal route), identifying trends (such as an increase in route time or an increase/decrease in efficiency, perhaps due to changes in traffic congestion, a change in traffic patterns, or road construction; such a trend can merit re-evaluation of the optimal route), and identifying deviations that increase efficiency or performance. Whenever an improvement to the optimal route is identified, the optimal route can be redefined, such that the actual route data corresponding to the improvement are used to define the new optimal route. The actual route data can be conveyed to the remote computing device in a variety of ways, for example, using a wireless communication (such as radio frequency or IR data transfer), a hardwired interface, or by storage on portable memory storage media that can be physically moved to a desired location for data retrieval. If desired, the actual route data can be transmitted to the remote computing device in real-time, for example, if the vehicle is equipped with radio or cellular communication capability useful for this purpose. In one embodiment, the remote computing device parses the actual route data to locate route identifier data (which is preferably input by a driver at the beginning of the route), thereby enabling identification of which one of a plurality of predefined routes matches the route identifier data, so that corresponding optimal route data can be compared to the subsequently collected actual route data.
With reference an alternative exemplary embodiment in which no route identifier is required, the geographical position data portion of the actual route data is used (as opposed to the route identifier data) to determine to which optimal route the actual route data corresponds. The optimal route data (which itself can comprise previously collected actual route data) for each predefined route operated by a fleet operator will be collected (and generally stored in a memory accessible by the remote computer). Significantly, while some routes may share one or more GPS data points in common (because of overlapping portions of the routes), each route will be generally defined by a unique collection of GPS data points (i.e., each route will exhibit a unique fingerprint of points along the route). When the GPS data collected by a particular vehicle are analyzed, the data can quickly be correlated with the particular route/fingerprint of a corresponding optimal route, to enable a fleet operator to rapidly determine the route completed by the vehicle, and to enable the subsequently collected actual route data to be compared to the optimal route data. The actual route data can include geographical position data only, or both positional data and temporal data. The addition of temporal data will be useful when a fleet operator has numerous routes that share common positional features. The additional metric of time can enable routes having common geographic data to be more readily distinguishable. Another aspect of the novel concepts presented herein is directed to a system for implementing the functional steps generally as described above.
This Summary has been provided to introduce a few concepts in a simplified form that are further described in detail below in the Description. However, this Summary is not intended to identify key or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.
Various aspects and attendant advantages of one or more exemplary embodiments and modifications thereto will become more readily appreciated as the same becomes better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:
Exemplary embodiments are illustrated in referenced Figures of the drawings. It is intended that the embodiments and Figures disclosed herein are to be considered illustrative rather than restrictive.
As used herein and in the claims that follow, the term specific route is intended to refer to a route between a starting location and an ending location, that is intended to be traversed a plurality of times. For example, bus operators generally operate buses on a number of different specific routes, which are generally differentiated by a route number. A bus Route 51 might connect a shopping mall and an airport, while a bus Route 52 might connect the airport to a university. Route 51 and Route 52 are each different specific routes. A specific route may include one or more intermediate locations disposed between the starting location and the ending location, such intermediate locations representing geographical locations that the specific route intersects. A specific route may change over time; with intermediate locations being added or deleted from time to time. For example, bus Route 51 between the shopping mall and the airport may add or eliminate various bus stops between the airport and the shopping mall over time, but despite such changes, that bus route remains bus Route 51, a recognizable specific route. For any given specific route, there may be more than one possible path connecting the locations defining the specific route (a path being a set of geographical coordinates that can be navigated in a specific order to traverse a specific route). The term actual route data as employed herein and in the claims that follow refers to a set of data including the geographical coordinates (i.e., geographical position data) navigated by a vehicle as it traverses a specific route. Traversing a specific route using different paths will thus yield different actual route data. The term optimal route (and optimal route data), as used herein and in the claims that follow, refers to a set of data including the geographical coordinates corresponding to a particular path that has been identified as being preferred to other possible paths that can be used to traverse a specific route. In absolute terms, the optimal route may not be the best possible path, it simply is the path that has currently been defined as the optimal route. Preferably, when a better path is identified, the optimal route is redefined. Standards for evaluating whether one path (i.e., one set of actual route data) is better than another path are discussed in greater detail below.
In a block 16, the route is subsequently traversed again, also using a vehicle equipped to collect GPS data, and this subsequent traversal generates actual route data. In a block 18, the actual route data for the subsequent traversal are compared to the optimal route data. In a simple exemplary embodiment, such a comparison only determines the data that corresponds to the least time required to complete the route. If in a decision block 20, it is determined that the subsequent route data represents an improvement over the optimal route data (i.e., if the actual route data for the subsequent traversal is more efficient than the optimal route data), the previous optimal route data are replaced with the subsequent actual route data (i.e., the subsequent route data then becomes the new optimal route data) in a block 22. It should be recognized that many parameters other than time required to complete the route can be used to evaluate whether the subsequent traversal of the route was performed more efficiently than the alternative traversal of the route. Factors such as those identified above with respect to the additional data can be used to compare the optimal route data with subsequently obtained actual route data. Whenever an improvement is identified, the actual route data for the subsequent traversal of the route can automatically be applied to replace the optimal route data, or a route manager can be informed of the improvement, so that the route manager (or other pertinent individual tasked with making such a decision) can determine whether the optimal route data should be replaced with the subsequently obtained actual route data. Once the subsequently obtained actual route data are used to redefine the optimal route, then the method is ready to collect additional actual route data during yet another subsequent traversal of the route, as indicated by the link between block 22 and block 16.
Referring once again to decision block 20, if it is determined that the subsequent traversal of the route is not more efficient than the optimal route as defined by the optimal route data, then in a decision block 24, it is determined whether any deviations between the optimal route data and the actual route data collected in the subsequent traversal have occurred. Such deviations can include missed stops, additional mileage required to complete the route, additional time required to complete the route, higher engine RPMs required during completion of the route, more fuel required during completion of the route, higher engine temperature reached during completion of the route, higher oil temperature reached during completion of the route, higher coolant temperature reached during completion of the route, and/or that a predefined boundary based on the optimal route was breached (for example, the driver ran a personal errand, or took the vehicle home rather than to a fleet yard). If so, then in a block 26 an exception report is generated. The method is then ready to collect additional actual route data for the next (i.e., yet another) traversal of the route, as indicated by the link between block 26 and block 16. Note that generation of an exception report may result in a disciplinary action, if it is determined that a driver of the vehicle violated a fleet policy. In some cases, a deviation will be permissible, because the deviation was required due to traffic conditions, such as accidents or road construction. It should also be recognized that an exception report may not be generated until any deviation exceeds a predefined value. For example, a fleet operator may determine that any reduction in time required to complete a traversal of the route never requires an exception report (as such a reduction in time is generally considered beneficial). Other fleet operators may want exception reports generated even when the deviation represents an increase in efficiency, so that the route manager can study route data representing increases in efficiency. Still other fleet operators may allow deviations of up to a certain percentage change (or other predefined limit) before an exception report is issued, recognizing that regularly changing traffic patterns will cause subtle variations in the route data.
Referring once again to decision block 24, if no deviation is identified, then the method is ready to collect additional actual route data for yet another subsequent traversal of the route, as indicated by the link between block 24 and block 16.
Note that the method described above enables optimal route data to be initially defined, and then regularly dynamically updated when improvements are identified, without requiring the use of route planning software. It should also be recognized that some fleet operators may choose to intentionally vary a subsequent traversal of a route from the optimal route, in order to determine if the variation leads to an improvement. Such intentional variations can be instituted on a case-by-case basis (for example, when exception reports note a trend of decreasing efficiency over time, perhaps due to changes in long term traffic patterns, routes, or traffic volumes), or can be regularly (i.e., periodically) scheduled (e.g., on a weekly, bi-weekly, or monthly basis, it being understood that such intervals are intended to be exemplary and not limiting).
Fleet operators generally operate vehicles over a plurality of different routes. Several techniques can be used to enable optimal route data for a particular route to be correlated to actual route data collected during subsequent traversal of the route. The vehicle operator can input a route identifier (ID) into a data input device that is logically coupled with the geographical position sensor employed to track the vehicle's position as it traverses the route. The route ID can then be incorporated into the actual route data, such that when the actual route data are compared to the optimal route data, the route ID enables the corresponding optimal route data to be identified (because the corresponding optimal route data will include the same route ID). Alternatively, the actual route data can be compared to the optimal route data for all of the fleet operator's routes, until a best match is found. The geographical positions in each set of actual route data and in each set of optimal route data can be considered analogous to fingerprints, and conventional data processing techniques can be used to rapidly determine which set of optimal route data most closely corresponds to a set of subsequently obtained actual route data. Unless the subsequent traversal of a specific route varies significantly from the optimal route as defined by the optimal route data, the subsequently collected actual route data should be able to be matched to the corresponding optimal route data.
In general, analysis of the actual route data (i.e., comparing subsequently obtained actual route data to previously determined optimal route data) will be carried out by a remote computing device. The remote computing device in at least one embodiment comprises a computing system controlled or accessed by the fleet operator. The remote computing device can be operating in a networked environment, and in some cases, may be operated by a third party under contract with the fleet operator to perform such services.
Also included in processing unit 254 are a random access memory (RAM) 256 and non-volatile memory 260, which can include read only memory (ROM) and may include some form of memory storage, such as a hard drive, optical disk (and drive), etc. These memory devices are bi-directionally coupled to CPU 258. Such storage devices are well known in the art. Machine instructions and data are temporarily loaded into RAM 256 from non-volatile memory 260. Also stored in the non-volatile memory are an operating system software and ancillary software. While not separately shown, it will be understood that a generally conventional power supply will be included to provide electrical power at voltage and current levels appropriate to energize computing system 250.
Input device 252 can be any device or mechanism that facilitates user input into the operating environment, including, but not limited to, one or more of a mouse or other pointing device, a keyboard, a microphone, a modem, or other input device. In general, the input device will be used to initially configure computing system 250, to achieve the desired processing (i.e., to compare subsequently collected actual route data with optimal route data, to identify any deviations and/or efficiency improvements). Configuration of computing system 250 to achieve the desired processing includes the steps of loading appropriate processing software into non-volatile memory 260, and launching the processing application (e.g., loading the processing software into RAM 256 for execution by the CPU) so that the processing application is ready for use. Output device 262 generally includes any device that produces output information, but will most typically comprise a monitor or computer display designed for human visual perception of output. Use of a conventional computer keyboard for input device 252 and a computer display for output device 262 should be considered as exemplary, rather than as limiting on the scope of this system. Data link 264 is configured to enable data collected in connection with operation of a vehicle to be input into computing system 250 for subsequent analysis to compare subsequent route data with optimal route data, to identify any deviations and/or efficiency improvements. Those of ordinary skill in the art will readily recognize that many types of data links can be implemented, including, but not limited to, universal serial bus (USB) ports, parallel ports, serial ports, inputs configured to couple with portable memory storage devices, FireWire ports, infrared data ports, wireless data communication such as Wi-Fi and Bluetooth™, network connections via Ethernet ports, and other connections that employ the Internet.
In general, route identification data input 62 comprises a keyboard or function keys logically coupled to GPS unit 64. It should be recognized, however, that other data input structures (i.e., structures other than keyboards) can instead be implemented, and that the concepts disclosed herein are not limited to any specific identification data input device. The operator can also use a handheld electronic data collection device to scan a token that uniquely corresponds to a specific one of the plurality of the predefined routes. For example, the operator can be provided with a plurality of tokens, each of which uniquely corresponds to a different one of the plurality of predefined routes, such that the user selects the appropriate token, and uses the handheld electronic data collection device to scan the appropriate token to input the ID for the selected route. Many different tokens/sensor combinations can be implemented. Barcodes and optical scanners represent one combination, while radio frequency identification (RFID) tags and RFID readers represent another such combination. The advantage of a token/sensor combination is that the handheld electronic data collection device is not required to incorporate a keypad for entry of the route identification data. As a further alternative, the route identification data can be entered verbally, using voice recognition software that can recognize and interpret the verbal input. In embodiments where the route identification data are entered into a portable electronic data collection device, the portable electronic data collection device can also be employed to collect other operational/vehicle data (i.e., operational data other than GPS data, monitored by sensors 66). Alternatively, the other operation data collected from sensors 66 can be conveyed to an onboard computer, or to GPS unit 64, to be combined with the GPS data and the route ID data, to provide the actual route data for transmittal to the remote computing device. The other operational data can include inspection data and/or data collected from sensors incorporated into the vehicle (e.g., sensors configured to collect data such as engine temperature data, oil temperature data, brake temperature data, tire pressure data, and tire temperature data, it being understood that such types of data are intended to be exemplary, rather than limiting).
It should be recognized that alternative configurations to enable the actual route data for a subsequent traversal of a specific route to be conveyed to a remote computer can be employed. For example, GPS data and the route ID data can be stored in an onboard computer, and then conveyed to a remote computer by a variety of different data links, including hard wired data transmission, wireless data transmission, and data transmission accomplished by carrying a portable data storage device from the vehicle to the site of the remote computer. The specific type of data link employed is not significant. Those of ordinary skill in the art will recognize that data can be communicated in a variety of different ways, including, but not limited to, via serial data ports, parallel data ports, USB data ports, infrared communication ports, Firewire ports, and/or using radio frequency transmitter/receivers that are linked in communication.
Although the concepts disclosed herein have been described in connection with the preferred form of practicing them and modifications thereto, those of ordinary skill in the art will understand that many other modifications can be made thereto within the scope of the claims that follow. Accordingly, it is not intended that the scope of these concepts in any way be limited by the above description, but instead be determined entirely by reference to the claims that follow.
This application is a continuation-in-part of prior co-pending application Ser. No. 11/425,222, filed on Jun. 20, 2006, the benefit of the filing date of which is hereby claimed under 35 U.S.C. §120.
Number | Name | Date | Kind |
---|---|---|---|
4025791 | Lennington et al. | May 1977 | A |
4258421 | Juhasz et al. | Mar 1981 | A |
4325057 | Bishop | Apr 1982 | A |
4602127 | Neely et al. | Jul 1986 | A |
4763356 | Day, Jr. et al. | Aug 1988 | A |
4799162 | Shinakawa et al. | Jan 1989 | A |
4804937 | Barbiaux et al. | Feb 1989 | A |
5058044 | Stewart et al. | Oct 1991 | A |
5068656 | Sutherland | Nov 1991 | A |
5223844 | Mansell et al. | Jun 1993 | A |
5321629 | Shirata et al. | Jun 1994 | A |
5399844 | Holland | Mar 1995 | A |
5459304 | Eisenmann | Oct 1995 | A |
5459660 | Berra | Oct 1995 | A |
5557254 | Johnson et al. | Sep 1996 | A |
5557268 | Hughes et al. | Sep 1996 | A |
5585552 | Heuston et al. | Dec 1996 | A |
5600323 | Boschini | Feb 1997 | A |
5610596 | Petitclerc | Mar 1997 | A |
5629678 | Gargano et al. | May 1997 | A |
5671158 | Fournier et al. | Sep 1997 | A |
5680328 | Skorupski et al. | Oct 1997 | A |
5719771 | Buck et al. | Feb 1998 | A |
5731893 | Dominique | Mar 1998 | A |
5808565 | Matta et al. | Sep 1998 | A |
5874891 | Lowe | Feb 1999 | A |
5942753 | Dell | Aug 1999 | A |
5995898 | Tuttle | Nov 1999 | A |
6054950 | Fontana | Apr 2000 | A |
6078255 | Dividock et al. | Jun 2000 | A |
6107917 | Carrender et al. | Aug 2000 | A |
6128959 | McGovern et al. | Oct 2000 | A |
6169943 | Simon et al. | Jan 2001 | B1 |
6236911 | Kruger | May 2001 | B1 |
6253129 | Jenkins | Jun 2001 | B1 |
6256579 | Tanimoto | Jul 2001 | B1 |
6396413 | Hines et al. | May 2002 | B2 |
6456039 | Lauper et al. | Sep 2002 | B1 |
6505106 | Lawrence et al. | Jan 2003 | B1 |
6529808 | Diem | Mar 2003 | B1 |
6539296 | Diaz et al. | Mar 2003 | B2 |
6594621 | Meeker | Jul 2003 | B1 |
6597973 | Barich et al. | Jul 2003 | B1 |
6609082 | Wagner | Aug 2003 | B2 |
6614392 | Howard | Sep 2003 | B2 |
6664897 | Pape et al. | Dec 2003 | B2 |
6671646 | Manegold et al. | Dec 2003 | B2 |
6708113 | Von Gerlach et al. | Mar 2004 | B1 |
20010053983 | Reichwein et al. | Dec 2001 | A1 |
20020147610 | Tabe | Oct 2002 | A1 |
20020150050 | Nathanson | Oct 2002 | A1 |
20030030550 | Talbot | Feb 2003 | A1 |
20030033061 | Chen et al. | Feb 2003 | A1 |
20030109973 | Hensey et al. | Jun 2003 | A1 |
20030120745 | Katagishi et al. | Jun 2003 | A1 |
20040009819 | Koga | Jan 2004 | A1 |
20050273250 | Hamilton et al. | Dec 2005 | A1 |
20070179709 | Doyle | Aug 2007 | A1 |
20080154489 | Kaneda et al. | Jun 2008 | A1 |
Number | Date | Country | |
---|---|---|---|
20070294031 A1 | Dec 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11425222 | Jun 2006 | US |
Child | 11675502 | US |