CN114706937A - Intelligent traffic path generation method, electronic device, and storage medium - Google Patents
Intelligent traffic path generation method, electronic device, and storage medium Download PDFInfo
- Publication number
- CN114706937A CN114706937A CN202210632051.0A CN202210632051A CN114706937A CN 114706937 A CN114706937 A CN 114706937A CN 202210632051 A CN202210632051 A CN 202210632051A CN 114706937 A CN114706937 A CN 114706937A
- Authority
- CN
- China
- Prior art keywords
- traveler
- phase
- time
- arrival
- traffic path
- 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
- 238000000034 method Methods 0.000 title claims abstract description 48
- 230000006870 function Effects 0.000 claims description 11
- 238000004364 calculation method Methods 0.000 claims description 8
- 238000004590 computer program Methods 0.000 claims description 8
- 230000006698 induction Effects 0.000 claims description 5
- 239000000126 substance Substances 0.000 claims 1
- 238000004891 communication Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 7
- 238000006243 chemical reaction Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 description 1
- 229910006119 NiIn Inorganic materials 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02A—TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE
- Y02A30/00—Adapting or protecting infrastructure or their operation
- Y02A30/60—Planning or developing urban green infrastructure
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Traffic Control Systems (AREA)
Abstract
The application relates to the technical field of vehicle-mounted supplies, and provides an intelligent traffic path generation method, electronic equipment and a storage medium, wherein the method comprises the following steps: acquiring starting point coordinate information and destination coordinate information of a traveler and a departure time of the traveler; acquiring signal periods of all signalized intersections between the starting point coordinate information and the destination coordinate information and road section information between any two adjacent signalized intersections; determining an arrival phase of a pedestrian at the signalized intersection based on the departure time, the signal period of the signalized intersection and the road section information; determining the waiting time of a traveler at a signalized intersection based on a phase interval where an arrival phase is located, wherein a signal cycle comprises a passing phase interval and a non-passing phase interval; a traffic path is determined based on the wait period. The method and the device can provide an accurate travel time range according to the departure time of the traveler, generate the shortest reliable path for the user, and avoid the user from arriving late.
Description
Technical Field
The present disclosure relates to the field of vehicle-mounted devices, and in particular, to an intelligent traffic path generation method, an electronic device, and a storage medium.
Background
As the level of urbanization increases and motor vehicle reserves continue to grow, urban traffic systems become increasingly complex. For travelers, the urban traffic network has great random characteristics and time-varying characteristics, and how to select a quick and reliable travel path can help the travelers to quickly realize the purpose of travel, shorten the time for the travelers to occupy road resources, and increase the traffic efficiency of a road network.
In the prior art, the generation method for the shortest reliable path problem is assumed to be on a determined road network, however, in an urban road network, the road conditions and the travel demand have random variability, which results in high randomness of the travel time of travelers. Meanwhile, in actual life, the waiting time at the traffic light needs to be considered, so that a traveler cannot clearly reach the accurate time range of the destination.
Therefore, how to provide accurate travel time range for travelers and avoid the technical problem of late arrival is urgently needed to be solved.
Disclosure of Invention
The application provides an intelligent traffic path generation method, electronic equipment and a storage medium, which are used for at least solving the technical problems of providing an accurate travel time range for travelers and avoiding late arrival in the related art.
According to an aspect of an embodiment of the present application, there is provided an intelligent traffic path generation method, including: acquiring starting point coordinate information and destination coordinate information of a traveler and a departure time of the traveler; acquiring signal periods of all signalized intersections between the starting point coordinate information and the destination coordinate information and road section information between any two adjacent signalized intersections; determining an arrival phase of a pedestrian at the signalized intersection based on the departure time, the signal period of the signalized intersection and the road section information; determining the waiting time of a traveler at a signalized intersection based on a phase interval where an arrival phase is located, wherein a signal cycle comprises a passing phase interval and a non-passing phase interval; a traffic path is determined based on the wait period.
Optionally, the waiting duration is determined by a waiting time function based on a phase interval in which the arrival phase is located.
Optionally, when the arrival phase is included in the passing phase interval, the traveler passes directly.
Optionally, when the arrival phase is before the passing phase interval, determining a first waiting time period when the traveler arrives at the signalized intersection based on the waiting time periods of all phases between the arrival phase and the passing phase interval.
Optionally, when the arrival phase is after the passing phase interval, determining a second waiting time period when the traveler arrives at the signalized intersection based on a waiting time period from the arrival phase to a final phase of a signal cycle in which the arrival phase is located and a waiting time period from an initial phase of an adjacent next signal cycle to the passing phase interval.
Optionally, the determining a traffic path based on the waiting duration comprises: acquiring random time-varying characteristics of a traffic network; converting the random time-varying features into deterministic time-varying models based on a first class of mathematical induction; determining a transit time calculation model for the traffic path based on the wait time and the deterministic time-varying model.
Optionally, a deterministic time range for the traveler to reach the destination is provided based on the departure time and the transit time calculation model.
Optionally, the determining a traffic path based on the waiting duration comprises: and calculating arrival time of all next signalized intersections towards the destination position based on the arrival phase of the traveler at the signalized intersection, the passing phase and the road section information corresponding to the passing phase, and determining a traffic road section of the next arrival target signalized intersection based on the arrival time.
According to yet another aspect of embodiments herein, there is also provided an electronic device comprising at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to enable the at least one processor to perform the method steps of any of the above embodiments.
According to yet another aspect of the embodiments of the present application, there is further provided a storage medium storing a computer program, which when executed by a processor implements the method steps in any of the above embodiments.
In the embodiment of the application, the waiting time of the travelers at the signalized intersection can be calculated by analyzing the arrival phase of the travelers when the travelers arrive at the signalized intersection, all traffic paths capable of reaching the destination are determined by means of the existing navigation technology, the accurate time range of reaching the destination is provided for the travelers according to the waiting time, the shortest reliable path is generated for the user, and the user is prevented from arriving late.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention.
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
FIG. 1 is a schematic diagram of a hardware environment for an alternative intelligent traffic path generation method according to an embodiment of the present application;
FIG. 2 is a schematic flow chart diagram of an alternative intelligent traffic path generation method according to an embodiment of the present application;
FIG. 3 is an image of a function of the wait time period for an optional traffic light according to an embodiment of the present application;
FIG. 4 is a block diagram of an alternative intelligent traffic path generation apparatus according to an embodiment of the present application;
fig. 5 is a block diagram of an alternative electronic device according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
According to one aspect of the embodiments of the present application, an intelligent traffic path generation method is provided. Alternatively, in the present embodiment, the intelligent traffic path generating method may be applied to a hardware environment formed by the terminal 102 and the server 104 as shown in fig. 1. As shown in fig. 1, the server 104 is connected to the terminal 102 through a network, which may be used to provide services for the terminal or a client installed on the terminal, may be provided with a database on the server or independent from the server, may be used to provide data storage services for the server 104, and may also be used to handle cloud services, and the network includes but is not limited to: the terminal 102 is not limited to a PC, a mobile phone, a tablet computer, etc. the terminal may be a wide area network, a metropolitan area network, or a local area network. The intelligent traffic path generation method according to the embodiment of the present application may be executed by the server 104, the terminal 102, or both the server 104 and the terminal 102. The terminal 102 may execute the intelligent traffic path generating method according to the embodiment of the present application, or may execute the intelligent traffic path generating method by a client installed thereon.
Taking the terminal 102 and/or the server 104 to execute the intelligent traffic path generating method in this embodiment as an example, fig. 2 is a schematic flow chart of an optional intelligent traffic path generating method according to this embodiment, and as shown in fig. 2, the flow of the method may include the following steps:
step S10, acquiring the starting point coordinate information and the destination coordinate information of the traveler and the departure time of the traveler;
step S20, acquiring signal periods of all signalized intersections between the starting point coordinate information and the destination point coordinate information and road section information between any two adjacent signalized intersections;
step S30, determining the arrival phase of the traveler at the signalized intersection based on the departure time, the signal cycle of the signalized intersection and the road section information;
step S40, determining the waiting time of the traveler at the signalized intersection based on the phase section where the arrival phase is located, wherein the signal cycle comprises a passing phase section and a non-passing phase section;
at step S50, a traffic path is determined based on the waiting time period.
Through the steps S10 to S50, the waiting time of the traveler at the signal intersection can be calculated by analyzing the arrival phase of the traveler when the traveler arrives at the signal intersection, all the traffic paths that can reach the destination are determined by means of the existing navigation technology, the accurate time range for the traveler to reach the destination is provided according to the waiting time, the shortest reliable path is generated for the user, and the user is prevented from being late.
For example, the following embodiments are explained by taking a traffic light as an example instead of a signalized intersection.
With the technical solution in step S10, the start point coordinate information and the destination coordinate information of the traveler and the departure time of the traveler are acquired. For example, in the conventional navigation software, after a traveler inputs a start point and an end point, the navigation software displays a travel path and a time length passing through the travel path for the traveler based on the travel data in the history database, but the time length does not take into account the waiting time length at a traffic light and the random time variation of a traffic network, and cannot provide an accurate arrival time range for the traveler, so that the time length provided by the navigation software is low in accuracy and large in error.
With the technical solution in step S20, the signal cycles of all signalized intersections between the start point coordinate information and the destination point coordinate information and the link information between any two adjacent signalized intersections are acquired. Illustratively, when the waiting time of the traffic light is calculated, the traffic light coordinate closest to the starting point coordinate of the traveler needs to be determined, the arrival phase position of the traveler when the traveler arrives at the traffic light coordinate closest to the starting point coordinate is determined according to the departure time of the traveler and the time required by the traveler to arrive at the traffic light coordinate closest to the starting point coordinate, the waiting time of the traveler needing to be at the traffic light is calculated according to the arrival phase position, and the waiting time of the next traffic light is calculated based on the waiting time of the traffic light and the road information between the traffic light and the next traffic light.
For the technical solution in step S40, the waiting time of the traveler at the signalized intersection is determined based on the phase interval where the arrival phase is located, where the signal cycle includes a passing phase interval and a non-passing phase interval. As an exemplary embodiment, after a traveler reaches a traffic light, the arrival phase of the traveler at the moment is recorded, the relationship between the arrival phase and a passing phase interval and a non-passing phase interval is compared, and the traveler can pass when the arrival phase is included in the passing phase interval; when the arrival phase is included in the non-passing phase interval, whether the arrival phase is in front of the passing phase interval or behind the passing phase interval needs to be judged, and corresponding calculation steps are carried out according to the different relation between the arrival phase and the passing phase interval, so that the waiting time of the travelers at the traffic lights is obtained.
With the technical solution in step S50, a traffic path is determined based on the waiting time period. In this embodiment, the calculation is performed from the start coordinates of the traveler, all the traffic routes that enable the traveler to reach the destination coordinates are determined, the waiting time at all the traffic lights of each traffic route is calculated, the travel time range for reaching the destination is provided for the traveler, and the traveler is prevented from being late.
For example, the traffic lights and road segments are numbered, and the utilization parameter can be expressed as: assuming that the number of traffic lights is N, the traffic light set can be represented as N = { N = { (N) }1，N2，…，NnAnd A is a link set, and if the number of links is m, the link set is represented as A = { A =1，A2，…，AmThe traffic route of a traveler from an origin to a destination can be described as the traffic route selection problem of the traveler in the directed graph, denoted as G (N, A, t)ij) If the traffic path required by the traveler is a node in the directed graph that is not emptyThe sets are arranged from the starting point in the order of the passing nodes to the end point, the time range is set as T, the sets can be discretized into a set of time periods T with the same time interval, any time period T belongs to T, wherein T belongs to Tij(i ≠ j) is a piecewise function related to the departure time period t, representing the road section (N)i，Nj) Upper travel time.
Before executing the method, each traffic light node needs to be initialized, a tentative distance value is allocated to each traffic light, the initial node is set to be zero, the initial node is the initial coordinate of a traveler, and all the traffic lights are set to be infinite. All traffic lights not visited are marked. And setting the source node as the current node, namely setting the initial coordinate as the current node. Creating a set W and a set Pi. W is called the set of non-visited traffic lights and consists of all non-visited traffic lights except the source node. PiThe method is a set of all front nodes of the traffic lights, namely a set of all accessed traffic lights in a traffic path where the accessed traffic lights are located. For the current traffic light i, consider dividing PiAll traffic lights except the traffic light in (1), and then calculate their tentative maximum travel time duration
And optimum stroke duration
If, if
Less than the previously recorded time, the tag is overwritten. Even if the node has been checked or marked as visited, it should remain in the unvisited set at this time. Will mark as
The traffic light for the optimal travel time is set to the next "current traffic light i".
If the set W is empty and the tags for all traffic lights can no longer be updated, then stop. Otherwise, the label is continuously updated, and a more optimal path is searched. After the label of the last traffic light in the set W is updated, the optimal path from the start coordinate to the destination coordinate is found in the reverse direction from the last traffic light.
As an exemplary embodiment, the wait duration is determined using a latency function based on a phase interval in which the arrival phase is located. When the arrival phase is included in the passing phase interval, the traveler passes directly. When the arrival phase is before the passing phase interval, determining a first waiting time length when the traveler arrives at the signalized intersection based on the waiting time lengths of all phases between the arrival phase and the passing phase interval. When the arrival phase is behind the passing phase interval, determining a second waiting time length when the traveler arrives at the signalized intersection based on a waiting time length from the arrival phase to a final phase of a signal cycle where the arrival phase is located and a waiting time length from an initial phase of an adjacent next signal cycle to the passing phase interval. In this embodiment, let the arrival phase be y, the traffic phase be x, the signal period of the traffic light includes k phases,
referring to the time when the signal period is started when the traveler reaches the ith intersection, the waiting time at the traffic light can be analyzed in 3 cases:
when x = y, the traveler can pass without waiting when arriving at the traffic light, and the waiting time t is set at the traffic light at the momentw,i=0；
When x is less than y, it indicates that the traveler needs to wait from phase y to phase x of the next signal period after arriving at the traffic light, and the waiting time at the traffic light is calculated by the following formula (1):
wherein i is a traffic light serial number, and L is the L-th phase of the ith traffic light;
when x is larger than y, it indicates that the traveler needs to wait from phase y to phase x of the period after arriving at the traffic light, and the waiting time at the traffic light is calculated by the following formula (2):
at a certain traffic light NiHaving k independent phases, then the traffic light NiThe function of latency is shown in figure 3. The ordinate is the waiting time at the traffic light i, and the abscissa is the time when the traveler reaches the traffic light. The numbers on the oblique lines of the image are phase numbers which respectively represent the change of the waiting time of the 1 st to the m-th phases with the arrival time of the travelers, t in fig. 3iRepresenting the green duration of the ith phase.
From the functional image the following conclusions can be drawn:
at any traffic light NiIn one signal period, the waiting time function is a piecewise function, and when the required phase is x, the waiting time function is shown as the following formula (3):
wherein d isiRepresenting the arrival time of the traveler, TiRepresenting one signal period.
It should be noted that the waiting time at the traffic light is related to the phase required by the traveler for passing, and the waiting time intervals of different phases are different
。
As an exemplary embodiment, the determining a traffic path based on the waiting duration comprises: acquiring random time-varying characteristics of a traffic network; converting the random time-varying features into deterministic time-varying models based on a first class of mathematical induction; based on the wait duration and the deterministic timeAnd determining a traffic duration calculation model of the traffic path by the variable model. Providing a deterministic range of time for the traveler to reach the destination based on a departure time and the transit time calculation model. In this embodiment, the traveler arrives at the traffic light NiTime of tiFrom NiThe departure time is a time period
The traveler is at the traffic light NiHas a waiting time of tw,iRoad section (N)i，Nj) Has a travel time of tijAnd (t), the value of the random time-varying network can change along with the difference of departure time, and the time-varying network embodies the time-varying property. To embody the random characteristics of the random time-varying network, let tij(t)=
In which
Is constant over the time period t and,
is not more than constant
A random variable of, and
is more than or equal to 0, so
≤tij(t)≤
+
The travel time is derived by using a first type of mathematical induction method:
suppose a traveler is in
Time slave traffic light N1Starting from, passing through the road section (N)1，N2) Has a travel time of t12(t), and t12(t)∈[
]Then, then
Can be uncertain
Is converted into an interval range of
A deterministic period of time.
Suppose a traveler is in
Time slave traffic light N2Starting from, passing through the road section (N)2，N3) Has a travel time of t23(t) and
then, formula (4):
formula (4) is further derived to give formula (5):
and therefore will be indeterminate
The conversion range is the deterministic time, and the value range is as the formula(6) Shown in the figure:
similarly, assume the traveler is in
Time slave traffic light Nk-2Starting from, passing through the road section (N)k-2，Nk-1) Has a travel time of tk-2,k-1(t) and
then, the following formula (7):
then, formula (8):
therefore, uncertainty can be reduced
The conversion interval range is a deterministic period, and is represented by formula (9):
suppose a traveler is in
Time slave traffic light Nk-1Starting from, passing through the road section (N)k-1，Nk) Has a travel time of tk-1,k(t) and
then, the following formula (10):
then, formula (11):
therefore, uncertainty can be reduced
The conversion interval range is a deterministic period, as shown in equation (12):
the travel time of the travel route in the random dynamic urban road network obtained by the first class of mathematical induction method can be converted into a deterministic time-varying network by a maximum and minimum principle,
is a deterministic variable, which is the time t of travel of the road sectionij(t) maximum value, so that the objective function turns to solving in a deterministic time-varying network, under the constraint of a time window, seeking
The smallest path.
It should be noted that for simplicity of description, the above-mentioned embodiments of the method are described as a series of acts, but those skilled in the art should understand that the present application is not limited by the described order of acts, as some steps may be performed in other orders or simultaneously according to the present application. Further, those skilled in the art will recognize that the embodiments described in this specification are preferred embodiments and that acts or modules referred to are not necessarily required for this application.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which is stored in a storage medium (e.g., a ROM (Read-Only Memory)/RAM (Random Access Memory), a magnetic disk, an optical disk) and includes several instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the methods according to the embodiments of the present application.
The embodiment of the application also provides an intelligent traffic path generating device for implementing the intelligent traffic path generating method. Fig. 4 is a schematic diagram of an alternative intelligent traffic path generating device according to an embodiment of the present application, and as shown in fig. 4, the device may include:
a first obtaining module 401, configured to obtain start point coordinate information and destination coordinate information of a traveler and a departure time of the traveler;
a second obtaining module 402, configured to obtain signal cycles of all signal intersections between the start coordinate information and the destination coordinate information and road section information between any two adjacent signal intersections;
a first analysis module 403, configured to determine an arrival phase of the traveler at the signalized intersection based on the departure time, the signal cycle of the signalized intersection, and the road section information;
a second analysis module 404, configured to determine a waiting duration of the traveler at the signalized intersection based on a phase interval where the arrival phase is located, where the signal cycle includes a passing phase interval and a non-passing phase interval;
the execution module 405 determines a traffic path based on the wait period.
It should be noted that the first obtaining module 401 in this embodiment may be configured to execute the step S10, the second obtaining module 402 in this embodiment may be configured to execute the step S20, the first analyzing module 403 in this embodiment may be configured to execute the step S30, the second analyzing module 404 in this embodiment may be configured to execute the step S40, and the executing module 405 in this embodiment may be configured to execute the step S50.
It should be noted that the modules described above are the same as examples and application scenarios realized by corresponding steps, but are not limited to what is disclosed in the foregoing embodiments. It should be noted that the modules described above as a part of the apparatus may be operated in a hardware environment as shown in fig. 1, and may be implemented by software, or may be implemented by hardware, where the hardware environment includes a network environment.
According to still another aspect of the embodiments of the present application, there is also provided an electronic device for implementing the intelligent traffic path generating method, where the electronic device may be a server, a terminal, or a combination thereof.
Fig. 5 is a block diagram of an alternative electronic device according to an embodiment of the present application, as shown in fig. 5, including a processor 502, a communication interface 504, a memory 506, and a communication bus 508, where the processor 502, the communication interface 504, and the memory 506 are communicated with each other via the communication bus 508, and where,
a memory 506 for storing a computer program;
the processor 502, when executing the computer program stored in the memory 506, implements the following steps:
acquiring starting point coordinate information and destination coordinate information of a traveler and a departure time of the traveler;
acquiring signal periods of all signalized intersections between the starting point coordinate information and the destination coordinate information and road section information between any two adjacent signalized intersections;
determining an arrival phase of the traveler at the signalized intersection based on the departure time, the signal cycle of the signalized intersection and the road section information;
determining the waiting time of the traveler at the signalized intersection based on a phase interval where the arrival phase is located, wherein the signal cycle comprises a passing phase interval and a non-passing phase interval;
determining a traffic path based on the wait period.
Alternatively, in this embodiment, the communication bus may be a PCI (Peripheral Component Interconnect) bus, an EISA (Extended Industry Standard Architecture) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 5, but this is not intended to represent only one bus or type of bus.
The communication interface is used for communication between the electronic equipment and other equipment.
The memory may include RAM, and may also include non-volatile memory (non-volatile memory), such as at least one disk memory. Alternatively, the memory may be at least one memory device located remotely from the processor.
As an example, as shown in fig. 5, the memory 502 may include, but is not limited to, a first obtaining module 401, a second obtaining module 402, a first analyzing module 403, a second analyzing module 404, and an executing module 405 of the intelligent transportation path generating apparatus. In addition, the device may further include, but is not limited to, other module units in the intelligent traffic path generating device, which is not described in detail in this example.
The processor may be a general-purpose processor, and may include but is not limited to: a CPU (Central Processing Unit), an NP (Network Processor), and the like; but also a DSP (Digital Signal Processing), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component.
Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments, and this embodiment is not described herein again.
It can be understood by those skilled in the art that the structure shown in fig. 5 is only an illustration, and the device implementing the intelligent traffic path generating method may be a terminal device, and the terminal device may be a terminal device such as a smart phone (e.g., an Android phone, an iOS phone, etc.), a tablet computer, a palm computer, a Mobile Internet Device (MID), a PAD, and the like. Fig. 5 is a diagram illustrating a structure of the electronic device. For example, the terminal device may also include more or fewer components (e.g., network interfaces, display devices, etc.) than shown in FIG. 5, or have a different configuration than shown in FIG. 5.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by a program instructing hardware associated with the terminal device, where the program may be stored in a storage medium, and the storage medium may include: flash disk, ROM, RAM, magnetic or optical disk, and the like.
According to still another aspect of an embodiment of the present application, there is also provided a storage medium. Alternatively, in the present embodiment, the storage medium may be used to execute a program code of the intelligent traffic path generating method.
Optionally, in this embodiment, the storage medium may be located on at least one of a plurality of network devices in a network shown in the embodiment.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps:
acquiring starting point coordinate information and destination coordinate information of a traveler and a departure time of the traveler;
acquiring signal periods of all signalized intersections between the starting point coordinate information and the destination coordinate information and road section information between any two adjacent signalized intersections;
determining an arrival phase of the traveler at the signalized intersection based on the departure time, the signal cycle of the signalized intersection and the road section information;
determining the waiting time of the travelers at the signalized intersection based on a phase interval where the arrival phase is located, wherein the signal cycle comprises a passing phase interval and a non-passing phase interval;
determining a traffic path based on the wait period.
Optionally, the specific example in this embodiment may refer to the example described in the above embodiment, which is not described again in this embodiment.
Optionally, in this embodiment, the storage medium may include, but is not limited to: various media capable of storing program codes, such as a U disk, a ROM, a RAM, a removable hard disk, a magnetic disk, or an optical disk.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
The integrated unit in the above embodiments, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in the above computer-readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a storage medium, and including instructions for causing one or more computer devices (which may be personal computers, servers, network devices, or the like) to execute all or part of the steps of the method described in the embodiments of the present application.
In the above embodiments of the present application, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed client may be implemented in other manners. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, and may also be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution provided in the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The foregoing is only a preferred embodiment of the present application and it should be noted that those skilled in the art can make several improvements and modifications without departing from the principle of the present application, and these improvements and modifications should also be considered as the protection scope of the present application.
Claims (10)
1. An intelligent traffic path generation method, comprising:
acquiring starting point coordinate information and destination coordinate information of a traveler and a departure time of the traveler;
acquiring signal periods of all signalized intersections between the starting point coordinate information and the destination coordinate information and road section information between any two adjacent signalized intersections;
determining an arrival phase of the traveler at the signalized intersection based on the departure time, the signal cycle of the signalized intersection and the road section information;
determining the waiting time of the traveler at the signalized intersection based on a phase interval where the arrival phase is located, wherein the signal cycle comprises a passing phase interval and a non-passing phase interval;
determining a traffic path based on the wait period.
2. The intelligent traffic path generation method according to claim 1,
the wait duration is determined using a latency function based on a phase interval in which the arrival phase is located.
3. The intelligent traffic path generation method according to claim 2,
when the arrival phase is included in the passing phase interval, the traveler passes directly.
4. The intelligent traffic path generation method according to claim 2,
when the arrival phase is before the passing phase interval, determining a first waiting time length when the traveler arrives at the signalized intersection based on the waiting time lengths of all phases between the arrival phase and the passing phase interval.
5. The intelligent traffic path generation method according to claim 2,
when the arrival phase is behind the passing phase interval, determining a second waiting time length when the traveler arrives at the signalized intersection based on a waiting time length from the arrival phase to a final phase of a signal cycle where the arrival phase is located and a waiting time length from an initial phase of an adjacent next signal cycle to the passing phase interval.
6. The intelligent traffic route generation method according to claim 1, wherein the determining a traffic route based on the waiting duration comprises:
acquiring random time-varying characteristics of a traffic network;
converting the random time-varying features into a deterministic time-varying model based on a first class of mathematical induction;
determining a transit time calculation model for the traffic path based on the wait time and the deterministic time-varying model.
7. The intelligent transportation path generation method according to claim 6,
providing a deterministic range of time for the traveler to reach the destination based on the departure time and the transit time calculation model.
8. The intelligent traffic path generation method according to claim 1, wherein the determining a traffic path based on the waiting duration includes:
and calculating arrival time of all next signalized intersections towards the destination position based on the arrival phase of the traveler at the signalized intersection, the passing phase and the road section information corresponding to the passing phase, and determining a traffic road section of the next arrival target signalized intersection based on the arrival time.
9. An electronic device, characterized in that the electronic device comprises:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the intelligent traffic path generation method according to any one of claims 1 to 8.
10. A storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the intelligent traffic path generating method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210632051.0A CN114706937A (en) | 2022-06-07 | 2022-06-07 | Intelligent traffic path generation method, electronic device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210632051.0A CN114706937A (en) | 2022-06-07 | 2022-06-07 | Intelligent traffic path generation method, electronic device, and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114706937A true CN114706937A (en) | 2022-07-05 |
Family
ID=82177937
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210632051.0A Pending CN114706937A (en) | 2022-06-07 | 2022-06-07 | Intelligent traffic path generation method, electronic device, and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114706937A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105225479A (en) * | 2015-08-21 | 2016-01-06 | 西南交通大学 | Based on the signalized intersections Link Travel Time computing method of mobile phone switch data |
| CN111882112A (en) * | 2020-07-01 | 2020-11-03 | 北京嘀嘀无限科技发展有限公司 | Method and system for predicting arrival time |
| CN113140114A (en) * | 2021-03-09 | 2021-07-20 | 中山大学 | Vehicle travel path reconstruction method based on travel time estimation |
| CN113747364A (en) * | 2021-09-29 | 2021-12-03 | 济南金宇公路产业发展有限公司 | Intelligent traffic navigation method, equipment and medium based on 5G network |
-
2022
- 2022-06-07 CN CN202210632051.0A patent/CN114706937A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105225479A (en) * | 2015-08-21 | 2016-01-06 | 西南交通大学 | Based on the signalized intersections Link Travel Time computing method of mobile phone switch data |
| CN111882112A (en) * | 2020-07-01 | 2020-11-03 | 北京嘀嘀无限科技发展有限公司 | Method and system for predicting arrival time |
| CN113140114A (en) * | 2021-03-09 | 2021-07-20 | 中山大学 | Vehicle travel path reconstruction method based on travel time estimation |
| CN113747364A (en) * | 2021-09-29 | 2021-12-03 | 济南金宇公路产业发展有限公司 | Intelligent traffic navigation method, equipment and medium based on 5G network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6804792B2 (en) | Systems and methods for estimating arrival time | |
| US10809723B2 (en) | Method and apparatus for generating information | |
| CN109724611A (en) | Paths planning method, device, electronic equipment and storage medium | |
| CN109547925A (en) | Location updating method, the display methods of position and navigation routine, vehicle and system | |
| CN113763700B (en) | Information processing method, information processing device, computer equipment and storage medium | |
| CN111310987B (en) | Method and device for predicting free parking space of parking lot, electronic equipment and storage medium | |
| CN113762595B (en) | Traffic time prediction model training method, traffic time prediction method and equipment | |
| CN113223293B (en) | Road network simulation model construction method and device and electronic equipment | |
| CN116046008A (en) | Situation awareness-based route planning method, system and efficiency evaluation device | |
| CN113643532A (en) | Regional traffic prediction method and device | |
| CN115410410A (en) | Parking space recommendation method, device, equipment and storage medium | |
| CN116467615A (en) | Clustering method and device for vehicle tracks, storage medium and electronic device | |
| CN111739283A (en) | Road condition calculation method, device, equipment and medium based on clustering | |
| CN113108806B (en) | Path planning method, device, equipment and medium | |
| CN110956299B (en) | Arrival time estimation method and device | |
| CN114639233B (en) | Congestion state prediction method and device, electronic equipment and storage medium | |
| CN111047107B (en) | Road traffic time prediction method, device, electronic equipment and storage medium | |
| CN114706937A (en) | Intelligent traffic path generation method, electronic device, and storage medium | |
| CN111141302A (en) | Estimation method and device for vehicle driving arrival time and electronic equipment | |
| CN110470310A (en) | Automatic map generates | |
| CN112053116B (en) | Method and device for identifying carpooling orders | |
| CN111836274B (en) | Service processing method and device | |
| JP2018025903A (en) | Congestion information estimation device and congestion information estimation method | |
| CN111612198B (en) | Method and device for predicting success rate of spelling and electronic equipment | |
| CN110647599B (en) | Method and apparatus for displaying information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220705 |
|
| RJ01 | Rejection of invention patent application after publication |