Method, device, equipment and storage medium for optimizing vehicle paths

Abstract

The present disclosure provides a method for optimizing vehicle paths, comprising: obtaining the starting point, end point, and waypoints of a vehicle's path within an area to be optimized; matching the starting point, end point, and waypoints to the nearest road nodes; finding at least one selectable path for the vehicle within the area to be optimized based on the matched starting point, end point, and waypoints, and generating a matrix σ; generating a coupling matrix J based on the selectable paths for the vehicle within the area to be optimized and the occupancy of the roads within the area to be optimized; inputting the matrix σ and the coupling matrix J into a coherent Ising machine to obtain an optimized path for the vehicle within the area to be optimized. The present disclosure combines traffic optimization with a coherent Ising machine, enabling the coherent Ising machine to be used for traffic optimization, significantly reducing the time cost of traffic optimization. The present disclosure utilizes time division multiplexing technology in the coherent Ising machine, enabling the system to address traffic problems involving large numbers of vehicles and complex roads.

Description

Technical Field

[0001] The present invention belongs to the technical field of microwave photonics, and in particular relates to a method, device, equipment and storage medium for optimizing vehicle paths. Background Art

[0002] With the growth of social economy and the advancement of science and technology, the process of urbanization is also accelerating. The number of motor vehicles in cities is also increasing rapidly, and the problem of traffic congestion is becoming increasingly serious. Traffic congestion not only increases the incidence of traffic accidents, but also greatly increases the emission of automobile exhaust, causing environmental pollution. Therefore, it is necessary to optimize traffic.

[0003] However, with the increasing number of vehicles and the increasing complexity of road nodes, traditional electronic methods have become increasingly difficult to address this complex optimization problem. This is primarily due to the fact that this optimization problem is non-deterministic, polynomially hard (NP-hard). As the number of vehicles and road nodes increases, the computational effort required for traffic optimization grows exponentially or even factorially, and the computational time required for optimization also increases accordingly. For a real-time problem like traffic optimization, this increased time cost is unacceptable.

[0004] At present, some people have tried to use quantum annealing algorithms to solve such optimization problems. However, due to the limitation of the number of quantum bits of quantum computers, the number of vehicles that can be optimized simultaneously is limited, and it is still impossible to solve the path optimization problem of a large number of vehicles.

[0005] Public content

[0006] (1) Technical issues to be resolved

[0007] In view of the above-mentioned deficiencies in the prior art, the main purpose of the present disclosure is to provide a method, apparatus, device and storage medium for optimizing vehicle paths, in order to at least partially solve at least one of the above-mentioned technical problems.

[0008] (2) Technical solution

[0009] To achieve the above objectives, according to one aspect of the present disclosure, a method for optimizing a vehicle path is provided, the method comprising:

[0010] Identify areas to be optimized;

[0011] Preprocessing the map of the area to be optimized to obtain a set of roads and road nodes in the area to be optimized;

[0012] Obtain the starting point, end point, and waypoints of the vehicle's path within the area to be optimized;

[0013] Match the starting point, end point and waypoint to the road node closest to the starting point, end point and waypoint respectively;

[0014] Find at least one selectable path for the vehicle in the area to be optimized based on the matched starting point, end point, and waypoints and generate a matrix σ describing the selectable paths for the vehicle in the area to be optimized;

[0015] Generate a coupling matrix J describing the road occupancy situation in the area to be optimized based on the occupancy situation of the roads in the area to be optimized according to the selectable paths of the vehicles in the area to be optimized;

[0016] The matrix σ and the coupling matrix J are input into the coherent Ising machine to obtain the optimized path of the vehicle in the area to be optimized.

[0017] In another aspect, the present disclosure provides an apparatus for optimizing a vehicle path, the apparatus comprising:

[0018] Preprocessing module to determine the area to be optimized;

[0019] Preprocessing the map of the area to be optimized to obtain a set of roads and road nodes in the area to be optimized;

[0020] An acquisition module obtains the starting point, end point and waypoints of the vehicle's path within the area to be optimized;

