WO2024030077A1 - Procédé, dispositif et système de prédiction de paramètres de circulation d'un réseau routier - Google Patents

Procédé, dispositif et système de prédiction de paramètres de circulation d'un réseau routier Download PDF

Info

Publication number
WO2024030077A1
WO2024030077A1 PCT/SG2023/050529 SG2023050529W WO2024030077A1 WO 2024030077 A1 WO2024030077 A1 WO 2024030077A1 SG 2023050529 W SG2023050529 W SG 2023050529W WO 2024030077 A1 WO2024030077 A1 WO 2024030077A1
Authority
WO
WIPO (PCT)
Prior art keywords
road
network
traffic
edge
traffic parameters
Prior art date
Application number
PCT/SG2023/050529
Other languages
English (en)
Inventor
Suriyanarayanan VENKATESAN
Padarn George WILSON
Chen Liang
Original Assignee
Grabtaxi Holdings Pte. Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Grabtaxi Holdings Pte. Ltd. filed Critical Grabtaxi Holdings Pte. Ltd.
Publication of WO2024030077A1 publication Critical patent/WO2024030077A1/fr

Links

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0125—Traffic data processing
    • G08G1/0133—Traffic data processing for classifying traffic situation
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B60—VEHICLES IN GENERAL
    • B60W—CONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
    • B60W40/00—Estimation or calculation of non-directly measurable driving parameters for road vehicle drive control systems not related to the control of a particular sub unit, e.g. by using mathematical models
    • B60W40/02—Estimation or calculation of non-directly measurable driving parameters for road vehicle drive control systems not related to the control of a particular sub unit, e.g. by using mathematical models related to ambient conditions
    • B60W40/04—Traffic conditions
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/04—Architecture, e.g. interconnection topology
    • G06N3/042—Knowledge-based neural networks; Logical representations of neural networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/04—Architecture, e.g. interconnection topology
    • G06N3/0464—Convolutional networks [CNN, ConvNet]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/08—Learning methods
    • G06N3/0895—Weakly supervised learning, e.g. semi-supervised or self-supervised learning
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0108—Measuring and analyzing of parameters relative to traffic conditions based on the source of data
    • G08G1/012—Measuring and analyzing of parameters relative to traffic conditions based on the source of data from other sources than vehicle or roadside beacons, e.g. mobile networks
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0125—Traffic data processing
    • G08G1/0129—Traffic data processing for creating historical data or processing based on historical data
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B60—VEHICLES IN GENERAL
    • B60W—CONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
    • B60W2552/00—Input parameters relating to infrastructure
    • B60W2552/05—Type of road, e.g. motorways, local streets, paved or unpaved roads
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B60—VEHICLES IN GENERAL
    • B60W—CONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
    • B60W2552/00—Input parameters relating to infrastructure
    • B60W2552/10—Number of lanes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"

