# Patent

## Title
Urban computing of route-oriented vehicles

## Abstract

Techniques for analyzing effectiveness of an urban area based on traffic patterns collected from route-oriented vehicles. A process collects sequences of global positioning system (GPS) points in logs and identifies geographical locations to represent the urban area where the route-oriented vehicles traveled. The process models traffic patterns by: partitioning the urban area into regions based at least in part on major roads, segmenting the GPS points from the logs into time slots, and identifying the GPS points associated with transporting a passenger in the route-oriented vehicles. The process models traffic patterns by projecting the identified GPS points onto the regions to construct transitions of the identified GPS points travelling between the regions. Then the process builds a matrix of the regions for each time slot in each day based on a number of the transitions. Each item in the matrix represents an effectiveness of a connection between two regions.

## Background
BACKGROUND
Ubiquitous computing is a model of human-computer interaction to integrate information processing into daily activities. For instance, ubiquitous computing includes multiple computational devices and systems operating simultaneously. Recently, ubiquitous computing is applied to urban areas, which includes physical movements and interpretations of social context. As a result, urban computing is emerging as a concept where every sensor, person, vehicle, building, and street in the urban areas may be used as a computing component for serving people and their towns or their cities.
Urban computing may be used for urban planning that integrates land-use planning and transportation planning to improve built, economic, and social environments of communities. Urbanization is increasing at a fast pace in developing countries. Meanwhile, urban reconstruction, renewal, and suburbanization are occurring in countries that have already been developed. However, there are opportunities for innovative technologies that may automatically and inconspicuously sense urban dynamics and provide crucial information to urban planners.
For instance, a large number of taxicabs transport passengers in urban areas. Some taxicabs may be equipped with sensors to record their location data to a centralized server at regular intervals. The taxicabs may be considered to be ubiquitous mobile sensors constantly probing the urban areas' traffic patterns. Thus, there is an increasing opportunity to utilize the location data of route-oriented vehicles.
SUMMARY
This disclosure describes analyzing effectiveness of an urban area based on traffic patterns collected from logs of route-oriented vehicles. In one aspect, a process collects sequences of global positioning system (GPS) points in the logs and identifies geographical locations to represent the urban area where the route-oriented vehicles traveled based on the logs. The process models traffic patterns in the urban area by: partitioning the urban area into regions based at least in part on major roads, segmenting the GPS points from the logs into time slots, and identifying the GPS points associated with transporting a passenger in the route-oriented vehicles. The process further models traffic patterns by projecting the identified GPS points onto the regions to construct transitions of the identified GPS points travelling between the regions. Then the process builds a matrix of the regions for each time slot in each day based on a number of the transitions. Each item in the matrix represents an effectiveness of connectivity between the regions.
In another aspect, an interface receives user input for an urban area to be evaluated for an efficiency of the planning of the urban area. An area computing application receives sequences of global positioning system (GPS) points from logs of route-oriented vehicles and creates a model of the traffic patterns in the urban area being selected based on the GPS points. The model identifies pairs of regions in the urban area having a set of transitions between them when travelling in the regions. The area computing application aggregates the transitions to associate each pair of regions with a volume of traffic between the pair of regions, expected travel speeds of the transitions, and a ratio between an actual travel distance and an Euclidan distance between centroids of each of the pair of regions. An identified pair of regions may require the route-oriented vehicles to take detours based on congested traffic when travelling between the identified pair of regions. Based on this evaluation, recommendations may be provided for converting streets to one way streets, adding more lanes to the streets, adding more roads, adding another subway line, adding a bus stop, adding a train stop, building a shopping area, and the like.
This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.



BRIEF DESCRIPTION OF THE DRAWINGS
The Detailed Description is set forth with reference to the accompanying figures. In the figures, the left-most digit(s) of a reference number identifies the figure in which the reference number first appears. The use of the same reference numbers in different figures indicates similar or identical items.
FIG. 1 illustrates an architecture to support an example environment to evaluate an effectiveness of planning of an urban area.
FIG. 2 is a flowchart showing example phases to: collect GPS points, model traffic patterns between the regions, identify a set of skylines from a model, and evaluate effectiveness of the planning of the urban area to be used in the architecture of FIG. 1.
FIG. 3 is a flowchart showing an example process of collecting the GPS points from the logs of the route-oriented vehicles.
FIG. 4 is a flowchart showing an example process of modeling traffic patterns and connectivity between the regions in the urban area based on the GPS points.
FIG. 5 illustrates an example map of partitioning the urban area into regions based at least on using major roads.
FIGS. 6A and 6B illustrate example charts of segmenting the GPS points into time slots for weekdays and weekends/holidays, respectively with their speeds.
FIG. 7 illustrates an example process of projecting the GPS points onto the regions and constructing transitions between the regions.
FIG. 8 illustrates an example graph of pairs of regions having a set of transitions between them.
FIG. 9 illustrates an example graph of a set of skylines from the model to represent a portion of the urban area.
FIG. 10 illustrates example kinds of pairs of regions in the set of skylines.
FIG. 11 illustrates an example process of formulating skyline graphs based on the pairs of regions connected from consecutive time slots.
FIG. 12 illustrates examples of mined frequent skyline patterns.
FIG. 13 illustrates an example heat map of the urban area using shapes to represent a number of passengers reaching the regions.
FIG. 14 is a block diagram showing an example server usable with the environment of FIG. 1.