[0021] Match the starting point, end point and waypoint to the road node closest to the starting point, end point and waypoint respectively;

[0022] A creation module is used to find at least one optional path for the vehicle in the area to be optimized based on the matched starting point, end point, and waypoints and to generate a matrix σ describing the optional paths of the vehicle in the area to be optimized;

[0023] Generate a coupling matrix J describing the road occupancy situation in the area to be optimized based on the occupancy situation of the roads in the area to be optimized according to the selectable paths of the vehicles in the area to be optimized;

[0024] The calculation module inputs the matrix σ and the coupling matrix J into a coherent Ising machine to obtain an optimized path of the vehicle in the area to be optimized.

[0025] In another aspect, the present disclosure provides an electronic device, the device comprising:

[0026] A communicator for communicating with the server;

[0027] processor;

[0028] The memory stores a computer executable program, which, when executed by the processor, enables the processor to perform the above-mentioned method for optimizing a vehicle path.

[0029] On the other hand, the present disclosure provides a computer-readable storage medium having a computer program stored thereon, which implements the above-mentioned method for optimizing a vehicle path when executed by a processor.

[0030] (3) Beneficial effects

[0031] (1) The present disclosure combines vehicle path optimization with a coherent Ising machine, so that the coherent Ising machine can be used to optimize vehicle paths, solve traffic congestion problems, and greatly reduce the time cost of solving traffic congestion problems.

[0032] (2) The present disclosure uses a coherent Ising machine to solve the problem. By using time division multiplexing technology in the coherent Ising machine, the system is able to solve a large number of vehicles and complex road traffic problems. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present disclosure. For those skilled in the art, other drawings can be obtained based on these drawings without paying any creative work.

[0034] Figure 1 A flowchart of a method for optimizing a vehicle path provided by an embodiment of the present disclosure;

[0035] Figure 2 A schematic diagram of a process for constructing a coupling matrix J according to an embodiment of the present disclosure;

[0036] Figure 3 A schematic structural diagram of a device for optimizing a vehicle path according to an embodiment of the present disclosure;

[0037] Figure 4 A hardware structure diagram of an electronic device is shown. DETAILED DESCRIPTION

[0038] To make the objectives, features, technical solutions, and advantages of the present disclosure more clearly understood, the present disclosure is further described below in conjunction with specific embodiments and with reference to the accompanying drawings. It is apparent that the embodiments described are only a portion of the embodiments of the present disclosure, not all of them. All other embodiments derived by those skilled in the art based on the embodiments of the present disclosure without inventive effort are intended to fall within the scope of protection of the present disclosure.

[0039] Figure 1 A flow chart of a method for optimizing vehicle paths provided by an embodiment of the present disclosure is shown as follows: Figure 1As shown, the method includes the following steps:

[0040] S101, determining the area to be optimized;

[0041] S102, preprocessing the map of the area to be optimized to obtain a set of roads and road nodes in the area to be optimized;

[0042] The map data of the area that needs to be optimized for traffic is preprocessed, and after processing, sets "R" and "I" describing roads and road nodes are obtained respectively.

[0043] S103, obtaining the starting point, end point, and waypoints of the vehicle's path within the area to be optimized;

[0044] S104, matching the starting point, the end point, and the waypoint to the road node closest to the starting point, the end point, and the waypoint respectively;

[0045] Obtain the coordinates of the starting point, ending point, and waypoints of vehicle i to be optimized. Match these starting points, ending points, and waypoints to the road nodes closest to them, and represent them using elements from the set "I" describing road nodes. There may be one, multiple, or no waypoints.

[0046] S105, searching for at least one selectable path for the vehicle in the area to be optimized based on the matched starting point, end point, and waypoints, and generating a matrix σ describing the selectable paths for the vehicle in the area to be optimized;

