Patent Grant
9582999
The following disclosure relates to a traffic volume estimation based on probe data, and more particularly, to a traffic volume estimation based on probe data and an estimation of traffic density from the probe data.
Traffic reporting is the study of movement of vehicles on the roads. Analytical techniques may manage and track traffic information and derive travel times, guide driving behavior and optimize road infrastructure for cities. Traffic Message Channel (TMC) and other traffic services deliver traffic information to customers. Traffic incidents and traffic flow are reported through broadcasts. Traffic delays may be caused by one or more of congestion, construction, accidents, special events (e.g., concerts, sporting events, festivals), weather conditions (e.g., rain, snow, tornado), and so on. Traffic services typically provide a speed or a range of speeds (e.g., low, medium, high) for a particular road. Another characteristic, traffic volume measures the total throughput of traffic for a particular road over a given span of time. Traffic volume could be measured using sensors that detect every car passing a particular point on the road. The sensors could be any combination of inductive loops embedded in the roadway, radar, or cameras. These sensors can be expensive to install and maintain, and their availability varies from location to location.
Method, systems, and devices are described for determining traffic volume of one or more path segments. A computing device may receive probe data associated with a road segment from one or more sources. The computing device selects either a free flow algorithm or a congestion algorithm for the probe data, and calculates an estimated probe quantity from historical data using either the free flow algorithm or the congestion algorithm. A traffic volume may be estimated from the estimate probe quantity.
Exemplary embodiments of the present invention are described herein with reference to the following drawings.
Traffic estimation, modeling, prediction, and management have traditionally depended on measurement of both traffic speeds and traffic volumes. The increasing ubiquity of personal mobile devices, such as dedicated global positioning system (GPS) units, cell phones, or other navigation devices, provides another source of data, probe points. Probe points provide information about speed and heading for a vehicle. Samples for the speed of the vehicle may be reported in a configurable time interval (e.g., 1 second, 10 seconds, 1 minute, or another value). Currently, the percentage of vehicles about which data is collected (e.g., penetration rate) may be on the order of 0.1% to 5%. This amount of data is generally sufficient to generate reliable estimates of current traffic speed, especially on highways, and when real-time data is missing at a particular location, historical data may be used to fill in the gaps.
In contrast, the low penetration rate and uneven sampling rate may disrupt attempts to determine traffic volumes directly from probe data. But by combining real-time and historical data about probe volumes, traffic volumes may be estimated using probe volumes as a proxy. In congested conditions, this provides real-time estimates of traffic volume. In one example, traffic volumes are estimated in free-flow conditions based on weekly patterns.
Traffic on a given stretch of road can be characterized by a density (ρ) in (vehicles/unit distance), traffic flow (q) in (vehicles/unit time), and velocity (v) in (distance/unit time). The distance may be miles, kilometers, meters or another length unit. The time may be hours, minutes, seconds or another time unit. Traffic flow, density, and velocity are related according to equation 1.
q=ρv Eq. 1
The triangular fundamental diagram demonstrates that below a certain critical density 21 in
Using the above Equation 1 for flow, density and velocity, and the triangular fundamental diagram in terms of the equivalent relationship between density and velocity, a diagram for velocity may be derived, as shown in
The diagram for velocity may include two or more piecewise functions. The left-hand portion function 27 is a horizontal line segment that indicates that velocity is constant, at the free flow velocity Vf, until density reaches the critical density 21. The right-hand portion 29 is a non-linear function. The right-hand portion 29 may be logarithmic, exponential, elliptical, or hyperbolic function. When the density versys flow fundamental diagram is triangular, the right hand-portion 29 of the diagram for velocity is hyperbolic. The right-hand portion may have a high slope near the critical density and a lower slope as density increases. The right-hand portion 29 of the diagram for velocity demonstrates that when traffic is congested there is a fixed relation between traffic velocity and density on a given segment of road. This relationship may be limited to congested conditions. A congestion condition may be defined based on speed or flow. The congestion condition may be defined as densities greater than the point at which the flow is a maximum. The maximum of the flow may be derived from probe data, sensor data, or a combination. Alternatively, the congestion condition may be a predetermined percentage (e.g., 50%, 70%, or 80%) of the speed limit. In free-flow conditions velocity is roughly constant, so any relation between velocity and density may have less of a correlation.
Equation 2 demonstrates that when the density is less than the critical density, flow is equal to a constant velocity v0 (e.g., the speed limit or a free flow speed) multiplied by density, and when the density exceeds the critical density, flow is equal to a linearly decreasing function of density having a slope equal to a jam propagation speed (w). The constant K is chosen to make the function q continuous at the critical density.
Equivalently, by combining Equation 1 and Equation 2, Equation 3 demonstrates a function for velocity. Velocity is constant at v0 when the density is less than the critical density. Velocity is a hyperbolic function of constant K, density, and the jam propagation speed when density is greater than the critical density.
Sensors such as inductive loops may be configured to measure flow, occupancy (the proportion of time that a vehicle is above the sensor) and velocity directly. An inductive loop may include one or more windings of electrically conductive material (e.g., wire) buried within or mounted adjacent to a roadway. A current flowing through the conductive material creates a magnetic field. As vehicles pass through or near the magnetic field, the magnetic field is altered. A counting device electrically connected to the inductive loop counts the number of disruptions in the magnetic field, which is also the number of vehicles that travel the road, and occupancy. Occupancy is related to density by the average length of a vehicle passing over the sensor. Density is estimated using an estimate of this average vehicle length, which can vary based on time and type of road. Some loop sensors consist of two loops, and the delay in sensing a vehicle between the two loops gives a direct estimate of velocity. For those loop sensors consisting of only a single loop, velocity is estimated from the flow count and the density estimate, using Eq. 1.
Probe points are direct measurements of velocity of the probe (e.g., mobile device) coming from a single vehicle. The probe point may be generated based on reported positions of the mobile device 122 or multiple mobile devices. The mobile device 122 may report location data from which the server 125 determines the speed of the mobile device 122. Alternatively, the mobile device 122 may calculate speed and report speed directly to the server 125.
It has been found empirically that a given stretch of road traffic tends to show a fixed relationship between density and flow, known as the triangular fundamental diagram as shown in
On average, the number of individual probe points (E) observed on a given segment of road over a fixed period of time is proportional to the average traffic density on that segment of road, as shown by Equation 4. In other words, Equation 4 provides a number of unique probe points, which is substantially proportional to and estimates traffic volume.
E=ρ·L·Δt·R Eq. 4
E(# probe points)=the expected number of probe points observed, ρ=Density (vehicles/mile), L=length of road segment (miles), Δt=duration of epoch (hours), and R=average probe rate (probes/vehicle/hour). Thus, for any density determined from on a lookup table based on
Equation 4 is independent of velocity. The variance in the number of probe points observed in a small period of time is very large, so a real-time count of probe points does not give a good estimate of traffic density. But by averaging together many time periods with similar traffic conditions, the average probe count for those periods estimate density.
In free-flow conditions, the velocity is not closely correlated with the traffic density. But traffic volumes tend to be repeatable from week to week. So roughly the same volume of traffic on a given segment of road at the same time of day and day of the week may be expected. Such a relationship allows volumes in free-flow conditions to be estimated using probes, using Equation 4 and Equation 1.
Traffic density for a given segment of road based on probes may be estimated piecewise, using one algorithm for congested conditions and another algorithm for free-flow conditions.
The algorithm for congested traffic examines time intervals (e.g., epochs) in a predetermined time duration (e.g., a year). All time intervals may be used or the time intervals may be filtered based on a predetermined factor (e.g., time, weather, events, traffic on other roads). The time intervals are grouped by velocity. The velocity assigned to each time interval may be an average velocity of the probes for the time interval or may be based on some other algorithm used to estimate velocity from discrete measurements, such as a Kalman filter. When no probe data is available for a given time interval, the velocity estimate may be based on historical data.
Bins may be created to group the velocity estimate by velocity intervals (e.g., 0-10 m.p.h., 10-20 m.p.h., 20-30 m.p.h., 30-40 m.p.h., 40-50 m.p.h., and so on). The intervals may be the same size or different sizes. The sizes of the intervals may be based on the distribution of the velocity data. In each bin, the number of probes for all of the epochs in the bin is counted. The average number of probe points per epoch (or the total number of probe points) observed for each of the velocity intervals across all of the time epochs is calculated.
The algorithm for free-flow traffic uses historical data for individual time of day and days of the week from the historical data in which traffic was in free flow. For example, the historical traffic data for which velocity was at the free flow velocity is organized by epoch (e.g., all Tuesdays at 2:00 p.m. with free-flow traffic are grouped together). The average number of probe points for each group of free-flow epochs is calculated.
The number of probe points from either algorithm is used to estimate the traffic volume using the percentage or vehicles on the road segment that are sending probe data. The relationship may be derived by geographic area or by time frame. The relationship may be associated with individual road segments. In one example, a stretch of road nearby with a loop detector, which detects precise traffic volume, is used to derive the relationship between the number of probe points and the total traffic volume.
In one example, for new observations, a single probe point or multiple probe points may be collected to give a real-time estimate of current traffic velocity. From the velocity and time, either the algorithm for free-flow traffic or the algorithm for congestion traffic is selected. From either algorithm, the average number of probe points for this road segment at this time and traffic conditions is estimated. Using Equation 4, the traffic density p in each case is equal to those average probe counts divided by the length L of the road segment, the duration Δt of the time epoch, and the average probe rate per vehicle R. Accordingly, the volume or flow q for the road segment may also be estimated using according to Equation 1.
In one example, probe points are weighted depending on the sources when building the model for free-flow traffic, the model for congested traffic, or both. When counting probes, proves from source A may be associated with a first weight and probes from source B may be associated with a second weight The weights may be assigned based on confidence (e.g., a fleet of trucks may produce more reliable data than mobile phones) or quantity of the probes. When source A is assigned a weight of 1 and source B is assigned a weight of 0.2, and for a given epoch of the historical data there are two data points from source A and three probes from source B, a score or probe count for the epoch may be 2.6. The score or probe count is a measure of the confidence of the data used to generate the free-flow traffic model or the congested traffic model. The calculations may be repeated for multiple or all time epochs.
Testing of this algorithm has been performed on highways in the San Francisco bay area, and compared to ground truth measurements of flow obtained from inductive loop detectors maintained by the Department of Transportation. The tests using only probe gave statistically reliable results compared to the loop measurements, in both free-flow and congested conditions.
Volumes estimated using these algorithms have several applications in traffic measurement and management. Operations performance measurement involves the identification of road segments with recurring congestion problems and estimations of the number of vehicles affected by the congestion and the cost in vehicle-hours of the delays. Volume heat maps and understanding of utilization of existing capacity may be generated using this information about road capacities and traffic volume patterns can be used to estimate the effects of changes in either the road network itself or its usage patterns. For example, in those areas suffering from recurring congestion estimates about how much additional capacity would be needed to alleviate the congestion, or what the effects of other changes (e.g. congestion pricing) might be.
In addition, the effects (both on volumes and speeds) of potential changes in demand, due, for example, to new construction, population growth, changes in employment patterns, and other factors may be estimated. These algorithms may also be applied to traffic management for arterials, possibly in conjunction with separate work measuring driver behavior around on-ramps and off-ramps. A better understanding of long-term volume on arterials could be used, for example, to improve signal timing algorithms.
The mobile device 122 may be any type of computing device, including a personal computer. The mobile device may be a smart phone, a mobile phone, a personal digital assistant (“PDA”), a tablet computer, a notebook computer, a personal navigation device (“PND”), a portable navigation device, a built-in vehicle navigation system, and/or any other known or later developed portable or mobile computing device.
The optional workstation 128 is a general purpose computer including programming specialized for the following embodiments. For example, the workstation 128 may receive user inputs for defining the time intervals, the relationship between probe quantity and traffic volume, or other values. The workstation 128 includes at least a memory, a processor, and a communication interface.
The developer system 121, the workstation 128, and the mobile device 122 are coupled with the network 127. The phrase “coupled with” is defined to mean directly connected to or indirectly connected through one or more intermediate components. Such intermediate components may include hardware and/or software-based components.
From the location data 40 a geographic database (e.g., database 123) may be queried to determine a road segment 41. The geographic database may store locations of opposing nodes for the road segment 41. The closest road segment to the geographic coordinates may be selected. In another example, the coordinates should be within a predetermined distance (e.g., 1 meter, 10 feet) to the road segment. An algorithm called a map-matcher may match the road segments to the location data.
A model selection 51 is determined as a function of the speed data 50, the time data 30, and the location data 40. The speed data 50 may be compared to a threshold value to determine whether a free flow model 31 or a congestion model 33 should be used. As an example, when the speed data 50 is less than the threshold value, the congestion model 33 may be used. When the speed data 50 is more than the threshold value, the free flow model 31 may be used.
The threshold value for the model selection 51 may be chosen based on time data 30. For example, the speed values that signify congestion may depend on the time of day or day of week. In the early morning hours (e.g., 1-3 A.M.), slow speeds may not be good indicators of congestion because congestion is so unlikely. Time may be divided into time epochs.
Example sizes for time epochs include 15 minutes, 30 minutes, 1 hour, or another value. In the example of 15 minute epochs, the traffic data is formatted into 96-dimensional vectors, in which each of the 96 components describe traffic for a different 15 minute epoch. For example, a daily traffic vector having 96 components may be defined as x→=(x_1, . . . , x_n), where n=96. The values contained in the vector may be speeds for a given epoch. For example, the first element of the vector is the average speed for time between 0:00 a.m. to 0:15 a.m., and the 50th element of the vector is the average speed for time between 12:15 p.m. and 12:30 p.m. Other vectors may be used. In another example, some days may have only two time epochs: rush hour and not rush hour. Table 1 includes example road segments having one, two, or three different time epochs.
The threshold value for the model selection 51 may be chosen based on functional classification of the road segment. For example, interstate highways may be considered congested at higher speeds than state highways or local roads. Table 2 lists example classification systems that may be assigned numeric values for functional class. The functional class of the road segment may be described as a numerical value (e.g., 1, 2, 3, 4, and 5) represented in the feature vector. Functional class 1 may be highways while functional class 5 may be small streets. Table 2 further illustrates schemes having three to six functional classes. The various functional classifications may have different threshold speed values for determination congestion versus free flow. The threshold speed values may generally go from high speeds to low speeds as Table 2 moves from the top to the bottom. The threshold value for the model selection 51 may be chosen based on both time epoch and functional classification of the road segment.
One example of a simple system includes the functional classification maintained by the United States Federal Highway administration. The simple system includes arterial roads, collector roads, and local roads. The functional classifications of roads balance between accessibility and speed. An arterial road has low accessibility but is the fastest mode of travel between two points. Arterial roads are typically used for long distance travel. Collector roads connect arterial roads to local roads. Collector roads are more accessible and slower than arterial roads. Local roads are accessible to individual homes and business. Local roads are the most accessible and slowest type of road. In one example, the arterial road has a high threshold value (e.g., 50 mph), the collector road has a medium threshold value (e.g., 30 mph), and the local road has a small threshold value (e.g., 10 mph).
An example of a complex functional classification system is the urban classification system. Interstates include high speed and controlled access roads that span long distances. The arterial roads are divided into principle arteries and minor arteries according to size. The collector roads are divided into major collectors and minor collectors according to size. Another example functional classification system divides long distance roads by type of road or the entity in control of the highway. The functional classification system includes interstate expressways, federal highways, state highways, local highways, and local access roads. Another functional classification system uses the highway tag system in the Open Street Map (OSM) system. The functional classification includes motorways, trunk roads, primary roads, secondary roads, tertiary roads, and residential roads.
Using either the free flow model 31 or the congestion model 33, a traffic volume estimation 35 is made. The traffic volume estimation 35 may be a probe quantity or an indication of the total number of vehicles traveling on the selected road segment. When the free flow model 31 is used, the traffic volume estimation 35 may be made primarily based on time epoch (e.g., time data 30). The free flow model 31 may include a lookup table that associates possible traffic volumes according to time epoch and road segment. In one example, the lookup table outputs traffic volume directly, and in another example, the lookup table outputs traffic density, and traffic volume is calculated according to one of the relationships above. The lookup table (e.g., free flow lookup table) may be generated from historical data collected on each road segment and averaged within individual time epochs.
When the congestion model 33 is used, the traffic volume estimation 35 may be made primarily based on the speed data 50. The congestion model 33 may include a lookup table (e.g., congestion model lookup table) that associates possible traffic volume according to speed or velocity. In one example, the lookup table outputs traffic volume directly, and in another example, the lookup table outputs traffic density, and traffic volume is calculated according to one of the relationships above. The traffic volume may be independent of time epoch. That is, the congestion model lookup table may be based on the average traffic volume for specific speeds or speed ranges at any time.
In one example, the congestion model lookup table may span multiple road segments. That is, the congestion model lookup table may be based on the average traffic volume for speed ranges on a set of multiple road segments for speed ranges at any time. The set of multiple road segments may be road segments for a single road. For example, the set of multiple road segments may be a series or sequence of road segments making up a highway. The set of multiple road segments may be the road segments in a geographic region (e.g., town, city, or other region).
In one example, after the congestion model 33 is used the model selection 51 may revert back to the free flow model 31. For example, in some scenarios, the model selection 51 overrules a determination that the road segment is under congestion. For example, even when the current speed of the road segment is less that the threshold velocity, the model selection 51 determines that a current time period for the road segment is very unlikely to experience congestion. Such congestion blackout times may occur in the early hours of the morning, during holidays, or during certain events. For example, road segments in a geographic region or along a highway may be deemed not to ever experience congestion during 1 A.M. to 4 A.M. Other road segments (e.g., in downtown areas) may experience congestion during this time. Some road segments may be deemed to not ever experience congestion during major holidays.
The traffic volume estimation 35 may calculate the estimate traffic volume as a weighted average among multiple sources. The sources may include one or more types of mobile devices. The mobile devices may be fleet tracking devices carried by a fleet of vehicles. The mobile devices may be a set of mobile phones running a particular mobile application. The mobile application may be a map application that provides navigation or mapping features to a user. The mobile application may also report location data with or without knowledge of the user. The mobile application may provide an incentive to the user to permit sharing of location data. The incentive may be a compensatory incentive (e.g., money, coupon, or application store credits).
The one or more sources may be prioritized to impact the traffic volume estimation 35 differently. For example, a first coefficient may be assigned to the probe data from a first source, and a second coefficient may be assigned to the probe data from the second source. The estimated probe quantity may be calculated as a function of the first coefficient and the second coefficient or the traffic volume is estimated from the first coefficient and the second coefficient. The coefficients may be a fractional or decimal value between 0 and 1.
The coefficients may be assigned as a function of the sampling rate of the respective probe data. For example, mobile device may report probe data multiple times on the same road segments, and different types of mobile devices may have different sampling rates. In one example, the probe data includes a device identifier indicative of the manufacturer of the mobile device, the operating of the mobile device, or the mobile application that collects probe data. The coefficient for the probe data may be assigned as a function of one or more components of the device identifier.
In one example, fleet tracking devices are weighted with a high coefficient and other mobile devices are weighted with a low coefficient.
At act S103, the processor 300 selects a free flow algorithm or a congestion algorithm from the probe data. The processor 300 may compare the velocity value from the probe data to a congestion threshold in order to select the algorithm. The congestion threshold may be received from a user or predetermined. The congestion threshold may be variable as a function of time of day, time of year, weather, or another factor. The congestion threshold may be a function of the road segment (e.g., different road segments may have different congestion thresholds).
At act S105, the processor 300 calculates an estimated probe quantity from historical data using either the free flow algorithm or the congestion algorithm. The free flow algorithm may estimate probe quantity based on an average of the number of probes over an extended period of time (e.g., a year) for the particular epoch. The free flow algorithm includes a free flow lookup table that associates a time epoch derived from the probe data to a traffic density.
The congestion algorithm may estimate probe quantity independent of the epoch and based on the velocity in other epochs over the extended period of time. The congestion algorithm includes a congestion lookup table that associate a velocity derived from the probe data to a traffic density. In one example, another comparison is made. The congestion algorithm may identify a time epoch from the probe data, access a threshold velocity based on the time epoch, and compare the threshold velocity to the velocity derived from the probe data. When the velocity from the probe data exceeds the threshold velocity, the congestion algorithm may revert to the free flow algorithm.
At act S107, the processor 300 estimates traffic volume from the estimated probe quantity. The relationship between probe quantity and traffic volume may be empirical. Measurements may be taken along a stretch of road using sensors. The sensor data is compared to the probe data for the stretch of road to derive the relationship. For a road, a type of road, or a geographical area the relationship between probe quantity and traffic volume may be substantially consistent or constant.
At act S201, the position circuitry 207 or the controller 200 is configured to determine a geographic position of the mobile device 122. At act S203, the controller 200 generates probe data including the geographic position associated with a road segment and a current speed of the mobile device 122.
At act S205, the controller 200 sends the probe data to traffic volume model including a congestion flow lookup table listing the road segment and a free flow lookup table listing the road segment. The traffic volume model may be stored at memory 204 and executed by the controller 200. In another example, the traffic model volume may be executed at the server 125.
At act S207, the controller 200 receives traffic volume data from the traffic volume model. The controller 200 may be configured to predict a future traffic state of a subsequent road segment based on the traffic volume data for the road segment. The controller 200 may calculate predictive traffic levels for downstream road segments based on the traffic volume data. For example, a predicted traffic level 15 minutes or an hour into the future for a particular road segment may be calculated based on current traffic volumes of the road segments that feed into the road segment. This may be particularly useful on a highway with a lane closure. The segment may not be experiencing traffic delays now, and upstream segments having no lane closures may not be experiencing traffic delays now. However, as traffic volume increases in the upstream segments, the controller 200 may determine that the downstream segment with the closure will likely experience traffic delays. The controller 200 may generate a message for display 211 to instruct the driver to choose an alternative route or otherwise warn the driver regarding the upcoming traffic congestion that may soon form.
Governments may also utilize the traffic volume data. When potential traffic congestion can be recognized ahead of time, measures may be taken to mitigate the traffic congestion. The allocation of express lanes or high occupancy lanes may be adjusted to relieve traffic pressure in one direction when the other direction would normally be assigned to express lanes at that time. On ramps may be closed or restriction using traffic lights or metering. A moving road block may be dispatched to regulate the flow and prevent stop and go traffic. Pricing of toll roads may be changed to match demand.
Other application for the traffic volume data may be useful over time. Traffic volume data that measures the number of vehicles passing a point may be used to calculate the cost of billboards or other advertising or optimal locations for billboards or other advertising. The traffic volume data may be used to identify roads in need of widening or other construction. The traffic volume data may be used to monitor wear and tear of road surfaces or paint to determine when replacement is needed without initially inspecting the road.
The position circuitry 207 is configured to collect probe data. Subsequent position measurements may be used to calculate the velocity of the mobile device 122. Velocity may be measured over several location data points. The position circuitry 207 also generates location data for the mobile device 122.
The input device 203 may include one or more buttons, keypad, keyboard, mouse, stylist pen, trackball, rocker switch, touch pad, voice recognition circuit, or other device or component for inputting data. The input device 203 may be combined with a display as a touch screen, which may be capacitive or resistive. The display may be a liquid crystal display (LCD) panel, light emitting diode (LED) screen, thin film transistor screen, or another type of display.
The processor 300 and/or the controller 200 may include a general processor, digital signal processor, an application specific integrated circuit (ASIC), field programmable gate array (FPGA), analog circuit, digital circuit, combinations thereof, or other now known or later developed processor. The processor 300 and/or the controller 200 may be a single device or combinations of devices, such as associated with a network, distributed processing, or cloud computing.
The memory 301 and/or the memory 204 may be a volatile memory or a non-volatile memory. The memory 301 may include one or more of a read only memory (ROM), random access memory (RAM), a flash memory, an electronic erasable program read only memory (EEPROM), or other type of memory. The memory 204 may be removable from the mobile device 122, such as a secure digital (SD) memory card.
The communication interface 305 and/or the communication interface 205 may include any operable connection. An operable connection may be one in which signals, physical communications, and/or logical communications may be sent and/or received. An operable connection may include a physical interface, an electrical interface, and/or a data interface. The communication interface 305 and/or the communication interface 205 provides for wireless and/or wired communications in any now known or later developed format.
The network 127 may include wired networks, wireless networks, or combinations thereof. The wireless network may be a cellular telephone network, an 802.11, 802.16, 802.20, or WiMax network. Further, the network 127 may be a public network, such as the Internet, a private network, such as an intranet, or combinations thereof, and may utilize a variety of networking protocols now available or later developed including, but not limited to TCP/IP based networking protocols.
While the non-transitory computer-readable medium (e.g., memory 301, memory 204) is shown to be a single medium, the term “computer-readable medium” includes a single medium or multiple media, such as a centralized or distributed database, and/or associated caches and servers that store one or more sets of instructions. The term “computer-readable medium” shall also include any medium that is capable of storing, encoding or carrying a set of instructions for execution by a processor or that cause a computer system to perform any one or more of the methods or operations disclosed herein.
In a particular non-limiting, exemplary embodiment, the computer-readable medium can include a solid-state memory such as a memory card or other package that houses one or more non-volatile read-only memories. Further, the computer-readable medium can be a random access memory or other volatile re-writable memory. Additionally, the computer-readable medium can include a magneto-optical or optical medium, such as a disk or tapes or other storage device to capture carrier wave signals such as a signal communicated over a transmission medium. A digital file attachment to an e-mail or other self-contained information archive or set of archives may be considered a distribution medium that is a tangible storage medium. Accordingly, the disclosure is considered to include any one or more of a computer-readable medium or a distribution medium and other equivalents and successor media, in which data or instructions may be stored.
In an alternative embodiment, dedicated hardware implementations, such as application specific integrated circuits, programmable logic arrays and other hardware devices, can be constructed to implement one or more of the methods described herein. Applications that may include the apparatus and systems of various embodiments can broadly include a variety of electronic and computer systems. One or more embodiments described herein may implement functions using two or more specific interconnected hardware modules or devices with related control and data signals that can be communicated between and through the modules, or as portions of an application-specific integrated circuit. Accordingly, the present system encompasses software, firmware, and hardware implementations.
In accordance with various embodiments of the present disclosure, the methods described herein may be implemented by software programs executable by a computer system. Further, in an exemplary, non-limited embodiment, implementations can include distributed processing, component/object distributed processing, and parallel processing. Alternatively, virtual computer system processing can be constructed to implement one or more of the methods or functionality as described herein.
As used in this application, the term ‘circuitry’ or ‘circuit’ refers to all of the following: (a) hardware-only circuit implementations (such as implementations in only analog and/or digital circuitry) and (b) to combinations of circuits and software (and/or firmware), such as (as applicable): (i) to a combination of processor(s) or (ii) to portions of processor(s)/software (including digital signal processor(s)), software, and memory(ies) that work together to cause an apparatus, such as a mobile phone or server, to perform various functions) and (c) to circuits, such as a microprocessor(s) or a portion of a microprocessor(s), that require software or firmware for operation, even if the software or firmware is not physically present.
This definition of ‘circuitry’ applies to all uses of this term in this application, including in any claims. As a further example, as used in this application, the term “circuitry” would also cover an implementation of merely a processor (or multiple processors) or portion of a processor and its (or their) accompanying software and/or firmware. The term “circuitry” would also cover, for example and if applicable to the particular claim element, a baseband integrated circuit or applications processor integrated circuit for a mobile phone or a similar integrated circuit in server, a cellular network device, or other network device.
Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and anyone or more processors of any kind of digital computer. Generally, a processor receives instructions and data from a read only memory or a random access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer also includes, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Moreover, a computer can be embedded in another device, e.g., a mobile telephone, a personal digital assistant (PDA), a mobile audio player, a Global Positioning System (GPS) receiver, to name just a few. Computer readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and CD ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.
To provide for interaction with a user, embodiments of the subject matter described in this specification can be implemented on a device having a display, e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input.
It is intended that the foregoing detailed description be regarded as illustrative rather than limiting and that it is understood that the following claims including all equivalents are intended to define the scope of the invention. The claims should not be read as limited to the described order or elements unless stated to that effect. Therefore, all embodiments that come within the scope and spirit of the following claims and equivalents thereto are claimed as the invention.
The present patent application claims the benefit of the filing date under 35 U.S.C. §119(e) of U.S. Provisional Patent Application Ser. No. 61/898,142, filed Oct. 31, 2013, which is hereby incorporated by reference herein in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4937570 | Matsukawa et al. | Jun 1990 | A |
| 5379215 | Kruhoeffer et al. | Jan 1995 | A |
| 5432895 | Myers | Jul 1995 | A |
| 5583972 | Miller | Dec 1996 | A |
| 5742924 | Nakayama | Apr 1998 | A |
| 5778332 | Chang | Jul 1998 | A |
| 5802492 | DeLorme et al. | Sep 1998 | A |
| 5864305 | Rosenquist | Jan 1999 | A |
| 5889477 | Fastenrath | Mar 1999 | A |
| 5917436 | Endo et al. | Jun 1999 | A |
| 5982298 | Lappenbusch et al. | Nov 1999 | A |
| 6075874 | Higashikubo | Jun 2000 | A |
| 6650948 | Atkinson | Nov 2003 | B1 |
| 6813555 | Kerner | Nov 2004 | B1 |
| 8269653 | Saunders | Sep 2012 | B2 |
| 8405520 | Soulchin et al. | Mar 2013 | B2 |
| 8626440 | Cera et al. | Jan 2014 | B2 |
| 8666645 | Saunders | Mar 2014 | B2 |
| 8676480 | Lynch et al. | Mar 2014 | B2 |
| 8781736 | Cera et al. | Jul 2014 | B2 |
| 8892345 | Arcot et al. | Nov 2014 | B2 |
| 8892356 | Weiland et al. | Nov 2014 | B1 |
| 20020045985 | Kerner | Apr 2002 | A1 |
| 20020193938 | DeKock et al. | Dec 2002 | A1 |
| 20040046759 | Soulchin et al. | Mar 2004 | A1 |
| 20050143902 | Soulchin et al. | Jun 2005 | A1 |
| 20070189181 | Kirk | Aug 2007 | A1 |
| 20070208494 | Chapman | Sep 2007 | A1 |
| 20080071466 | Downs | Mar 2008 | A1 |
| 20100228467 | Wolfe | Sep 2010 | A1 |
| 20110106416 | Scofield | May 2011 | A1 |
| 20110161261 | Wu | Jun 2011 | A1 |
| 20120109506 | Fei | May 2012 | A1 |
| 20130261944 | Koshizen | Oct 2013 | A1 |
| 20140114885 | Han | Apr 2014 | A1 |
| 20140149029 | Sakakibara | May 2014 | A1 |
| 20140222321 | Petty | Aug 2014 | A1 |
| 20150161886 | Kesting | Jun 2015 | A1 |
| 20150262477 | Fowe | Sep 2015 | A1 |
| Entry |
|---|
| Fabritiis.pdf (Corrado de Fabritiis, Roberto Ragona, Gaetano Valenti, Traffic Estimation and Prediction Based on Real Time Floating Car Data, 2008, IEEE, pp. 197-203). |
| Number | Date | Country | |
|---|---|---|---|
| 20150120174 A1 | Apr 2015 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61898142 | Oct 2013 | US |