DETAILED DESCRIPTION
Overview
This disclosure describes evaluating effectiveness of an urban area based on information collected from the logs of the route-oriented vehicles. The route-oriented vehicles travel frequently in the urban area to pick up passengers and to drop the passengers off in their desired destinations. Typically, a majority of the route-oriented vehicles tend to be equipped with sensors, such as global positioning system (GPS) sensors, which enable the route-oriented vehicles to report their locations to a centralized server at regular intervals. For instance, the sensors may collect the GPS points at regular intervals, such as every one to two minutes, every two to five minutes, or may be set at shorter or longer intervals.
As a result, the route-oriented vehicles equipped with the sensors are constantly probing the urban areas' traffic patterns, such as traffic flow on the roads and city-wide travel patterns of people in the route-oriented vehicles. For instance, a large city may have approximately 67,000 route-oriented vehicles generating an average of 1.2 million trips per day with passengers in the route-oriented vehicles. The 1.2 million trips per day generated by the route-oriented vehicles tend to have an average of 1.2 passengers per trip. This number represents about 5% of total personal trips created by various transportation systems including buses, subways, private vehicles, and the route-oriented vehicles. Based on the 5% of total personal trips, the route-oriented vehicles represent actual traffic patterns on the roads in the urban area. As a result, a process may create a model to model traffic patterns and to connect the traffic flows between the regions in the urban area.
Traffic data is collected via the GPS sensors in logs of the route-oriented vehicles. A process extracts trajectories, which are sequences of GPS points from the logs. The trajectories represent trips for the route-oriented vehicles and imply human knowledge from drivers of the route-oriented vehicles. For example, human knowledge may include driving conditions during rush hour, road constructions, direction turns, and the like.
While aspects of described techniques can be implemented in any number of different computing systems, environments, and/or configurations, implementations are described in the context of the following example computing environment.
ILLUSTRATIVE ENVIRONMENT
FIG. 1 illustrates an example architectural environment 100, in which an evaluation of an effectiveness of planning of an urban area may be determined on a computing device. The environment 100 includes an example computing device 102, which is illustrated as a mobile device. The computing device 102 is configured to connect via one or more network(s) 104 to access a planning service 106 for a user 108. It is noted that the computing device 102 may take a variety of forms, including, but not limited to, a portable handheld computing device (e.g., a personal digital assistant, a smart phone, a cellular phone), a personal navigation device, a laptop computer, a desktop computer, a portable media player, or any other device capable of connecting to one or more network(s) 104 to access the planning service 106 for the user 108.
The network(s) 104 represents any type of communications network(s), including wire-based networks (e.g., cable), wireless networks (e.g., cellular, satellite), cellular telecommunications network(s), WiFi networks, and IP-based telecommunications network(s). The planning service 106 represents an urban planning service that may be operated as part of any number of online service providers, such as a search engine. In another implementation, the planning service 106 may be a map-based application stored in memory of the computing device 102. Updates with GPS logs and trajectories may be sent for an area computing application that is stored on a mobile device.
In the illustrated example, the computing device 102 may include a user interface (UI) 110 that is presented on a display of the computing device 102. The user interface 110 facilitates access to the planning service 106 that provides the evaluation of the planning of urban area(s). The user 108 also employs the UI 110 to submit a request for an urban area from the planning service 106.
In one implementation, the UI 110 is a browser-based UI that presents a page received from the trajectory datasets of the route-oriented vehicles. The UI 110 shows trajectory datasets for “Year X” and “Year Y.” The UI 110 illustrates the datasets are collected from about 29,800 route-oriented vehicles in Year X and from about 32,400 route-oriented vehicles in Year Y. The UI 100 also illustrates the number of GPS points is approximately 978 million in Year X and approximately 1730 million in Year Y.
In the illustrated example, the planning service 106 is hosted on one or more area computing servers, such as area computing server(s) 112(1), 112(2), . . . , 112(S), accessible via the network(s) 104. The area computing servers 112(1)-(S) may be configured as plural independent servers, or as a collection of servers that are configured to perform larger scale functions accessible by the network(s) 104. The area computing server(s) 112 may be administered or hosted by a network service provider that provides the planning service 106 to and from the computing device 102.
The planning service 106 further includes an area computing application 114 that executes on one or more of the area computing servers 112(1)-(S). The area computing application 114 provides the evaluation of the effectiveness of the urban area, which first includes collecting logs from the route-oriented vehicles. Data from the route-oriented vehicles are used as drivers are very familiar with urban roads and time-variant traffic flows on the urban roads. The drivers know the fastest routes, which are short and quick, but not necessarily the shortest in distance. Thus, the data of the route-oriented vehicles enhances the area computing application 114 by mining human knowledge, such as learning smart driving directions.
The area computing application 114 processes the global positioning system (GPS) logs from various types of route-oriented vehicles. Based on the logs collected, the area computing application 114 identifies geographical locations where the route-oriented vehicles have traveled to generate a map of the urban area. To better identify effective driving directions in the geographical locations, the area computing application 114 parses trajectories from the logs. The urban area may be further partitioned into multiple regions based at least on the major roads.
The trajectory datasets may be stored in a database 116, which is then used to construct a model based at least in part on the traffic patterns of the route-oriented vehicles. The model involves associating each route-oriented vehicle trajectory to a corresponding region in the urban area. Details of constructing the model are described with reference to FIGS. 4-8.
As mentioned, the environment 100 may include the database 116, which may be a separate server or may be a representative set of server 112 that is accessible via the network(s) 104. The database 116 may store information, such as logs for one or more route-oriented vehicle(s) 118, a sequence of global positioning system (GPS) points, trajectories archive, graphs, a matrix, models, other data, and the like.
The environment 100 shows a representation of the urban area 120 computed as a result of the GPS logs from the route-oriented vehicles 118. The representation of the urban area 120 illustrates evaluations and recommendations performed by the area computing application 114 to the user 108. For instance, at 122 is a recommendation for a subway line to decrease the traffic.
FIG. 2 is a flowchart of an example process 200 showing high-level functions performed by the area computing application 114. These processes are illustrated as logical flow graphs, each operation of which represents a sequence of operations that can be implemented in hardware, software, or a combination thereof. In the context of software, the operations represent computer-executable instructions stored on one or more computer-readable storage media that, when executed by one or more processors, perform the recited operations. Generally, computer-executable instructions include routines, programs, objects, components, data structures, and the like that perform particular functions or implement particular abstract data types. For discussion purposes, the processes are described with reference to the computing environment 100 shown in FIG. 1. However, the processes may be performed using different environments and devices. Moreover, the environments and devices described herein may be used to perform different processes.
For ease of understanding, the methods are delineated as separate steps represented as independent blocks in the figures. However, these separately delineated steps should not be construed as necessarily order dependent in their performance. The order in which the process is described is not intended to be construed as a limitation, and any number of the described process blocks maybe be combined in any order to implement the method, or an alternate method. Moreover, it is also possible for one or more of the provided steps to be omitted.
The area computing application 114 provides the evaluation of the urban area based on the log information collected from the route-oriented vehicles 118. The process 200 may be divided into four phases, an initial phase to collect GPS points from logs of route-oriented vehicles 202, a second phase to model traffic patterns and connectivity between the regions in the urban area based on the GPS points 204, a third phase to identify a set of skylines from the model to represent a portion of the urban area 206, and a fourth phase to evaluate the effectiveness of planning of the urban area 208. All of the phases may be used in the environment of FIG. 1, may be performed separately or in combination, and without any particular order.
The first phase is to collect the GPS points from the logs of the route-oriented vehicles 202. For instance, the area computing application 114 collects the logs from various types of route-oriented vehicles 118 that transport passengers, including but not limited to taxicabs, limousines, and shuttles. These types of route-oriented vehicles 118 tend to focus on picking up and dropping off passengers in the urban area. The logs may be obtained from GPS sensors located on each of the route-oriented vehicles 118. The logs are generally a collection of GPS points, which includes a date, a time, a longitude coordinate, and a latitude coordinate. Also, the GPS points associated with transporting passengers are selected for the evaluation, so the route-oriented vehicles 118 may include a weight sensor for each of the route-oriented vehicles 118 to detect passengers other than the driver, a weight sensor to determine an occupancy status in a passenger seat of the route-oriented vehicle 118, an identifier for the driver to specify a passenger is present in the route-oriented vehicle 118, and the like. From the logs, the geographical locations are identified in the urban area.
The second phase is to model traffic patterns and connectivity between the regions in the urban area based on the GPS points 204. For example, the area computing application 114 models the traffic patterns by: partitioning the urban area into regions based at least in part on major roads, segmenting the GPS points from the logs into time slots, and identifying the GPS points associated with transporting a passenger in the route-oriented vehicles 118. The area computing application 114 projects the GPS points onto the regions to identify pairs of regions having a set of transitions between them when travelling in the regions and builds a matrix for the regions.
The third phase is to identify a set of skylines from the model to represent a portion of the urban area 206. The term skyline describes a graphical representation of the data. For instance, the set of skylines represents the GPS points with travel speeds and ratios of actual travel distance and an Euclidan distance between centroids of each of the pair of regions, which are less efficient than other GPS points. The area computing application 114 then identifies pairs of regions having small travel speeds and large ratios of the actual travel distance and the Euclidan distance between centroids of each of the pair of regions. The identified pairs of regions may require the route-oriented vehicles 118 to take detours based on congested traffic when travelling between the identified pairs of regions.
The fourth phase is to evaluate the effectiveness of planning of the urban area 208. Based on this evaluation, the area computing application 114 may provide recommendations for building new roads, converting streets to one way streets, adding more lanes to existing roads, adding new roads, adding another subway line, adding a bus stop, adding a train stop, and the like. Details are discussed for collecting GPS points from logs of the route-oriented vehicles 202 with reference to FIG. 3; for modeling traffic patterns 204 with reference to FIGS. 4-8, for creating and mining skylines with reference to FIGS. 9-12, and for evaluating the effectiveness of planning of the urban area with reference to FIG. 13.
Collect GPS Points from Logs of Route-Oriented Vehicles
FIG. 3 is a flowchart illustrating an example process for phase 202 (discussed at a high level above) of collecting the GPS points from the logs of the route-oriented vehicles 118. The area computing application 114 may use the collected GPS logs from the centralized server or receive the GPS logs from the route-oriented vehicle companies. Drivers for the route-oriented vehicles 118 may be very familiar with the roads and time-variant traffic flows on the roads. To be effective and to make profit, the drivers for the route-oriented vehicles 118 tend to select a fastest route based on their knowledge. Along with their knowledge, the drivers consider other factors, such as traffic flows and signals, accidents, road constructions, direction turns, and the like. By directly following their routes that are well supported by the GPS logs, the knowledge of the drivers may be effectively used.
The area computing application 114 identifies the geographical locations from the logs to represent the urban area 302. The geographical locations from the logs represent roads and streets where the route-oriented vehicles 118 have traveled as recorded in the logs.
It is possible to collect log information since a large number of the route-oriented vehicles 118 may be equipped with GPS sensors that automatically record a trajectory, which is a sequence of time-ordered GPS points. The trajectory may be represented by Tr. Each trajectory may include the sequence of GPS points represented as p1→p2→p3→ . . . →pn.
At 304, the GPS sensors record timestamps, coordinates of locations, and status of occupancy of each route-oriented vehicle 118 for a GPS point. The status of occupancy may be determined by a weight sensor for each of the route-oriented vehicles 118 to detect passengers other than the driver, a weight sensor on seats to determine if passengers occupied the seats of the route-oriented vehicles 118, an identifier of occupancy associated with fares indicating passenger(s) are present in the route-oriented vehicle 118, and the like. For instance, the GPS point may contain a date, a time in a.m. or p.m., a longitude coordinate, a latitude coordinate, and the status of occupancy which may be collected with a low sampling rate every one-two minutes or every two-five minutes per point. Thus, the GPS point may be represented by p=(d, t, long, lat, o).
At 306, the area computing application 114 may identify the GPS points from the trajectory datasets based on satisfying a criteria. For instance, the criteria may include certain dates in the year, specific times during rush hour, weekdays, and an occupied status indicating a passenger was being transported in the route-oriented vehicle 118. In another implementation, the criteria may include summer months, specific times during rush hour, weekends, and the occupied status of the passenger in the route-oriented vehicles.
After the GPS points for the route-oriented vehicle logs have been collected, the area computing application 114 may store the trajectory datasets in the database 116 or archive the information 308. The area computing application 114 uses the GPS points to create a model.
Model Traffic Patterns and Connectivity Between Regions Based on GPS Points
FIG. 4 is a flowchart illustrating an example process for phase 204 (discussed at a high level above) of modeling traffic patterns and connectivity between the regions in the urban area based on the GPS points. The area computing application 114 partitions the urban area into regions represented by (r) based at least on using major roads 402. The use of regions helps provide rich knowledge about people's living and travel conditions. Also any problems or flaws in the regions are reflected in both land-use and transportation planning. An example of partitioning the urban area will be discussed with reference to FIG. 5.
The area computing application 114 may separate the GPS points from the logs into time slots 404. For instance, the area computing application 114 separates the GPS points into two groups, 1) weekdays and 2) weekends and/or holidays. Then the GPS points are further divided according to the time of day into time slots. It is commonly understood that the time of day for travelling on the roads may affect the speed of the route-oriented vehicles 118. Traffic patterns are considerably different during rush hour on weekdays as compared to weekends. For example, the time of day may be grouped into three or four time slots that are different for weekends than weekends or holidays, as shown below.







