EP3035314B1 - Système de fusion de données de trafic et procédé associé permettant de fournir un état de trafic de réseau routier - Google Patents

Système de fusion de données de trafic et procédé associé permettant de fournir un état de trafic de réseau routier Download PDF

Info

Publication number
EP3035314B1
EP3035314B1 EP14199054.9A EP14199054A EP3035314B1 EP 3035314 B1 EP3035314 B1 EP 3035314B1 EP 14199054 A EP14199054 A EP 14199054A EP 3035314 B1 EP3035314 B1 EP 3035314B1
Authority
EP
European Patent Office
Prior art keywords
traffic
data
traffic data
traffic state
state
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
EP14199054.9A
Other languages
German (de)
English (en)
Other versions
EP3035314A1 (fr
Inventor
Steven Logghe
Wim Vanbelle
Isaak Yperman
Karolien Scheerlinck
Maarten Houbraken
Wim Vandenberghe
Pieter Callewaert
Bert De Rijck
Jens De Valck
Pieter Pauwels
Mario Vanlommel
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Be-Moblie Tech Nv
Original Assignee
Be Mobile Tech NV
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 Be Mobile Tech NV filed Critical Be Mobile Tech NV
Priority to EP14199054.9A priority Critical patent/EP3035314B1/fr
Priority to PCT/EP2015/075162 priority patent/WO2016096226A1/fr
Publication of EP3035314A1 publication Critical patent/EP3035314A1/fr
Application granted granted Critical
Publication of EP3035314B1 publication Critical patent/EP3035314B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/0108—Measuring and analyzing of parameters relative to traffic conditions based on the source of data

Definitions

  • the present invention relates to the field of processing vehicular traffic data and information for providing an outlook of the traffic state of a network of roads.
  • Traffic data sources measure traffic data along main traffic arteries such as highways and roads.
  • the traffic data is collected to generate a traffic state, which gives an overview of the traffic state at the moment the traffic data is collected, and which can be used to predict an overview of the traffic state in the next coming minutes, hours, or days for example.
  • a wide variety of public, such as drivers, truck drivers, engineers and traffic law makers and enforcers depend upon an accurate description of the current and future traffic state situations and scenarios.
  • Prior art techniques typically include calculating velocities of vehicles by for example acquiring series of exact locations of the vehicles along road segments in known intervals.
  • Fixed or static traffic sensors or electronic devices such as video cameras, tag readers, traffic detectors, etc. are for instance installed permanently or temporarily at known locations of main traffic arteries.
  • the sensors relay crossing times of vehicles to a computerized central traffic data and information handling system that calculates the speed of the vehicles between two sensors and generates a traffic state offering for instance an overview of the traffic to an end-user at the moment of the measurement and/or for instance a prediction of the traffic state.
  • the process of transforming the disparate traffic information into a unified form is called a "data fusion" process in US5173691 .
  • a first weighting step of this "data fusion” process the data from each source undergo a transformation from their original form to a code that represents a level of congestion for a particular segment of a road, thereby attributing a weighting factor to each source.
  • each data source is assigned a quality value according to the quality of the source of the data.
  • each of the data sources is assigned an aging factor reflecting its validity over time.
  • the weighting factor, quality value and aging factor are combined to provide a "score" for each data source.
  • the "data fusion" process of US5173691 is completed by calculating the maximum score at a particular point in time, identifying the source of the maximum score, and displaying the traffic data of the source with the maximum score to the end-user, as explained on page 11, lines 62-65.
  • the system described in US5173691 collects traffic data from a plurality of traffic data sources and in fact performs a fusion of weights assigned to the different sources. With each data source are associated three factors: a weighting factor related to different levels of congestion, a quality value according to the quality of the source, and an aging factor reflecting the validity of the source over time.
  • the accuracy achievable with the system described in US5173691 is limited as the calculation of a traffic state relies on the fusion of weights associated with each traffic data source.
  • the system described in US5173691 finally selects only one traffic data source from which the traffic data is displayed to the end-user of the system. This threatens the relevance and the reliability of the traffic state provided to an end-user of the system.
  • the patent application US2002/0026278 from Estimotion Inc. entitled “Method and system for modelling and processing vehicular traffic data and information and applying thereof", filed on August 28 th 2001 and published on February 28 th 2002, describes a method and a system for modelling and processing vehicular traffic data information to provide a single complete current vehicular traffic situation picture.
  • the method comprises acquiring vehicular traffic data from a plurality of sources by tracking a sample of mobile sensors using techniques based on GPS and/or cellular telephone types of wireless communication networks or systems.
  • the acquired vehicular traffic data is then prioritized and filtered in order not to take data emerging from irrelevant sensors and erroneous data into account.
  • the path of a given vehicle is identified along the network of roads and the vehicular traffic data is acquired in known time intervals.
  • the velocities of all mobile sensors that travelled on a specific road segment of the path during a time period of the assessment yields a normalized travel time value, also referred to as NTT value, on that specific road segment.
  • the normalized travel time refers to a travel time normalized with respect to a pre-determined distance, for example, with respect to a distance having a range between about 10 meters to about 100 meters.
  • the method comprises calculating a mean normalized travel time value, also referred to as mean NTT value, for each road segment of the network of roads using the prioritized and filtered vehicular traffic data and information associated with each source. This results in the generation of a partial current picture of the vehicular traffic situation associated with each source.
  • the system further fuses the partial current traffic situation pictures associated with each source in order to generate a single complete current vehicular traffic situation picture associated with the network of roads.
  • the method also comprises predicting a fixture complete vehicular traffic situation picture associated with the network of roads.
  • the unification of the individual NTT values into a determined value per road segment is done with consideration of a confidence factor of each of the individual data, defined in function of for example the accuracy of the sensor, the amount of footprints, the error rate, etc.
  • the position of the vehicle on a road segment taken into account in the determination of the partial current traffic situation pictures is obtained by introducing assumptions such as the minimal acceleration and the minimal velocity of the vehicle.
  • the accuracy achievable with the described method is therefore limited, as the calculation of the NTT only relies on the fusion of partial current traffic situation pictures associated with sources. Errors generated during the acquisition of the vehicular traffic data as well as errors during the determination of partial current traffic situation pictures are directly transferred to the determination of the single complete current vehicular traffic situation picture and severely impact the quality and the accuracy of the traffic situation picture. This threatens the relevance and the reliability of the traffic state provided to an end-user of the system.
  • the SVM classification component classifies the data as being in the unimpeded state or the busy state for example by utilizing training samples of vehicular traffic data.
  • weighting of input parameters for example the average vehicle speed, traffic volume, the average arrival time, can be set and SVM parameters are optimized.
  • the two outputs of the SVM and the MLP classification algorithms are fed to a voting component, which records the detection accuracy of the classifiers and then determines the current traffic state. For example, if the voting component determines that the classifiers have the same detection decision, the voting component outputs the decision as the final state. Alternatively, if the voting component determines that the classifiers each generate different decisions, one decision of a classifier is selected and is treated as the current traffic state.
  • US2014/0222321 A1 discloses interfaces adapted to receive traffic data from multiple traffic data sources as well as a central traffic database adapted to collect the traffic data from multiple data sources.
  • a traffic data fusion system adapted to produce a traffic state for a network of roads, the traffic data fusion system comprising:
  • Multiple data sources acquire traffic data along a network of roads.
  • the multiple data sources can for example be sensors positioned along the roads of the network of roads, and/or sensors positioned in the vehicles, and/or can be journalistic data sources, and/or weather data sources, etc.
  • the traffic data fusion system comprises a plurality of traffic state determination algorithms that run on the central data fusion engine.
  • Each traffic state determination algorithm uses a partial set or the full set of available traffic data collected from the multiple traffic data sources to generate a respective intermediate traffic state.
  • each intermediate traffic state is generated by a respective algorithm independently.
  • the aggregation engine of the traffic data fusion system combines the intermediate traffic states to generate the traffic state.
  • Each intermediate traffic state is a representation of the traffic data and of the same traffic state of the network of roads as the other intermediate traffic states, but each intermediate traffic state differs from all the other intermediate traffic states as it depicts one or more characteristics of the traffic data differently from the other intermediate traffic states.
  • the fact that the aggregation engine combines all these different representations of the same traffic data to output one single traffic state drastically increases the relevance and the accuracy of the determination of the traffic state.
  • each intermediate traffic state is representative for a different characteristic of the traffic data and the combination of all these different characteristics in one traffic state improves the relevance, the reliability and the robustness of the traffic state outputted to an end-user of the traffic data fusion system.
  • Flexibility in the determination of a traffic state is also provided by the use of a plurality of traffic state determination algorithms.
  • the traffic data fusion system can select to execute two or more traffic state determination algorithms and to combine the respective intermediate traffic states to generate the traffic state. This reduces the processing power required by the traffic data fusion system and decreases the costs associated with its implementation.
  • an intermediate traffic state is a representation of the traffic state at the moment the traffic data fusion system collects the traffic data.
  • the intermediate traffic state reflects the traffic situation at the moment the traffic data is collected.
  • traffic state comprises a predefined set of parameters that determines the traffic on a road segment, alternatively on more than one road segment.
  • the predefined set of parameters comprises at least for example the average speed of a vehicle, but also possibly the type of vehicle, a differentiation between driving lanes of the road segment, etc.
  • the intermediate traffic state is a prediction of the traffic state at a time posterior of the moment the traffic data is collected by the traffic data fusion system.
  • the traffic data fusion system makes a prediction of a future traffic state in time.
  • a plurality of traffic state determination algorithms extrapolate the traffic data to be able to predict the traffic state in the future and to generate an intermediate traffic state representative for a prediction of the traffic state.
  • the intermediate traffic state is a representation and/or an extrapolation of the traffic state at a time anterior of the moment the traffic data is collected by the traffic data fusion system.
  • the traffic data fusion system depicts of a past traffic state in time.
  • a plurality of traffic state determination algorithms extrapolate the traffic data to be able to depict the traffic state in the past and to generate an intermediate traffic state representative for a past traffic state.
  • Interfaces receive traffic data from multiple data sources. To each data source corresponds an interface. Alternatively, an interface is adapted to receive traffic data from a plurality of data sources.
  • An interface is for example a sensor, a sensor adapted for wireless data communication, a phone, a Global Navigation System, a camera, etc.
  • the plurality of traffic state determination algorithms comprise two or more of:
  • the traffic state results from the combination of two or more intermediate traffic states independently generated by two or more respective traffic state determination algorithms.
  • the traffic data fusion system can select to execute two or more traffic state determination algorithms and to combine the respective intermediate traffic states to generate the traffic state.
  • the fact that the aggregation engine combines all these different representations of the same traffic data to output one single traffic state drastically increases the relevance, the accuracy and the reliability of the determination of the traffic state.
  • the intermediate traffic states are independently generated by the central data fusion engine. This way, the central data fusion engine selects traffic state determination algorithms to be executed and does not need to perform all the traffic state determination algorithms at all times. This saves processing power and therefore reduces the costs associated with the traffic data fusion system.
  • Kalman filtering also known as linear quadratic estimation or LQE
  • LQE linear quadratic estimation
  • a Kalman filter operates recursively on streams of noisy input data to produce a statistically optimal estimate of the underlying system state.
  • the algorithm works in a two-step process. In the prediction step, the Kalman filter produces estimates of the current state variables, along with their uncertainties. Once the outcome of the next measurement, corrupted with some amount of error, is observed, these estimates are updated using a weighted average, with more weight being given to estimates with higher certainty.
  • the algorithm's recursive nature because of the algorithm's recursive nature, it can run in real time using only the present input measurements and the previously calculated state and its uncertainty matrix; no additional past information is required.
  • Using this filtering technique enables the determination of variables that are not directly observed, such as travel times for example, and allows to deal with all types of traffic situations represented by the traffic data as long as these traffic situations can be described by the model.
  • the Kalman filtering technique is also relevant even if traffic data for a certain road segment or a certain time interval is missing. Indeed, the model is able to fill the gaps by providing a result at any moment and at any place.
  • the Kalman filtering technique further offers the possibility to clarify possible inconsistencies and errors in the traffic data and inconsistencies between traffic data measured on different road segments.
  • the fact that the model cannot be applied to the collected traffic data can be an indication that the traffic data is not consistent, or that the traffic data is not consistent with traffic engineering laws. It is also possible to extrapolate the model in order to predict a future traffic state when the future traffic state is brought close to reality using traffic data.
  • Another advantage of the Kalman filtering method is that it provides insight into the road segment from which traffic data should be measured in order to optimize the determination of the traffic state, i.e. rely on an optimal overview of the traffic data.
  • the state of the traffic at the time t is called x (t) .
  • the data assimilation techniques according to the present invention are sequential data assimilation techniques. Starting from a state x( t ), the model is used to estimate the traffic state at the time t + ⁇ t , for which the measurements y ( t + ⁇ t ) are available.
  • the prediction of the model x f ( t + ⁇ t ) is then combined with the y( t + ⁇ t ) in an improved prediction x a ( t + ⁇ t ) in an assimilation step.
  • the alternative ensemble Kalman filter or EnKF
  • EnKF is used to continue to assimilate the measurements.
  • EnKF is a popular alternative to the Kalman filtering method, and is used with large non-linear models.
  • the EnKF algorithm uses a plurality of model realizations to depict the uncertainty of the model.
  • the new state x a ( t + ⁇ t ) is then determined by adjusting the model prediction (including the uncertainty) according to the measurements (including the measurement uncertainty). If the model shows less uncertainty than the measurement, then the adjusted prediction resembles the measurements. During the adjustment of the prediction, a new estimation of the remaining model uncertainty is performed.
  • another method for data fusion is the use of amaschineer-Helbing filter.
  • This filter exploits the fact that, in congested traffic, perturbations travel upstream at a near-constant speed, while in free traffic information propagates downstream.
  • traffic data propagates along with a speed which is equal to the slope in the basic diagram of the traffic flow theory.
  • velocity, flow, or other variables as smooth functions of space and time.
  • the parameters that characterize a traffic state for example the speed and/or the density of vehicles, are interpolated with this filter, so that measurements that are acquired recently and that are acquired for a close road segment are associated with a heavier weight than other measurements.
  • Data sources that comprise more data traffic can also be more heavily weighted in the determination of the traffic state than other data sources which comprise less traffic data.
  • this filter is extended to the Extended Generalizedmaschineer-Helbing filter, also referred to as EGTF.
  • the EGTF is able to fuse multiple data sources, as long as for each of these, it is possible to estimate under which traffic regime, for example free flowing or congested, the traffic data was collected.
  • the main advantage of this approach is that it allows merging or fusing traffic data from different data sources, characterized by different spatial and temporal resolutions and/or different accuracies and/or different reliabilities, into a consistent, coherent and meaningful traffic information. This process allows the use of the theoretical traffic laws.
  • Machine learning is a subfield of computer science and statistics that deals with the construction and study of systems that can learn from data, rather than follow only explicitly programmed instructions.
  • Machine learning tasks can be of several forms.
  • supervised learning the computer is presented with example inputs and their desired outputs, given by a "teacher", and the goal is to learn a general rule that maps inputs to outputs.
  • unsupervised learning no labels are given to the learning algorithm, leaving it on its own to form groups of similar inputs, density estimates or projections of high-dimensional data that can be visualised effectively.
  • a computer program interacts with a dynamic environment in which it must perform a certain goal, for example driving a vehicle, without a teacher explicitly telling it whether it has come close to its goal or not.
  • a certain goal for example driving a vehicle
  • a teacher explicitly telling it whether it has come close to its goal or not.
  • Specific algorithms that follow this methodology are for example neural networks and pattern recognition, which will be discussed in more detail below.
  • Neural networks belong to the category of machine learning algorithms. Neural networks are very suited to perform specific tasks such as pattern recognition, perception and control. Neural networks compute these tasks very fast and accurately. Neural networks, also referred to as Biological Neural Networks or BNNs have the further advantage that they are robust, i.e. that data provided with a lot of noise is - to some extent - processed in a correct manner. By imitating the brain processes and the brain architecture, specific properties are used by the neural networks to execute brain-related tasks. These simplified BNNs are called Artificial Neural Networks, also referred to as ANNs. BNNS and ANNs both comprise parallel units called neurons.
  • a Multi-Layer Feed-forward neural network is an artificial neural network where connections between the units do not form a directed cycle.
  • the information moves in only one direction, forward, from the input nodes, through the hidden nodes, if any, and to the output nodes. There are no cycles or loops in the network.
  • the imitation lies in the fact that signals that were first non-linearly processed are passed on to all the forward-associated neurons.
  • An ANN for example complies with the following steps: signals enter a network via an input layer comprising, for example, n neurons. The signals are processed non-linearly and passed on to all the forward associated units in the following layer: this can for example be a hidden layer, but also the output layer. These operations are repeated until the output layer having m neurons has been reached.
  • the description shows that the adaptation of an ANN is actually nothing more than a non-linear mapping of an n -dimensional input vector, often referred to as pattern, to an m-dimensional output vector.
  • the way the mapping is achieved is determined by the choice of network architecture, the choice of the transfer function within the artificial neurons and the selection of the learning rule which is in force during the learning process.
  • the network architecture depends on the number of artificial neurons per layer and the connections of neurons between layers and the connection of neurons in the same layers.
  • the selection of the transfer function is always an increasing function.
  • the choice of the transfer function may be per neuron or per layer, but is usually the same for each neuron of the entire network.
  • the selection of the learning rule determines how the synaptic weights, with which incoming signals are multiplied, change during the learning process.
  • the use of a neural network is justified by its short development time, its robustness with respect to the collection of noisy data, its efficiency with respect to the computer processing time and its adaptability in a changing environment.
  • the ANNs are trained under supervision. This training comprises three phases: the learning phase, also called the training phase, during which training patterns are introduced along with end purposes.
  • the difference between the end purpose and the output generated by the ANN is an error term that is a measure used to adjust the synaptic weights and therefore to minimize the cumulative error term of all the training patterns.
  • the test phase training patterns are provided to the ANN. Judging from the cumulative error term, one can estimate how generalizing the ANN is.
  • the last phase called the validation phase
  • the traffic data is therefore divided into four sets of traffic data. Two sets of traffic data are used to train the ANN, one set is used during the test phase and the last set is used during the validation phase. Relying on cross-correlation, it is then possible to determine the result for the whole traffic data.
  • Pattern recognition also belongs to the category of machine learning algorithms. This branch of artificial intelligence focuses on the recognition of patterns and regularities in data. In many cases, these patterns are learned from labelled "training" data, but when no labelled data are available other algorithms can be used to discover previously unknown patterns.
  • An example of pattern recognition is classification, which attempts to assign each input value to one of a given set of classes. However, pattern recognition is a more general problem that encompasses other types of output as well.
  • Pattern recognition algorithms generally aim to provide a reasonable answer for all possible inputs and to perform "most likely” matching of the inputs, taking into account their statistical variation. Pattern recognition can thus be used to combine multiple data sources into a single accurate description of the traffic state.
  • a genetic algorithm is a search heuristic that mimics the process of natural selection. This heuristic is routinely used to generate useful solutions to optimization problems and search problems using techniques inspired by natural evolution, such as inheritance, mutation, selection and crossover. This algorithm can be used to minimize the difference between the fused traffic state and reality.
  • another method for data fusion is the use of the Lagrange and Euler Cinematic wave method.
  • the kinematic wave model is often used in simulation tools to describe dynamic traffic flow and to estimate and predict traffic states. Discretization of the model is generally based on Eulerian coordinates, which are fixed in space. However, the Lagrangian coordinate system, in which the coordinates move with the velocity of the vehicles, results in more accurate solutions. Furthermore, if the model includes multiple user classes, it describes real traffic more accurately.
  • Such a multiclass model in contrast to a mixed-class model, treats different types of vehicles, for example passenger cars and trucks or vehicles with different origins or destinations, or both, differently.
  • the Lagrangian coordinate system is combined with a multiclass model, and a Lagrangian formulation of the kinematic wave model for multiple user classes is proposed. It is shown that the advantages of the Lagrangian formulation also apply for the multiclass model. Simulations based on the Lagrangian formulation result in more accurate solutions than simulations based on the Eulerian formulation.
  • LTM Link Transmission Model
  • the Link Transmission Model is a Dynamic Network Loading model for a macroscopic simulation-based Dynamic Traffic Assignment model; vehicles are moved as a continuum.
  • traffic propagation on network links is consistent with kinematic wave theory. This theory provides substantial realism in the representation of queue-propagation and queue-dissipation.
  • LTM considers a detailed description of traffic dynamics at signalized and un-signalized intersections. Local flow restrictions and experienced intersection delays are consistent with state-of-the-art queuing theory. Since the LTM solution algorithm is computationally efficient and walks through simulations in large time steps, large scale networks can be dealt with in a small amount of time.
  • another method for data fusion is the combination of the Extended Generalizedmaschineer-Helbing Filter, also referred to as EGTF, and the traffic conservation law.
  • EGTF Extended Generalizedmaschineer-Helbing Filter
  • the EGTF is able to fuse multiple data sources, in order to estimate the traffic state (velocity, density and intensity) as a function of space and time.
  • This filter encompasses the fundamental concepts of traffic flow theory, namely the upstream propagation of congested traffic perturbations and the downstream propagation of free flow traffic waves.
  • the conservation law states that in case of a closed section, no on- or off-ramps are present, the number of vehicles cannot change in time and space.
  • the cumulative number of vehicles for example determined with the Link Transmission Model, also referred to as LTM.
  • LTM Link Transmission Model
  • the conservation law is applied to simultaneously correct the estimated traffic state, which can be necessary in case the original data sources contains errors.
  • This extension of the EGTF thus allows us to minimize the effect of false measurements, e.g. due to technical failure, in the original available data sources, which empowers the original EGTF considerably.
  • Kalman filters have been widely used for navigation and system integration.
  • a possible challenge associated with Kalman filters is how to assign suitable statistical properties to both the dynamic and the observational models.
  • For Global Navigation System navigation the manoeuvre of the vehicle and the level of measurement noise are environmental dependent, and difficult to be predicted. Therefore, to assign constant noise levels for such applications is not realistic.
  • adaptive algorithms are more robust to sudden changes of vehicle motion and measurement errors than a conventional Kalman filter is for vehicle navigation.
  • other variants of the implementation of the Kalman filtering method are also in accordance with the present invention.
  • another method for data fusion is the use of a particle swarm optimization.
  • This computational method optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality.
  • the method optimizes a problem by having a population of candidate solutions, referred to as particles, and moving these particles around in the search-space according to simple mathematical formulae over the particle's position and velocity.
  • Each particle's movement is influenced by its local best known position but is also guided towards the best known positions in the search-space, which are updated as better positions are found by other particles.
  • another method for data fusion is the use of an ant colony optimization algorithm.
  • This algorithm is a probabilistic technique for solving computational problems which can be reduced to searching for an optimal path in a graph.
  • another method for data fusion is the use of a dynamic programming method.
  • This method solves complex problems by breaking them down into simpler subproblems and by then combining the solutions of the subproblems to reach the best overall solution for the problem.
  • the dynamic programming approach seeks to solve each subproblem only once, thus reducing the number of computations. Once the solution to a given subproblem has been computed, it is stored or "memorized": the next time the same solution is needed, it is simply looked up.
  • another method for data fusion is the use of a simulated annealing method.
  • This method locates a good approximation to the global optimum of a given function in a large search space.
  • the algorithm relies on a slow decrease in the probability of accepting worse solutions as it explores the solution space.
  • the aggregation engine is adapted to calculate a mean value of the intermediate traffic states as the traffic state.
  • the traffic state takes all the available intermediate traffic states independently resulting from their respective traffic state determination algorithms into account. All the intermediate traffic states are associated with a same weight value during the determination of the traffic state, and the traffic state is obtained by averaging all the available intermediate traffic states. All the available intermediate traffic states are combined and the resulting traffic state is divided by the total number of available intermediate traffic states, thereby generating the traffic state. In other words, each intermediate traffic state is considered with the same importance during the determination of the traffic state and each intermediate traffic state has the same impact as all the other intermediate traffic states on the determination of the traffic state. This combination of several intermediate traffic states drastically increases the accuracy and the reliability of the traffic state.
  • each intermediate traffic state is obtained from a different traffic state determination algorithm and therefore is a different representation of the traffic data compared to all the other intermediate traffic states.
  • the determination of the traffic state therefore relies on a robust and relevant combination of all these different representations of the same traffic data.
  • the traffic data fusion system performs a prediction in time of the traffic state
  • the fact that the aggregation engine calculates a mean value of the intermediate traffic states as the traffic state drastically increases the reliability and the accuracy of the prediction. The probability that the generated predicted traffic state becomes real increases.
  • the aggregation engine is adapted to calculate a median value of the intermediate traffic states as the traffic state.
  • the traffic state is determined by identifying the median value of all the available intermediate traffic states.
  • a calculation is performed to identify the median value of all the different representations of the traffic data represented by the respective different intermediate traffic states. This makes the determination of the traffic state more relevant as the system is able to identify similarities between all the different independently generated intermediate traffic states and to associate these similarities with a larger weight during the generation of the traffic state.
  • similar representations of traffic data identified on different intermediate traffic states are considered as more relevant for the determination of the traffic state than representations and characteristics of the traffic data that are only present in a minority of intermediate traffic states. This improves the accuracy of the traffic state as the traffic state is calculated to be as close as possible to the current traffic state and/or to the most likely predicted traffic state.
  • the aggregation engine is adapted to calculate a weighted sum of the intermediate traffic states as the traffic state.
  • the weighted sum comprises weights representative for the reliability of the respective traffic state determination algorithms.
  • each intermediate traffic state is associated with a weight representative for the reliability of the respective traffic state determination algorithms.
  • the traffic data fusion system is able to evaluate the reliability of two or more traffic state determination algorithms for the traffic state situation depicted by the traffic data it collected. In other words, depending on the nature of the traffic data and of the situation the traffic data reflects, the traffic data fusion system determines the reliability of two or more of the traffic determination algorithms by for example associating a reliability factor to two or more of the traffic state determination algorithms.
  • the traffic data fusion system re-evaluates the reliability of two or more of the traffic state determination algorithms for the situation reflected by the traffic data.
  • Reliable traffic state determination algorithms are then associated with weights demonstrating a higher numerical value than the weights associated with traffic state determination algorithms identified as less reliable.
  • intermediate traffic states generated by reliable traffic state determination algorithms are weighted with a higher numerical value than other intermediate traffic states during their combination, i.e. during the generation of the traffic state.
  • the more reliable a traffic state determination algorithm is, the higher the numerical value of the weight associated with the corresponding intermediate traffic state is, and the larger the impact of the intermediate traffic state on the generation of the traffic state.
  • the traffic state is therefore more influenced by reliable intermediate traffic states, which drastically increases the reliability and the relevance of the traffic state.
  • the data fusion system performs a prediction of the traffic state in time
  • the fact that the reliability of the traffic state determination algorithm is taken into account during the generation of the traffic state drastically increases the reliability and the accuracy of the prediction.
  • the resulting probability that the generated predicted traffic state is realized therefore increases.
  • the traffic state comprises one or more of:
  • the traffic state can be used to reflect the state of the network of roads, for example if the network of roads is free-flowing or if the network of roads is congested.
  • This traffic state makes information over vehicles on the network of roads available and the traffic state also reflects journalistic traffic data acquired. This information can for example then be shared with other vehicles and/or data sources. Further traffic parameters can be deduced from the traffic state, for example the travel time, the gap distance between two vehicles, the vehicle heading, the delay, the level of service, the presence of absence of a traffic jam, etc. Indicators such as the level of gas emission of a vehicle, the level of noise generated by a vehicle, hours during which a vehicle consumes the most, etc can also be deduced from the traffic state.
  • the traffic state facilitates the representation and the visualization of the traffic data by an end-user of the traffic data fusion system, and it therefore facilitates a diagnosis performed by the end-user to identify if the network of roads is free-flowing or if it is congested. It also reduces the time needed for an end-user to analyze the traffic state and to identify the state of the network of roads.
  • the average vehicle speed and/or the journalistic traffic data can for example be used, possibly in combination with other parameters, when predicting the traffic state in time.
  • the traffic state is validated.
  • This validation is performed simultaneously with the traffic estimation, this means directly after publishing the traffic state and before publishing the next traffic state.
  • the validation result is used to adapt the weights given to the different data fusion algorithms.
  • the validation result can for example indicate that in congestion, the results obtained with the Schwarzer-Helbing Filter are significantly more accurate than with neural networks.
  • the weight of the Schwarzer-Helbing Filter can be increased with respect to the weight of neural networks.
  • the validation result can also be used to determine the reliability of the different data sources. With these results, it can be decided to give different weights to the different data sources. In this way, the complete data fusion methodology can be trained.
  • the traffic state is periodically updated.
  • Traffic data is periodically updated.
  • the traffic state is periodically updated, which means that the traffic state remains relevant in time as the traffic state depicts and reflects recently acquired traffic data.
  • the fact that the traffic state is periodically updated also ensures the robustness of the traffic state.
  • An end-user of the traffic data fusion system is indeed provided with a real-time viewing experience of the state of the network of roads.
  • the periodic update also increases the relevance, the reliability and the accuracy of the prediction of the traffic state in time as the determination of the traffic state can more rapidly take changes of the traffic data into account and therefore adapt the prediction of the traffic state in time accordingly.
  • the traffic state can be updated every 15 seconds, or every 30 seconds, or every 45 seconds, or every minute, or every day, etc.
  • the traffic state is calculated for road segments of a predetermined length.
  • Traffic data is collected for each individual lane of every road segment of the network of roads.
  • the predetermined length of a road segment can for example be substantially equal to 25 meters, or 50 meters, or 100 meters, or 1 kilometer, etc. Every road segment of the network of roads has the same predetermined length. Alternatively, at least two road segments of the network of roads have different predetermined lengths. This way, the traffic data is regularly updated and the traffic state therefore reflects a recent and reliable state of the road segment. This increases the reliability and the robustness of the traffic state.
  • the multiple traffic data sources comprise two or more of:
  • Floating Car Data also known as FCD or floating cellular data
  • FCD floating Car Data
  • FCD floating cellular data
  • a point measurement system performs a measurement locally, either in a vehicle or on one road segment of the network of roads.
  • a trajectory measurement is performed by measuring the position of vehicles at different positions, for example on several road segments of the network of roads and determining the corresponding trajectories.
  • journalistic data is provided to the traffic fusion data system. Journalistic data gathers input from for example users of vehicles, such as internet messages, tweets, location updates, SMS, social media, and/or even traffic directly provided by the vehicles themselves.
  • Weather data system identifies the weather conditions on the road segments of the network of roads.
  • Traffic management systems comprise for example traffic cameras, number plate recognition systems, and induction loops embedded in the road segments of the network of roads. The combination and cross-comparison of traffic data acquired from vehicles and of traffic data acquired on the road segments themselves increases the accuracy of the determination of the traffic state.
  • a traffic state for a network of roads comprising the steps of:
  • Multiple data sources acquire traffic data along a network of roads.
  • the multiple data sources can for example be sensors positioned along the roads of the network of roads, and/or sensors positioned in the vehicles, and/or can be journalistic data sources, and/or weather data sources, etc.
  • Each traffic state determination algorithm uses a partial set or the full set of available traffic data collected from the multiple traffic data sources to independently generate a respective intermediate traffic state. In other words, each intermediate traffic state is independently generated by a respective algorithm. The intermediate traffic states are then combined to generate the traffic state.
  • the traffic data collected from the plurality of traffic data sources is therefore computed according to a plurality of traffic state determination algorithms.
  • Each intermediate traffic state is a representation of the traffic data and of the same current traffic state of the network of roads than the others intermediate traffic state, but each intermediate traffic state differs from all the other intermediate traffic states as it depicts one or more characteristics of the traffic data differently than the other intermediate traffic states.
  • the fact that the all these different representations of the same traffic data are combined to output one single traffic state drastically increases the relevance and the accuracy of the determination of the traffic state. Indeed, as each intermediate traffic state is representative for a different characteristic of the traffic data and the combination of all these different characteristics in one traffic state improves the relevance, the reliability and the robustness of the traffic state outputted to an end-user of the traffic data fusion system. Flexibility in the determination of a traffic state is also provided by the use of a plurality of traffic state determination algorithms.
  • two or more traffic state determination algorithms can be selected and executed independently and the generated respective intermediate traffic states are combined to generate the traffic state. This reduces the processing power required to reach the traffic state and decreases the costs associated with the implementation of the method.
  • an intermediate traffic state is a representation of the traffic state at the moment the traffic data fusion system collects the traffic data.
  • the intermediate traffic state reflects the traffic situation at the moment the traffic data is collected.
  • the intermediate traffic state is a prediction of the traffic state at a time posterior of the moment the traffic data is collected by the traffic data fusion system.
  • the traffic data fusion system makes a prediction of a future traffic state in time.
  • a plurality of traffic state determination algorithms extrapolate the traffic data to be able to predict the traffic state in the future and to generate an intermediate traffic state representative for a prediction of the traffic state.
  • the intermediate traffic state is a representation and/or an extrapolation of the traffic state at a time anterior of the moment the traffic data is collected by the traffic data fusion system.
  • the traffic data fusion system depicts of a past traffic state in time.
  • a plurality of traffic state determination algorithms extrapolate the traffic data to be able to depict the traffic state in the past and to generate an intermediate traffic state representative for a past traffic state.
  • the current invention in addition also relates to a computer program comprising software code adapted to perform the method according to the present invention.
  • the invention further relates to a computer readable storage medium comprising the computer program according to the present invention.
  • a traffic data fusion system 1 comprises a plurality of interfaces 100, a plurality of data sources 200, a central traffic database 300, a central data fusion engine 400, and an aggregation engine 500.
  • Traffic data 3 is collected by a plurality of data sources 200.
  • Floating Car Data source 201, counting loops source 202, travelling time source 203, journalistic data source 204 and/or any other suitable data source 205 receive and collect traffic data 3 for a network of roads.
  • Interfaces 100 receive the traffic data 3 from the plurality of data sources 200. As visible in Fig. 1 , each interface 100 receives traffic data 3 from one data source 200.
  • Fig. 1 each interface 100 receives traffic data 3 from one data source 200.
  • interface 101 to interface 105 respectively receive traffic data 3 from data source 201 to data source 205.
  • each interface 100 receives traffic data 3 from more than one data source 200.
  • the central traffic database 300 collects the traffic data 3 from the interfaces 100.
  • the central traffic database 300 comprises a road network description 310.
  • a road network description 310 consists of a consistent logical description of the location, properties and topological model of the road network. It contains a set of nodes and links with additional properties described in segments.
  • a node describes a geographical point with coordinates, for example a longitude and a latitude, in a world surface coordinate system. It contains a node ID and additional node properties. Roads are described as links, a vector or connection between different nodes.
  • Links have driving properties like driving direction, number of lanes, speed limits, road length, etc.
  • a set of links and nodes describes a graph that can be used in a route planner or a Geographic Information System.
  • a link can be split in different short sections, referred to as segments.
  • the central traffic database 300 comprises the interfaces 100.
  • the central data fusion engine 400 uses the traffic data 3 to generate intermediate traffic states 4.
  • the central data fusion engine 400 performs a plurality of traffic state determination algorithms 10 using the traffic data 3 to independently generate respective intermediate traffic states 4 for the network of roads.
  • the traffic state determination algorithms 10 visible in Fig. 1 are for example model based, neural network,maschineer-Helbing filter, a semantic web approach, a statistical approach, etc.
  • the aggregation engine 500 receives the intermediate traffic states 4 generated by the central data fusion engine 400 and combines the intermediate traffic states 4 to generate the traffic state 2.
  • a traffic data fusion system 1 comprises a plurality of interfaces 100, a plurality of data sources 200, a central traffic database 300, a central data fusion engine 400, an aggregation engine 500 and a validation unit 7 labelled A.
  • Traffic data 3 is collected by a plurality of data sources 200.
  • Floating Car Data source 201, counting loops source 202, travelling time source 203, journalistic data source 204 and/or any other suitable data source 205 receive and collect traffic data 3 for a network of roads.
  • Interfaces 100 receive the traffic data 3 from the plurality of data sources 200. As visible in Fig. 2 , each interface 100 receives traffic data 3 from one data source 200.
  • Fig. 1 comprises a plurality of interfaces 100, a plurality of data sources 200, a central traffic database 300, a central data fusion engine 400, an aggregation engine 500 and a validation unit 7 labelled A.
  • Traffic data 3 is collected by a plurality of data sources 200.
  • the central traffic database 300 collects the traffic data 3 from the interfaces 100.
  • the central traffic database 300 comprises a road network description 310.
  • a road network description 310 consists of a consistent logical description of the location, properties and topological model of the road network. It contains a set of nodes and links with additional properties described in segments.
  • a node describes a geographical point with coordinates, for example a longitude and a latitude, in a world surface coordinate system. It contains a node ID and additional node properties. Roads are described as links, a vector or connection between different nodes.
  • Links have driving properties like driving direction, number of lanes, speed limits, road length, etc.
  • a set of links and nodes describes a graph that can be used in a route planner or a Geographic Information System.
  • a link can be split in different short sections, referred to as segments.
  • the central traffic database 300 comprises the interfaces 100.
  • the central data fusion engine 400 uses the traffic data 3 to generate intermediate traffic states 4.
  • the central data fusion engine 400 performs a plurality of traffic state determination algorithms 10 using the traffic data 3 to independently generate respective intermediate traffic states 4 for the network of roads.
  • the traffic state determination algorithms 10 visible in Fig. 2 are for example model based, neural network,maschineer-Helbing filter, a semantic web approach, a statistical approach, etc.
  • the aggregation engine 500 receives the intermediate traffic states 4 generated by the central data fusion engine 400 and combines the intermediate traffic states 4 to generate the traffic state 2.
  • the system 1 further comprises a validation unit 7 labelled A.
  • the validation unit 7 labelled A is adapted to compare the published traffic state 2 with the reality of the traffic state depicted by the traffic data 3 collected by the data sources 200.
  • the validation unit 7 labelled A therefore receives the traffic state 2 and the data 3 as inputs.
  • the validation unit 7 labelled A outputs a comparison 8 of how reliable the published traffic state 2 is compared to the traffic data 3 collected by the data sources 200.
  • the aggregation engine 500 receives the comparison 8 generated by the validation unit 7 labelled A.
  • the aggregation engine 500 takes this comparison 8 into account when determining the weights of the different traffic state determination algorithms 10 in order to alter the reliability of the data sources 200.
  • predictions of the traffic state 2 generated by the traffic data fusion system 1 can be validated by the validation unit 7 labelled A.
  • the weights of one or more traffic state determination algorithms 10 can be adapted so that the traffic state 2 is more in accordance with the traffic data 3.
  • the comparison 8 generated by the validation unit 7 labelled A is used to allocate weights to the traffic data 3. These weights are a measure of the reliability of each of the data sources 200.
  • the validation unit 7 labelled A identifies that the traffic state 2 does not have any correspondence with the traffic data 3 collected by a data source 200
  • the validation unit 7 labelled A will generate a weight for the data source 200 smaller than the weights associated with other data sources 200.
  • the validation unit 7 labelled A ensures the traffic data 2 is more in accordance with the traffic data 3 by allocating more importance to one or more data sources 200, i.e. by allocating weights demonstrating a higher numerical value to data sources 200 from which the traffic data 3 is in accordance with the traffic state 2 and/or by respectively allocating weights demonstrating a lower numerical value to data sources 200 from which the traffic data 3 is not in accordance with the traffic state 2.
  • a traffic data fusion system 1 comprises a plurality of interfaces 100, a plurality of data sources 200, a central traffic database 300, a central data fusion engine 400, an aggregation engine 500 and a validation unit 9 labelled B.
  • Traffic data 3 is collected by a plurality of data sources 200.
  • Floating Car Data source 201, counting loops source 202, travelling time source 203, journalistic data source 204 and/or any other suitable data source 205 receive and collect traffic data 3 for a network of roads.
  • Interfaces 100 receive the traffic data 3 from the plurality of data sources 200. As visible in Fig. 3 , each interface 100 receives traffic data 3 from one data source 200.
  • Fig. 3 In Fig.
  • the central traffic database 300 collects the traffic data 3 from the interfaces 100.
  • the central traffic database 300 comprises a road network description 310.
  • a road network description 310 consists of a consistent logical description of the location, properties and topological model of the road network. It contains a set of nodes and links with additional properties described in segments.
  • a node describes a geographical point with coordinates, for example a longitude and a latitude, in a world surface coordinate system. It contains a node ID and additional node properties. Roads are described as links, a vector or connection between different nodes.
  • Links have driving properties like driving direction, number of lanes, speed limits, road length, etc.
  • a set of links and nodes describes a graph that can be used in a route planner or a Geographic Information System.
  • a link can be split in different short sections, referred to as segments.
  • the central traffic database 300 comprises the interfaces 100.
  • the central data fusion engine 400 uses the traffic data 3 to generate intermediate traffic states 4.
  • the central data fusion engine 400 performs a plurality of traffic state determination algorithms 10 using the traffic data 3 to independently generate respective intermediate traffic states 4 for the network of roads.
  • the traffic state determination algorithms 10 visible in Fig. 3 are for example model based, neural network,maschineer-Helbing filter, a semantic web approach, a statistical approach, etc.
  • the aggregation engine 500 receives the intermediate traffic states 4 generated by the central data fusion engine 400 and combines the intermediate traffic states 4 to generate the traffic state 2.
  • the system 1 further comprises a validation unit 9 labelled B.
  • the validation unit 9 labelled B is adapted to compare the intermediate traffic states 4 generated by the central data fusion engine 400 and to delete intermediate traffic states 4 the validation unit 9 labelled B identifies as not reliable.
  • the validation unit 9 labelled B therefore receives the intermediate traffic states 4 as input.
  • the validation unit 9 labelled B outputs reliable intermediate traffic states 4.
  • one intermediate traffic state 4 represents an intermediate traffic state that is completely different, for example a complete opposite representation and/or prediction than the one of the other intermediate traffic states 4, the validation unit 9 labelled B can safely identify this intermediate traffic state 4 as not reliable.
  • this non reliable traffic state 4 is not inputted to the aggregation engine 500 and is therefore not included in the calculation of the traffic state 2 performed by the aggregation engine 500.
  • a traffic data fusion system 1 comprises a plurality of interfaces 100, a plurality of data sources 200, a central traffic database 300, a central data fusion engine 400, an aggregation engine 500, a validation unit 7 labelled A and a validation unit 9 labelled B.
  • Traffic data 3 is collected by a plurality of data sources 200.
  • Floating Car Data source 201, counting loops source 202, travelling time source 203, journalistic data source 204 and/or any other suitable data source 205 receive and collect traffic data 3 for a network of roads.
  • Interfaces 100 receive the traffic data 3 from the plurality of data sources 200. As visible in Fig.
  • each interface 100 receives traffic data 3 from one data source 200.
  • interface 101 to interface 105 respectively receive traffic data 3 from data source 201 to data source 205.
  • each interface 100 receives traffic data 3 from more than one data source 200.
  • the central traffic database 300 collects the traffic data 3 from the interfaces 100.
  • the central traffic database 300 comprises a road network description 310.
  • a road network description 310 consists of a consistent logical description of the location, properties and topological model of the road network. It contains a set of nodes and links with additional properties described in segments.
  • a node describes a geographical point with coordinates, for example a longitude and a latitude, in a world surface coordinate system. It contains a node ID and additional node properties.
  • Roads are described as links, a vector or connection between different nodes. Links have driving properties like driving direction, number of lanes, speed limits, road length, etc.
  • a set of links and nodes describes a graph that can be used in a route planner or a Geographic Information System.
  • a link can be split in different short sections, referred to as segments.
  • the central traffic database 300 comprises the interfaces 100.
  • the central data fusion engine 400 uses the traffic data 3 to generate intermediate traffic states 4.
  • the central data fusion engine 400 performs a plurality of traffic state determination algorithms 10 using the traffic data 3 to independently generate respective intermediate traffic states 4 for the network of roads.
  • the traffic state determination algorithms 10 visible in Fig.
  • the aggregation engine 500 receives the intermediate traffic states 4 generated by the central data fusion engine 400 and combines the intermediate traffic states 4 to generate the traffic state 2.
  • the system 1 further comprises a validation unit 7 labelled A.
  • the validation unit 7 labelled A is adapted to compare the published traffic state 2 with the reality of the traffic state depicted by the traffic data 3 collected by the data sources 200.
  • the validation unit 7 labelled A therefore receives the traffic state 2 and the data 3 as inputs.
  • the validation unit 7 labelled A outputs a comparison 8 of how reliable the published traffic state 2 is compared to the traffic data 3 collected by the data sources 200.
  • the aggregation engine 500 receives the comparison 8 generated by the validation unit 7 labelled A.
  • the aggregation engine 500 takes this comparison 8 into account when determining the weights of the different traffic state determination algorithms 10 in order to alter the reliability of the data sources 200.
  • predictions of the traffic state 2 generated by the traffic data fusion system 1 can be validated by the validation unit 7 labelled A.
  • the weights of one or more traffic state determination algorithms 10 can be adapted so that the traffic state 2 is more in accordance with the traffic data 3.
  • the comparison 8 generated by the validation unit 7 labelled A is used to allocate weights to the traffic data 3. These weights are a measure of the reliability of each of the data sources 200.
  • the validation unit 7 labelled A identifies that the traffic state 2 does not have any correspondence with the traffic data 3 collected by a data source 200
  • the validation unit 7 labelled A will generate a weight for the data source 200 smaller than the weights associated with other data sources 200.
  • the validation unit 7 labelled A ensures the traffic data 2 is more in accordance with the traffic data 3 by allocating more importance to one or more data sources 200, i.e. by allocating weights demonstrating a higher numerical value to data sources 200 from which the traffic data 3 is in accordance with the traffic state 2 and/or by respectively allocating weights demonstrating a lower numerical value to data sources 200 from which the traffic data 3 is not in accordance with the traffic state 2.
  • the validation unit 7 labelled A ensures the traffic data 2 is more in accordance with the traffic data 3 by allocating more importance to one or more data sources 200, i.e. by allocating weights demonstrating a higher numerical value to data sources 200 from which the traffic data 3 is in accordance with the traffic state 2 and/or by respectively allocating
  • the system 1 further comprises a validation unit 9 labelled B.
  • the validation unit 9 labelled B is adapted to compare the intermediate traffic states 4 generated by the central data fusion engine 400 and to delete intermediate traffic states 4 the validation unit 9 labelled B identifies as not reliable.
  • the validation unit 9 labelled B therefore receives the intermediate traffic states 4 as input.
  • the validation unit 9 labelled B outputs reliable intermediate traffic states 4. For example, if one intermediate traffic state 4 represents an intermediate traffic state that is completely different, for example a complete opposite representation and/or prediction than the one of the other intermediate traffic states 4, the validation unit 9 labelled B can safely identify this intermediate traffic state 4 as not reliable.
  • this non reliable traffic state 4 is not inputted to the aggregation engine 500 and is therefore not included in the calculation of the traffic state 2 performed by the aggregation engine 500.
  • a traffic state 2 is generated from a plurality of intermediate traffic states 4, labelled ITS a to ITS m , where ITS stands for Intermediate Traffic State and where m is an integer higher than 1.
  • a traffic state 2 is generated from two or more intermediate traffic states 4.
  • the intermediate traffic states 4 are weighted by respective and corresponding weights 5, labelled w a to w m .
  • each intermediate traffic state 4 is indeed weighted by a weight 5.
  • the weights 5 are equal to an integer or a floating number, and can for example for comprised between 0 and 1, 0 and 100, etc. The numerical value of the weights 5 are different.
  • two or more weights 5 can be equal to the same numerical value.
  • all the weights 5 can be equal to the same numerical value and therefore all the intermediate traffic states 4 have the same importance during the generation of the traffic state 2.
  • the weighted intermediate traffic states 6 are then combined together and the traffic state 2 is generated from the combination of at least two intermediate traffic states 4.
  • the weights 5 associated with all the intermediate traffic states 4 except two intermediate traffic states 4 can be equal to zero. In that case, the traffic state 2 is generated from the combination of two intermediate traffic states 4.
  • the intermediate traffic state 4 respectively has more or less importance during the generation of the traffic state 2 than the other intermediate traffic state 4.
  • Fig. 6 shows a suitable computing system 800 for hosting the system 1 of Fig. 1 .
  • Computing system 800 may in general be formed as a suitable general purpose computer and comprise a bus 510, a processor 502, a local memory 504, one or more optional input interfaces 514, one or more optional output interfaces 516 a communication interface 512, a storage element interface 506 and one or more storage elements 508.
  • Bus 510 may comprise one or more conductors that permit communication among the components of the computing system.
  • Processor 502 may include any type of conventional processor or microprocessor that interprets and executes programming instructions.
  • Local memory 504 may include a random access memory (RAM) or another type of dynamic storage device that stores information and instructions for execution by processor 502 and/or a read only memory (ROM) or another type of static storage device that stores static information and instructions for use by processor 504.
  • Input interface 514 may comprise one or more conventional mechanisms that permit an operator to input information to the computing device 800, such as a keyboard 520, a mouse 530, a pen, voice recognition and/or biometric mechanisms, etc.
  • Output interface 516 may comprise one or more conventional mechanisms that output information to the operator, such as a display 540, a printer 550, a speaker, etc.
  • Communication interface 512 may comprise any transceiver-like mechanism such as for example two 1 Gb Ethernet interfaces that enables computing system 800 to communicate with other devices and/or systems, for example mechanisms for communicating with one or more other computing systems 900.
  • the communication interface 512 of computing system 800 may be connected to such another computing system by means of a local area network (LAN) or a wide area network (WAN, such as for example the internet, in which case the other computing system 580 may for example comprise a suitable web server.
  • LAN local area network
  • WAN wide area network
  • the other computing system 580 may for example comprise a suitable web server.
  • Storage element interface 506 may comprise a storage interface such as for example a Serial Advanced Technology Attachment (SATA) interface or a Small Computer System Interface (SCSI) for connecting bus 510 to one or more storage elements 508, such as one or more local disks, for example 1TB SATA disk drives, and control the reading and writing of data to and/or from these storage elements 508.
  • SATA Serial Advanced Technology Attachment
  • SCSI Small Computer System Interface
  • the storage elements 508 above is described as a local disk, in general any other suitable computer-readable media such as a removable magnetic disk, optical storage media such as a CD or DVD, -ROM disk, solid state drives, flash memory cards, ... could be used.
  • the system 800 described above can also run as a Virtual Machine above the physical hardware.
  • the system 1 of Fig. 1 can be implemented as programming instructions stored in local memory 504 of the computing system 800 for execution by its processor 502.
  • system 1 of Fig. 1 could be stored on the storage element 508 or be accessible from another computing system 900 through the communication interface 512.
  • top, bottom, over, under, and the like are introduced for descriptive purposes and not necessarily to denote relative positions. It is to be understood that the terms so used are interchangeable under appropriate circumstances and embodiments of the invention are capable of operating according to the present invention in other sequences, or in orientations different from the one(s) described or illustrated above.

Landscapes

  • Chemical & Material Sciences (AREA)
  • Analytical Chemistry (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Traffic Control Systems (AREA)

Claims (13)

  1. Système de fusion de données de trafic (1) adapté pour produire un état du trafic (2) pour un réseau routier, ledit système de fusion de données de trafic (1) comprenant :
    - des interfaces (100) adaptées pour recevoir des données de trafic (3) en provenance de multiples sources de données de trafic (200) ;
    - une base de données de trafic centrale (300) adaptée pour collecter lesdites données de trafic (3) en provenance de multiples sources de données de trafic (200) ;
    CARACTÉRISÉ EN CE QUE ledit système de fusion de données de trafic comprend en outre :
    - un moteur de fusion de données central (400) adapté pour exécuter une pluralité d'algorithmes de détermination d'état de trafic (10) à l'aide desdites données de trafic (3) pour générer de manière indépendante des états de trafic intermédiaires respectifs (4) pour ledit réseau routier ; et
    - un moteur d'agrégation (500) adapté pour combiner lesdits états de trafic intermédiaires (4) pour générer de la sorte ledit état de trafic (2).
  2. Système de fusion de données de trafic (1) selon la revendication 1, dans lequel ladite pluralité d'algorithmes de détermination d'état de trafic (10) comprend deux éléments ou plus parmi :
    - un filtre de Kalman, de préférence le filtre de Kalman d'ensemble ou EnKF ;
    - un filtre de Treiber-Helbing, de préférence le filtre de Treiber-Helbing généralisé étendu ou EGTF ;
    - un réseau neuronal, de préférence un réseau neuronal multi-couche de type Feed-forward (sans cycle) ;
    - un apprentissage automatique ;
    - une reconnaissance de formes ;
    - un algorithme statistique ;
    - un algorithme génétique ;
    - un procédé d'onde cinématique de Lagrange et d'Euler ;
    - un nombre cumulatif de véhicules ;
    - un procédé multicritères ;
    - une fluidification adaptive ;
    - un procédé de Kalman adaptatif ;
    - une optimisation par essaim de particules ;
    - une optimisation par colonies de fourmis ;
    - une programmation dynamique ; et
    - un recuit simulé.
  3. Système de fusion de données de trafic (1) selon la revendication 1, dans lequel ledit moteur d'agrégation (500) est adapté pour calculer une valeur moyenne desdits états de trafic intermédiaires (4) en tant que ledit état de trafic (2).
  4. Système de fusion de données de trafic (1) selon la revendication 1, dans lequel ledit moteur d'agrégation (500) est adapté pour calculer une valeur médiane desdits états de trafic intermédiaires (4) en tant que ledit état de trafic (2).
  5. Système de fusion de données de trafic (1) selon la revendication 1, dans lequel ledit moteur d'agrégation (500) est adapté pour calculer une somme pondérée desdits états de trafic intermédiaires (4) en tant que ledit état de trafic (2).
  6. Système de fusion de données de trafic (1) selon la revendication 5, dans lequel ladite somme pondérée comprend des poids (5) représentatifs de la fiabilité desdits algorithmes de détermination d'état de trafic respectifs (10).
  7. Système de fusion de données de trafic (1) selon la revendication 1, dans lequel ledit état de trafic (2) comprend un élément ou plus parmi :
    - un volume de véhicules ;
    - une classification de véhicules ;
    - une densité de véhicules ;
    - une vitesse de véhicule moyenne ; et
    - des données de trafic journalistiques.
  8. Système de fusion de données de trafic (1) selon la revendication 1, dans lequel ledit état de trafic (2) est actualisé périodiquement.
  9. Système de fusion de données de trafic (1) selon la revendication 1, dans lequel ledit état de trafic (2) est calculé pour des segments routiers d'une longueur prédéterminée.
  10. Système de fusion de données de trafic (1) selon la revendication 1, dans lequel lesdites multiples sources de données de trafic (200) comprennent deux éléments ou plus parmi :
    - un système de données de véhicule flottant ou système FCD ;
    - un système de mesure de points ;
    - un système de mesure de trajectoire ;
    - un système de données journalistiques ;
    - un système de données météo ; et
    - un système de données de gestion de trafic.
  11. Procédé de production d'un état de trafic (2) pour un réseau routier, ledit procédé comprenant les étapes de :
    - réception de données de trafic (3) en provenance de multiples sources de données de trafic (200) ;
    - la collecte desdites données de trafic (3) en provenance desdites multiples sources de données de trafic (200) ;
    CARACTÉRISÉ EN CE QUE ledit procédé comprend en outre l'étape de :
    - exécution d'une pluralité d'algorithmes de détermination d'état de trafic (10) à l'aide desdites données de trafic (3) pour générer de manière indépendante des états de trafic intermédiaires respectifs (4) pour ledit réseau routier ; et
    - la combinaison desdits états de trafic intermédiaires (4) pour générer de la sorte un état de trafic (2).
  12. Programme informatique comprenant un code logiciel adapté pour exécuter le procédé selon la revendication 11.
  13. Support de stockage lisible sur un ordinateur comprenant des instructions exécutables par un ordinateur qui, lorsqu'il est exécuté par un système informatique, exécute un procédé selon la revendication 11.
EP14199054.9A 2014-12-18 2014-12-18 Système de fusion de données de trafic et procédé associé permettant de fournir un état de trafic de réseau routier Active EP3035314B1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP14199054.9A EP3035314B1 (fr) 2014-12-18 2014-12-18 Système de fusion de données de trafic et procédé associé permettant de fournir un état de trafic de réseau routier
PCT/EP2015/075162 WO2016096226A1 (fr) 2014-12-18 2015-10-29 Système de fusion de données de trafic et procédé associé permettant de fournir un état de trafic pour un réseau routier

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP14199054.9A EP3035314B1 (fr) 2014-12-18 2014-12-18 Système de fusion de données de trafic et procédé associé permettant de fournir un état de trafic de réseau routier

Publications (2)

Publication Number Publication Date
EP3035314A1 EP3035314A1 (fr) 2016-06-22
EP3035314B1 true EP3035314B1 (fr) 2017-11-15

Family

ID=52133979

Family Applications (1)

Application Number Title Priority Date Filing Date
EP14199054.9A Active EP3035314B1 (fr) 2014-12-18 2014-12-18 Système de fusion de données de trafic et procédé associé permettant de fournir un état de trafic de réseau routier

Country Status (2)

Country Link
EP (1) EP3035314B1 (fr)
WO (1) WO2016096226A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109598939A (zh) * 2018-12-24 2019-04-09 中国科学院地理科学与资源研究所 一种基于多任务多视图学习模型的短时交通预测方法
CN111710161A (zh) * 2020-06-15 2020-09-25 北京航空航天大学 一种基于传染病模型的路网拥堵传播态势预测方法及系统

Families Citing this family (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105931480A (zh) * 2016-06-30 2016-09-07 百度在线网络技术（北京）有限公司 一种获取路况描述信息的方法和装置
US10733876B2 (en) 2017-04-05 2020-08-04 Carnegie Mellon University Deep learning methods for estimating density and/or flow of objects, and related methods and software
US10733877B2 (en) 2017-11-30 2020-08-04 Volkswagen Ag System and method for predicting and maximizing traffic flow
FR3080701B1 (fr) * 2018-04-26 2020-05-15 Transdev Group Systeme de surveillance de la circulation routiere avec affichage d'une image virtuelle d'objets mobiles evoluant dans une portion d'infrastructure routiere
CN109410576A (zh) * 2018-11-08 2019-03-01 深圳北斗应用技术研究院有限公司 多源数据融合的路况分析方法、装置、存储介质及系统
CN111435450A (zh) * 2019-01-11 2020-07-21 阿里巴巴集团控股有限公司 一种道路数据处理方法及其装置
CN110390419A (zh) * 2019-05-20 2019-10-29 重庆大学 基于pso-lssvm模型的高速公路收费站流量预测方法
CN110348615B (zh) * 2019-06-27 2023-05-16 西安工程大学 基于蚁群优化支持向量机的电缆线路故障概率预测方法
EP3839917A1 (fr) * 2019-12-18 2021-06-23 Telefónica Iot & Big Data Tech, S.A. Procédé, système et programmes informatiques d'estimation de trafic à l'aide de données de réseau passif
CN111160650B (zh) * 2019-12-31 2022-08-09 杭州电子科技大学 一种基于Adaboost算法的交通流特性分析与预测方法
CN111523706B (zh) * 2020-04-06 2022-07-08 武汉理工大学 一种基于深度学习组合模型的断面车道级短时交通流预测方法
CN111445093B (zh) * 2020-04-23 2023-04-07 长春工程学院 一种输电线路应急抢修路径优化系统及方法
CN111666274B (zh) * 2020-06-05 2023-08-25 北京妙医佳健康科技集团有限公司 数据融合方法、装置、电子设备及计算机可读存储介质
CN111859287A (zh) * 2020-06-12 2020-10-30 广东省智能制造研究所 一种多源交通信息融合方法及装置
US11915122B2 (en) 2020-07-29 2024-02-27 Micron Technology, Inc. Gateway for distributing an artificial neural network among multiple processing nodes
US11588735B2 (en) * 2020-07-29 2023-02-21 Micron Technology, Inc. Edge processing of sensor data using a neural network to reduce data traffic on a communication network
CN112927498B (zh) * 2021-01-20 2022-07-29 广州新流向电子科技有限公司 一种基于智慧交通监控的数据分析方法及装置
CN113506440B (zh) * 2021-09-08 2021-11-30 四川国蓝中天环境科技集团有限公司 一种拉格朗日坐标系下多源数据融合的交通状态估计方法
CN113570870A (zh) * 2021-09-27 2021-10-29 华砺智行(武汉)科技有限公司 分布式路口平均延误估计方法、装置、设备及存储介质
CN114463977B (zh) * 2022-02-10 2023-06-23 北京工业大学 一种基于车路协同多源数据融合交通流预测的路径规划方法
CN116776454B (zh) * 2022-03-04 2024-07-16 中国人民解放军空军航空大学 一种基于监测信息融合的航空发动机在翼可靠性评估方法
CN114664090B (zh) * 2022-04-14 2023-07-04 山东大学 基于循环神经网络的交通数据填补方法及系统
CN115457764B (zh) * 2022-08-24 2023-07-18 华南理工大学 基于车辆轨迹数据的路段交通密度估测方法、装置及介质
CN117152973B (zh) * 2023-10-27 2024-01-05 贵州宏信达高新科技有限责任公司 基于etc门架数据的高速公路实时流量监测方法及系统

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140222321A1 (en) * 2013-02-06 2014-08-07 Iteris, Inc. Traffic state estimation with integration of traffic, weather, incident, pavement condition, and roadway operations data

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5173691A (en) * 1990-07-26 1992-12-22 Farradyne Systems, Inc. Data fusion process for an in-vehicle traffic congestion information system
DE19944888A1 (de) * 1998-02-19 2000-02-10 Mannesmann Ag Verkehrslageerfassung mit Fuzzy-Klassifikation und mehrdimensionaler morphologischer Datenfilterung und dynamischer Domänenbildung
US6587781B2 (en) 2000-08-28 2003-07-01 Estimotion, Inc. Method and system for modeling and processing vehicular traffic data and information and applying thereof
US7026958B2 (en) * 2003-11-07 2006-04-11 The Boeing Company Method and system of utilizing satellites to transmit traffic congestion information to vehicles
CN1967524B (zh) * 2005-11-15 2010-07-21 日电（中国）有限公司 路况信息收集和查询系统及其方法
US8437948B1 (en) 2012-04-12 2013-05-07 Inrix, Inc. Traffic forecasting

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140222321A1 (en) * 2013-02-06 2014-08-07 Iteris, Inc. Traffic state estimation with integration of traffic, weather, incident, pavement condition, and roadway operations data

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109598939A (zh) * 2018-12-24 2019-04-09 中国科学院地理科学与资源研究所 一种基于多任务多视图学习模型的短时交通预测方法
CN109598939B (zh) * 2018-12-24 2019-08-27 中国科学院地理科学与资源研究所 一种基于多任务多视图学习模型的短时交通预测方法
CN111710161A (zh) * 2020-06-15 2020-09-25 北京航空航天大学 一种基于传染病模型的路网拥堵传播态势预测方法及系统
CN111710161B (zh) * 2020-06-15 2024-05-24 北京航空航天大学 一种基于传染病模型的路网拥堵传播态势预测方法及系统

Also Published As

Publication number Publication date
WO2016096226A1 (fr) 2016-06-23
EP3035314A1 (fr) 2016-06-22

Similar Documents

Publication Publication Date Title
EP3035314B1 (fr) Système de fusion de données de trafic et procédé associé permettant de fournir un état de trafic de réseau routier
US11403526B2 (en) Decision making for autonomous vehicle motion control
Cheng et al. Research on travel time prediction model of freeway based on gradient boosting decision tree
Yao et al. Short‐term traffic speed prediction for an urban corridor
Jin et al. A group-based traffic signal control with adaptive learning ability
US20210101619A1 (en) Safe and scalable model for culturally sensitive driving by automated vehicles
Gazis et al. Nonlinear follow-the-leader models of traffic flow
Sadeghi-Niaraki et al. Short-term traffic flow prediction using the modified elman recurrent neural network optimized through a genetic algorithm
Wang et al. Car-following models for human-driven vehicles and autonomous vehicles: A systematic review
Jabamony et al. IoT Based Bus Arrival Time Prediction Using Artificial Neural Network (ANN) for Smart Public Transport System (SPTS).
KR20220136006A (ko) 자율 주행 차량의 성능을 평가하기 위한 테스트 시나리오의 선택
CN115311860B (zh) 一种交通流量预测模型的在线联邦学习方法
Almukhalfi et al. Traffic management approaches using machine learning and deep learning techniques: A survey
Shamsi et al. Reinforcement learning for traffic light control with emphasis on emergency vehicles
Lee et al. Development of reinforcement learning-based traffic predictive route guidance algorithm under uncertain traffic environment
Zipfl et al. Relation-based motion prediction using traffic scene graphs
Shabab et al. Deep reinforcement learning-based short-term traffic signal optimizing using disaggregated vehicle data
Choi et al. Real-time prediction of arterial vehicle trajectories: An application to predictive route guidance for an emergency vehicle
Li et al. An Overview and General Framework for Spatiotemporal Modeling and Applications in Transportation and Public Health
Morris et al. Traffic congestion classification using data mining techniques
US20240242600A1 (en) Infrastructure Sensor Processing
Petrou AI-Driven Systems for Autonomous Vehicle Traffic Flow Optimization and Control
Shabestary Deep Reinforcement Learning Approach to Multimodal Adaptive Traffic Signal Control
Bowman Modeling Traffic Flow With Microscopic Discrete Event Simulation
Muresan Deep Reinforcement Learning Models for Real-Time Traffic Signal Optimization with Big Traffic Data

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

17P Request for examination filed

Effective date: 20160811

RBV Designated contracting states (corrected)

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: BE-MOBLIE TECH NV

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20161221

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20170823

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

Ref country code: GB

Ref legal event code: FG4D

Ref country code: AT

Ref legal event code: REF

Ref document number: 946978

Country of ref document: AT

Kind code of ref document: T

Effective date: 20171115

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602014017169

Country of ref document: DE

REG Reference to a national code

Ref country code: NL

Ref legal event code: FP

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 946978

Country of ref document: AT

Kind code of ref document: T

Effective date: 20171115

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180215

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180216

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180215

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602014017169

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20171218

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20180831

26N No opposition filed

Effective date: 20180817

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20180115

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20171218

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20180703

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20171231

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20171231

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20141218

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20181218

REG Reference to a national code

Ref country code: NL

Ref legal event code: PD

Owner name: BE-MOBILE NV; BE

Free format text: DETAILS ASSIGNMENT: CHANGE OF OWNER(S), MERGE; FORMER OWNER NAME: BE-MOBILE TECH NV

Effective date: 20191004

REG Reference to a national code

Ref country code: LU

Ref legal event code: HC

Owner name: BE-MOBILE NV; BE

Free format text: FORMER OWNER: BE-MOBILE

Effective date: 20191007

Ref country code: LU

Ref legal event code: PD

Owner name: BE-MOBILE; BE

Free format text: FORMER OWNER: BE-MOBILE TECH NV

Effective date: 20191007

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

REG Reference to a national code

Ref country code: BE

Ref legal event code: PD

Owner name: BE-MOBILE NV; BE

Free format text: DETAILS ASSIGNMENT: CHANGE OF OWNER(S), FUSION; FORMER OWNER NAME: BE-MOBILE TECH NV

Effective date: 20191112

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20181218

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171115

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180315

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 20231215

Year of fee payment: 10

Ref country code: LU

Payment date: 20231215

Year of fee payment: 10

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: BE

Payment date: 20231127

Year of fee payment: 10