[0047] According to the information of the starting point, end point and waypoints matched with the road nodes obtained in S104, n optional paths are found for each vehicle in the area, and c ij Indicates the state where the jth path of the i-th vehicle is selected. Among them, the n paths for selection need to have a lower similarity to obtain a better optimization effect; in addition, c ij There are only two possible values, “+1” and “-1” or “0” and “1”, which respectively indicate whether the jth path of the i-th vehicle is selected. Each vehicle in the optimization area has only one path selected. ij By putting a 1×N dimensional matrix in a certain order, we can get the matrix σ that describes the vehicle path selection state. The dimension of the matrix σ is related to the number of vehicles and the number of paths that the vehicle can choose. The dimension of the matrix σ is N=∑ i In particular, the number of selectable paths found for different vehicles may be different, that is, the above n may not be equal for different vehicles.

[0048] S106, generating a coupling matrix J describing the road occupancy status in the area to be optimized based on the occupancy status of the roads in the area to be optimized according to the selectable paths of the vehicles in the area to be optimized;

[0049] The coupling matrix J is a square matrix corresponding to the dimensions of the matrix σ.

[0050] S107 : Input the matrix σ and the coupling matrix J into the coherent Ising machine to obtain the optimized path of the vehicle in the area to be optimized.

[0051] The matrix σ and coupling matrix J obtained in S105 and S106 are input into the coherent Ising machine for optimization. Since the coherent Ising machine is used for optimization, the path optimization of a large number of vehicles can be performed simultaneously by utilizing the principle of time division multiplexing.

[0052] The optimized path of the vehicle in the area to be optimized corresponds to the state with the lowest energy in the Ising model. The calculation formula of the Ising energy is:

[0053]

[0054] Wherein, i and j represent a path of a vehicle, and N represents the dimension of the matrix σ.

[0055] In S107 , the final result obtained by the optimization in S107 , ie, the optimized matrix σ, may be output as the final optimization result.

[0056] Coherent Ising machines include coherent Ising machines based on lasers, optical parametric oscillators, optoelectronic parametric oscillators, or optoelectronic oscillators.

[0057] Figure 2 A schematic diagram of a process for constructing a coupling matrix J according to an embodiment of the present disclosure is shown in FIG. Figure 2 As shown,

[0058] S201, respectively count the number of vehicles on each road section r (using S r Represented), and then construct a function to describe the vehicle's occupancy of road section r:

[0059]

[0060] S202: The vehicle occupancy status of a certain road section r obtained in S201 is traversed over all road sections in the area to be optimized, i.e., the set "R", to obtain a function that generally describes the road occupancy status:

[0061]

[0062] S203: To ensure that each vehicle has only one path selected, a constraint function needs to be constructed to constrain this. The constructed constraint function is as follows:

[0063]

[0064] Among them, the value of k is related to c ij The value that can be taken depends on the size of n. For example, c ij The possible values ​​are +1 and -1, and +1 represents that the current path is selected. If n=3, the value of k should be -1.

[0065] S204. Traverse all vehicles and sum them up to obtain the total constraint function:

[0066]

[0067] S205. Perform a weighted sum of the function describing the road occupancy obtained in S202 and the vehicle constraint function obtained in S204 to obtain an Ising energy calculation formula describing the current road occupancy:

[0068]

[0069] The introduction of α is to ensure that the increase in Ising energy caused by the vehicle's path selection state not meeting the constraints is greater than the increase in Ising energy caused by the increase in the vehicle's occupancy of certain paths, thereby ensuring that the optimization result has only one path selected for each vehicle and α has a minimum value.

[0070] S206. Expand the formula for calculating the Ising energy obtained in S205 to obtain its coefficient matrix, which is the coupling matrix J.

[0071] Figure 3 A schematic diagram of the structure of a device for optimizing vehicle paths provided in one embodiment of the present disclosure is shown as follows: Figure 3 As shown, the present disclosure also provides a device, which includes:

[0072] Preprocessing module 301, acquisition module 302, creation module 303, calculation module 304

[0073] Pre-processing module 301, determining the area to be optimized;

[0074] Preprocessing the map of the area to be optimized to obtain a set of roads and road nodes in the area to be optimized;

[0075] An acquisition module 302 acquires the starting point, end point, and waypoints of the vehicle's path within the area to be optimized;