TABLE I







Time Partition for Weekdays and Weekends/Holidays











Time
Weekdays
Weekends/Holidays







Slot 1
 7:00 am-10:30 am
 9:00 am-12:30 pm



Slot 2
10:30 am-4:00 pm 
12:30 pm-7:30 pm 



Slot 3
4:00 pm-7:30 pm
7:30 pm-9:00 am



Slot 4
7:30 pm-7:00 am










The area computing application 114 identifies the GPS points associated with the passenger in the route-oriented vehicles 406. When there are passengers associated with the GPS points, the trajectories represent actual trips along the roads and streets to desired destinations. Thus, this represents actual traffic congestion.
The area computing application 114 projects the identified GPS points to the urban area and constructs transitions between the regions 408. A transition represented by (s) is generated between two regions if a GPS point represented as pi is a first point in region 1, r1, and pj is a second point in region 2 r2 (i<j). The transition (s) includes a departure time (pi, ti), an arrival time (pj, tj), a travel distance (d) and a travel speed (v). The travel distance (d) may be calculated with the following equation:

d(pi,pj)=Σi≦k<jDist(pk,pk+1)

where Dist(pk, pk+1) denotes the Euclidian distance between two consecutive GPS points.

The travel speed (v) may be calculated with the following equation:

v=d(pipj)/|pj·t−pi·t|

