EP3991161A1 - Method for controlling a traffic system, device, computer program, and computer-readable storage medium - Google Patents
Method for controlling a traffic system, device, computer program, and computer-readable storage mediumInfo
- Publication number
- EP3991161A1 EP3991161A1 EP20797740.6A EP20797740A EP3991161A1 EP 3991161 A1 EP3991161 A1 EP 3991161A1 EP 20797740 A EP20797740 A EP 20797740A EP 3991161 A1 EP3991161 A1 EP 3991161A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- traffic
- intersections
- switching times
- light systems
- road section
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/07—Controlling traffic signals
- G08G1/081—Plural intersections under common control
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0108—Measuring and analyzing of parameters relative to traffic conditions based on the source of data
- G08G1/0116—Measuring and analyzing of parameters relative to traffic conditions based on the source of data from roadside infrastructure, e.g. beacons
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0125—Traffic data processing
- G08G1/0129—Traffic data processing for creating historical data or processing based on historical data
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0125—Traffic data processing
- G08G1/0133—Traffic data processing for classifying traffic situation
-
- 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/0137—Measuring and analyzing of parameters relative to traffic conditions for specific applications
- G08G1/0145—Measuring and analyzing of parameters relative to traffic conditions for specific applications for active traffic flow control
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/07—Controlling traffic signals
Definitions
- the present invention relates to a method for controlling a traffic system with a plurality of intersections with switchable traffic lights and road sections lying between the intersections.
- the invention also relates to a corresponding device, a computer program and a computer-readable storage medium.
- Traffic on roads is increasing worldwide, especially in cities and metropolitan areas. Traffic jams, congested streets and creeping traffic are not only a significant loss of time for road users, but also increasingly contribute to air pollution and health problems for residents of the congested streets. The longer a vehicle is stuck in traffic, the more exhaust gases are released into the environment. Consequently, it would be desirable to avoid congested roads and traffic jams as much as possible.
- the object of the present invention is to describe a method, a device, a computer program and a computer-readable storage medium which solve or reduce the above-mentioned problem.
- the object is achieved by the features of the independent patent claims.
- Advantageous refinements are characterized in the subclaims.
- a method for controlling a traffic system with a plurality of intersections with switchable traffic lights and road sections between the intersections comprises the following steps:
- Quantum concept processor optimized switching times for the traffic light systems of the intersections adjacent to the relevant road sections, the optimized switching times being determined in such a way that the global stress function assumes the smallest value that can be found, and switching of the traffic light systems adjacent to the relevant road sections according to a switching model based on the optimized Switching times based.
- the switching times for a large number of traffic light systems are simultaneously modulated in such a way that the global traffic system Stress function is as low as possible.
- the determination of the optimized switching times can be determined particularly quickly, so that a quick reaction to increased traffic volume is possible, and thus congestion and slow traffic are avoided or at least reduced.
- vehicle densities in the relevant road sections are considered here.
- traffic stress and stress functions describe variables that are, for example, a measure of the congestion of a road section.
- the stress function is calculated using a difference between currently available vehicles on a road section and a maximum number of vehicles that can be tolerated stress-free for the road section.
- values that are a measure of environmental pollution, such as exhaust gas values can also be used to determine the stress function.
- the global stress function can be determined from the sum of all specific local stress functions.
- a quantum concept processor is a processor based on quantum algorithms for the accelerated implementation of optimization tasks. For example, this is a processor that is set up to do this is to solve an optimization problem using quantum annealing simulation.
- a processor can, for example, be based on conventional hardware technology, for example complementary metal-oxide-semiconductor (CMOS) technology.
- CMOS complementary metal-oxide-semiconductor
- An example of such a quantum concept processor is the "Digital Annealer" from the company "FUJITSU".
- any other quantum processors can also be used for the method described here, in the future also those based on real quantum bit technologies.
- a quantum concept processor is a processor that uses the concept of minimizing a QUBO (Quadratic Unconstrained Binary Optimization) function realized either on a special processor in classic technology or on a quantum annealer.
- QUBO Quadrattic Unconstrained Binary Optimization
- the switching times for the traffic light systems are, for example, determined here between the red and green phases of the respective traffic light systems.
- the smallest value of the global stress function that can be found is either a local or an absolute minimum of a corresponding stress function.
- the relevant road sections can also be only a part of the road sections of the traffic system, in particular if only a control of special traffic light systems is interesting or possible.
- the traffic light systems are, for example, visual light signal systems with corresponding color signals (red / green) signal to a driver of a vehicle whether he has to stop at an associated intersection or whether he can pass it.
- the traffic light systems can also be other traffic light systems that are used to control a traffic flow.
- it can be special traffic light systems that regulate a flow of traffic, for example with non-visual signals, in particular when predominantly or exclusively autonomous vehicles are used in the traffic system.
- the switching model can, for example, be based directly on the specific switching times, i.e. each traffic light system is switched immediately according to the switching times that have been determined as optimized switching times.
- a switching model that is based on these switching times, but also takes into account other functions, such as offsets of individual switching times or the like.
- the global stress function is defined as a term for a quadratic optimization, in particular as a quadratic Unconstrained Binary Optimization (QUBO) term.
- QUBO Quadratic Unconstrained Binary Optimization
- the determination of the local stress function is additionally carried out based on selection values of various possible green phases for traffic light systems adjacent to the respective relevant road section.
- Different possible green phases for the traffic light systems each describe the red-to-green ratio of the respective traffic light systems.
- Various possible green phases can accordingly be, for example: 40% green to 60% red; 50% green to 50% red; 70% green to 30% red - as well as any other division of the red and green times to one another.
- Adjacent traffic light systems are the traffic light systems located directly on the relevant road section, but can also include all traffic light systems that exist at the intersections adjacent to the relevant road section.
- the method further comprises the step:
- the traffic system can also be controlled via the traffic system based on empirical values. For example, more precise local stress functions can be determined in this way.
- the historical data is used to define a maximum traffic flow at each intersection, or to determine a value for each switching period that corresponds to the number of vehicles choosing a particular route.
- the historical data can be used to determine the traffic load for each switching period more precisely, or to concretize boundary conditions of the traffic system, for example how many vehicles appear on each road section located at the edge per switching period.
- Periodic boundary conditions can be selected for such boundary conditions, ie it is assumed that the same number of vehicles leave the traffic system as new ones appear in the traffic system.
- the determination of the local stress functions, the determination of the global stress function, the determination of the optimized switching times, and the switching of the traffic light systems are repeated periodically and the optimized switching times are always determined for the next switching period.
- the acquisition of the traffic load is also repeated periodically as an alternative or in addition.
- switching times can be determined and thus it is possible to react to changes in the traffic system. For example, these values are redetermined every 90 seconds. Alternatively, shorter or longer time intervals can also be selected, for example adapted to traffic times - such as, for example, rush hour traffic or holiday and public holiday traffic.
- a device for controlling a traffic system with a plurality of intersections with switchable traffic lights and road sections located between the intersections comprises: at least one sensor that is set up to detect traffic loads of several relevant road sections, a computing unit that is set up to generate a local Stress function for each relevant road section depending on the recorded traffic loads of the to determine the relevant relevant road section and a global stress function for the entire traffic system based on the local stress functions, a quantum concept processor which is set up to determine optimized switching times for the traffic lights at the intersections adjacent to the relevant road sections, the optimized switching times being determined in such a way that the global stress function assumes a smallest value that can be found, and a switching device which is set up to switch the traffic light systems in accordance with a switching model, the switching model being based on the optimized switching times.
- Suitable sensors are, for example, sensors that are set up to record the traffic load on the relevant road sections continuously and in real time.
- the computing unit is also set up to determine the local stress function for each relevant road section additionally as a function of the traffic load of the relevant relevant road section predicted for different switching times.
- the invention is characterized by a computer program, the computer program comprising instructions which, when the program is executed by a computer arrangement, cause the computer arrangement to carry out the method according to the first aspect.
- the invention is characterized by a computer-readable storage medium comprising a computer program according to the third aspect.
- Figure 1 is a schematic representation of a traffic system
- FIG. 2 shows a flow diagram of a method for controlling the traffic system according to FIG. 1, and
- FIG. 3 shows a schematic representation of a device for controlling the traffic system according to FIG. 1.
- FIG. 1 shows a schematic representation of a traffic system 1.
- the traffic system 1 is shown in a greatly simplified manner in order to simplify the description of the invention disclosed here. However, this greatly simplified representation is not intended to represent a limitation of the invention.
- the traffic system 1 comprises several streets 2.
- the streets 2 run both in an east-west direction and in a north-south direction. Every meeting of two streets 2 represents an intersection 3.
- the intersections 3 are numbered for the purpose of mathematical description, "n” denotes the intersections 3 in the west-east direction, "m” the intersections 3 in the south-north direction.
- the west-east direction corresponds to the x-direction of the coordinate system shown in FIG.
- the south-north direction corresponds to the y-direction of the coordinate system
- "n" runs from 0 to N - 1, where N represents the total number of streets 2 running in south-north direction y
- "m” runs from 0 to M - 1, where M represents the total number of streets 2 running in west-east direction x.
- the roads 2 are formed by road sections 4 between the intersections 3. At each intersection 3, four incoming road sections 4 arrive and four outgoing road sections 4 exit.
- the incoming and outgoing road sections 4 are numbered according to their orientation:
- the road sections 4 can now each be described as an incoming or outgoing road section 4 of an intersection 3 or as an outgoing or incoming road section 4 of a correspondingly adjacent intersection 3.
- “ModN” and “modM” are used here to denote periodic boundary conditions.
- the outgoing road sections 4 are each used below.
- an equivalent consideration of the incoming road sections 4 would of course also be possible.
- a switchable traffic light system 5 which communicates with road users by means of light signals, is located at each intersection 3 in the exemplary embodiment shown.
- a traffic load l n , m , d (t) denotes a number of vehicles 6 on an outgoing road section 4 “from n , m , d ” at a point in time t.
- a global stress function S which supplies a value for an overload of the traffic system 1, is the sum of local stress functions f of the individual road sections 4.
- the global stress function S can be defined as: Here, l n, m, d (t) is the traffic load and f n , m , d are the local stress functions of the road sections 4, the position of which is characterized by the indices n and m, and the direction of which is characterized by the index d.
- the dependency of the respective local stress function is chosen here to simplify the representation.
- the method can take into account several different parameters that can be assigned to the respective roads, for example the currently drivable speed and / or the current CO 2 emissions, in order to determine a stress function.
- the local stress functions f are defined as:
- V R is a constant that corresponds to a maximum number of vehicles 6 that can be on a specific road section 4 without excessive traffic on the respective road section 4, which could lead to traffic jams or slow-moving traffic.
- V R is the maximum number of vehicles 6 that can be located on a specific road section 4 without stress.
- the A constant V R is assumed for all road sections 4 shown in the exemplary embodiment shown.
- the local stress functions f can be designed as complex as required and can be set up for the traffic system 1 depending on the needs and requirements of a desired traffic optimization (e.g. reduction of traffic jams, reduction of exhaust gas concentrations, etc.). In addition to traffic load, the stress function can also depend on many other influencing variables, such as traffic throughput, exhaust gas emissions, noise development, etc.
- the local stress functions f can be adapted to real conditions in a real traffic system, for example by using road-specific threshold values and progressive functions.
- the definition used here for the local stress functions f supplies a value 0 as long as the number of vehicles 6 on the road section 4 is below the constant V R. If the number of vehicles 6 on the road section 4 is above the constant V R , the local stress increases as the number of vehicles 6 increases.
- the global stress function is then defined as:
- a portion of a green phase ⁇ n, m in a cycle time T P of a special traffic light system 5 is modeled, for example, in R steps r, in this case r is a natural number from 0 to Rl, where R is the total number of steps r.
- the cycle time T P of a traffic light system 5 is, for example, the time, in seconds, from the start of a red phase to the start of the next red phase of the traffic light system 5.
- a fixed cycle time T P is assumed, which is also used for the purpose of a simple Description, for all traffic lights 5 is clocked together.
- the cycle time T P can also vary for the individual traffic light systems 5 or can additionally be optimized using the method shown here.
- the cycle time T P could also be taken into account via the local stress functions f n, m, d.
- T P Proportion of the cycle time T P for which the traffic light system 5 of a certain intersection 3 in the west-east direction x is switched to green.
- T c is a so-called clearance time, which specifies in seconds how much time elapses between switching over the traffic light system 5 and clearing the associated intersection 3.
- T T is a traffic time that indicates the time in seconds during which vehicles 3 actually drive Junction 3 can pass.
- a traffic flow F indicates how many vehicles 6 can pass an intersection 3 in a direction d during a green phase per second.
- the traffic load 1 of a special road section 4 in west-east direction x for a next point in time t + 1 then results from the current traffic load 1 on this road section 4 at time t, that is to say at the next round trip time T P plus incoming traffic from an adjacent road section 4, and minus an outgoing traffic to another neighboring road section 4:
- the incoming and outgoing traffic is defined here as a minimum function, whereby either the total incoming or outgoing traffic load 1 is taken into account if this is less than the maximum possible incoming or outgoing traffic via the respective traffic light system 5, or otherwise the maximum possible incoming or outgoing traffic outbound traffic.
- the traffic load 1 and consequently the local stress function f of a road section 4 thus depends on which values for the green phase ⁇ nm of an intersection n, m adjacent to the road section 4 and which values for the green phase ⁇ (n + 1) modN, m a adjacent intersection n + 1, m adjacent to the road section 4 can be selected. If r c is the value for r of a green phase A nm with respect to a central intersection and r 0 is the value for r one
- the local stress function for an outgoing road section 4 from the intersection 3 with the indices "n, m" in direction d at time t + 1 is then:
- the local stress functions f shown here are based, for the purpose of an easily understandable description, on relatively simple assumptions with regard to the traffic system 1.
- the local stress functions f can be expanded as desired and represented as complex as desired, in particular to improve adaptation to real traffic systems.
- historical data for example, can also be taken into account for the local stress functions f, which are collected, for example, via statistical evaluations with regard to the traffic system 1 or by means of artificial intelligence methods.
- a constant adaptation of the local stress functions f for example based on such historical data at runtime, is also possible.
- FIG. 2 shows a flow chart of a method 100 for controlling the traffic system 1 according to FIG. 1.
- traffic loads 1 of road sections 4 are recorded.
- traffic loads are recorded for all road sections 4 of the traffic system 1.
- only traffic loads of relevant road sections 4, ie those road sections 4 for which an optimization of the traffic system 1 is to be carried out, can also be recorded or taken into account.
- the traffic loads 1 are recorded for example by means of road sensors, floating phone data (FPD) or floating car data (FCD). Additionally or alternatively, historical data of the traffic system 1, ie empirical values from previous measurements or other values available with regard to the traffic of the traffic system, can also be used to record the traffic loads 1.
- a local stress function f is determined for each road section 4 as a function of the recorded traffic loads 1 of the respective road section 4.
- current switching times of traffic light systems 5 at intersections 3 adjacent to this road section 4 can also be taken into account. In other words, it can be taken into account how many vehicles 6 will enter the road section 4 under consideration in a next switching cycle and how many vehicles 6 will leave it.
- a global stress function S is created for the entire traffic system 1 based on the local stress functions + 1) for all possible proportions of the
- the global stress function S is a measure of a congestion or overloading of the traffic system 1.
- a congestion of fewer road sections 4 provides a higher overall global stress value than a distribution of vehicles 6 with the maximum possible stress-free number of vehicles 6 in the road sections 4 of the transport system 1 does not are exceeded, even if, in the second case, a total of more vehicles 6 are traveling in the traffic system 1.
- a fourth step 104 using a quantum concept processor, optimized switching times, that is to say optimized lengths of green phases 1 for the traffic lights 5 of the intersections 3, are determined. This is done by minimizing the function H, which in part Hi represents the global stress under the respective decision for the green portions at all traffic lights in the network.
- the optimized switching times are determined in such a way that the global stress function S assumes a smallest value that can be found. In other words: an optimization problem for the global stress function S is solved, the solution of the optimization problem taking into account the traffic system 1 in its entirety and not merely regulating switching times for traffic lights 5 of individual intersections 3 independently of one another.
- optimized switching times for all (or all relevant) traffic light systems 5 are determined simultaneously, and the best possible system state for the entire traffic system 1, i.e. a system state with the lowest possible global stress, is thus determined.
- a fifth step 105 the traffic light systems 5 are switched according to a switching model which is based on the optimized switching times.
- the switching model can, for example, be based directly on the optimized switching times, i.e. each traffic light system 5 is switched immediately according to the optimized switching times.
- offsets, intermediate states such as yellow phases
- additional traffic flows such as crossing trams or turning lanes, or the like.
- the method 100 shown here is carried out periodically, for example, parallel to ongoing operation of the traffic system 1. In this way, switching times for the traffic light systems 5 that are always adapted to the current volume of traffic can be determined. For example, the method 100 is carried out after a certain time has elapsed, for example every 90 seconds, or at each cycle time T P for a subsequent cycle time.
- This cycle time T P can be predetermined for all traffic light systems 5, or there can be individual cycle times T P for different traffic light systems 5. Alternatively or additionally, the method 100 can also be carried out dynamically, for example as a function of a traffic volume or a global stress value in the traffic system 1.
- the cycle time T P can also, in addition or as an alternative to the green phases I, be optimized. In this case, bits for the cycle times T P for each relevant intersection 3 must be added to the functions to be optimized, or the bits described above must be replaced with these.
- the cycle times T P can also be taken into account for the local stress functions f and thus, in particular, are included in the future local stress f (t + l).
- circuit phases ie offsets between cycle times T P of different traffic light systems 5, can be optimized in addition or as an alternative to green phases 1 and cycle times T P.
- bits for the circuit phases for each relevant intersection 3 must be added to the functions to be optimized, or the bits described above must be replaced with these.
- the circuit phases can also be taken into account for the local stress functions f and thus, in particular, are included in the future local stress f (t + l).
- FIG. 3 shows a schematic representation of a device 7 for controlling the traffic system 1 according to FIG. 1.
- the device 7 comprises sensors 8 with which traffic loads 1 of the road sections 5 can be detected.
- the sensors 8 are, for example, road sensors, sensors for collecting floating phone data (FPD) or sensors for collecting floating car data (FCD).
- the device 7 further comprises a computing unit 9 with which the local stress functions f for each road section 4 as a function of the recorded traffic loads 1 des respective road section 4 can be determined. Furthermore, the computing unit 9 can determine a global stress function S for the entire traffic system 1 based on the local stress functions f.
- a conventional computer is used as the arithmetic unit 9, for example.
- the computing unit 9 is connected to a network 10, for example the Internet.
- the device 7 further comprises a
- Quantum concept processor 11 which is set up to determine optimized switching times for the traffic light systems 5, the optimized switching times being determined in such a way that the global stress function S assumes a smallest value that can be found.
- a processor is used as the quantum concept processor 11, for example, which is set up to solve an optimization problem by means of quantum annealing simulation.
- a quantum concept processor 11 can, for example, be based on conventional technology, for example complementary metal-oxide-semiconductor (CMOS) technology.
- CMOS complementary metal-oxide-semiconductor
- any other can be used for the device 7
- Quantum concept processors 11 in the future also those based on real quantum bit technologies, will be used.
- the quantum concept processor 11 is also connected to the network 10.
- the computing unit 9 is set up to send the global stress function S to the quantum concept processor 11 via the network 10.
- the quantum concept processor 11 then sends the determined optimized switching times back to the computing unit 9 via the network 10.
- the device 7 also includes a switching device 12 which is set up to switch the traffic light systems 5 in accordance with a switching model, the switching model being based on the optimized switching times.
- the switching device 12 is connected here to the computing unit 9, so that the computing unit controls the switching device 12 based on the optimized switching times.
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Chemical & Material Sciences (AREA)
- Analytical Chemistry (AREA)
- Traffic Control Systems (AREA)
Abstract
Description
Claims
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE102019129943 | 2019-11-06 | ||
DE102020116669.9A DE102020116669A1 (en) | 2019-11-06 | 2020-06-24 | Method for controlling a traffic system, device, computer program and computer-readable storage medium |
PCT/EP2020/080144 WO2021089367A1 (en) | 2019-11-06 | 2020-10-27 | Method for controlling a traffic system, device, computer program, and computer-readable storage medium |
Publications (1)
Publication Number | Publication Date |
---|---|
EP3991161A1 true EP3991161A1 (en) | 2022-05-04 |
Family
ID=75485411
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP20797740.6A Pending EP3991161A1 (en) | 2019-11-06 | 2020-10-27 | Method for controlling a traffic system, device, computer program, and computer-readable storage medium |
Country Status (5)
Country | Link |
---|---|
US (1) | US11948456B2 (en) |
EP (1) | EP3991161A1 (en) |
JP (1) | JP7394219B2 (en) |
DE (1) | DE102020116669A1 (en) |
WO (1) | WO2021089367A1 (en) |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5357436A (en) * | 1992-10-21 | 1994-10-18 | Rockwell International Corporation | Fuzzy logic traffic signal control system |
JP3380882B2 (en) | 1994-12-19 | 2003-02-24 | 株式会社日立製作所 | Traffic signal control method and control device |
JP3729937B2 (en) | 1996-06-05 | 2005-12-21 | 松下電器産業株式会社 | Traffic control device and control method |
US6539300B2 (en) * | 2001-07-10 | 2003-03-25 | Makor Issues And Rights Ltd. | Method for regional system wide optimal signal timing for traffic control based on wireless phone networks |
JP2003132490A (en) | 2001-10-23 | 2003-05-09 | Mitsubishi Heavy Ind Ltd | Autonomous distributed signal control system, signal control method and program for signal control |
DE102005023742B4 (en) * | 2005-05-17 | 2010-08-05 | Eidgenössische Technische Hochschule (ETH) | A method of coordinating networked check-in processes or controlling the transport of mobile units within a network |
US20070273552A1 (en) * | 2006-05-24 | 2007-11-29 | Bellsouth Intellectual Property Corporation | Control of traffic flow by sensing traffic states |
US9633560B1 (en) * | 2016-03-30 | 2017-04-25 | Jason Hao Gao | Traffic prediction and control system for vehicle traffic flows at traffic intersections |
CN110494902A (en) * | 2017-02-03 | 2019-11-22 | 西门子交通有限责任公司 | For managing the system, apparatus and method of the traffic in geographical location |
WO2018224872A1 (en) | 2017-06-09 | 2018-12-13 | Prannoy Roy | Predictive traffic management system |
US10733877B2 (en) * | 2017-11-30 | 2020-08-04 | Volkswagen Ag | System and method for predicting and maximizing traffic flow |
AU2018282318B2 (en) * | 2018-07-25 | 2021-02-04 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for controlling traffic lights |
-
2020
- 2020-06-24 DE DE102020116669.9A patent/DE102020116669A1/en active Pending
- 2020-10-27 EP EP20797740.6A patent/EP3991161A1/en active Pending
- 2020-10-27 WO PCT/EP2020/080144 patent/WO2021089367A1/en unknown
- 2020-10-27 US US17/638,323 patent/US11948456B2/en active Active
- 2020-10-27 JP JP2022526298A patent/JP7394219B2/en active Active
Also Published As
Publication number | Publication date |
---|---|
JP7394219B2 (en) | 2023-12-07 |
US20220301426A1 (en) | 2022-09-22 |
JP2023500351A (en) | 2023-01-05 |
DE102020116669A1 (en) | 2021-05-06 |
WO2021089367A1 (en) | 2021-05-14 |
US11948456B2 (en) | 2024-04-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1212738B1 (en) | Method for monitoring the condition of traffic for a traffic network comprising effective narrow points | |
EP1298620B1 (en) | Controlsystem for lightsignal devices at intersections | |
DE10022812A1 (en) | Method for determining the traffic situation on the basis of reporting vehicle data for a traffic network with traffic-regulated network nodes | |
EP0884708B1 (en) | Method and device for traffic condition prognosis | |
DE10057796B4 (en) | Method for vehicle-specific traffic condition forecasting | |
DE10062856B4 (en) | Method for vehicle-specific traffic forecast | |
DE102011005844A1 (en) | Method for automatic controlling of vehicle, involves processing transverse movement of vehicle by decision tree and processing longitudinal movement of vehicle by another decision tree | |
DE102019214931A1 (en) | Control of a vehicle | |
EP2161698B1 (en) | Method for coordinating light signal-controlled nodes in a street network | |
EP3723062A1 (en) | Method and device for the computer-implemented routing of motor vehicles in a predetermined area | |
EP3991161A1 (en) | Method for controlling a traffic system, device, computer program, and computer-readable storage medium | |
WO2021165113A1 (en) | Method for training at least one algorithm for a control device of a motor vehicle, method for optimising traffic flow in a region, computer program product, and motor vehicle | |
DE102018208150A1 (en) | Method and system for ensuring a real-time capability of a driver assistance system | |
DE102010048675A1 (en) | Method for prognosticating phase transitions into traffic jam phases on traffic route system traveled by vehicles, involves determining phase zone of traffic jam phases depending on number of phase transition parameters | |
WO1997009218A2 (en) | Transport means control process | |
EP2418632B1 (en) | Method for regulating a signalling assembly | |
EP2413302B1 (en) | Method for traffic management of a tramway | |
DE10131526B4 (en) | Method and device for controlling an assistance system for a vehicle | |
DE102019213562A1 (en) | Method for calculating a function for a vehicle | |
DE102009047409A1 (en) | Method for determining route between starting point and destination of vehicle, involves determining route course between starting point and destination from segments of database under consideration of segment driving times | |
DE19510343A1 (en) | Process for sequential feedforward control of a process | |
EP3866135B1 (en) | Method for controlling a light signal system | |
DE102022126944A1 (en) | Method for determining an optimal motion state of an object along a trajectory with regard to time and energy consumption | |
DE102022126945A1 (en) | Method for determining an optimal motion state of an object along a trajectory with regard to time and energy consumption | |
DE102017207538A1 (en) | Driver assistance system and method for assisting a driver of a rail vehicle |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: UNKNOWN |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE |
|
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 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE |
|
17P | Request for examination filed |
Effective date: 20220131 |
|
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 |
|
DAV | Request for validation of the european patent (deleted) | ||
DAX | Request for extension of the european patent (deleted) | ||
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: FUJITSU TECHNOLOGY SOLUTIONS GMBH |