Abstract:
Location information obtained and continuously updated from vehicular-based cellular phones is collected, processed and used as a basis for input to Intelligent Transportation Systems, in particular to Real Time Urban Traffic Guidance for Vehicular Congestion and Intelligent Traffic Control Systems. Location information that forms the basis of the present invention is obtainable from wireless location systems such as GSM in Europe, CDMA in the USA, or PDC in Japan, and depends on supporting technologies, which are in the process of perpetual improvement. Relying on cellular networks location system capabilities to provide moderately reliable position information, the records of vehicle phones coordinates, timing, etc., are collected, updated and stored in the Traffic Service Center database. Those records together with digital maps are fed into mathematical models and algorithms that construct lists of vehicles traveling on various road sections, traffic loads at particular road sections, real time travel times along all road sections resulting from traffic congestion in particular areas, turning loads for signal intersections, and other key parameters necessary for real time functioning of Intelligent Transportation Systems, in particular of Intelligent Traffic Control Systems, Route Guidance Systems, etc.

Description:
FIELD OF THE INVENTION  
         [0001]    This invention relates generally to traffic control systems. More specifically, the present invention relates to a traffic information gathering system using cellular phone networks for automated intelligent traffic signal control.  
         BACKGROUND OF THE INVENTION  
         [0002]    Intelligent traffic control systems comprise three major components: hardware, traffic control models, and information gathering systems.  
           [0003]    After briefly reviewing the first two components, we will present the state of the art of conventional information gathering systems.  
           [0004]    Numerous Traffic Signal Controllers are used extensively throughout the United States and elsewhere around the globe. Most controllers are computer activated and use sophisticated software models to achieve optimization of traffic flow.  
           [0005]    In the context of the present invention, we will concentrate on the operating models and algorithms that control such traffic signal controllers. Traffic control models underwent a radical change in the mid- 1960 &#39;s when digital computers began to be increasingly utilized in traffic control systems. Computers allowed creation of actuated controllers that have the ability to adjust the signal phase lengths in real time in response to traffic flow.  
           [0006]    Modes of controller operation can be divided into three primary categories: Pre-timed, actuated (including both semi-actuated and fully actuated), and traffic responsive. Under pre-timed operation, the master controller sets signal phases and cycle lengths at predetermined rates based on historical data. Actuated controllers operate based on traffic demands as registered by the actuation of vehicle and/or pedestrian detectors.  
           [0007]    Semi-actuated controllers maintain green on the major street except when vehicles are detected on minor streets, and always return right of way to the major street. Fully actuated controllers rely on detectors for measuring traffic flow on all approaches and make assignments of the right of way in accordance with traffic demands.  
           [0008]    Traffic responsive controllers respond to inputs from traffic detectors and may react in one of the following ways:  
           [0009]    Use vehicle volume data as measured by traffic detectors;  
           [0010]    Perform pattern matching: the volume and occupancy data from system detectors are compared with profiles in memory, and the most closely matching profile is used for decision-making;  
           [0011]    Perform future traffic prediction: projections of future conditions are computed based on data from traffic detectors.  
           [0012]    As the use of traffic responsive controllers has been gaining momentum, the importance of methods of gathering information has also greatly increased.  
           [0013]    Conventional Methods of Gathering Traffic Condition Information  
           [0014]    Due to ever increasing traffic volumes, traffic control and information acquisition have become a central part of the overall traffic management strategy. Numerous computerized traffic models have become dependent on real time traffic event updates in complex traffic signaling applications.  
           [0015]    Generally, dynamic traffic data are gathered by three methods:  
           [0016]    1. Road sensor devices such as induction loops, traffic detectors, and TV cameras mounted on poles;  
           [0017]    2. Mobile traffic units such as police, road service, helicopters, weather reports, etc.  
           [0018]    3. Cellular mobile communication systems, using GPS or similar equipped vehicle-tracking services, usually in closed environments, such as individual private organizations, or commercial entities.  
           [0019]    The disadvantages of these conventional data collection methods can be summarized as follows:  
           [0020]    1. Relatively high cost of capital investment to install fixed road devices, especially in existing road infrastructures;  
           [0021]    2. Relatively limited number of organizations such as trucking, delivery and other service companies utilizing GPS reporting vehicles and relying on proprietary rights of the collected traffic data;  
           [0022]    3. Apart from the relatively small number of cars equipped with required GPS devices necessary for precise position determination, generally only small geographical areas are effectively covered due to specific nature of service tasks.  
           [0023]    One conventional way to measure traffic flow is by using buried loops in the pavement. These loops create a magnetic field, which is disturbed by the magnetic materials in a car passing over it. A special device in the traffic control cabinet monitors the buried loop and reports to the controller when it has been disturbed. Sometimes microwave detectors resembling a closed circuit TV camera mounted on a pole are used.  
           [0024]    Some work has been done recently on mobile traffic data generation using GPS reporting devices mounted on individual cars to provide positioning information of the vehicle via a wireless mobile communication system.  
           [0025]    These conventional systems can also provide information on road conditions, weather conditions, etc. The expenditures related to these mobile systems are much more cost-effective than the traditional methods using fixed road metering (such as that disclosed in U.S. Pat. No. 6,012,012 to Fleck et al.). The disadvantage of these systems is the relatively limited number of cars equipped with required GPS devices necessary for precise position determination. Therefore, only a relatively small geographical areas that can be effectively covered.  
           [0026]    In another conventional system, GSM phones are combined with built-in GPS devices to enable hybrid location capabilities, based on the GSM network as well as an integral GPS receiver. Mobile Phone Telematics Protocol (MPTP) facilitates hybrid positioning, transferring and managing of information. Mobil phone providers integrate resource management, traffic reporting, telematics, safety and security systems and provide the data to their mobile terminals. With the help of MPTP, cell phones are connected to an existing emergency center and can obtain position updates and emergency call messages. GSM/GPS phones can also provide a wide range of optional features, such as safe area tracking, route navigation, and position requests.  
           [0027]    The present invention proposes a system and method that overcomes the shortcomings of conventional traffic data gathering systems by utilizing the general wireless (cellular) telephone information network data. The exemplary system and method is equally compatible with the GSM, CDMA or PDC wireless telephone systems, since it does not depend on system specific features. The data from moving vehicles is collected and fed into the system continuously. The system filters and cleans the data by applying intelligent heuristic algorithms and produces information on traffic situations in real time that can be supplied to automated traffic controllers. This eliminates the need for developing a dedicated mobile wireless information gathering fleet or other high cost devices requiring a large amount of personnel and long reaction times for traffic events such as accidents and traffic congestion.  
           [0028]    In brief, the advantages of the exemplary information collection system of the present invention over the prior art sensor based systems may be summarized as follows:  
           [0029]    Advantages:  
           [0030]    1. No need for costly infrastructure: detectors, loops, etc.;  
           [0031]    2. Low recurring costs associated with obtaining information;  
           [0032]    3. Comprehensive coverage of large geographical regions;  
           [0033]    4. Constant improvement in measurement precision;  
           [0034]    5. Information stored in the database allows for the performance of various tasks which are difficult or impossible to perform under traditional methods of data collection, such as studying travel profiles, calculating travel times under congestion conditions, calculating various statistics related to roads, road sections, etc.  
         SUMMARY OF THE INVENTION  
         [0035]    In view of the shortcomings of the prior art, it is an object of the present invention to provide a system and method for optimizing traffic flow based on information received from wireless telephone systems.  
           [0036]    The disadvantages of the prior art may be overcome by using the wireless networks as the means to provide location information as described herein. Technologically, this may be achieved by measuring the signals traveling between a moving cell phone and a fixed set of base stations. This approach takes advantage of the large pool of existing cell handsets. For example, in the United States along there are presently about 50 million cellular handsets. And any necessary modifications, such as specialized location equipment, can be placed on the network rather than in the handsets.  
           [0037]    The present invention comprises an intelligent data gathering and processing system based on existing cellular phone networks, and utilizes real time cell phone position data for reconstructing concurrent traffic conditions.  
           [0038]    A primary function of the exemplary system of the present invention is the construction and maintenance of lists of vehicles moving along all road sections at particular points in time. This may be achieved by tracking all in-vehicle cell phones within a given region. At each moment, the system maintains a series of such lists associated with a limited number of past consecutive moments. This allows the system to obtain accurate estimates of the total number of vehicles traveling on each specific road section, together with their direction of travel and average velocity. Based on these data, the system is able to 1) compute real time traffic loads for various roads and road sections, 2) generate detailed lists of vehicle turning movements, real time turning data for all relevant intersections, and 3) other traffic parameters. The resulting information can then be passed on with minimum delay to the automated traffic control systems for the purpose of adjusting signal intersection timings to calculate other traffic related parameters of interest.  
           [0039]    To achieve these purposes, the system uses the position data of a plurality of cell phones, whether located in moving vehicles, held by pedestrians in moving, or stationary positions, and processes them in an intelligent way to translate their coordinates into relevant traffic information. The system utilizes heuristic algorithms to differentiate between vehicle based cell phones and other cell phone users. Furthermore, the system identifies multiple phone users in a common vehicle to combine them into a single vehicular entity.  
           [0040]    Once each group of cell phones has been associated with a common vehicle, it&#39;s the vehicle&#39;s position is calculated, recorded in the database, and assigned to an appropriate road section according to the coordinates of its cell phones at a particular moment.  
           [0041]    After recording a pre-assigned number of these positions in a particular time interval, the system generates a continues path profile (or movement profile) for a given vehicle. Such path profiles constructed and stored for a large number of vehicles make it possible to calculate traffic loads for all road sections, turning movement volumes at various intersections, and other parameters that can be fed as inputs into traffic control systems. Moreover, the dynamic plurality of path profiles enables the preparation of statistical traffic data tables, the calculation of statistical predictions of travel times along road sections, and the obtaining of other desirable traffic condition parameters .  
           [0042]    Obviously, the success of these tasks depends on the quality of initial location data. Improvements in the location technology of wireless networks will undoubtedly lead to new improved performance of traffic information gathering systems and their applications to Intelligent Transportation Systems.  
           [0043]    The exemplary system and method is expected to and enhance the overall traffic control capabilities of conventional systems by providing a maximum range of traffic related information.  
       
    
    
     DESCRIPTION OF THE DRAWINGS  
       [0044]    The invention is best understood from the following detailed description when read in connection with the accompanying drawing. It is emphasized that, according to common practice, the various features of the drawing are not to scale. On the contrary, the dimensions of the various features are arbitrarily expanded or reduced for clarity. Included in the drawing are the following Figures:  
         [0045]    [0045]FIG. 1 is a flowchart of an exemplary method of the present invention;  
         [0046]    [0046]FIG. 2 is a table illustrating creation of current cell phone lists containing cell phone IDs, positions, and recorded times at intervals T to T 4 ;  
         [0047]    [0047]FIG. 3 is a table illustrating creation of cell phone path profile lists and with pending cell phone lists;  
         [0048]    [0048]FIG. 4 illustrates initial discrimination between phones in moving vehicles and other phones;  
         [0049]    [0049]FIG. 5 illustrates an exemplary method for eliminating false cell phone records;  
         [0050]    [0050]FIG. 6 illustrates missing data imputation and elimination;  
         [0051]    [0051]FIG. 7 is a table illustrating creation and storage of pending phone lists;  
         [0052]    [0052]FIG. 8 illustrates a first exemplary Type A Error where two vehicles are clustered together inducing a large measurement error;  
         [0053]    [0053]FIG. 9 illustrates a second exemplary Type A Error where two vehicles are clustered together by travelling close to one another;  
         [0054]    [0054]FIG. 10 illustrates an exemplary Type B Error where two phones in one vehicle are clustered into different clusters due to a large measurement error;  
         [0055]    [0055]FIG. 11 illustrates criteria for placing cell phones into vehicular clusters;  
         [0056]    [0056]FIG. 12 illustrates groping cell phones into vehicular clusters;  
         [0057]    [0057]FIG. 13 are tables illustrating placing vehicles on road sections;  
         [0058]    [0058]FIG. 14 illustrates a method for updating entry and exit lists on road sections;  
         [0059]    [0059]FIG. 15 illustrates a regression-based prediction of current travel times;  
         [0060]    [0060]FIG. 16 illustrates the preparation of statistical tables based on real time traffic information;  
         [0061]    [0061]FIG. 17 illustrates the preparation of a seasonal statistical traffic data table for each road section;  
         [0062]    [0062]FIG. 18 illustrates a current and daily turning-vehicle table for road intersections;  
         [0063]    [0063]FIG. 19 illustrates a current and daily vehicle load table for road sections; and  
         [0064]    [0064]FIG. 20 illustrates the updating of current intersection node records. 
     
    
     DETAILED DESCRIPTION OF THE INVENTION  
       [0065]    One purpose of the present invention is to maximize the acquisition of important traffic event data with minimum sacrifices with respect to the quality or the scope of the available data. Naturally, the extent and the precision of the overall data collected from the plurality of cell phones in the given network will largely depend on the total number of current cell phone users and also on the technology used for measuring and recording data. It should be noted here that for purposes of the present invention&#39;s data collection any cell phone in an “on” position will be considered as part of the reporting system.  
         [0066]    The present invention does not deal with problems of precision of the cell phone location methods but rather presumes existing cell phone location technologies and contemplates their progressive improvement in the near future.  
         [0067]    It is also assumed that increasing competition in the cell phone market will further enhance the already large public popularity of cell phone usage.  
         [0068]    In the exemplary system, all relevant cell phone position data will be obtained directly from the cell phone network operator without any involvement of the individual phone user.  
         [0069]    [0069]FIG. 1 is a flow diagram of an exemplary embodiment of the inventive cell phone gathering system showing the main steps of data exchange flow. As shown in FIG. 1, at Step  1 , the cell phone records are obtained from the network operator for  100 ,  102 ,  104 ,  106 , etc. At Step  2 , the current cell phone list and a series of previous cell phone lists are created and stored. At Step  3 , temporary cell phone path profiles (Positioning Algorithm) are created. At Step  4 , initial discrimination between phones in moving vehicles and other phones is preformed. If a phone is determined not to be within a car, it is rejected. At Step  5 , untenable cell phone positions (outliers) are eliminated. At Step  6 , missing cell phone positions are imputed. At Step  7 , pending phone lists are prepared, stored and processed. At Step  8 , active cell phones are grouped into vehicular clusters (Vehicle Identification Procedure). At Step  9 , the representation of vehicles by vehicular clusters is performed. At Step  10 , travel path profile for each vehicle (Speed, Direction of Travel) is created. At Step  11 , real time traffic related information is attached to road sections. At Step  12 , the statistical traffic data table is maintained. At Step  13 , the statistical predictions of travel times along various road sections are performed. At Step  14 , true vehicle loads for all road sections (Adjusting for Vehicles Without Cell Phones) are prepared. At Step  15 , the data for automated actuated traffic signal controllers and various traffic optimization programs is updated.  
         [0070]    The following is a list of acronyms used throughout the specification:  
         [0071]    APL=Adjusted Phone List  
         [0072]    AU=Traveling Vehicle  
         [0073]    CP=Cell Phone  
         [0074]    CPL=Current Phone List  
         [0075]    CVL=Current Vehicle List  
         [0076]    ENL=Entry List  
         [0077]    ENT=Entry Time  
         [0078]    EXL=Exit List  
         [0079]    EXT=Exit Time  
         [0080]    ID=Identification Number  
         [0081]    INT=Road Intersection Node  
         [0082]    OP=Outlying Position  
         [0083]    PEPL=Pending Phone List  
         [0084]    PPL=Previous Phone List  
         [0085]    PPP=Phone Path Profile  
         [0086]    PVL=Previous Vehicle List  
         [0087]    RS=Road Section  
         [0088]    RSL=Road Section List  
         [0089]    TSC=Traffic Service Center  
         [0090]    Obtaining Cell Phone Records from the Network Operator  
         [0091]    It is assumed that the cell phone network operator is capable of providing all the necessary information on the plurality of active cell phone units in the network. The process of collecting and transmitting cell phone position data is well known and described in the literature.  
         [0092]    For the purposes of the present invention it is time and cost effective if the data are received in the form of periodic data packets in real time, such as, 1 to 3 minutes, for example.  
         [0093]    The packet file consists of a list of records, each for a single cell phone (CP) containing phone&#39;s unique ID number, the recorded time of signal reception t, and its location P (x, y):  
         record(CP)=(ID,  t, x, y )  
         [0094]    For the purposes of protecting privacy of individual cell phone users, an automatic coding system set up by the network operator will assign each cell phone number a unique ID reference number. In the present invention, only the reference ID will be used to identify each cell phone record.  
         [0095]    Creating And Storing the Current Cell Phone List And a Series of Previous Lists  
         [0096]    As shown in FIG. 2, at each time period T, the Traffic Service Center (TSC) compiles a Current Phone List (CPL) consisting of cell phone records (in the sense defined above) of all available active cell phones in the system database according to their ID reference numbers. At the next time period T 1  a new CPL is similarly compiled and recorded, with the first CPL becoming the Previous Phone List (PPL) number  1 , PPL 1 . At the following period, a new CPL is compiled, the CPL becomes PPL 1 , and PPL 1  becomes PPL 2 , etc. For the purposes of analysis (see below), it is necessary to store at any given moment a predetermined number of these lists, such as, 4 or 5.  
         [0097]    Creating Temporary Cell Phone Path Profiles  
         [0098]    At this stage it is necessary to create a temporary Phone Path Profile (PPP) for each active cell phone CP and correlate individual cell phone positions with the digital map. The map database which is connected to global digital map contains a list of all road sections RS each with a number of fixed attributes such as road name, the names of two adjacent intersection nodes INT, allowable speed, number of lanes, turns to and from the nodes, sensor devices if available, automatic traffic control signals, and all other pertinent data. For each individual CP, we define its original path profile PPP as a series of its records stored in the CPL and PPL lists as described above.  
         [0099]    The present invention assumes that the cell phone path profile PPP for each CP is preferably constructed if the predetermined number of its latest 5 recorded positions P 1 , P 2 , . . . , P 5  is available on the CPL (see FIG. 2).  
         [0100]    [0100]FIG. 3 illustrates an exemplary PPP table and PEPL table. The PPP table will contain each CP record with its scored rating according to the total number of positions P 1 , P 2 , . . . , P 5  it obtained, where the final score between −4 to 0 will reflect the number of missing positions. In the event that the PPP list receives a score of −1, it is entered into the Pending Phone List (PEPL) created for temporarily storing incomplete PPPs. If in the next time period T, a new CP position P 6  is obtained, then the PPP can be completed, otherwise construction of the PPP will be discontinued, e. g. CP 4 . All other PPP scores i.e. −2, −3, etc. (see CP 6  and CP 7 ) will be discontinued immediately.  
         [0101]    Due to measurement errors, cell phone positions will generally not lie on road sections, but rather in the vicinity of road sections. To correct for this, the Positioning Algorithm presented below is used for finding the most probable positions of cell phones on road sections.  
         [0102]    Positioning Algorithm  
         [0103]    Given a point P′ (recorded cell phone position) and a class of road sections RSs, the Positioning Algorithm searches for a point P located on one of the road sections RS and at a shortest distance (usually perpendicular) from the point P′. The area of search is bounded by the circle C centered at P′ and having radius M (maximum acceptable measurement error), so that only road sections crossing this circle are considered as candidates for locating a point P. In case a road section is located within the circle C but a perpendicular projection will not find any RS, the point closest to point P′ is determined as one of its endpoints. Of those closest points, the point nearest to point P′ is selected and established as point P.  
         [0104]    After all recorded CP positions have been adjusted and associated with individual RSs, the Adjusted Phone List (APL) is created with all cell phones now positioned on road sections.  
         [0105]    Construction of Continuous Path Profiles  
         [0106]    In general, cell phone path profiles may have different recorded times so that for any given group of phones there may be no time moment at which positions of all group members have been measured. In contrast, below we will often need positions of all members of a group simultaneously, i.e. for calculating distances between phones for the purpose of discriminating between two phones in a common vehicle vs. two vehicles with a single phone each, etc. To be able to calculate positions of a number of phones simultaneously, we will construct continuous path profiles, i.e. curves or trajectories that the phones in question have most likely followed during the predefined time interval.  
         [0107]    Here we will be assuming that the predefined number of cell phone positions has been recorded and all of them are good. The treatment of outlying positions and of missing positions are described below. For constructing continuous curves it is suggested that linear regression techniques are used as follows.  
         [0108]    Construction of regression curves  
         [0109]    First, consider the case when all, say, five measured positions p 1 , p 2 , p 5  are located on a common section RS (probably, after some initial positioning).  
         [0110]    Our major assumption is that we can perform valid interpolations and extrapolations within the given section.  
         [0111]    Using linear regression techniques, we can construct a regression curve of coordinates x on t based on the five observed-paired values (t 1 , x 1 ), (t 2 , X 2 ), . . . , (t 5 , x 5 ). The obtained linear function x=x(t) could then be used for computing x positions anywhere on the road section RS. Similar calculations produce a curve y=y(t) for y positions. In other words, the moving position of the phone can be construed as a function p=p(t) of location in time. Having functions x=x(t), y=y(t), we will be able to calculate the position of the phone at any time moment t 1  as p 1 =p(t 1 ), or x 1 =x(t 1 ), y 1 =y(t 1 ).  
         [0112]    Within certain precision limits, it might be even possible to use the functions x=x(t) and y=y(t) for calculating phone velocities on the section RS.  
         [0113]    When we have less than five positions on a single section, say, four, three, or even two, we could still perform linear regression or interpolation though precision although reliability might suffer.  
         [0114]    On the other hand, one must be warned against attempting extrapolation over section boundaries. It appears that while the assumption of validity of interpolation and extrapolation within one road section is tenable, extrapolating across section boundaries is not safe and is not recommended. This is due to abrupt changes in speed that often occur while switching to other sections, long waiting times near intersections, jams at section ends, turning point delays, sudden slowdowns and stops that drivers do before entering highways, etc.  
         [0115]    Initial Discrimination Between Phones In Moving Vehicles And Other Phones  
         [0116]    Once a PPP has been obtained, it is possible to estimate the corresponding CP&#39;s direction of movement, distance traveled, travel speed, etc. Here we will put some of these attributes to use for separating phones located in moving vehicles, on the one hand, and from all other phones on the other hand.  
         [0117]    Among those other phones may be stationary phones such as phones inside houses, phones left in parked cars, etc., slowly moving phones such as phones held by pedestrians, fast moving phones located in trains, held by bicycle and motorcycle riders which may be moving in the open without regard of any roads, and many other cases of phones difficult to envision and enumerate.  
         [0118]    For the purpose of discriminating phones located in moving vehicles, we will isolate, formalize and categorize some characteristics regularly exhibited by most of such phones.  
         [0119]    To simplify presentation, we assume that 4 observed phone positions P 1 , P 2 , P 3  and P 4  are being used, and that all of them are valid positions. Increasing the number of positions to five or six will simply multiply the number of cases to be enumerated without introducing new ideas. Problems related to bad observations, i.e., missing observations and outliers, will be dealt with below.  
         [0120]    The Phone-In-Moving-Vehicle Recognition Algorithm  
         [0121]    As shown in FIG. 4, consider a cell phone CP 1  whose path profile PPP contains a series of four (4) valid recorded positions: current position P 4 , previous position P 3 , the position before previous P 2 , and still earlier position P 1 . The speeds of the phone calculated for moving between those positions are as follows: the speed between P 3  and P 4  was v 4 , between P 2  and P 3  was v 3  and between P 1  and P 2  was v 2 . Assume that we have two categories of roads, large roads (say, highways) LR, and small roads (all others) SR.  
         [0122]    We will use two basic criteria for identifying phones in vehicles: a cell phone on a large road is probably a vehicle phone and a cell phone that traveled with a speed v larger than some critical speed, say, 4 miles/hour (7 km/hour) is a vehicle phone.  
         [0123]    CP position on a large road LR is obviously not a foolproof criterion, and, unfortunately, a higher speed is not either since it may have resulted from measurement errors. To attain more confidence in our conclusions, we will rely on combinations of these criteria in the following ways.  
         [0124]    If at least two positions say P 1  and P 2  of the recorded PPP lie on a large road section RS, we conclude that the phone is a vehicle phone—see lines  1  to  6  in FIG. 4. Further, if P 1  of the PPP lies on a large road and a large speed, say, v&gt;4 miles/hour (7 km/hour) was calculated for at least one traveled section, we also tend to conclude that the phone is a vehicle phone—see lines  7  to  12  in FIG. 4.  
         [0125]    Still further, if two adjacent sections belong to small roads RS 1  and RS 2  and both corresponding speeds are large, we also conclude that the phone is a vehicle phone—see lines  13  and  14 .  
         [0126]    As illustrated in FIG. 4, 14 combinations of CP positions and their speeds (in the case of 4 available valid positions) where the algorithm can surely or almost surely establish that the CPs are located in traveling vehicles.  
         [0127]    The algorithm based on FIG. 4 may be further developed and refined. For example, Table 1 does not relate to a possible traffic situation where a large number of CPs are located on the small road SR (say in a form of continuous “platoon”), but their overall speed is consistently small on average (say for T 1 ,T 2 , . . . ,T 5 ) v&lt;1.8 miles/hour (3 km/hour) and the overall distance between most CP positions (i.e. P 1 , P 2 , . . . , P 5 ) is small (i.e. d&lt;33-50 ft. (10-15 m)). In such a situation an additional analysis of the surrounding road sections adjacent to intersection INT 1  may reveal similar conditions prevailing on RS 2 , RS 3 , etc. If no CPs have left the RS 1 , RS 2  or RS 3  and the INT 1  intersection (as described later) then the conditions for traffic “jam” may exist. The cell phones may still be located in vehicles and therefore be valid, but are temporarily delayed in a traffic slowdown. This situation should then be classified separately and reported as a traffic jam.  
         [0128]    Eliminating Untenable Cell Phone Positions (Outliers)  
         [0129]    This stage relates to further refining each CP&#39;s recorded progression path PPP. For the purposes of this invention, it is required that all 5 CP&#39;s recorded positions P 1 , P 2 , . . . , P 5  can be tabulated into a feasible progression path PPP.  
         [0130]    At the first stage, we use the Positioning Algorithm (see description above) and replace the recorded available phone positions CP 1  (P 1 , P 2 , . . . , P 5 ) by other, most feasible positions located on the nearby road sections. The Positioning Algorithm searches for the closest road section RS within the given radius of the vehicle position P. In this fashion all available positions (P 1 , P 2 , . . . , P 5 ) will be placed on closest road sections RS.  
         [0131]    The limitation of this present version of the Positioning Algorithm is that it always selects the closest possible RS, which may not always conform to the general travel path PPP of the observed vehicle. For instance, in a dense urban situation where many roads are located within the same positioning radius it may happen than an “inappropriate” RS is preferred by the Positioning Algorithm. If the road selected by the Positioning Algorithm has no physical link to other positions, say P 3 , it will be defined as outlying position OP 1  with respect to the progression path PPP constructed from all available positions (P 1 , P 2 , . . . , P 5 ).  
         [0132]    [0132]FIG. 5 shows several combinations of possible outlying position situations on PPP.  
         [0133]    A. Position P 1  is placed at RS 1  which has no direct link to the other four remaining positions placed at RS 5 , RS 6 , RS 7  and RS 8  respectively. In this case, P 1  will be considered an outlying position OP 1 , and the PPP will obtain score −1 (one outlying position) and will be stored in the pending phone list PPL. If the next position P 6  obtained from the next CPL is valid, i.e. not an OP, position P 1  will be rejected and the PPP will be included in the calculations.  
         [0134]    B. In the case when P 5  is recognized as an OP 1 , the event will be processed as above.  
         [0135]    C. Referring to FIG. 6, in the case when a single OP is recorded at P 3 , or P 4 , this OP will be rejected and replaced by another, so called imputed position. To calculate this imputed position, we can firstly construct a regression curve through the remaining ‘good’ positions as described in the algorithm for construction of regression curves above, and then calculate the imputed position as the position on this regression curve for the corresponding time moment.  
         [0136]    D. In case two or more positions are OP positions, the PPP will be rejected and no imputation will be attempted.  
         [0137]    E. In the case where after P 1  and P 2  all subsequent positions at P 3 , P 4 , and P 5  are technically plausible, but incompatible to each other, an additional CPL should be constructed for further consideration.  
         [0138]    To summarize: for the purpose of construction of continuous path profiles PPP outlined above, outlying positions OPs are misleading records that may severely impair or invalidate the PPP which has been influenced by it. Therefore, after having been detected OPs will be removed (the process sometimes called cleaning the data) and replaced by unobserved but plausible positions. A standard technique for doing this is to use the linear regression methods as described above in the algorithm for construction of regression curves.  
         [0139]    Making Imputations for Missing Cell Phone Positions  
         [0140]    In case of a single missing observation, i.e. a missing value in the recordings of the CP positions P 1 , P 2 , . . . , P 5  due to technical difficulties or any other reasons, imputation procedures similar to those used in cases of outlying observations OP&#39;s described above will be used. This is in order to utilize all available data to a maximum for a particular P (see FIG. 6).  
         [0141]    If more outlying observations or missing data have been detected, however, no further attempts at constructing a PPP will be made for a corresponding cell phone, as the available data are judged insufficient for creating a viable PPP.  
         [0142]    Preparing, Storing And Processing Pending Phone Lists  
         [0143]    As mentioned above, under the accepted methodological approach, no progression path PPP containing less than the predetermined number of recorded positions of a CP can be processed. In order to avoid unnecessary loss of recorded information, however, it is deemed necessary to create temporary pending phone lists PEPL to store incomplete information.  
         [0144]    [0144]FIG. 7 is a table illustrating creation and storage of pending phone lists. In FIG. 7, it is assumed that in the process of updating a CPL, additional position information for CPs on PEPLs may be obtained, the corresponding PPPs completed and CPs records cleared from the pending phone lists. The PEPLs may contain additional positions for each CP such as position record P 6  at time T 6  if necessary. Longer records are not necessary but may be used in some cases.  
         [0145]    Grouping Active Cell Phones into Vehicular Clusters  
         [0146]    It is necessary at this stage to introduce the Vehicle Identification Procedure. Simply, this procedure analyzes CPs that display similar PPP characteristics in a given time period.  
         [0147]    The purpose of this procedure is to identify and eliminate the possibility that several CPs traveling in a single vehicle will mistakenly be recorded as a number of moving vehicles due to measurement inaccuracies at a given period and thereby misrepresenting the actual number of moving vehicles or the “vehicular load” on a particular road section RS.  
         [0148]    The procedure will attempt to identify and analyze the following situations:  
         [0149]    A. Two or more CPs produce consistently similarly placed positions (P 1 , P 2 , . . . ,P 5 ) for a given period of time (i.e. T 1 , T 2 , . . . ,T 5 ), i.e. the measured distance between CP 1  and CP 2  is smaller than a predetermined distance d 0  (say, 10 m).  
         [0150]    It will then be assumed that the corresponding CPs are located in a common cluster CL and are located in the same traveling vehicle AU (see FIG. 7).  
         [0151]    B. Two or more CPs produce several similar recorded positions (P 1 , P 2 , P 3 , and P 4 ) while in the remaining position P 5  d 0 ≧10 m.  
         [0152]    In such a situation, the procedure will attempt to correct the P 5  measurement by introducing another position P 6  at period T 6  as has been done in cases of outlying observations described above (see FIG. 6).  
         [0153]    C. If two or more CPs produce several similar positions (i.e., at T 1 , T 2 ), but there is sufficient variance in their other recorded positions (T 3 , T 4  and, say, T 5 ) to prevent their clustering into a common vehicular cluster, no further measurements will be attempted.  
         [0154]    Vehicle Identification Procedure  
         [0155]    A problem to be solved is identifying which groups of cell phones belong to a common vehicle and which to different vehicles. The input data consist of a series of lists (say, 5 or 6 lists) of cell phone records recorded at sequential time moments t 0 , t 1 , . . . , t s . The solution is deemed to be a list of phone clusters in which phones in a single cluster supposedly belong to the same vehicle while phones in different clusters are located in different vehicles.  
         [0156]    It should be clear from the start that it is a difficult problem in that most cases cannot be solved without erroneous decisions even if phone positions were measured and recorded without errors. With measurement errors, and especially with large measurement errors, it becomes more difficult still.  
         [0157]    Below, we describe what is called the Vehicle Identification Procedure, which consists of three steps and uses elementary mathematical techniques and heuristic, or common sense, considerations. It relies on a number of assumptions that could be grouped into two major assumptions:  
         [0158]    1. There are only few large measurement errors; and  
         [0159]    2. All the records used are good enough: no newly appearing phones within the defined time period, no missing or miss-recorded positions, etc., except a few large errors as postulated in assumption 1.  
         [0160]    The first assumption appears sensible enough: a large number of large errors will render the task unsolvable. The second assumption may be considerably relaxed in view of the Agglomeration Procedure described below.  
         [0161]    The errors made by any decision procedure can be classified into to categories:  
         [0162]    Type A errors: Two or more cell phones located in separate vehicles are grouped into a common cluster; and  
         [0163]    Type B errors: Two or more phones located in a common vehicle are put into different clusters.  
         [0164]    Referring to FIGS. 8 and 9 it is shown that Type A Errors arise mainly in two situations: under large measurement errors, such as shown in FIG. 8, or when vehicles travel close one to another, such as shown in FIG. 9. Errors of Type B arise because of large measurement errors, such as shown in FIG. 10.  
         [0165]    Though the Vehicle Identification Procedure described below is not based on any explicit optimization principle, it is expected to produce relatively small number of errors of both types under normal traffic situations. It consists of three steps (or sub-procedures):  
         [0166]    Step 1: Initial Clustering Procedure  
         [0167]    The cell phone list at time t 0  is used for initial grouping of the available phones into clusters. The algorithm developed for the purpose is called the Initial Clustering Algorithm and is described in detail below.  
         [0168]    Step 2: Sequential Splitting Procedure  
         [0169]    Using phone lists at moments t 0 , t 1 , . . . , t s , the clusters constructed at Step  1  are sequentially split into smaller clusters in an attempt to eliminate or reduce type A errors. No attention is being paid until now on type B errors. The proposed algorithm is called the Split Algorithm.  
         [0170]    Step 3: Agglomeration Procedure  
         [0171]    Relying on the assumption of small number of large measurement errors, we now attempt to eliminate some unit clusters and also to fuse some of the existing clusters into bigger ones with the purpose of reducing the number of type B errors. Accordingly, the suggested Agglomeration Algorithm consists of two algorithms: the Kill Unit Clusters Algorithm and the Fusion Algorithm.  
         [0172]    Before giving a detailed description of Steps 1-3, we introduce a necessary notation.  
         [0173]    Cell phone records are denoted by small letters: a=(ID a , t a , x a , y a ), b=(ID b , t b , x b , y b ), C=(ID c , t c , x c , y c ).  
         [0174]    The distance between two phones a=(ID a , t a , x a , y a ) and b=(ID b , t b , x b , y b ) is calculated as  
           d ( a,b )={square root}{square root over (( x   a   −x   b ) 2 +( y   a   −y   b ) 2 )}.  
         [0175]    Clusters are defined as the ordered (by increasing IDs) sets of phones and are denoted by capital letters: C=(c 1 , c 2 , . . . , c k ). Diameter of a cluster C is the maximum distance between its phones:  
         [0176]    d(C)=max 1≦i&lt;j≦k d(c i ,c j ). Unit clusters consist of single phones and have diameter 0. The distance between phone a and cluster C is calculated as d(a,C)=max 1≦j≦k d(a,c j ). The distance between two clusters A=(c 1 , c 2 , . . . , c r ) and C=(c 1 , c 2 , . . . , c k ) is calculated as d(A,C)=max 1≦i≦j≦k  d(a i ,c j ).  
       Step 1: Initial Clustering Procedure  
       [0177]    Initial grouping of a set of phones into clusters can be done by using a simple distance relation criterion: if distance between the phones is no larger than some predefined critical value d 0  (say, 10 m, or 15 m to accommodate large buses), they are put into a common cluster. Note, however, that due to non-transitivity of this relation and multiplicity and complexity of possible traffic situations, any method of partitioning phones into non-overlapping groups based on distance relation is likely to create numerous type B errors. Therefore, to reduce the potential number of type B errors, it is preferable to begin by grouping phones into a super-partition in which a phone may enter into a number of clusters simultaneously. Later, those contradictory patterns will be resolved, and multiple entries reduced to single entries (see Kill Unit Clusters in the Agglomeration Procedure below).  
         [0178]    Assume that we have a configuration of elements (phones) A={a 1 , a 2 , . . . , a n }, which implies both the given set of elements and known distances between all pairs of elements.  
         [0179]    Formally, a super-partition Γ=(C 1 , C 2 , . . . , C k ) consisting of clusters C 1 , C 2 , . . . , C k  of elements a 1 , a 2 , . . . , a n  is defined as a system of clusters satisfying the following requirements:  
         [0180]    1. Any element a j  in the configuration A belongs to at least one cluster C i , and may belong to a number of them simultaneously.  
         [0181]    2. Diameter of any cluster C i  is no greater than d 0 .  
         [0182]    3. Any subset of elements {a i1 , a i2 , . . . , a iq } in the configuration A with diameter no greater than d 0  is contained in some cluster C i .  
         [0183]    4. The system of clusters Γ is minimal in the sense that there can be no two different clusters C i  and C j  such that C i ⊂C j .  
         [0184]    The following properties of super-partitions are easily derived from this definition.  
         [0185]    Property 1. For any configuration of elements there exists a unique super-partition.  
         [0186]    Property 2. Assume that we have two configurations of elements  
         [0187]    A={a 1 , a 2 , . . . , a k } and A′={a 1 , a 2 , . . . , a k , a k+1 } where A is a subset of A′, and S′ is the super-partition of A′. If we delete a k+1  from all clusters of S′, and also delete an empty cluster in S′ if a k+1  constituted a unit cluster there, we will have a super-partition S of configuration A.  
         [0188]    Property 3. Let A and A′ be as defined above, and S the super-partition of A. Then we can construct a super-partition S′ for A′ by the following method: append the element a k+1  to all clusters C i  in S for which d(a k+1 ,C i )≦d 0 , and in case there are no such clusters, construct an additional unit cluster from element a k+1 .  
         [0189]    These properties allow the construction of the following Initial Clustering Algorithm consisting of a series of steps.  
         [0190]    The Initial Clustering Algorithm  
         [0191]    Assume as before a configuration of n elements a 1 , a 2 , . . . , a n  ordered by their IDs.  
         [0192]    Step 1. Take element a 1  and construct a cluster C 1 ={a 1 }.  
         [0193]    Step 2. Consider element a 2  and calculate the distance d(a 2 ,C 1 ): if d(a 2 , C 1 )≦d 0 , then include a 2  into C 1 , otherwise construct a new unit cluster C 2 ={a 2 }.  
         [0194]    General step m (2≦m≦n). Assume that there have already been constructed p (p≦m−1) clusters C 1 , C 2 , . . . , C p  containing the first m−1 elements in the configuration. Now, we have to allocate the next element a m  to some of those clusters by calculating distances d(a m , C 1 ), d(a m , C 2 ), . . . , d(a m , C p ), and by appending the element a m  to all those clusters for which the corresponding distance is no greater than d 0 . In case there are no such clusters, we set up a new unit cluster C p+1 ={a m }. We will denote by Γ 0  the super-partition obtained after termination of this algorithm.  
         [0195]    It can be easily verified that The Initial Clustering Algorithm produces a super-partition of the original configuration. As noted earlier, solutions produced by this algorithm are likely to contain both type A and type B errors; those will be dealt with at steps 2 and 3 ahead.  
       Step  2 : Sequential Splitting Procedure  
       [0196]    As indicated above, a system of clusters obtained by the initial clustering procedure will usually contain many false clusters. At this step we will use the positions of cell phones observed at successive moments t 1 , . . . ,t s  for sequentially splitting too stretched out clusters suspected to be false. This is usually possible due to the fact that distances between vehicles are constantly changing and, when observed over a succession of time moments, will almost inevitably allow the exposure of any false clusters initially created at Step 1.  
         [0197]    The Sequential Split Algorithm  
         [0198]    Consider the moment t 1 . We have the system of clusters Γ 0  obtained at the moment t 0  but the distances between pairs of elements are different from those observed at moment t 0 . Now, we go over all clusters in Γ 0 , and recalculate the diameter for each cluster based on new distances. If cluster&#39;s new diameter is no larger than d 0 , the cluster is retained intact, otherwise the Sequential Split Algorithm is applied to it, and, as a result, it is split into two or more clusters. After this process terminates, a new system of clusters, say, Γ 1 , is obtained. At the moment t 2 , this procedure is applied to Γ 1 , resulting in a system Γ 2 , etc. After completion of this step, the sequential split algorithm produces a new system of clusters, say, Γ=Γ s ,. Note that under realistic traffic conditions, and with the assumption of an absence of large measurement errors, the obtained clusters are likely to closely emulate real clusters of cell phones in moving vehicles.  
       Step  3 : Agglomeration Procedure  
       [0199]    Until now we have been ignoring large measurement errors and the ensuing type B errors. Now, we will presume a small number of large measurement errors (for a more precise definition of ‘small number’ see below).  
         [0200]    If at a moment t r , some cell phone&#39;s position was measured with large error, it means that it was either:  
         [0201]    1. Shot into empty space (and thereby made into a unit cluster), or  
         [0202]    2. Tossed into a foreign cluster.  
         [0203]    First consider the case when this happened at the initial moment t 0 .  
         [0204]    If a phone was shot into space, it will remain in a unit cluster until the end, and if tossed into another cluster, it will most probably be chipped away and put into a unit cluster at one of the following steps.  
         [0205]    Furthermore, if this happened at one of the following moments rather than t 0 , the phone will be made into a unit cluster anyway.  
         [0206]    Therefore, it appears that to correct type B errors, it will suffice to go over all unit clusters and to check:  
         [0207]    1. Whether the element in this unit cluster is also present in another non-unit cluster, and if yes, then to kill the unit cluster;  
         [0208]    2. Whether it is possible to fuse it into another cluster.  
         [0209]    The Kill-Unit-Clusters Algorithm  
         [0210]    This algorithm attempts the elimination of unit clusters by searching for multiple entries. Assume that at moment t s , we have non-unit clusters C 1 , C 2 , . . . , C p  and unit clusters {a 1 }, {a 2 }, . . . , {a q }. For each unit cluster {a 1 }, check if a i εC j  for at least one C j , and if ‘yes’, then kill unit cluster {a 1 }.  
         [0211]    If the Kill-Unit-Clusters Algorithm terminates by removing all unit clusters, then stop, otherwise apply the Fusion Algorithm described below.  
         [0212]    Before presenting the Fusion Algorithm we need some assumptions. Consider a unit cluster {a} that might have been created as a result of a large measurement error: a cell phone a was dashed from its natural cluster and generated a false unit cluster. To be able to proceed, we are going to make the two following assumptions:  
         [0213]    1. For each phone making a unit cluster, there might have been ,at most, one large measurement error;  
         [0214]    2. No large measurement errors have been made at the last moment t s .  
         [0215]    The Fusion Algorithm  
         [0216]    Assume that at the last t s , there exist non-unit clusters C 1 (s), C 2 (s), . . . , C p (s) and unit clusters {a 1 }, {a 2 }, . . . ,{a q }. We will consider unit clusters one by one and try to fuse them into other non-unit clusters. For the first unit cluster {a 1 }, we will check conditions  
           d ( a   1   C   1 ( s ))≦ d   0   , d ( a   1   , C   2 ( s ))≦d 0 , etc.  
         [0217]    Suppose it has been found such cluster C j (s) that d(a 1 , C j (s))≦d 0  is fulfilled.. For any t=t s−1 ,t s−2 , . . . ,t 0 , denote by C j (t) a cluster or sub-cluster consisting of the elements in the cluster C j (s) at moment t. Now we check the system of conditions  
           d ( a   1   , C   j ( s− 1))≦ d   0    
           d ( a   1   , C   j ( s− 2))≦ d   0    
           d ( a   1   , C   j (0))≦ d   0    
         [0218]    If these conditions are all satisfied, except at most one (that may correspond to an outlier), we decide that a 1  belongs to cluster C j (s) and fuse a 1  into cluster C j (s).  
         [0219]    Similar operations are then performed on a 2 , and all other unit clusters. If after completing all possible fusions, there remain one or no unit clusters, the procedure terminates.  
         [0220]    Now assume that there remain more than one unit clusters. For all possible pairwise combinations of unit clusters {a i } and {a j }, we attempt to perform pairwise adjustments (see definition and description below). Denoting adjusted elements by a′ i  and a′ j , we then set up a new non-unit cluster C ij ={a′ i ,a′ j }. Similar operations are performed on all unit clusters. At the end, either there remain no unit clusters, or the remaining unit clusters cannot be fused into other clusters and are thereby presumed to be real unit clusters representing single-phone vehicles.  
         [0221]    Pairwise Adjustments of Unit Clusters of Cell Phones  
         [0222]    Let two cell phones a 1  and a 2  have recorded positions p=(p 1 , p 2 , p 3 , p 4 ) and q=(q 1 , q 2 , q 3 , q 4 ) respectively over the observed time period of four time moments. If all the distances d(p i ,q i ) are no larger than d 0 , or, on the opposite, 3 or 4 of them are larger than d 0 , no adjustment is performed. Adjustment may be necessary if only one or two of those distances are larger than d 0 .  
         [0223]    First consider the case when d(p 2 , q 2 )&gt;d 0 , all others being no larger than d 0 .  
         [0224]    If divergence of points p 2  and q 2  is due to an outlying position of one of the phones, we do not know of which. Therefore, we try to replace each of the suspected outlying positions p 2  and q 2  by interpolated positions p′ 2  and q′ 2  respectively. Interpolating cell phone positions is described below.  
         [0225]    First, we check the condition d(p′ 2 ,q 2 )≦d 0 . If it is true, we assume that p 2  was an outlying position, we replace it with the interpolated position p′ 2 , and proceed. Now the pair of phones a 1  (with p 2  replaced by p′ 2 ) and a 2  may be deemed as belonging to a common cluster, and they are replaced by a non-unit cluster containing them both.  
         [0226]    If the condition d(p′ 2 ,q 2 )≦d 0  does not hold, we check the condition d(p 2 ,q′ 2 )≦d 0 , and proceed in a similar fashion. If not, we can try the condition d(p′ 2 ,q′ 2 )≦d 0 .  
         [0227]    The case of d(p 3 ,q 3 )&gt;d 0  is completely similar.  
         [0228]    Now consider the case of two large divergences: d(p 2 , q 2 )&gt;d 0  and d(p 3 ,q 3 )&gt;d 0 . First, we try to adjust the positions p 2  and q 2 , and if successful, then adjustment for p 3  and q 3  is attempted. If both adjustments are successful, a new non-unit cluster is created; otherwise both unit clusters remain unchanged.  
         [0229]    If endpoints p 1 , p 4  are trouble-makers, no interpolation is performed, and the cell phones will be put on a pending list for possible future resolution of the problem.  
         [0230]    Now we describe interpolating cell phone positions.  
         [0231]    If two positions p 1  and p 3  are on the same section, simple linear interpolation in time will suffice. If p 1  and p 3  belong to adjacent sections, first a route connecting them is calculated, and thereafter linear interpolation in time is performed. If p 1  and p 3  are far away (a rare case), then linear interpolation is probably not safe and should not be attempted.  
         [0232]    Note. It should be noted that rating of sibling CPs as sharing a common vehicle does not necessarily classify them in that manner permanently. In a future moment they may become separate as for instance an individual cell phone user traveling in a bus and changing to another bus later. When such a change occurs, a new travel path is created for each CP as described above. It is expected therefore, that most double or triple recordings of the multiple cell phones from common vehicles may be identified and clustered into common vehicles at an early stage to arrive at the correct number of recorded vehicles on each road section.  
         [0233]    Representation of Vehicles by Vehicular Clusters  
         [0234]    After all feasible vehicular clusters have been grouped together, each one is assigned a new vehicular identity AU 1 , AU 2 , etc. For the purposes of this invention, this new identity, say, AU 1  will be considered representative of the cluster coordinates, speed, and movement directions (see FIG. 8), and will be called a ‘vehicle’ AU 1 .  
         [0235]    All other individual CP cell phones not included in clusters but satisfying traveling profile characteristics and conditions as described above will also receive similar vehicular identities AUn and will be called unit clusters.  
         [0236]    For the purposes of traffic load calculations for each road section, each AU entity will represent a vehicle, and coordinates of all clusters will be calculated as the averages of the corresponding coordinates of cell phones in the corresponding cluster.  
         [0237]    Creating Travel Path Profile for Each Vehicle (Speed, Direction of Travel)  
         [0238]    Each AU vehicle is associated with an appropriate road section (the road section it is ostensibly traveling on at a particular moment) and put on a current vehicle list CVL. It will be required that at least 4 AU positions be recorded at consecutive time intervals and stored on Previous Vehicle Lists (PVL) similar to Previous Phone Lists. The CVL will be analyzed with respect to vehicle coordinates, and the vehicles assigned to appropriate road sections (see FIG. 10). The purpose of this analysis is to maintain a sequential path for each vehicle similar to the PPP paths of cell phones mentioned above. Each additional vehicle record is stored in the current list CVL and analyzed with respect to its previous positions, speed and directions. It is expected that new additional information together with previous recorded data will provide a plausible progression profile for each vehicle.  
         [0239]    It should be noted that some continuity criteria for the validity of the Vehicle Path Profile will be applied as in the creation of cell phone profiles PPPs above. Namely, for each vehicle, the vehicle path profile can only be constructed if the predetermined number of its lately recorded positions (say, 4 or 5) is available on the PVL and CVL lists.  
         [0240]    However, there are differences as compared to the treatment of cell phones above. First, ‘vehicles’, i.e. vehicular clusters, are ‘created’ from groups of cell phones after the data on cell phones have been cleaned as described above so that most problems resulting from bad data do not arise here. Second, vehicles may contain sets of active cell phones rather than individual phones. FIG. 11 illustrates the criteria for placing cell phones into vehicular clusters and FIG. 12 illustrates groping cell phones into vehicular clusters.  
         [0241]    Attaching Real Time Traffic Related Information to Road Sections  
         [0242]    In order to define real time vehicle information on road sections, some assumptions must be made.  
         [0243]    1. The vast majority of vehicles travelling on the roads are equipped with some kind of cellular phone device connected to network operators. It will be assumed that all cell phone data from these various operators will be available and will be processed in the Central Traffic Database.  
         [0244]    2. We assume that vehicles without cell phones in major urban centers represent only a fraction of total vehicles traveling and this number will progressively decrease. Later we will describe the methodology of estimating the number of vehicles without cell phones and their influence on real vehicle traffic loads on urban roads.  
         [0245]    3. In the event that the ratio of vehicles with cell phones to the total number of travelling vehicles approaches 90% to 100%, the data obtained in the framework of the present system can be considered truly representative traffic data. Naturally, in the event that this ratio is less favorable, the information obtained on the totality of vehicles will still be useful as statistical data but less reliable as real time traffic data. For example, these statistical data may be applied to general vehicle load patterns in various urban locations but less applicable for specific automated traffic signal controllers.  
         [0246]    [0246]FIG. 13 illustrates placing vehicles on road sections. As shown in FIG. 13, in order to prepare statistical tables based on real time vehicle-related information for each AU on road sections, the CVL and PVL data are recorded according to the specific road sections. In addition, each road section RS contains real time data such as vehicle ID, recorded observation time t, and each vehicle position stored over a given period of time, say, Δt=16 min. The time Δt is further subdivided into shorter observation time slots such as 2 as minutes. These slots may correspond to the expected intervals between each vehicle consecutive positions on a corresponding road section on the Road Section List. Any vehicle whose position coordinates correspond to the given RS will be recorded on this RS according to its specific time slot. In this fashion, a full updated list of all presently recorded vehicles passing through the RS in Δt can be constructed. The total number of vehicles at each RS will represent current traffic load CTL on that particular RS. Entry and exit times (ENT) and (EXT) (first and last recorded positions for each vehicle AU) can also be calculated for each road section RS 1 . It should be noted here that time EXT can be obtained only after the vehicle AU was observed on the next consecutive, usually adjacent, road section, say, RS 2  at a later time moment T 6 . (This is necessary in order to avoid the possibility that the AU is still located on the RS 1  and waiting to turn to RS 2 ).  
         [0247]    The data structures associated with sections and used for computing the times ENT and EXT are as follows. Each such data structure related to a particular section RS consists of two lists of vehicles as shown in FIG. 14. The first list, Entry List (ENL), contains all the vehicles presently traveling on this section of the road identified by their together with their ENTs. The second list, EXL, represents a queue of the latest n vehicles (optionally, n is set equal to 3) that already left section RS. The database stores their IDs together with their ENTs and their EXTs. The two lists are updated as follows: When a vehicle enters section RS, it is put on ENL of RS together with its ENT. When a vehicle leaves RS, it is removed from ENL of RS and is put last on EXL of RS together with its ENT and EXT. Simultaneously, the first vehicle in the queue is removed from EXL of RS.  
         [0248]    Every RS containing a new vehicle data can be updated automatically on a real time dynamic traffic flow map for each observed time Δt within a given region. It is expected that for any Δt, each vehicle may be recorded on a number of RSs depending on the speed and direction of the traffic flow. All data that needs to be extracted for each RS such as RS loading, estimated vehicle travelling velocities, number of turning vehicles(as will be explained bellow), predicted intersection loads and directions etc., can be obtained for specific time slot or for the overall period Δt.  
         [0249]    Maintaining Statistical Traffic Data Table  
         [0250]    The Traffic Service Center monitors all traveling vehicles AU and registers their travel times, loads etc. on road sections as described above. Thus, we obtain empirical travel times along all sections, number of vehicles per section at interval Δt, travelling speed coefficient for that RS and other data which will be stored in the Traffic Service Center database. All sections will also contain other pertaining information such as type of road, day of the week, month in the year etc. These data will allow for seasonal changes between summer and winter etc.), various combinations of working days or holidays, holidays for students and school pupils, time of the day (see FIGS. 16 and 17).  
         [0251]    It should be noted that real time observations for a great number of road sections might create system memory problems. For this reason, the concept of limited Δt real time observation period was introduced to be used according the available system capacity. It is expected however, that a separate Statistical Traffic Data Table for each road section RS can also be constructed. This table will record all available traffic information for each individual RS such as number of vehicles, average vehicle speeds, directions etc. on hourly, daily or weekly etc. basis. This information can be used as a statistical supplement for the real time data or for developing overall regional traffic analysis.  
         [0252]    Statistical Prediction of Travel Times On Road Sections  
         [0253]    A still better way to account for variations of travel times due to changing traffic conditions is to use statistical prediction methods. A simple one is linear regression prediction.  
         [0254]    Regression-Based Prediction of Current Travel Times presented in FIG. 15 is performed as follows: Assume that the EXL contains n travel times Δt 1 ,Δt 2 , . . . , Δtn, while t 1 ,t 2 , . . . ,t n  are the corresponding entry times. Also assume that the entry times are ordered increasingly: t 1 &lt;t 2 &lt; . . . &lt;t n . Then computing a linear regression of the travel times Δt 1 ,Δt 2 , . . . ,Δt n , on the entry times t 1 , t 2 , . . . , t n , we can predict a future travel time as a predicted value of Δt at time moment t. Predicted future travel time values will then be utilized by traffic controllers in adjusting the traffic flow according to the computed linear regression estimates in subsequent time intervals. We assume that by using regression curves a better approximation of the future traffic loads and their distribution can be achieved. Similarly, these predicted values could also be used in traffic navigation systems and in future traffic loads prediction tables.  
         [0255]    Preparing True Vehicle Loads for All Road Sections (Adjusting for Vehicles without Cell Phones)  
         [0256]    Estimating real vehicle load for each road section and intersection is an essential element of all traffic light control applications. Besides other factors, it is required to obtain the true quantity of vehicles located on particular road sections at a given time. For the purposes of this invention, vehicles without cell phones must also be taken into account in traffic load calculations. Estimation of the overall number of those vehicles can be accomplished in several ways the main of which are listed below.  
         [0257]    A. By utilizing public poll statistical data on population of cell phone owners. In the traffic areas where no other information exists with regard to numbers of vehicles without cell phones, it may be possible, through various information polls and specific questionnaires, to determine number of cell phone users in cars in specific geographical regions on daily basis. This may provide a general picture of usage of cell phones by drivers for certain destinations but still may not truly estimate existing vehicle loads on all road sections at a given time as they may vary from place to place and from one time of the day to another.  
         [0258]    B. By using detailed existing statistical traffic load data for various municipal traffic study areas. In many urban areas traffic authorities constantly update the existing estimates of traffic loads for specific key zones in order to establish available parking spaces, high peak time periods, peak traffic congestion periods, etc. As these data are constantly updated, it may be advantageous to use the current vehicle data and the corresponding cell phone data to establish a usable statistical ratio R (the number of cell phones in vehicles to the total number of vehicles) to be used in RS load calculations.  
         [0259]    C. By determining a reliable ratio R of vehicles equipped with cell phones to the total number of vehicles by comparing two methods of counting vehicles wherever possible. In any large city there are roads and signal intersections equipped with detectors, ramp meters, and similar devices for counting passing cars. If their outputs are available to our system, they can be used for estimating the ratio R introduced above. If at a specific road section at a particular moment, k 1  cell phones have been identified by our system and simultaneously n 1  vehicles have been registered by road detectors, the estimate for R may be calculated as {circumflex over (R)} 1 =k 1 /n 1 . Assuming at another road section without vehicle counters, k cell phones have been identified by our system, we can estimate the number of vehicles located there as {circumflex over (n)}=k/{circumflex over (R)} 1 . Of course, we can calculate an estimate for R averaged over a number of sections with detectors, etc. It appears that this method could provide closer estimates because they are obtained from nearby regions at the same time and therefore reflect similar traffic situations.  
         [0260]    It may also be advantageous to introduce another control parameter in a system of determining the traffic volume on each individual road section RS. Statistical estimates of quantities of vehicles obtained via the R ratio should also be compared to the historical statistical data if available. The final vehicle estimate {circumflex over (N)} will then be established by the following rule:  
           {circumflex over (N)}={circumflex over (n)}if {circumflex over (n)}&gt;n   hist ,  
         [0261]    otherwise  
         
       {circumflex over (N)}=n 
       hist  
     
         [0262]    where, {circumflex over (n)} is the estimate obtained via {circumflex over (R+EE. and n hist  the historical estimate. )} 
         [0263]    It is expected that by comparing the obtained data with the historical results any gross discrepancies can be eliminated.  
         [0264]    Updating Data for Various Traffic Optimization Programs, Automated Actuated Traffic Signal Controllers, And Various Travel Navigation Systems  
         [0265]    As described above in the main body of the specification, the exemplary embodiment of the present invention provides a method for computing the following information:  
         [0266]    real time traffic load data for road sections;  
         [0267]    automatic calculation of current travel times for road sections;  
         [0268]    vehicle flow directions;  
         [0269]    statistical updates of the above; and  
         [0270]    short-term predictions of the above.  
         [0271]    All this information can be utilized by various traffic optimization programs and automated actuated traffic signal controllers for specific computations in their own traffic optimization models.  
         [0272]    Traffic signal models calculate cycle length, signal phases, phase splits, offsets, etc. They provide simple or two-phase plans, or can be tailored to allow heavy traffic phasing. Many signal intersections also allow for left turning phase, opposing traffic phase, lead phase etc.  
         [0273]    Both master and single actuated traffic signal controllers such as NEMA local controllers are used at many locations for signal intersection control. Their control operation requires phasing and timing of traffic signal data, traffic turn movement counts, traffic turns movement percentages, and traffic volumes that can be provided by the system described in the specification.  
         [0274]    Within the scope of this patent we assume that our communication network can also transmit real time data updates to other client application programs such as guided navigation systems, traffic related and congestion studies, emergency 911 services, etc. These services can be provided independently from our traffic center database server via Internet and WAP applications.  
         [0275]    Methods for obtaining some more specific traffic data will be further described in the following Patent Refinements and Future Embodiments section.  
         [0276]    Patent Refinements and Future Embodiments  
         [0277]    This section describes a number of possible improvements of the exemplary embodiment of the present invention in the form of additional embodiments that may be implemented either instead of the first exemplary embodiment or added as refinements at later stages of implementation. It should be kept in mind, however, that possible extensions to the present invention are by no means limited to the embodiments described below.  
         [0278]    Future Embodiment  
         [0279]    The purpose of this embodiment is to provide additional examples of the kinds of traffic data that can be also obtained and computed on the basis of the information-gathering model developed in the present invention. The examples presented here include among others traffic turn movement counts, traffic turns movement percentages, left and right turns, traffic loads at each road intersection, and road saturation percentages. Turning-vehicle volumes for each intersection node INT may be defined as the total number of completed vehicle turns: (i.e. sum of left turns, right turns and straight pass-throughs for a given time T) for that node. The vehicle turns will be further expressed in terms of RT and LT turn movement percentages and turn preference values. We give here a brief description of a method of turn movement counts of vehicles located near road intersections and adjacent road sections.  
         [0280]    We start by creating a Current And Daily Turning-Vehicle Table for Road Intersections (see FIG. 18). This table stores total number of vehicles which have completed left and right-turns, straight pass-throughs (no-turn) at a given time interval (say 2-15 min.) at road intersection nodes INT 1 , INT 2 , . . . All intersections in this table are grouped together according to specific geographical regions and with an updated list of turning options allowed for a given location. Another table, Current And Daily Vehicle Traffic Loads Table for Road Sections (see FIG. 19), will be created for each road section RS. It contains total number of vehicles that have traveled on this RS, or traffic loads for that RS in the period T. It will also contain current turning data and turning options at a given RS.  
         [0281]    The turning computations are executed in the following manner: The position P (x, y) of each vehicular cluster AU travelling on a road section RS is recorded at time T as shown in FIG. 20. In this example, vehicle AU 33  is first recorded at time T 1  in position P 1  (x 1 , y 1 ). After applying the Positioning Algorithm described above, AU 33  is positioned on the corresponding road section i.e. on RS 4 , then at time T 2  on RS 12 , at T 3  on RS 13 , etc. When the vehicle AU 33  has left RS 4  and is next recorded on RS 12  at time interval T 1 -T 2  it is considered to have “cleared” INT 1  intersection node and is recorded in the intersection table at INT 1 . If the AU cannot be found on any adjacent RS, it will be assumed no turn was executed yet.  
         [0282]    Vehicle loads, traffic loads and road saturation percentages for each INT will be computed at a given time T as the sum total all of vehicles N that have “cleared” the adjacent INT and are observed traveling on another RS. All turns, right-turns, left-turns, and straight pass-throughs are also computed for that appropriate RS and the results updated in current and statistical tables. We expect, that the turn volume data and movement percentages obtained in this embodiment together with timing and phasing data provided by the traffic controller will supply sufficient real time data necessary for planning of actuated traffic signal controllers.  
         [0283]    Although the invention has been described with reference to exemplary embodiments, it is not limited thereto. Rather, the appended claims should be construed to include other variants and embodiments of the invention which may be made by those skilled in the art without departing from the true spirit and scope of the present invention.