where t represents time. Examples of charts illustrating the speeds of the route-oriented vehicles 118 in certain hours of the day follow with reference to FIGS. 6A and 6B. Examples of the transitions constructed are shown in FIG. 7.

The area computing application 114 plots pairs of regions having a set of transitions between them 410. For instance, the pairs of regions, region 1 and region 2, may be represented by r1→r2 having the set of transitions between them. The area computing application 114 aggregates the transitions so each pair of regions is associated with the following features: (a) volume of traffic between the regions such as a count of transitions |S|, (b) expected travel speed(s) E(V) of the transitions, and (c) the ratio Θ between the expected actual travel distance E(D) and the Euclidian distance between the centroids of two regions, represented as CenDist(r1, r2).
The following equations are used to compute expected travel speed E(V), expected travel distance E(D), and ratio Θ, respectively.



  
    
      E
      ⁡
      
        (
        V
        )
      
    
    =
    
      
        
          ∑
          
            
              s
              i
            
            ∈
            s
          
        
        ⁢
        
          
        
        ⁢
        
          
            s
            i
          
          ·
          v
        
      
      
        
        s
        
      
    
  




  
    
      E
      ⁡
      
        (
        D
        )
      
    
    =
    
      
        
          ∑
          
            
              s
              j
            
            ∈
            s
          
        
        ⁢
        
          
        
        ⁢
        
          
            s
            j
          
          ·
          d
        
      
      
        
        s
        
      
    
  




  
    θ
    =
    
      
        E
        ⁡
        
          (
          D
          )
        
      
      /
      
        CenDist
        ⁡
        
          (
          
            
              r
              1
            
            ,
            
              r
              2
            
          
          )
        
      
    
  



where S is a collection of transitions between r1 and r2. An example graph illustrating expected travel speed E(V), expected actual travel distance E(D), and ratio Θ is shown in FIG. 8.

The area computing application 114 builds a matrix of the regions for each time slot in each day based on the transitions 412. For instance, an item in the matrix is a tuple, ai,j=<|S|, E(V), Θ>, denoting a number of transitions |S|, the expectation of travel speed E(V), and the ratio Θ between regions ri and rj. In an implementation, there may be x weekdays and y weekends or holidays, 4x+3y matrices will be build using the schema of the time slots shown in Table I. The matrix M is shown below.




  M
  =
  
    
      
        
          
        
      
      
        
          
            r
            0
          
          ⁢
          
            
          
          ⁢
          
            r
            1
          
          ⁢
          
            
          
          ⁢
          ...
          ⁢
          
            
          
          ⁢
          
            r
            j
          
          ⁢
          
            
          
          ⁢
          ...
          ⁢
          
            
          
          ⁢
          
            r
            
              n
              -
              1
            
          
          ⁢
          
            
          
          ⁢
          
            r
            n
          
        
      
    
    
      
        
          
            
              
                r
                0
              
            
          
          
            
              
                r
                1
              
            
          
          
            
              ⋮
            
          
          
            
              
                r
                i
              
            
          
          
            
              ⋮
            
          
          
            
              
                r
                
                  n
                  -
                  1
                
              
            
          
          
            
              
                r
                n
              
            
          
        
      
      
        
          [
          
            
              
                ∅
              
              
                
                  a
                  0.1
                
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                
                  a
                  
                    0
                    ,
                    n
                  
                
              
            
            
              
                
                  a
                  
                    1
                    ,
                    0
                  
                
              
              
                ∅
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                
                  a
                  
                    1
                    ⁢
                    n
                  
                
              
            
            
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
            
            
              
                
                  a
                  
                    i
                    ⁢
                    .0
                  
                
              
              
                
                  a
                  
                    i
                    ⁢
                    .1
                  
                
              
              
                ...
              
              
                
                  a
                  
                    i
                    .
                    j
                  
                
              
              
                ...
              
              
                ...
              
              
                
                  a
                  
                    i
                    .
                    n
                  
                
              
            
            
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
            
            
              
                
                  a
                  
                    1
                    ,
                    n
                  
                
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ∅
              
              
                
                  a
                  
                    
                      n
                      -
                      1
                    
                    ,
                    n
                  
                
              
            
            
              
                
                  a
                  
                    n
                    ,
                    0
                  
                
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ...
              
              
                ∅
              
            
          
          ]
        
      
    
  




Example Map of Partitioned Urban Area into Regions