[0076] Matching the starting point, the end point and the waypoint to the road node closest to the starting point, the end point and the waypoint respectively;

[0077] A creation module 303 searches for at least one selectable path for the vehicle in the area to be optimized based on the matched starting point, end point, and waypoints, and generates a matrix σ describing the selectable paths for the vehicle in the area to be optimized;

[0078] Generate a coupling matrix J describing the road occupancy situation in the area to be optimized based on the occupancy situation of the roads in the area to be optimized according to the selectable paths of the vehicles in the area to be optimized;

[0079] The calculation module 304 inputs the matrix σ and the coupling matrix J into a coherent Ising machine to obtain an optimized path of the vehicle in the area to be optimized.

[0080] The present disclosure further provides an electronic device 400, which includes:

[0081] Communicator 410, for communicating with the server;

[0082] Processor 420;

[0083] The memory 430 stores a computer-executable program, which includes the method for optimizing the vehicle path as described above.

[0084] Figure 4 The electronic device according to the embodiment of the present disclosure is schematically shown as follows: Figure 4 As shown, the electronic device 400 includes: a communicator 410, a processor 420, and a memory 430. The electronic device 400 can execute the method according to the embodiment of the present disclosure.

[0085] Specifically, the processor 420 may include, for example, a general-purpose microprocessor, an instruction set processor and / or a related chipset and / or a dedicated microprocessor (e.g., an application-specific integrated circuit (ASIC)), etc. The processor 420 may also include onboard memory for cache purposes. The processor 420 may be a single processing unit or multiple processing units for executing different actions of the method flow according to the embodiments of the present disclosure.

[0086] Memory 430 can be, for example, any medium capable of containing, storing, conveying, disseminating, or transmitting instructions. For example, readable storage media can include, but are not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, components, or propagation media. Specific examples of readable storage media include: magnetic storage devices, such as magnetic tape or hard disk drives (HDDs); optical storage devices, such as compact disks (CD-ROMs); memory, such as random access memory (RAM) or flash memory; and / or wired / wireless communication links. It stores a computer-executable program that, when executed by the processor, causes the processor to perform the method for optimizing the vehicle path as described above.

[0087] The present disclosure also provides a computer-readable storage medium storing a computer program that implements the method for optimizing vehicle paths described above. The computer-readable storage medium may be included in the apparatus / device described in the above embodiments, or it may exist independently and not incorporated into the apparatus / device. The computer-readable storage medium carries one or more programs that, when executed, implement the method according to the embodiments of the present disclosure.

[0088] According to an embodiment of the present disclosure, the computer-readable storage medium may be a computer-readable signal medium or a computer-readable storage medium or any combination thereof. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or component, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to, an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof.

[0089] In the present disclosure, a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In the present disclosure, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, which carries computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical cable, radio frequency signals, etc., or any suitable combination of the foregoing.

[0090] The specific embodiments described above further illustrate the purpose, technical solutions and beneficial effects of the present disclosure. It should be understood that the above are only specific embodiments of the present disclosure and are not intended to limit the present disclosure. Those skilled in the art will understand that the features described in the various embodiments and / or claims of the present disclosure may be combined or / and combined in various ways. Even if such combinations or combinations are not explicitly described in the present disclosure, any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present disclosure shall be included in the scope of protection of the present disclosure.

Claims