Definitions

  • Various aspects of this disclosure relate to methods, devices and systems for predicting one or more traffic parameters on a road network.
  • Obtaining traffic data on a road network is useful as part of the process for building robust travel patterns.
  • the obtained path-based data typically suffer from incompleteness and relatively low network-coverage, that is, traffic data of one or more road segments may be missing.
  • Approximation and inference methods and systems are typically performed on network segments that are detected to suffer from missing traffic data.
  • a known method of predicting or inferring traffic on a road segment is the use of historical traffic patterns, such as historic mean or median speeds on the road segment, and the road-class level speed profiles to overcome data sparsity issues.
  • historical traffic patterns such as historic mean or median speeds on the road segment
  • road-class level speed profiles to overcome data sparsity issues.
  • statistics-based algorithms that run, for example, regression techniques to predict missing traffic data.
  • current methods fail to account for or exploit underlying road network structure and properties.
  • the disclosure provides a method, device and/or system predicting traffic parameters of a road network.
  • a machine learning algorithm such as Graph Convolution network, is used to facilitate prediction.
  • underlying road network structure and properties may be incorporated via the modelling of transition penalization for the task of network smoothing to further improve prediction or inference of missing segment level speeds on a road network.
  • a computer-implemented method for predicting traffic parameters on a road network comprising the steps of: loading a spatial data file associated with the road network and a corresponding network profile associated with the road network; converting the spatial data file to an edge-based graph comprising a plurality of nodes and edges, each node representing a respective road segment of the road network and each edge representing a respective physical location; extracting a plurality of road attributes associated with the road network and deriving corresponding node features based on the plurality of road attributes; inputting the edge-based graph, node features and network profile into a machine learning algorithm for predicting network parameters on each respective road segment; wherein the machine learning algorithm is configured to output a set of traffic parameters corresponding to each of the plurality of nodes.
  • the plurality of road attributes may include at least two of the following: a road length, a road width, a number of lanes, a direction and a road type.
  • the method further comprises a step of receiving the plurality of road attributes and the edge-based graph as input, and constructing a set of transitioning rules for assigning traffic parameters to one or more adjacent road segments associated with each of the plurality of road segments.
  • the set of transitioning rules includes a rule stating that a similar range of traffic parameters is to be assigned to the one or more adjacent road segments.
  • the method further comprises a step of pre-processing the extracted plurality of road attributes, wherein the pre-processing includes at least one of the following: binning and one-hot encoding the road-length of each road segment into the plurality of distance brackets, normalization, clustering, and assigning binary values for categorization.
  • the method further comprises a step of computing a matrix representation of the edge-based graph, wherein the matrix comprises a normalized Adjacency and Laplacian matrix.
  • the machine learning algorithm comprises a graph convolutional network (GCN).
  • GCN graph convolutional network
  • the method further comprises a step of checking the set of output traffic parameters for one or more entries that fall out of range.
  • the method further comprises a step of training the GCN, wherein the GCN is modelled as a two-layer GCN and a fully-connected layer for learning the traffic parameter propagation based on a subset of traffic prior information as a semi-supervised learning task.
  • the training comprises defining an objective function to minimize a root- mean- squared error measure associated with incorrect assignment of traffic parameters to one or more road segments.
  • a device for predicting traffic parameters on a road network comprising a processor configured to: receive a spatial data file associated with the road network and a corresponding network profile associated with the road network; convert the spatial data file to an edge-based graph comprising a plurality of nodes and edges, each node representing a respective road segment of the road network and each edge representing a respective physical location; extract a plurality of road attributes associated with the road network and deriving corresponding node features based on the plurality of road attributes; input the edge-based graph, node features and network profile into a machine learning algorithm for predicting network parameters on each respective road segment;
  • the machine learning algorithm is configured to output a set of traffic parameters corresponding to each of the plurality of nodes.
  • a system for predicting traffic parameters on a road network comprising the aforementioned device arranged in data communication with a map service to receive spatial data file from the map service.
  • non-transitory computer- readable storage medium comprising instructions, which, when executed by one or more processors, cause the execution of the aforementioned method.
  • the method further comprises a step of receiving the plurality of road attributes and the edge -based graph as input, and constructing a set of transitioning rules for assigning traffic parameters to one or more adjacent road segments associated with each of the plurality of road segments.
  • the set of transitioning rules advantageously account for underlying road attributes/ structure and provides for a smoothing (curve-fitting/low pass filtering) to more efficiently predict traffic parameters on each road segment.
  • FIG. 1 is a flow diagram of a method for predicting traffic parameters of a road network according to an embodiment
  • FIG. 2 is a flow diagram of the method of FIG. 1, with further sub-steps for predicting traffic parameters of a road network according to another embodiment
  • FIG. 3 is a block diagram depicting a model architecture for training a GCN according to an embodiment
  • FIG. 4A to FIG. 4C show various results associated with applying the method for predicting traffic parameters of a road network according to various embodiments.
  • FIG. 5 shows a schematic illustration of a processor for predicting traffic parameters of a road network in accordance with an embodiment.
  • Embodiments described in the context of one of the enclosure systems, devices or methods are analogously valid for the other systems, devices or methods. Similarly, embodiments described in the context of a system are analogously valid for a device or a method, and vice-versa.
  • the articles “a”, “an” and “the” as used with regard to a feature or element include a reference to one or more of the features or elements.
  • data may be understood to include information in any suitable analog or digital form, for example, provided as a file, a portion of a file, a set of files, a signal or stream, a portion of a signal or stream, a set of signals or streams, and the like.
  • data is not limited to the aforementioned examples and may take various forms and represent any information as understood in the art.
  • spatial data refers broadly to data in various formats that is associated with a geographical location or area.
  • Non-limiting examples of spatial data include satellite imagery, georeferenced maps in two-dimensional, three-dimensional form.
  • Such spatial data may be stored in various file formats with or without metadata.
  • a non-limiting example of a spatial data file is a map having geographical locations encoded based on the Geohash format.
  • module refers to, or forms part of, or include an Application Specific Integrated Circuit (ASIC); an electronic circuit; a combinational logic circuit; a field programmable gate array (FPGA); a processor (shared, dedicated, or group) that executes code; other suitable hardware components that provide the described functionality; or a combination of some or all of the above, such as in a system-on-chip.
  • ASIC Application Specific Integrated Circuit
  • FPGA field programmable gate array
  • processor shared, dedicated, or group
  • the term module may include memory (shared, dedicated, or group) that stores code executed by the processor.
  • a single module or a combination of modules may be regarded as a device.
  • graph refers to a mathematical structure for modelling relationships between two or more objects.
  • a graph comprises vertices (nodes) connected by edges.
  • road network refers broadly to any physical roads suitable for vehicles to travel thereon, the road network comprises a plurality of road segments meeting at a transition point. Non-limiting examples of such transition point may include a junction, a filter, a slip road etc.
  • traffic parameters may broadly refer to a mean/median speed on a road segment and/or road network, and may also include other distance and time derivable parameters.
  • association As used herein, the term “associate”, “associated”, and “associating” indicate a defined relationship (or cross-reference) between two items. For instance, spatial data file and/or a plurality of attributes may be associated with a geographical feature such as a road network or part thereof.
  • memory may be understood as a non-transitory computer-readable medium in which data or information can be stored for retrieval. References to “memory” included herein may thus be understood as referring to volatile or non-volatile memory, including random access memory (“RAM”), read-only memory (“ROM”), flash memory, solid-state storage, magnetic tape, hard disk drive, optical drive, etc., or any combination thereof. Furthermore, it is appreciated that registers, shift registers, processor registers, data buffers, etc., are also embraced herein by the term memory.
  • a single component referred to as “memory” or “a memory” may be composed of more than one different type of memory, and thus may refer to a collective component including one or more types of memory. It is readily understood that any single memory component may be separated into multiple collectively equivalent memory components, and vice versa. Furthermore, while memory may be depicted as separate from one or more other components (such as in the drawings), it is understood that memory may be integrated within another component, such as on a common integrated chip.
  • a method 100 for predicting traffic parameters of or associated with a road network may be implemented using a computer or processor, and comprises the steps of: loading a spatial data file associated with the road network and a corresponding network profile associated with the road network (step 102); converting the spatial data file to an edge-based graph comprising a plurality of nodes and edges, each node representing a respective road segment of the road network and each edge representing a respective physical location (step 104); extracting a plurality of road attributes associated with the road network and deriving corresponding node features based on the plurality of road attributes (step 106); inputting the graph, node features and network profile into a machine learning algorithm for predicting network parameters on each respective road segment (step 108); wherein the machine learning algorithm is configured to output a set of traffic parameters corresponding to each of the plurality of nodes (step 110).
  • the method 100 is suited for predicting traffic speed or speed profile on the road network.
  • the road network may comprise a plurality of road segments, each road segment having a specific speed profile.
  • the predicted output of method 100 may be used to assign missing speed profiles to corresponding road segments due to incomplete on-site information gathering, and/or may be used to revise or update outdated speed profiles.
  • the spatial data file may be a geographical map of an area comprising the road network.
  • the geographical map may be a Geohash level 5 map which spans a 4.9 kilometers (km) by 4.9 km grid.
  • the map data may be modelled as a Graph G’, where each node represents a location tuple (comprising a latitude and a longitude), and each edge between the location represent a road segment.
  • the network profile may be a historical profile of previously obtained speed profiles or real-time speed profiles. The network profile may be subsequently utilized for training the machine learning algorithm.
  • step 104 the Graph G’ with
  • This representation is obtained by converting each edge in G’ into a node in G and every node in G’ into an edge (link) in G. After the conversion, every node in G will represent a physical road segment, and adjacent nodes in G will learn the propagation of speed across nodes. Examples of physical location include non-road features such as buildings, structures, and/or landmarks. Each physical location may be connected to another physical location via a road segment.
  • each node feature may correspond to features or road attributes of underlying road segment such as, but not limited to, a road length, a road width, number of lane(s), directions (for example, one-way traffic or two-way traffic), road type/class (primary, secondary, tertiary, etc.). Such information may be obtained from publicly available geospatial data sources or from dedicated databases.
  • the road class feature may include thirteen types/classes, as follows: trunk, secondary, service, residential, primary, motorway link, primary link, tertiary, motorway, living street, secondary link, tertiary link, trunk link. Any road class feature not recognized as any of the above thirteen types may be deemed “unclassified”.
  • the machine learning algorithm may be a graph convolutional network (GCN) or any other type of graph-based machine learning model or algorithm.
  • GCN graph convolutional network
  • the output set of traffic parameters may be used to infer missing traffic parameters such as traffic speed profile of each road segment.
  • FIG. 2 shows another embodiment of a method 100 for completing traffic network using GCN. It is appreciable that the FIG. 2 may be regarded a specific embodiment of the steps in FIG. 1, for the prediction of speed profile of a road network using Graph Convolution Network.
  • Step 122 comprises receiving the plurality of road attributes and the edge -based graph as input, and constructing a set of transitioning rules for assigning traffic parameters to one or more adjacent road segments associated with each of the plurality of road segments.
  • the transitioning rules is motivated by an implicit relation for transitioning between road segments, which assumes that traffic from one road segment to an adjacent road segment have an “inherent smoothness” in road traffic patterns. For example, two road segments adjacent to and connected to each other, belonging to the same class or type (e.g. primary), will tend to have similar traffic distributions and travel trends.
  • the “inherent smoothness” principle may be explicitly expressed in the form of a transition rule, such as "connected roads should have similar traffic”.
  • the transition rule may form part of a regularization and transition penalty matrix to train the machine learning algorithm and so as to avoid over-fitting.
  • the transition rule may be applicable to all adjacent road segments belonging to the same road class as the road segment.
  • One exception to the aforementioned rule is that transitions across different road classes - i.e. a primary road leading to a secondary or tertiary road can (and must) have different traffic speeds, whereas connected primary roads should exhibit inherent smoothness.
  • Any assignment of traffic speeds on an adjacent road segment which does not obey the above rules, and therefore result in a speed jump may be modelled as a penalty function of the machine learning model so as to minimize segment level differences in speed jumps to enforce or promote learning of the model towards achieving smoothness.
  • the penalty may be modelled as penalty coefficient in the machine learning algorithm in the form of a GCN.
  • the penalty coefficient may be derived from the speed profiles across different road classes.
  • the set of transitioning rules includes a rule stating that a similar range of traffic parameters (traffic speed) is to be assigned to the one or more adjacent road segments.
  • Step 124 comprises pre-processing the extracted plurality of road attributes of step 106, wherein the pre-processing includes at least one of the following: binning and one-hot encoding the road-length of each road segment into the plurality of distance brackets, normalization, clustering, and assigning binary or integer values for categorization.
  • the preprocessing step may be used for or form part of feature construction for subsequent machine learning.
  • the binning and one-hot encoding of the road-length into a plurality of distance buckets may be adaptive distance buckets defined as for example [0m,10m], [10m, 50m], [50m, 100m], [100m, 200m], [200m, 500m], [500m, 1000m], [1000m - Above] .
  • the normalization of road segments may include defining each road segment such that each road segment has exactly one incoming and outgoing road.
  • adaptive bin estimates may create a representative distribution approximation of underlying road lengths.
  • the road class feature was one-hot encoded into one of the predefined thirteen types/classes.
  • binary categorization may include representing some of the extracted road attributes as binary values.
  • a one-way road segment may be expressed as a binary categorical value (1-Yes, 0-No).
  • In-degree and out-degree values may be treated as integers.
  • a trainable embedding encoder may be used for implicit featurization.
  • Step 126 comprises the construction of a matrix representation of the edge-based graph, wherein the matrix comprises a normalized Adjacency and Laplacian matrix.
  • A(i,j) 1 if there exists an edge eij connecting node Vi to Vj, 0 otherwise where i and j correspond to the Vi and Vj nodes in V Normalized Adjacency Matrix
  • L D - A, where D is its diagonal node degree matrix (each diagonal element is its sum of incoming/outgoing edges), and A, its adjacency.
  • An adjacency matrix captures relationships between nodes of the Graph.
  • labels are generated based on the traffic profiles and/or real-time traffic in step 102.
  • the machine learning may be modelled as a semi-supervised label propagation, where partial labels (priors) may be propagated via the GCN.
  • the target values which need to be propagated may be traffic speed values, which may be loaded to a memory unit of a computer or processor executing the method 100.
  • the traffic speeds can either be real-time speeds aggregated over a pre-defined window, such as a 15-minute rolling window at each road segment level, or historic traffic profiles aggregated at adaptive buckets of 30 mins-60 mins at a way-id level (i.e. one way or two way) by mean or median aggregation, depending on the context of application such as real-time traffic inference, historical traffic inference, etc.
  • the checking of outputs may comprise a step of checking the set of output traffic parameters for one or more entries that fall out of range.
  • Such checks may be important to ensure the quality of the traffic speed propagation, implementation of the transitioning rules, and correct any spurious entries that might be generated via the machine learning model. Examples of such spurious entries include negative or zero speed values, more than a speed limit, for example speed greater than 30 metres/second (m/s) on a road segment.
  • the checking of outputs may include road class level bound for each city/geo-hash can be computed via aggregation of historic data for each time of day, weekday/weekend .
  • the spurious entry(ies) may be corrected to default speed profiles.
  • the default speed profiles may be based on road-segment, road-class, historic speeds or global default.
  • the sanity checks may include road class level checks in the following two-step checks: First step check: check if speeds are within the lower and upper bound of speeds, for example- i. Motorway road speed range - [lOm/s to 30m/s] ii. Service road speed range - [2m/s - lOm/s] (and so on)
  • Second step check check if speeds are within a statistical measure, [ road-class mean - 3 standard deviation, road-class mean + standard deviation ] range iii. Ensure 6-sigma correctness of speeds within > 90% confidence interval of the mean (this is done to ensure the smoothening aligns with historic patterns )
  • the sanity checks may also include further statistical measures including mode.
  • step 108 the step of executing or running the GCN (Graph convolution networks) for traffic speed value propagation so as to complete any missing values on the road network may be based on performs weighted aggregation of the node features and propagates the latent information through its adjacency structure based on the Laplacian matrix generated in step 126.
  • the converted edge -based graph node represents a road segment
  • road attributes such as length, road-class type, number of lanes, one-way information, in-degree, and out-degree of the nodes of the graph (i.e. for each road segment, how many adjacent road segments are connected), may be regarded as associated node features.
  • FIG. 3 shows a model architecture 300 of a GCN, including an overview of model training.
  • the graph network and its corresponding node features obtained from steps 122, 124, 126, 128 may be passed into a two-layer GCN (GCN layer 302 and GCN layer 304) followed by fully-connected layers 306, 308 for learning the traffic speed propagation based on a subset of traffic prior information as a semi-supervised learning task.
  • Each of the layers 302, 304, 306, 308 may be implemented as separate modules, or may be integrated as one single module or processor.
  • the error minimization module 310 computes the semi-supervised loss as a linear combination of the following components:
  • Root mean square error For the model training, a set of data comprising actual speed values may form a training dataset. In some embodiments, 80% of the road network with actual speed values may be used for training and learning latent speeds via optimizing to minimize a Root- Mean-Squared Error Loss (RMSE).
  • Smoothness Penalty In the process of smoothening using the transitioning rules, adjacent road segments are to have similar speeds (say 1 Motorway, linked/mapped to 2 different segments, need to have similar speeds). A smoothening regularizer module may be used to enforce smoothness in predictions. As one exception to the smoothness penalty, transition between road-class such as motorway to primary, etc. may be considered. In these cases where the road class are different, a transition factor may be introduced to account for the change in road class to allow “discontinuity/jumps” in speeds.
  • FIG. 4A shows an example of traffic around a road network comprising a plurality of road segments, at a particular time, e.g. post-midnight.
  • the darkened (black) roads in the left most image labelled or marked 402 shows missing traffic/vehicle information.
  • the centre image show the speed profile smoothening for the entire road network obtained by the method 100, with portions marked 404 representing propagated values.
  • the right most image shows only the edges where speed is propagated.
  • FIG. 4B is a t-Distributed Stochastic Neighbour Embedding (t-SNE) visualization of learned node embeddings post model training.
  • t-SNE t-Distributed Stochastic Neighbour Embedding
  • FIG. 4C is a visualization of predicted traffic speeds, checkpointed over every ten iterations of the trained model. Network learning to propagate speed over iterations are marked as 410 (earlier iterations) and 412 (later iterations), demonstrating the efficacy of the algorithm to predict and assign traffic speeds to various road segments.
  • the visualization shows that speed profiles have been assigned to most road segments with the exception of a few areas with black portions.
  • FIG. 5 shows a server computer 500 according to various embodiments.
  • the server computer 500 includes a communication interface 502 (e.g. configured to receive input spatial data from the one or more map source).
  • the server computer 500 further includes a processing unit 504 and a memory 506.
  • the memory 506 may be used by the processing unit 504 to store, for example, data to be processed, such as data associated with the input spatial data and intermediate results or final output from one or more of steps 102, 104, 106, 108, 122, 124, 126, 128, 130.
  • the server computer 500 is configured to perform the method of FIG. 1 and/or FIG. 2, and/or FIG. 3. It should be noted that the server computer system 500 can be a distributed system including a plurality of computers.
  • the memory 506 may include a non- transitory computer readable medium.
  • the ML model may be trained by supervised method, semi-supervised method, unsupervised method and/or a combination of the aforementioned.
  • the output of the method, system and/or device as described may be deployed as input for subsequent modelling of travel time prediction systems, congestion prediction system, traffic flow modelling, etc.
  • the traffic profile associated in each road segment may be used for travel time estimation for an on-demand vehicle service between a source and a destination.
  • the described system may be simple to implement as spatial data may be readily available, a subset of traffic data may be obtained and machine learning used to infer traffic for the entire road network.
  • a weighted average function may be formulated that combines traffic from neighboring roads to extrapolate inference for all nodes.
  • the methods described herein may be performed and the various processing or computation units and the devices and computing entities described herein may be implemented by one or more circuits.
  • a "circuit" may be understood as any kind of a logic implementing entity, which may be hardware, software, firmware, or any combination thereof.
  • a “circuit” may be a hard-wired logic circuit or a programmable logic circuit such as a programmable processor, e.g. a microprocessor.
  • a “circuit” may also be software being implemented or executed by a processor, e.g. any kind of computer program, e.g. a computer program using a virtual machine code. Any other kind of implementation of the respective functions which are described herein may also be understood as a "circuit" in accordance with an alternative embodiment.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Biomedical Technology (AREA)
  • Computational Linguistics (AREA)
  • Analytical Chemistry (AREA)
  • Software Systems (AREA)
  • Health & Medical Sciences (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Chemical & Material Sciences (AREA)
  • Biophysics (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • Automation & Control Theory (AREA)
  • Mechanical Engineering (AREA)
  • Transportation (AREA)
  • Traffic Control Systems (AREA)

Abstract

Selon certains aspects, la présente invention concerne un procédé mis en œuvre par ordinateur pour prédire des paramètres de circulation sur un réseau routier, lequel procédé comprend les étapes consistant à : charger un fichier de données spatiales associé au réseau routier et un profil de réseau correspondant associé au réseau routier; convertir le fichier de données spatiales en un graphe basé sur les arêtes comprenant une pluralité de nœuds et d'arêtes, chaque nœud représentant un segment de route respectif du réseau routier et chaque arête représentant un emplacement physique respectif; extraire une pluralité d'attributs de route associés au réseau routier et dériver des caractéristiques de nœud correspondantes sur la base de la pluralité d'attributs de route; entrer le graphe basé sur les arêtes, les caractéristiques de nœud et le profil de réseau dans un algorithme d'apprentissage machine pour prédire des paramètres de réseau sur chaque segment de route respectif; l'algorithme d'apprentissage machine étant configuré pour délivrer un ensemble de paramètres de circulation correspondant à chacun de la pluralité de nœuds.
PCT/SG2023/050529 2022-08-05 2023-07-28 Procédé, dispositif et système de prédiction de paramètres de circulation d'un réseau routier WO2024030077A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
SG10202250678H 2022-08-05
SG10202250678H 2022-08-05

Publications (1)

Publication Number Publication Date
WO2024030077A1 true WO2024030077A1 (fr) 2024-02-08

Family

ID=89849966

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SG2023/050529 WO2024030077A1 (fr) 2022-08-05 2023-07-28 Procédé, dispositif et système de prédiction de paramètres de circulation d'un réseau routier

Country Status (1)

Country Link
WO (1) WO2024030077A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN118297775A (zh) * 2024-04-12 2024-07-05 中南大学 基于数字孪生技术的城市规划管控系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080004789A1 (en) * 2006-06-30 2008-01-03 Microsoft Corporation Inferring road speeds for context-sensitive routing
CN112541638A (zh) * 2020-12-21 2021-03-23 北京邮电大学 一种网联车车辆行程时间估计方法
CN113807578A (zh) * 2021-09-01 2021-12-17 南京航空航天大学 一种基于gcn与强化学习的智能路径推荐方法
WO2022129421A1 (fr) * 2020-12-18 2022-06-23 Imec Vzw Prédiction de trafic

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080004789A1 (en) * 2006-06-30 2008-01-03 Microsoft Corporation Inferring road speeds for context-sensitive routing
WO2022129421A1 (fr) * 2020-12-18 2022-06-23 Imec Vzw Prédiction de trafic
CN112541638A (zh) * 2020-12-21 2021-03-23 北京邮电大学 一种网联车车辆行程时间估计方法
CN113807578A (zh) * 2021-09-01 2021-12-17 南京航空航天大学 一种基于gcn与强化学习的智能路径推荐方法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN118297775A (zh) * 2024-04-12 2024-07-05 中南大学 基于数字孪生技术的城市规划管控系统

Similar Documents

Publication Publication Date Title
Ali et al. Exploiting dynamic spatio-temporal graph convolutional neural networks for citywide traffic flows prediction
Essien et al. Improving urban traffic speed prediction using data source fusion and deep learning
CN110415516B (zh) 基于图卷积神经网络的城市交通流预测方法及介质
CN109658695B (zh) 一种多因素的短时交通流预测方法
US20240054321A1 (en) Traffic prediction
CN114330868A (zh) 基于自注意力的个性化增强图卷积网络的客流预测方法
CN110599766A (zh) 一种基于sae-lstm-sad的道路交通拥堵传播预测方法
CN112819222B (zh) 打车需求量和交通流量联合预测模型的预测方法和装置
CN113762595A (zh) 通行时间预测模型训练方法、通行时间预测方法及设备
CN113256980A (zh) 一种路网状态的确定方法、装置、设备及存储介质
CN115691137A (zh) 一种基于因果马尔科夫模型的多模态数据预测方法
WO2023173633A1 (fr) Procédé et appareil de prédiction d'état de route, procédé et appareil d'apprentissage de modèle correspondants, et dispositif et support
CN113159403A (zh) 路口行人轨迹预测的方法及装置
EP4241263A1 (fr) Système et procédé de prédiction de vitesse de circulation routière
CN115423172A (zh) 智慧城市清洁路线管理方法、物联网系统及存储介质
CN114418189A (zh) 水质等级预测方法、系统、终端设备及存储介质
WO2024103770A1 (fr) Procédé et appareil de division d'espace, et support de stockage
WO2024030077A1 (fr) Procédé, dispositif et système de prédiction de paramètres de circulation d'un réseau routier
Petelin et al. Models for forecasting the traffic flow within the city of Ljubljana
CN111190952B (zh) 一种基于图像金字塔提取城市画像多尺度特征并持久化的方法
CN118262527B (zh) 基于大数据的交通平台数据管理方法
Golovnin et al. E-STGCN: enhanced spatial-temporal graph convolutional network for road traffic forecasting
Molefe et al. A new approach for road type classification using multi-stage graph embedding method
Qin Traffic flow prediction based on Two-Channel Multi-Modal fusion of MCB and attention
Rahman et al. Reinforcement Learning Based Approach For Urban Resource Allocation and Path Planning Problems

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23850535

Country of ref document: EP

Kind code of ref document: A1