FIG. 5 illustrates an example map of partitioning the urban area into regions based at least on using major roads 402. For instance, a map of the urban area may be divided into disjoint regions, which includes: communities, neighborhoods, subdivisions, roads, streets, and the like. The roads facilitate transportation while the streets facilitate public interaction. The roads include but are not limited to highways and motorways. The streets include but are not limited to pedestrian streets, alleys, city-centre streets, and the like.
In implementations, the major roads 500 may be highlighted with a color or a heavy weight line, and referred to as a first zone that includes the top two communities. Meanwhile, the small roads 502 may be highlighted with another color or a medium weight line, and referred to a second zone that includes smaller areas, which are at a lower level than the first zone. Also, the streets 504 may be highlighted with yet another color or a small weight line, referred to as a third zone that includes smallest areas, and at a lower level than the first zone and the second zone.
Example Charts of GPS Points with Speed Versus Time of Day
FIGS. 6A and 6B illustrate example charts of separating the GPS points from the logs into time slots 404 for weekdays and weekends/holidays, respectively with their speeds. At 600, the chart is for the GPS points collected during the weekdays. The speed 602 of the route-oriented vehicles 118 is shown in (km/h) and the time of day 604 is shown in hour-half increments starting with the hour at 06:00 until 22:30.
The average travel speed is shown at 606. The average travel speed for the route-oriented vehicles 118 in chart 600, from 7:00 am-10:30 am 608 (i.e., slot 1) is lower than that of the entire day. This is expected due to rush hour traffic as there are more vehicles on the roads during this time. Also, the average travel speed during 4:00 pm-7:30 pm 610 (i.e., slot 3) represents the evening rush hour when people are returning home.
The bottom chart 612 illustrates the speed of the route-oriented vehicles 118 and the time of day for weekends or holidays. For instance, the average travel speed is shown at 614. As expected, the average travel speed for the weekdays is slightly slower than the average travel speed for the weekends or holidays.
The charts 600, 612 illustrate in the same time slot, the traffic conditions and semantic meaning of people's travels are similar. The area computing application 114 explores the trajectories from different time slots to detect flaws in the urban planning. Finally, the time partition enables the area computing application 114 to evaluate temporal relationships between the results detected from continuous time slots to understand the flaws in the urban planning.
Construct Transitions Between Regions
FIG. 7 illustrates an example process of projecting the GPS points onto the regions and constructing transitions between the regions 408. The trajectory Tr1 700 traverses from point p0 702 in region r1 704, to p1 706 in region r1 704, to p2 710 in region r1 704, and to p3 712 in region r3 714. The top dark line represents a path 716 of the trajectory Tr1 700. Also shown is a second trajectory Tr2 718.
Turning to the diagram 720 below, the two trajectories Tr1 700 and Tr2 718 are shown with transitions formed between the regions. The first trajectory Tr1 700 traverses from r1→r3 722 to formulate a transition of r1→r3. The second trajectory Tr2 718 traverses from r1→r2→r3 724 to formulate three transitions of: r1→r2, r2→r3, and r1→r3. The second trajectory Tr2 718 discontinuously traverses two regions, r1→r3 but formulates the transition between the two regions. Thus, the distance represented by (d) of this transition may be represented by: Σ4≦k<8DiSt(pk, pk+1) and the travel speed may be represented by d/(p8·t−p4·t).
FIG. 8 illustrates pairs of regions having a set of transitions between them 410. An example graph includes a count of transitions |S| 800 on z-axis, the expectation of travel speed E(V) 802 on y-axis, and the ratio Θ 804 on x-axis. The area computing application 114 plots pairs of regions from a time slot of 7:00 am-10:30 am for a weekday in the <|S|, E(V), Θ> space. A single dot located in the center 806 represents a pair of regions. The pair of regions is projected onto XZ space 808 and YZ space 810. It is noted that Θ may have a value smaller than 1 as the route-oriented vehicles travel across two adjacent regions with a distance shorter than that between the two centroids.
Referring to the second trajectory Tr2 718 that was described in FIG. 7, the route-oriented vehicle 118 may have traveled through several other regions before finally reaching the destination of r3. However, the connectivity of the two regions may be represented by all the possible routes between them instead of the direct or fastest transitions. Often, the driver of the route-oriented vehicle 118 may have to reach a region through a roundabout route travelling through other regions to avoid traffic jams. Also, the discontinuous transitions do not bias the expected travel speed E(V) 802 and the ratio Θ 804. The drivers of the route-oriented vehicles 118 tend to travel through an effective shortcut route between two regions rather than the roundabout route.
For instance, the driver of the route-oriented vehicle 118 intending to travel from r1 to r3, tends to travel the shortcut route by travelling the trajectory path 716. Thus, the number of discontinuous travel is a very small portion in the transition set. As a result, the expected travel speed E(V) 802 and the ratio Θ 804 are close to the real travel speed and ratio that people could travel from r1 to r3. However, if the drivers of the route-oriented vehicles 118 have to reach the destination of r3 by travelling through additional regions such as r2, which is indicative that the route directly connecting r1 to r3 is not very effective.
The graph of <|S|, E(V), Θ> represents the model of traffic patterns and the connectivity between two regions. Specifically, the ratio Θ 804 captures a geometry property of the connection between the pairs of regions. The pair or regions with a large ratio Θ 804 indicates drivers of the route-oriented vehicles 118 have to take a long detour when travelling from one region to another region. The count of transitions |S| 800 and the expected travel speed E(V) 802 represent features of the traffic. For instance, a large count of transitions |S| 800 and a small expected travel speed E(V) 802 imply there is congested traffic by the existing routes between the two regions. One of the purposes is to identify problem areas in the urban area. The area computing application 114 retrieves the pairs of regions with a large count of transitions |S| 800, a small expected travel speed E(V) 802, and a large ratio Θ 804, which is indicative of flaws in the urban area.
Identify a Set of Skylines from the Model
FIG. 9 illustrates an example graph from a third phase 206 (discussed at high level above) to identify a set of skylines from the model to represent a portion of the urban area. As previously mentioned, the area computing application 114 built a matrix of regions, M and now selects the pairs of regions having the number of transitions above an average from the matrix M. The area computing application 114 locates “a skyline set” represented by (L) from the selected region pairs according to the expected travel speed E(V) 802 and the ratio Θ 804. A skyline is defined as points which are not dominated by any other points. For instance, a point dominates another point if the point is as good or better in all dimensions and better in at least one dimension than the another point.
An example process illustrates how the area computing application 114 determines when a first point dominates a second point if the first point is as good or better in all dimensions and better in at least one dimension than the second point. Points are shown in Table II along with expected travel speed E(V), and ratio Θ between the actual travel distance and the Euclidan distance between centroids of each of the pair of regions.







TABLE II







Identifying GPS Points for Skyline










Expected Travel



Point
Speed E(V)
Ratio Θ





1
24
1.6


2
20
2.4


3
30
2.8


4
22
2.0


5
18
1.4


6
34
2.4


7
30
2.0


8
36
3.2