1. A method for optimizing a vehicle path, characterized in that: include: Identify areas to be optimized; Preprocessing the map of the area to be optimized to obtain a set of roads and road nodes in the area to be optimized; Obtaining the starting point, end point, and waypoints of the vehicle's path within the area to be optimized; Matching the starting point, the end point and the waypoint to the road nodes closest to the starting point, the end point and the waypoint respectively; Find at least one optional path for each vehicle in the area to be optimized based on the starting point, end point and waypoint after matching, and use c ij Indicates the state where the jth selectable path of the i-th vehicle is selected, the c ij The value of indicates whether the jth optional path of the i-th vehicle is selected. ij Put a 1×N dimensional matrix in a certain order to generate a matrix describing the optional paths of the vehicle in the area to be optimized ; The coupling matrix J describing the road occupancy situation in the area to be optimized is generated based on the occupancy situation of the roads in the area to be optimized according to the optional paths of the vehicles in the area to be optimized. The coupling matrix J is related to the matrix The construction process of the coupling matrix J includes: counting the number of vehicles on each road section to construct a function describing the vehicle occupation of the road section; traversing all road sections in the area to be optimized based on the function describing the vehicle occupation of the road section to obtain a total function describing the road occupation; constructing a total constraint function for all vehicles; obtaining an Ising energy calculation formula describing the current road occupation based on a weighted summation of the total function describing the road occupation and the total constraint function; expanding the Ising energy calculation formula describing the current road occupancy, and using the coefficient matrix obtained by the expansion as the coupling matrix J; The matrix and the coupling matrix J are input into a coherent Ising machine to obtain an optimized path of the vehicle in the area to be optimized; The optimized path of the vehicle in the area to be optimized corresponds to the state with the lowest energy in the Ising model. The calculation formula of the Ising energy is: Among them, p and q represent a path of a vehicle, and N represents the matrix dimension.

2. The method for optimizing vehicle paths according to claim 1, characterized in that: The road nodes include intersections and starting points of roads.

3. The method for optimizing vehicle paths according to claim 1, characterized in that: The waypoint may be one, multiple or non-existent.

4. The method for optimizing vehicle paths according to claim 1, wherein: Each vehicle in the optimization area has only one path selected.

5. The method for optimizing vehicle paths according to claim 1, characterized in that: The coherent Ising machine includes a coherent Ising machine based on a laser, an optical parametric oscillator, an optoelectronic parametric oscillator or an optoelectronic oscillator.

6. A device for optimizing a vehicle path, characterized in that: The device comprises: Preprocessing module to determine the area to be optimized; Preprocessing the map of the area to be optimized to obtain a set of roads and road nodes in the area to be optimized; An acquisition module, which acquires the starting point, end point and waypoints of the path of the vehicle in the area to be optimized; Matching the starting point, the end point and the waypoint to the road nodes closest to the starting point, the end point and the waypoint respectively; Create a module to find at least one optional path for each vehicle in the area to be optimized based on the starting point, end point and waypoints after matching, and use c ij Indicates the state where the jth selectable path of the i-th vehicle is selected, the c ij The value of indicates whether the jth optional path of the i-th vehicle is selected. ij Put a 1×N dimensional matrix in a certain order to generate a matrix describing the optional paths of the vehicle in the area to be optimized ; The coupling matrix J describing the road occupancy situation in the area to be optimized is generated based on the occupancy situation of the roads in the area to be optimized according to the optional paths of the vehicles in the area to be optimized. The coupling matrix J is related to the matrix The construction process of the coupling matrix J includes: counting the number of vehicles on each road section to construct a function describing the vehicle occupation of the road section; traversing all road sections in the area to be optimized based on the function describing the vehicle occupation of the road section to obtain a total function describing the road occupation; constructing a total constraint function for all vehicles; obtaining an Ising energy calculation formula describing the current road occupation based on a weighted summation of the total function describing the road occupation and the total constraint function; expanding the Ising energy calculation formula describing the current road occupancy, and using the coefficient matrix obtained by the expansion as the coupling matrix J; The calculation module converts the matrix and the coupling matrix J are input into a coherent Ising machine to obtain an optimized path of the vehicle in the area to be optimized; The optimized path of the vehicle in the area to be optimized corresponds to the state with the lowest energy in the Ising model. The calculation formula of the Ising energy is: Among them, p and q represent a path of a vehicle, and N represents the matrix dimension.

7. An electronic device, characterized in that: The device comprises: A communicator for communicating with the server; processor; A memory storing a computer executable program, which, when executed by the processor, enables the processor to perform the method for optimizing a vehicle path according to any one of claims 1 to 5.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method for optimizing a vehicle path according to any one of claims 1 to 5 is implemented.

Images