Table II indicates that point 2 dominates point 1 based on the lower E(V) value and higher ratio. Thus, point 1 is not included in the skyline. However, point 2 does not dominate point 3 as point 3 has a higher ratio, indicating point 3 is better than point 2. Also, points 5 and 8 are detected as not being dominated by other points and included in the skyline while points 4, 6, and 7 are dominated by other points.
FIG. 9 further illustrates the expected travel speed E(V) 802 plotted along y-axis and the ratio Θ 804 plotted along x-axis. The dashed line 900 illustrates points representing the pair of regions 900 that have smaller expected travel speeds E(V) 802 and larger ratios Θ 804 than the other points 902 located in the skyline. Each tuple ai,j, L is not dominated by others, such as ap,qLM, in terms of the expected travel speed E(V) 802 and the ratio Θ 804. There are not any pairs of regions ap, qL having smaller expected travel speed E(V) 802 and larger ratio Θ 804 than ai,j L.
FIG. 10 illustrates example kinds of pairs of regions detected in the set of skylines. For instance, at 1000, the pairs of regions in the set of skylines may have properties of a small expected travel speed E(V) 802 between a set of transitions and a small ratio Θ 804 between an actual travel distance of the set of transitions and an Euclidan distance between centroids of each of the pair of regions. The properties here indicate the pairs of regions are connected with some direct routes, while a capacity of these routes is not sufficient as compared to the existing traffic between the two regions. The properties here further indicate the drivers may have no other options but to take ineffective routes for travelling between the two regions.
In another instance at 1002, the pairs of regions in the set of skylines may have properties of a small expected travel speed E(V) 802 between a set of transitions and a large ratio Θ 804 between an actual travel distance of the set of transitions and an Euclidan distance between centroids of each of the pair of regions. The properties here indicate drivers of the route oriented vehicles 118 have to take detours for travelling between two regions while these detours have congested traffic leading to a slow speed. This is one of the worst cases of the kinds of pairs of regions in the set of skylines.
In yet another instance at 1004, the pairs of regions in the set of skylines may have properties of a large expected travel speed E(V) 802 between a set of transitions and a large ratio Θ 804 between an actual travel distance of the set of transitions and an Euclidan distance between centroids of each of the pair of regions. The properties here indicate that the drivers of the route-oriented vehicles 118 take detours such as highways, which are fast when travelling between two regions. Although the expected travel speed E(V) 802 is not slow, the long distance may cost the drivers and current passengers in the route-oriented vehicles more time and gas.
The area computing application 114 identifies the most salient pairs of regions that have flawed planning. The skyline is constructed from the pairs of regions having a large amount of traffic, as represented by the count of transitions |S| 800 that is above average. Thus, the skyline generated is based on many travels of passengers and each expected travel speed E(V) 802, ratio Θ 804 is calculated based on a large number of observations.
FIG. 11 illustrates an example process 1100 of formulating skyline graphs based on the pairs of regions connected from consecutive time slots. Shown along the left side are time periods of slot 1, slot 2, and slot 3 at 1102. Table I. previously illustrated how the time slots correspond to different hours based on whether the day is a weekday or a weekend or holiday. Shown along the top are days, DAY 1, DAY 2, DAY 3 at 1104.
The process 1100 identifies a skyline in each time slot 1102 of each day 1104. For instance, two pairs or regions from two consecutive slots may be connected if the pairs of regions are spatially close to each other. For example, in DAY 1, the process 1100 connects the pairs of regions r1→r2 from slot 1 at 1106 to r2→r8 from slot 2 at 1108 since the two pairs of regions share a common node of r2 and appear in the consecutive time slots of the same day. Also, for DAY 1, the process 1100 connects r4→r5 from slot 1 at 1110 to r5→r7 from slot 2 at 1112. However, for DAY 1, the process 1100 does not connect r4→r5 from slot 1 at 1100 to r8→r4 from slot 3 at 1114 since the pairs of regions are not temporally close. The process 1100 then formulates a collection of skyline graphs (CG) 1116.
The area computing application 114 mines frequent sub-graph patterns from the collection of skyline graphs across a certain number of days to avoid any false alter. In certain instances, the area computing application 114 may detect a pair of regions with effective connectivity as part of a skyline based on anomaly events, such as a traffic accident. The mining of frequent sub-graph patterns further provides deeper analysis of any flaws in the urban area.
The area computing application 114 mines the skyline patterns by utilizing different supports. The area computing application 114 calculates a support of a sub-graph pattern using the following equation:




  
    support
    ⁡
    
      (
      g
      )
    
  
  =
  
    
      
        
        
          
            
              
                {
                G
                
              
              ⁢
              g
            
            ⊆
            G
          
          ,
          CG
        
        }
      
      
    
    
      num
      ⁢
      
        
      
      ⁢
      of
      ⁢
      
        
      
      ⁢
      days
    
  




where g represents the sub-graph pattern, G is a skyline graph, and CG represents a collection of skyline graphs across multiple days. The denominator denotes the number of days that the dataset is analyzed over.

For example, the support of r4→r5 is 1 since this transition appears in the skyline graphs of all three days while that of r3→r6 is 2⁄3 since it only appears in DAY 2 and DAY 3. For a threshold 6, the area computing application 114 selects the support ≧δ. The patterns represent flaws present in the planning of the urban area, in which the patterns appear prominent and frequent.
FIG. 12 illustrates examples of mined frequent skyline patterns at 1200 and 1202. The area computing application 114 associates individual pairs of regions to determine any causalities and/or relationships among the regions to better understand how a problem may be derived. The area computing application 114 mines association rules among the patterns according to the following equations for support and confidence:



  
    
      Support
      ⁡
      
        (
        
          
            g
            1
          
          ⇒
          
            g
            2
          
        
        )
      
    
    =
    
      
        
        
          
            g
            1
          
          ⋃
          
            g
            2
          
        
        
      
      
        num
        ⁢
        
          
        
        ⁢
        of
        ⁢
        
          
        
        ⁢
        days
      
    
  




  
    
      Confidence
      ⁡
      
        (
        
          
            g
            1
          
          ⇒
          
            g
            2
          
        
        )
      
    
    =
    
      
        
        
          
            g
            1
          
          ⋃
          
            g
            2
          
        
        
      
      
        
        
          g
          1
        
        
      
    
  



where |g1∪g2| denotes the number of days that g1 and g2 both occurred and |g1| indicates the number of days having g1.

Two patterns may formulate an association rule, denoted as g1→g2, if the support of g1→g2≧δ and the confidence ≧Θ (i.e., a given threshold). For instance, at 1200, the association rules illustrate (r4→r5) at 1204→(r3→r6) at 1206 which includes a support of 2⁄3 and a confidence of 2⁄3. In yet another example, (r3→r6) at 1206→(r4→r5) at 1204 which includes a support of and a confidence of 1.
The association rules may include two or more patterns. For instance, g1, g2→g3, where g3 has a very high probability (conditioned by δ and Θ) to occur when g1 and g2 appear simultaneously. However, the sub-graph patterns may not be geospatially close to each other, revealing the causality and correlation between flawed planning without any relationship in the geographical spaces.
In an implementation, the planning service 106 presents the user interface 110 on the display of the computing device 102, after the user 108 activates the planning service 106. The user interface 110 gives the user 108 access to the area computing application 114 provided by the planning service 106. The user input may be for a request for a particular urban area to evaluate flaws in the planning.
Once the planning service 106 receives the input or query from the user 108, the planning service 106 accesses the model constructed from analysis of the logs of the route-oriented vehicles 118. The construction of the model was previously described with reference to FIGS. 4-8.
FIG. 13 is an example heat map 1300 as computed by the area computing application 114 and presented to the user 108 on the user interface 110. As mentioned, the area computing application 114 from the planning service 106 may be provided by a network service provider, a web application, an application based on a live search map, an application stored in memory of a computing device, and the like.
The heat map 1300 represents the flaws in the urban area based on detecting the frequent sub-graph patterns. The heat map 1300 includes frequency that a region has been detected as a flaw. For instance, a shape represents different frequency levels of flaws in the regions. In an implementation, a square represents a smallest level of frequency of flaws 1302 for the regions shown with the squares, while a circle represents a small level of frequency of flaws 1304 for the regions shown with the circles. Also, a star represents a middle level of frequency of flaws 1306 for the regions shown with the stars and a triangle represents a high level of frequency of flaws 1308 for the regions with the triangles. In another implementation, arrows may be used to indicate the direction of the transition from one region to another region.
Based on this evaluation of the heat map 1300, the recommendations may include building new roads, widening existing roads, converting roads to one way streets, adding new roads, adding local businesses such as shopping malls in the regions outsourcing people (i.e., land-use planning), adding subways or bus routes in these regions.
Example Server Implementation
FIG. 14 is a block diagram showing an example server 112 to be used for the planning service 106 and/or the area computing application 114. The area computing server 112 may be configured as any suitable system capable of services, which includes, but is not limited to, implementing the planning service 106 for evaluating the planning of urban areas, such as provide the map of the urban area with flaws in the urban area due to traffic congestion, insufficient number of roads travelling through the regions, insufficient number of lanes on existing roads, insufficient land use, and the like. In one example configuration, the server 112 comprises at least one processor 1400, a memory 1402, and a communication connection(s) 1404. The processor(s) 1400 may be implemented as appropriate in hardware, software, firmware, or combinations thereof. Software or firmware implementations of the processor(s) 1400 may include computer-executable or machine-executable instructions written in any suitable programming language to perform the various functions described.
Similar to that of computing environment 100 of FIG. 1, memory 1402 may store program instructions that are loadable and executable on the processor(s) 1400, as well as data generated during the execution of these programs. Depending on the configuration and type of computing device, memory 1402 may be volatile (such as random access memory (RAM)) and/or non-volatile (such as read-only memory (ROM), flash memory, etc.). Thus, memory 1402 includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information, such as computer-readable instructions, data structures, program modules, or other data.
The communication connection(s) 1404 may include access to a wide area network (WAN) module, a local area network module (e.g., WiFi), a personal area network module (e.g., Bluetooth), and/or any other suitable communication modules to allow the area computing server 112 to communicate over the network(s) 104.
Turning to the contents of the memory 1402 in more detail, the memory 1402 may store an operating system 1406, the planning service module 106, the area computing application module 114, and one or more applications 1408 for implementing all or a part of applications and/or services using the planning service 106.
The one or more other applications 1408 may include an email application, online services, a calendar application, a navigation module, a game, and the like. The memory 1402 in this implementation may also include a model of traffic patterns and connectivity module 1410 and a skyline graph module 1412.
The area computing application module 114 may perform the operations described with reference to the figures or in combination with the planning service module 106, the model of traffic patterns and connectivity module 1410, and the skyline graph module 1412.
The server 112 may include the database 116 to store the collection of GPS logs, trajectories, graphs, routes, models, maps of urban areas, and the like. Alternatively, this information may be stored on other databases.
The server 112 may also include additional removable storage 1414 and/or non-removable storage 1418 including, but not limited to, magnetic storage, optical disks, and/or tape storage. The disk drives and their associated computer-readable media may provide non-volatile storage of computer readable instructions, data structures, program modules, and other data for the computing devices. In some implementations, the memory 1402 may include multiple different types of memory, such as static random access memory (SRAM), dynamic random access memory (DRAM), or ROM.
Computer-readable media includes, at least, two types of computer-readable media, namely computer storage media and communications media.
Computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, RAM, ROM, erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information for access by a computing device.
In contrast, communication media may embody computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave, or other transmission mechanism. As defined herein, computer storage media does not include communication media.
Various instructions, methods, techniques, applications, and modules described herein may be implemented as computer-executable instructions that are executable by one or more computers, servers, or computing devices. Generally, program modules include routines, programs, objects, components, data structures, etc. for performing particular tasks or implementing particular abstract data types. These program modules and the like may be executed as native code or may be downloaded and executed, such as in a virtual machine or other just-in-time compilation execution environment. The functionality of the program modules may be combined or distributed as desired in various implementations. An implementation of these modules and techniques may be stored on or transmitted across some form of computer-readable storage media.
The server 112 as described above may be implemented in various types of systems or networks. For example, the server may be a part of, including but is not limited to, a client-server system, a peer-to-peer computer network, a distributed network, an enterprise architecture, a local area network, a wide area network, a virtual private network, a storage area network, and the like.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described. Rather, the specific features and acts are disclosed as example forms of implementing the claims.

## Claims

1. A computer-implemented method comprising:
enabling a wireless coupling between a computing device including a processor and global positioning system (GPS) receiving devices of route-oriented vehicles through a wireless communication network;
receiving through the wireless communication network, by the processor, sequences of GPS points of the route-oriented vehicles, the GPS points being obtained by the GPS receiving devices of the route-oriented vehicles;
identifying, by the processor, geographical locations from the sequences of GPS points in which the geographical locations represent on urban area where the route-oriented vehicles travelled as recorded in the sequences GPS points;
modeling, by the processor, traffic patterns in the urban area by:
partitioning the urban area into regions based at least in part on roads that form borders between regions;
segmenting the GPS points into time slots and identifying two or more of the GPS points that each include a status of vehicle occupancy indicating that each of the two or more GPS points is associated with transporting a passenger in one or more of the route-oriented vehicles has at least on a sensor that detects the passenger;
projecting the two or more GPS points associated with transporting the passenger onto the regions to construct transitions associated with transporting the passenger between one or more pairs of the regions; and
building a matrix of the regions for each time slot in each day based on a number of the transitions; and

providing, by the processor, one or more recommendations using the modeled traffic patterns creating at least one new traffic route, the new traffic route replacing a previous area unavailable for travel by the route-oriented vehicles.

2. The computer-implemented method of claim 1, wherein the GPS points are analyzed from similar time spans in a year.

3. The computer-implemented method of claim 1, wherein the time slots comprise:
separating the GPS points into (a) weekdays and (b) weekends and/or holidays of a year; and
dividing a time of a day into multiple time slots based on the traffic patterns in the urban area.

4. The computer-implemented method of claim 1, wherein the transitions are associated with an arrival time, a departure time, a travel distance, and a travel speed between one or more pairs of the two or more GPS points.

5. The computer-implemented method of claim 1, wherein the matrix includes items to represent effectiveness of connections between each of the one or more pairs of the regions.

6. The computer-implemented method of claim 1, further comprising:
identifying a pair of regions having a set of transitions between the pair of regions; and
aggregating the transitions to associate the pair of regions with a volume of traffic between the pair of regions, expected travel speeds of the transitions, and a ratio between an actual travel distance for transitions between the pair of regions and a Euclidean distance between a first centroid of a first region of the pair of regions and a second centroid of a second region the pair of regions.

7. The computer-implemented method of claim 1, further comprising identifying a set of skylines from the matrix of the regions to represent flaws in planning of the urban area, the set of skylines representing GPS points with travel speeds and ratios of actual travel distance and to Euclidean distance between centroids of regions of each of the one or more pairs of the regions that are less efficient than other GPS points.

8. The computer-implemented method of claim 1, further comprising:
identifying a plurality of pairs of regions, each pair of regions of the plurality of the pairs of regions having a set of transitions between the pair of regions, each pair of regions of the plurality of the pairs of regions in a set of skylines having properties of:
a small travel speed between the set of transitions and a small ratio between an actual travel distance of the set of transitions and a Euclidean distance between centroids of regions of the pair of regions;
a small travel speed between the set of transitions and a large ratio between an actual travel distance of the set of transitions and a Euclidean distance between centroids of regions of the pair of regions; and
a large travel speed between the set of transitions and a large ratio between an actual travel distance of the set of transitions and a Euclidean distance between centroids of regions of the pair of regions; and
identifying from the plurality of the pairs of regions, an identified pair of regions having the small travel speed and the large ratio as requiring the route-oriented vehicles to take detours based on congested traffic for travelling between the identified pair of regions.

9. The computer-implemented method of claim 8, further comprising:
building skyline graphs for each day b connecting the plurality of the pairs of regions in the skylines with consecutive time slots in which the plurality of the pairs of regions are spatially close to each other;
detecting sub-graph patterns from the skyline graphs to identify the plurality of the pairs of regions with traffic problems and to determine a casualty and a relationship among the plurality of the pairs of regions; and
providing the one or more recommendations based on an analysis of a planning of the urban area based on at least on the sub graph patterns being detected, the recommendations include building roads, suggesting a bus route; or suggesting a subway line.

10. One or more computer storage media encoded with instructions that, when executed by a processor, perform acts comprising:
enabling a wireless coupling between a computing device including the processor and global positioning system (GPS) receiving devices route-oriented vehicles over a wireless communication network;
receiving, in the wireless communication network, sequences of GPS points obtained tot the GPS receiving devices of the route-oriented vehicles, individual of the GPS points comprising a status of vehicle occupancy associated with transporting a passenger based at least on a sensor that detects the passenger;
creating a traffic and connectivity model that models a relationship of traffic of the route oriented vehicles travelling through regions in an urban area;
generating a matrix of the regions from the model to identify a connectivity between the regions, the identifying the connectivity between the regions comprising:
identifying a pair of the regions having a set of transitions between the pair the regions;
aggregating the set of transitions to associate the pair of regions with a volume of traffic between each of the pair regions, expected travel speeds of transitions between the pair of regions, and a ratio between an actual travel distance for transitions between the pair of regions and a Euclidean distance between a first centroid of a first region of the pair of the regions and a second centroid of a second region of the pair of the regions; and
mining information from the aggregated set of transitions for effectiveness of connectivity in the regions with reference to the matrix; and

providing, by the processor, one or more recommendations using output of the identified, connectivity between the regions identifying at least one new traffic route, the new traffic route replacing a previous area unavailable for travel by the route-oriented vehicles.

11. The computer storage media of claim 10, further comprising:
presenting a user interface to receive a user query for the urban area;
searching the traffic and connectivity model for the urban area being queried, which is represented by a map of the urban area partitioned hr roads and streets; and
providing the one or more recommendations for adding a shopping area; adding a subway line, or widening roads based at least in part on the traffic and connectivity model and the effectiveness of the connectivity in the regions.

12. The computer storage media of claim 10, further comprising identifying a set of skylines from the matrix of the regions to represent flaws in planning of the urban area, the set of skylines representing GPS points with travel speeds and ratios of actual travel distance to a Euclidean distance between centroids of regions of each of the one or more pairs of the regions that are less efficient than other GPS points.

13. The computer storage media of claim 10, further comprising identifying a plurality of pairs of regions having a set of transitions between each of the plurality of the pairs of regions, the plurality of the pairs of regions in the set of skylines having properties of a small travel speed between a set of transitions and a large ratio between an actual travel distance of the set of transitions and a Euclidean distance between centroids of regions of each of the plurality of pairs of regions, to cause the route-oriented vehicles to take detours based on congested traffic for travelling between the identified plurality of pairs of regions.

14. The computer storage media of claim 10, further comprising creating the traffic and connectivity model by:
partitioning the urban area into the regions based at least in part on roads that at least partially define a border between two or more of the regions;
segmenting the GPS points into time slots and identifying two or more of the GPS points as being associated with transporting a passenger in the route-oriented vehicles;
projecting the two or more GPS points associated with transporting the passenger onto the regions to construct the transitions associated with transporting the passenger between the one or more pairs of the regions; and
building the matrix of the regions for each time slot in each day based on a number of the transitions.

15. The computer storage media of claim 10, further comprising:
presenting a user interface to receive a user query for the urban area; and
presenting on the user interface the one or more recommendations for the urban area being queried, the recommendations include converting streets to one way streets, adding more lanes to streets, adding more roads, adding another subway line, adding a bus stop, or adding a train stop based at least in part on effectiveness of connectivity in the regions.

16. The computer storage media of claim 10, further comprising:
presenting a user interface to receive a user query for the urban area; and
presenting on the user interface a display a heat map of the urban area being queried, the heat map illustrating frequency of flaws in the regions ranging from a least amount of frequency of flaws, a mid level of frequency of flaws, and a high level of frequency of flaws based at least in part on the effectiveness of connectivity in the regions.

17. A system comprising:
a memory;
a processor coupled to the memory to perform acts comprising:
enabling a wireless coupling between the system and global positioning system (GPS) receiving devices of route-oriented vehicles a wireless communication network;
receiving, via the wireless communication network, geographical locations obtained by the GPS receiving devices of the route-oriented vehicles such that the geographical locations represent an urban area where the route-oriented vehicles travelled;
accessing a model of traffic patterns in the urban area by partitioning regions in the urban area and projecting GPS points onto the regions to construct transitions of the GPC points from a first region to a second region, individual of the GPS points comprising a status of vehicle occupancy based at least on a sensor that detects a passenger;
creating a skyline chart to identify a portion of the urban area where ratios of actual travel distance for transitions between a pair of regions to Euclidean distance between centroids of each region of the pair of regions associated with GPS points are larger than ratios of actual travel distance for transitions between an additional pair of regions to a Euclidean distance between centroids of each region of the additional pair of regions associated with other GPS points; and
providing, by the processor, one or more recommendations based on a determination in the skyline chart of at least one new transition from the first region to the second region, the new transition replacing, a previous area unavailable for travel by the route-oriented vehicles.

18. The system of claim 17, further comprising:
collecting logs of the route-oriented vehicles, which include a sequence of GPS points; and
selecting trajectories from the logs, the selected trajectories representing trips associated with transporting passengers to desired destinations.

19. The system of claim 17, further comprising partitioning the GPS points into time slots based on a time of a day and a weekday, a weekend, and/or a holiday.

20. The system of claim 17, further comprising:
dividing the portion of the urban area with the GPS points into time slots;
detecting sub-graph patterns from the GPS points from the skyline chart based on the time slots; and
formulating skyline graphs based on pairs in regions from consecutive time slots as being connected when spatially close to each other.