Vehicle route determination method and device, computer device and storage medium

Abstract

The application relates to a vehicle route determination method and device, computer equipment, a storage medium and a computer program product. The method comprises the following steps: acquiring position information of each target vehicle, position information of each target vehicle group, position information of multiple stations, and transmission cost information of each target vehicle to each station; determining the dispersion degree of the target vehicle according to the position information of each target vehicle and the position information of each target vehicle in the target vehicle group; for each target vehicle, based on the position information of the target vehicle, the position information of each station and the transmission cost information, calculating the initial transmission solution of the target vehicle to each station and the transmission cost value of each initial transmission solution; returning to the above steps until a preset iteration number is met; and determining the target station corresponding to the target vehicle and the target route information of the target vehicle to the target station. The method can improve the transportation effect of the target vehicle to the target station.

Description

Methods, devices, computer equipment, and storage media for determining vehicle routes Technical Field

[0001] This application relates to the field of artificial intelligence technology, and in particular to a method, apparatus, computer device, and storage medium for determining vehicle routes. Background Technology

[0002] With the development of car sharing, the transportation of shared cars has gradually become a research focus in this field. Users often have to take detours, navigate around, or return the vehicle to the pick-up location because they cannot find the most suitable return station, thus placing a lot of transportation pressure on users who rent shared vehicles. Therefore, there is a current need for an optimal vehicle transportation method to optimize users' vehicle transportation routes.

[0003] Traditional optimal transport methods follow the constraint of "lowest cost," using the Sinkhorn algorithm to randomly select the straight-line route from the target vehicle to the station as the optimal transport solution. However, this method does not require consideration of the degree of clustering of vehicles belonging to the same group. This can lead to geographically large distances between the target stations of vehicles in the same group, resulting in poor transport efficiency. Summary of the Invention

[0004] Therefore, it is necessary to provide a method, apparatus, computer equipment, computer-readable storage medium, and computer program product for determining vehicle routes to address the aforementioned technical problems.

[0005] Firstly, this application provides a vehicle transmission method. The method includes:

[0006] The location information of each target vehicle in each target vehicle group, the location information of each target vehicle group, the location information of multiple stations, and the transmission cost information from each target vehicle to each station are obtained; the location information of the target vehicle group is the location information of the center of gravity of the target vehicle group.

[0007] The dispersion of the target vehicles is determined based on the location information of each target vehicle and the location information of each target vehicle in the target vehicle group.

[0008] For each target vehicle, based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, the initial transmission solution from the target vehicle to each station is calculated using the distributed constraint optimal transmission algorithm corresponding to the target vehicle to each station. Then, based on each initial transmission solution of the target vehicle and the dispersion of the target vehicle, the transmission cost value of each initial transmission solution of the target vehicle is calculated.

[0009] Among the various transmission cost values, the parameter values ​​of the distributed constraint optimal transmission algorithm corresponding to the minimum transmission cost value are selected, the parameter values ​​of the distributed constraint optimal transmission algorithm corresponding to each target vehicle to each station are updated, and the execution steps based on the location information of the target vehicle, the location information of each station, and the transmission cost information of the target vehicle to each station are returned. The initial transmission solution steps of the target vehicle to each station are calculated using the distributed constraint optimal transmission algorithm corresponding to the target vehicle to each station until the preset number of iterations is met.

[0010] Based on the initial transmission solution corresponding to the minimum transmission cost value among all transmission cost values ​​obtained in the last iteration, the target station corresponding to the target vehicle and the target route information from the target vehicle to the target station are determined.

[0011] Optionally, the step of calculating the initial transmission solution from the target vehicle to each station based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, using a distributed constrained optimal transmission algorithm corresponding to the target vehicle to each station, includes:

[0012] For each station's location information, the transmission distance of the target vehicle is determined based on the target vehicle's location information and the station's location information.

[0013] Based on the transmission distance and the transmission cost information from the target vehicle to the station, the initial transmission solution from the target vehicle to the station is obtained through the distributed constraint optimal transmission algorithm corresponding to the target vehicle to the station.

[0014] Optionally, calculating the transmission cost of each initial transmission solution of the target vehicle based on each initial transmission solution of the target vehicle and the dispersion of the target vehicle includes:

[0015] Based on the dispersion of the target vehicles and the transmission cost algorithm, the cost of the target vehicles is determined.

[0016] For each initial transmission solution, the cost value of the initial transmission solution is calculated using a transmission cost algorithm;

[0017] The transmission cost of the initial transmission solution is determined based on the cost of the initial transmission solution and the cost of the target vehicle.

[0018] Optionally, the method further includes:

[0019] The evaluation value of the optimal transmission solution for each target vehicle is calculated using an evaluation function.

[0020] Among the evaluation values, the target optimal transmission solution corresponding to each evaluation value that is greater than the preset evaluation threshold is selected;

[0021] The optimal transmission solutions for each target, the first target vehicle corresponding to each optimal transmission solution, the first station corresponding to each optimal transmission solution, and the transmission cost information from each first target vehicle to the first station are input into the distributed constraint optimal transmission algorithm, and the distributed constraint optimal transmission algorithm is trained to obtain an optimized distributed constraint optimal transmission algorithm.

[0022] Optionally, obtaining the location information of each target vehicle group includes:

[0023] For each target vehicle group, the location information of all target vehicles in the target vehicle group is connected to obtain the area range of the target vehicle group;

[0024] The location information of the target vehicle group is determined based on the area range of the target vehicle group and the centroid solution algorithm.

[0025] Optionally, obtaining the transmission cost information from each target vehicle to each station includes:

[0026] Based on the location information of each target vehicle in each target vehicle group and the location information of each station, the transmission range from the target vehicle to the station is determined, and the environmental information of the transmission range is obtained.

[0027] For each target vehicle, the location information of the target vehicle is connected with the location information of each station to obtain the straight-line transmission route from the target vehicle to each station. Based on the location information of the target vehicle, the location information of each station, and the environmental information of the transmission range from the target vehicle to each station, the actual transmission route from the target vehicle to each station is determined.

[0028] For each station, the transmission cost information from the target vehicle to the station is determined based on the straight transmission route from the target vehicle to the station and the actual transmission route from the target vehicle to the station.

[0029] Secondly, this application also provides a vehicle route determination device. The device includes:

[0030] The acquisition module is used to acquire the location information of each target vehicle in each target vehicle group, the location information of each target vehicle group, the location information of multiple stations, and the transmission cost information from each target vehicle to each station; the location information of the target vehicle group is the location information of the center of gravity of the target vehicle group.

[0031] The determination module is used to determine the dispersion of the target vehicles based on the location information of each target vehicle and the location information of each target vehicle in the target vehicle group.

[0032] The calculation module is used to calculate the initial transmission solution from the target vehicle to each station for each target vehicle based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, using the distributed constraint optimal transmission algorithm corresponding to the target vehicle to each station. The module is also used to calculate the transmission cost value of each initial transmission solution of the target vehicle based on the initial transmission solutions of the target vehicle and the dispersion of the target vehicle.

[0033] The iteration module is used to select the parameter values ​​of the distributed constraint optimal transmission algorithm corresponding to the minimum transmission cost value from each of the transmission cost values, update the parameter values ​​of the distributed constraint optimal transmission algorithm corresponding to each of the target vehicles to each of the stations, and return the execution steps of calculating the initial transmission solution from the target vehicle to each station based on the location information of the target vehicle, the location information of each of the stations, and the transmission cost information from the target vehicle to each of the stations, using the distributed constraint optimal transmission algorithm corresponding to each of the target vehicles to each station, until the preset number of iterations is met;

[0034] The filtering module is used to determine the target station corresponding to the target vehicle and the target route information from the target vehicle to the target station based on the initial transmission solution corresponding to the minimum transmission cost value among the transmission cost values ​​obtained in the last iteration.

[0035] Optionally, the computing module is specifically used for:

[0036] For each station's location information, the transmission distance of the target vehicle is determined based on the target vehicle's location information and the station's location information.

[0037] Based on the transmission distance and the transmission cost information from the target vehicle to the station, the initial transmission solution from the target vehicle to the station is obtained through the distributed constraint optimal transmission algorithm corresponding to the target vehicle to the station.

[0038] Optionally, the computing module is specifically used for:

[0039] Based on the dispersion of the target vehicles and the transmission cost algorithm, the cost of the target vehicles is determined.

[0040] For each initial transmission solution, the cost value of the initial transmission solution is calculated using a transmission cost algorithm;

[0041] The transmission cost of the initial transmission solution is determined based on the cost of the initial transmission solution and the cost of the target vehicle.

[0042] Optionally, the device further includes:

[0043] The evaluation module is used to calculate the evaluation value of the optimal transmission solution for each target vehicle using an evaluation function.

[0044] The judgment module is used to filter the target optimal transmission solution corresponding to each evaluation value that is greater than a preset evaluation threshold from the evaluation values.

[0045] The optimization module is used to input the optimal transmission solutions for each target, the first target vehicle corresponding to each optimal transmission solution, the first station corresponding to each optimal transmission solution, and the transmission cost information from each first target vehicle to the first station into the distributed constraint optimal transmission algorithm, and to train the distributed constraint optimal transmission algorithm to obtain the optimized distributed constraint optimal transmission algorithm.

[0046] Optionally, the acquisition module is specifically used for:

[0047] For each target vehicle group, the location information of all target vehicles in the target vehicle group is connected to obtain the area range of the target vehicle group;

[0048] The location information of the target vehicle group is determined based on the area range of the target vehicle group and the centroid solution algorithm.

[0049] Optionally, the acquisition module is specifically used for:

[0050] Based on the location information of each target vehicle in each target vehicle group and the location information of each station, the transmission range from the target vehicle to the station is determined, and the environmental information of the transmission range is obtained.

[0051] For each target vehicle, the location information of the target vehicle is connected with the location information of each station to obtain the straight-line transmission route from the target vehicle to each station. Based on the location information of the target vehicle, the location information of each station, and the environmental information of the transmission range from the target vehicle to each station, the actual transmission route from the target vehicle to each station is determined.

[0052] For each station, the transmission cost information from the target vehicle to the station is determined based on the straight transmission route from the target vehicle to the station and the actual transmission route from the target vehicle to the station.

[0053] Thirdly, this application provides a computer device. The computer device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to implement the steps of the method described in any one of the first aspects.

[0054] Fourthly, this application provides a computer-readable storage medium having a computer program stored thereon that, when executed by a processor, implements the steps of the method described in any one of the first aspects.

[0055] Fifthly, this application provides a computer program product. The computer program product includes a computer program that, when executed by a processor, implements the steps of the method described in any one of the first aspects.

[0056] The aforementioned method, apparatus, computer equipment, and storage medium for determining vehicle routes acquire the location information of each target vehicle in each target vehicle group, the location information of each target vehicle group, the location information of multiple stations, and the transmission cost information from each target vehicle to each station; the location information of the target vehicle group is the location information of the center of gravity of the target vehicle group; based on the location information of each target vehicle and the location information of each target vehicle in the target vehicle group, the dispersion degree of the target vehicles is determined; for each target vehicle, based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, the initial transmission solution from the target vehicle to each station is calculated using the dispersion-constrained optimal transmission algorithm corresponding to the target vehicle to each station, and the initial transmission solution is determined based on the target vehicle... The system calculates the transmission cost of each initial transmission solution for the target vehicle based on the initial transmission solutions of the target vehicles and the dispersion of the target vehicles. Among these transmission costs, it selects the parameter values ​​of the dispersion-constrained optimal transmission algorithm corresponding to the minimum transmission cost, updates the parameter values ​​of the dispersion-constrained optimal transmission algorithm, and returns to execute the step of calculating the initial transmission solution from the target vehicle to each station using the dispersion-constrained optimal transmission algorithm corresponding to each station, based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, until a preset number of iterations is met. Based on the initial transmission solution corresponding to the minimum transmission cost among the transmission costs obtained in the last iteration, it determines the target station corresponding to the target vehicle and the target route information from the target vehicle to the target station. By calculating the dispersion of the target vehicles based on each target vehicle in the same target vehicle group and determining the transmission cost of each initial transmission solution for each target vehicle, the initial transmission solutions of each target vehicle are adjusted to obtain the optimal transmission solution corresponding to each target vehicle. This avoids the problem of long distances between target vehicles in the same group and multiple stations, improving the transportation efficiency from the target vehicle to the target station. Attached Figure Description

[0057] Figure 1 is a flowchart illustrating a method for determining vehicle routes in one embodiment;

[0058] Figure 2 is a flowchart illustrating the steps for calculating the transmission cost value in one embodiment;

[0059] Figure 3 is a flowchart illustrating a vehicle transmission example in one embodiment;

[0060] Figure 4 is a structural block diagram of a vehicle transmission device in one embodiment;

[0061] Figure 5 is an internal structure diagram of a computer device in one embodiment. Detailed Implementation

[0062] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0063] The vehicle route determination method provided in this application can be applied to a terminal, a server, or a system including both a terminal and a server, and is implemented through interaction between the terminal and the server. The terminal can include, but is not limited to, various personal computers, laptops, tablets, etc. This terminal calculates the dispersion of target vehicles based on each target vehicle in the same target vehicle group, determines the transmission cost of each initial transmission solution for each target vehicle, and adjusts the initial transmission solution for each target vehicle to obtain the optimal transmission solution for each target vehicle. This avoids the problem of large distances between multiple stations for target vehicles in the same group, improving the transportation efficiency from target vehicles to target stations.

[0064] In one embodiment, as shown in the figure, a method for determining a vehicle route is provided. Taking the application of this method to a terminal as an example, the method includes the following steps:

[0065] Step S101: Obtain the location information of each target vehicle in each target vehicle group, the location information of each target vehicle group, the location information of multiple stations, and the transmission cost information from each target vehicle to each station.

[0066] Among them, the position information of the target vehicle group is the position information of the center of gravity of the target vehicle group.

[0067] In this embodiment, the terminal responds to the user's information input operation and obtains the location information of each target vehicle in each target vehicle group input by the user. The target vehicles are objects that need to be transmitted to the station location, such as large, medium, and small vehicles. The station can be, but is not limited to, a bus station or a parking spot. For each target vehicle group, the terminal calculates the location information of that group of target vehicles. The terminal obtains the location information of each station and the transmission cost information from each target vehicle to each station. The transmission cost information is the transmission cost information required to transport the target vehicle to the station, which includes information such as transmission time, route length, and vehicle weight. The location information is a three-dimensional coordinate system established in a geodetic coordinate system.

[0068] Step S102: Determine the dispersion of the target vehicles based on the location information of each target vehicle and the location information of each target vehicle in the target vehicle group.

[0069] In this embodiment, the terminal uses a dispersion algorithm to calculate the dispersion of the location information of each target vehicle and the location information of the target vehicle group to which each target vehicle belongs. The dispersion of each target vehicle is then obtained. Dispersion represents the distribution of a target vehicle within its target vehicle group; a higher dispersion indicates a more dispersed center of gravity relative to the target vehicle group, while a lower dispersion indicates a more compact center of gravity relative to the target vehicle group. The dispersion algorithm is as follows:

[0070]

[0071] In the above formula, let i be the target vehicle number, j be the station number, which is also the target vehicle group number, and γ ij This represents the quality of the vehicle in the transmission cost information transmitted from target vehicle i to target vehicle j. (x) i ,y i (x′) represents the position of target vehicle i. j ,y′ j Let ) represent the center of gravity position of target vehicles in group j, n be the total number of target vehicles, and m be the total number of stations. Where t j L represents the sum of the masses of all vehicles in the j-th group, where L[(x i ,y i ),(x′ j ,y′ j The calculation method for ] is as follows:

[0072]

[0073] Step S103: For each target vehicle, based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, calculate the initial transmission solution from the target vehicle to each station using the distributed constraint optimal transmission algorithm corresponding to the target vehicle to each station, and calculate the transmission cost value of each initial transmission solution of the target vehicle based on each initial transmission solution of the target vehicle and the dispersion degree of the target vehicle.

[0074] In this embodiment, for each target vehicle, the terminal inputs the target vehicle's location information, the location information of each station, and the transmission cost information from the target vehicle to each station into a distributed constraint optimal transmission algorithm. The algorithm calculates the initial transmission solutions from the target vehicle to each station, resulting in multiple initial transmission solutions for the target vehicle. For each initial transmission solution of the target vehicle, the terminal inputs the initial transmission solution and the dispersion of the target vehicle into a transmission cost algorithm to obtain the transmission cost value of the initial transmission solution. Similarly, the terminal obtains the transmission cost value of each initial transmission solution for each target vehicle through the above scheme. The distributed constraint optimal transmission algorithm includes a dispersion constraint parameter, the expression of which is as follows:

[0075]

[0076] In the above formula, d represents the dispersion, γ represents the dispersion, and γ represents the dispersion. ij This represents the quality of the vehicle in the transmission cost information transmitted from target vehicle i to target vehicle j, where i is the target vehicle number and j is the station number, and t j Let represent the sum of the masses of all vehicles in group j.

[0077] The distributed constraint optimal transport algorithm can be any traditional distributed constraint optimal transport algorithm that can implement the above steps. The specific transport cost calculation process will be explained in detail later.

[0078] Step S104: Among the various transmission cost values, select the parameter values ​​of the decentralized constraint optimal transmission algorithm corresponding to the minimum transmission cost value, update the parameter values ​​of the decentralized constraint optimal transmission algorithm corresponding to each target vehicle to each station, and return the execution steps based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station. Calculate the initial transmission solution steps from the target vehicle to each station using the decentralized constraint optimal transmission algorithm corresponding to each target vehicle to each station until the preset number of iterations is met.

[0079] In this embodiment, the terminal selects the initial transmission solution corresponding to the minimum transmission cost among the transmission costs of the target vehicle, and replaces the parameter values ​​of the current distributed constraint optimal transmission algorithm with the parameter values ​​of the initial transmission solution with the minimum transmission cost. The terminal presets the number of iterations and returns to step S103. The terminal stops returning to the execution operation when the preset number of iterations is reached.

[0080] Step S105: Based on the initial transmission solution corresponding to the minimum transmission cost value among the transmission cost values ​​obtained in the last iteration, determine the target station corresponding to the target vehicle and the target route information from the target vehicle to the target station.

[0081] In this embodiment, the terminal selects the initial transmission solution with the smallest transmission cost value from the transmission cost values ​​obtained in the last iteration, and uses this as the optimal transmission solution for the target vehicle. The terminal then designates the station corresponding to this optimal transmission solution as the target station for the target vehicle. Finally, the terminal uses the transmission route information from this optimal transmission solution as the target route information from the target vehicle to the target station. Through these steps, the terminal obtains the target stations for all target vehicles and the target route information from all target vehicles to their respective target stations.

[0082] Based on the above scheme, the dispersion of target vehicles is calculated for each target vehicle in the same target vehicle group, and the transmission cost of each initial transmission solution for each target vehicle is determined. This allows for the adjustment of the initial transmission solution for each target vehicle, resulting in the optimal transmission solution for each target vehicle. This avoids the problem of long distances between target vehicles in the same group and multiple stations, and improves the transportation efficiency from target vehicles to target stations.

[0083] Optionally, based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, the initial transmission solution from the target vehicle to each station is calculated using the distributed constraint optimal transmission algorithm corresponding to the target vehicle to each station. This includes: determining the transmission distance of the target vehicle based on the location information of each station and the location information of the target vehicle; and obtaining the initial transmission solution from the target vehicle to the station using the distributed constraint optimal transmission algorithm corresponding to the target vehicle to the station based on the transmission distance and the transmission cost information from the target vehicle to the station.

[0084] In this embodiment, for each station's location information, the terminal determines the straight-line transmission route from that station's location information to the target vehicle's location information, and uses this straight-line transmission route as the transmission distance for the target vehicle. The terminal inputs this transmission distance, along with the transmission cost information from the target vehicle to the station, into a distributed constraint optimal transmission algorithm. The algorithm then performs calculations to obtain the initial transmission solution from the target vehicle to the station. Similarly, using the above scheme, the terminal obtains the initial transmission solutions from each target vehicle to each station.

[0085] Based on the above scheme, the initial transmission solution from each target vehicle to the station is calculated using the basic distributed constraint optimal transmission algorithm, providing a data foundation for subsequent selection of the initial transmission solution.

[0086] Optionally, as shown in Figure 2, based on the initial transport solutions of the target vehicle and the dispersion of the target vehicle, the transport cost of each initial transport solution of the target vehicle is calculated, including:

[0087] Step S201: Determine the cost of the target vehicle based on the dispersion of the target vehicle and the transmission cost algorithm.

[0088] In this embodiment, the terminal inputs the dispersion of the target vehicle into the transmission cost algorithm and performs calculations to obtain the cost of the target vehicle.

[0089] The formula for the transmission cost algorithm is as follows:

[0090]

[0091]

[0092] In the above formula, γ * Let M be the transmission cost of the initial transmission solution, Ω be the transmission cost information from the target vehicle to the station, λ be a preset regularization term, λ be a preset regularization term coefficient, and C be a constant parameter. Let i represent the dispersion of the target vehicle, and j represent the initial transmission solution from the target vehicle to the station. i and j are selected for selection in different computational processes. For example, when calculating the cost of the target vehicle, the algorithm does not include j; when calculating the cost of the initial transmission solution, the algorithm does not include i.

[0093] Step S202: For each initial transmission solution, calculate the cost of the initial transmission solution using the transmission cost algorithm.

[0094] In this embodiment, for each initial transmission solution of the target vehicle, the terminal inputs the initial transmission solution into the transmission cost algorithm and performs calculations using the algorithm to obtain the cost value of the initial transmission solution. Similarly, using the above scheme, the terminal performs calculations on all initial transmission solutions of the target vehicle to obtain the cost value of all initial transmission solutions for the target vehicle.

[0095] Step S203: Determine the transmission cost of the initial transmission solution based on the cost of the initial transmission solution and the cost of the target vehicle.

[0096] In this embodiment, the terminal sums the cost of each initial transmission solution with the cost of the target vehicle to obtain the transmission cost of the initial transmission solution. The cost of the target vehicle is negative, while the cost of the initial transmission solution is positive.

[0097] Based on the above scheme, the transmission cost of each initial transmission solution is calculated by using the dispersion of the target vehicles and the initial transmission solution. This provides reference data for the dispersion-constrained optimal transmission algorithm during subsequent adjustment iterations, thereby improving the accuracy of the calculated optimal transmission solution.

[0098] Optionally, the method further includes: calculating the evaluation value of the optimal transmission solution for each target vehicle using an evaluation function; selecting the target optimal transmission solutions corresponding to each evaluation value that is greater than a preset evaluation threshold from among the evaluation values; inputting each target optimal transmission solution, the first target vehicle corresponding to each target optimal transmission solution, the first station corresponding to each target optimal transmission solution, and the transmission cost information from each first target vehicle to the first station into the distributed constraint optimal transmission algorithm, and training the distributed constraint optimal transmission algorithm to obtain the optimized distributed constraint optimal transmission algorithm.

[0099] In this embodiment, the terminal presets an evaluation threshold and, for each target vehicle, calculates the evaluation value of its optimal transmission solution using an evaluation function. From the evaluation values ​​of each target vehicle's optimal transmission solutions, the terminal selects the optimal transmission solutions corresponding to evaluation values ​​greater than the preset evaluation threshold as target optimal transmission solutions, designates the target vehicle corresponding to this target transmission solution as the first target vehicle, and the station corresponding to this target optimal transmission solution as the first station. The terminal inputs each target optimal transmission solution, the corresponding first target vehicle, the corresponding first station, and the transmission cost information from each first target vehicle to the first station into the distributed constraint optimal transmission algorithm, and trains the algorithm to obtain an optimized distributed constraint optimal transmission algorithm. The evaluation function can be any evaluation function capable of implementing the above operations.

[0100] Based on the above scheme, the computational accuracy of the distributed constraint optimal transmission algorithm is improved by optimizing the algorithm.

[0101] Optionally, the location information of the center of gravity of each target vehicle group is obtained, including: for each target vehicle group, connecting the location information of all target vehicles in the target vehicle group to obtain the area range of the target vehicle group; and determining the location information of the target vehicle group based on the area range of the target vehicle group and the center of gravity solution algorithm.

[0102] In this embodiment, for each target vehicle group, the terminal connects the position information of each target vehicle in the target vehicle group with straight lines in a geodetic coordinate system. The terminal defines the area enclosed by all the connecting lines as the region of the target vehicle group. The terminal defines the line connecting the edges of this region as the boundary line of the region, and inputs the position information of the target vehicles corresponding to the boundary line into the centroid calculation algorithm for centroid calculation processing to obtain the position information of the target vehicle group.

[0103] Based on the above scheme, the location information of the target vehicle group is calculated to provide reference data for subsequent calculation of the dispersion of each target vehicle.

[0104] Optionally, the transmission cost information from each target vehicle to each station is obtained, including: determining the transmission range from the target vehicle to the station based on the location information of each target vehicle in each target vehicle group and the location information of each station, and obtaining the environmental information of the transmission range; for each target vehicle, connecting the location information of the target vehicle with the location information of each station to obtain the straight transmission route from the target vehicle to each station, and determining the actual transmission route from the target vehicle to each station based on the location information of the target vehicle, the location information of each station, and the environmental information of the transmission range from the target vehicle to each station; for each station, determining the transmission cost information from the target vehicle to the station based on the straight transmission route from the target vehicle to the station and the actual transmission route from the target vehicle to the station.

[0105] In this embodiment, for each target vehicle and each station, the terminal determines the transmission range from the target vehicle to the station based on the location information of the target vehicle and the station. The terminal acquires environmental information for each transmission range, which may include, but is not limited to, information such as slope changes, number of traffic lights, road congestion level, number of bridges, number of streets, and number of obstacles. For each target vehicle, the terminal performs a straight-line connection processing between the location information of the target vehicle and each station to obtain the straight-line transmission route from the target vehicle to each station. Based on the environment of the transmission range from the object's location information to the location information of each station, the terminal determines the actual transmission distance from the target vehicle to each station. For each station, the terminal calculates the straight-line transmission route from the target vehicle to that station, and the transmission difference between the target vehicle's distance to that station and the actual transmission route. This transmission difference is a distinguishing value for different features, such as the difference between the straight-line transmission route distance and the actual transmission route distance, the difference between the straight-line transmission route distance and the actual transmission route number of obstacles, the difference between the straight-line transmission route distance and the actual transmission route number of traffic lights, the difference between the straight-line transmission route distance and the actual transmission route number of bridges, and the difference between the straight-line transmission route distance and the actual transmission route number of streets. The terminal uses this transmission difference as the transmission cost information from the target vehicle to that station. Similarly, through the above scheme, the terminal obtains the transmission cost information from each target vehicle to each station.

[0106] Based on the above scheme, the transmission cost information of the target vehicle to the station is determined by the straight transmission route from the target vehicle to the station and the actual transmission route from the target vehicle to the station, providing reference data for subsequent calculation of the optimal transmission solution.

[0107] This application also provides a vehicle transmission example, as shown in Figure 3, the specific processing steps of which include the following:

[0108] Step S301: Obtain the location information of each target vehicle in each target vehicle group, as well as the location information of multiple stations.

[0109] Step S302: For each target vehicle group, connect the location information of all target vehicles in the target vehicle group to obtain the area range of the target vehicle group.

[0110] Step S303: Determine the location information of the target vehicle group based on the area range of the target vehicle group and the center of gravity solution algorithm.

[0111] Step S304: Based on the location information of each target vehicle in each target vehicle group and the location information of each station, determine the transmission range from the target vehicle to the station, and obtain the environmental information of the transmission range.

[0112] Step S305: For each target vehicle, connect the location information of the target vehicle with the location information of each station to obtain the straight-line transmission route from the target vehicle to each station. Based on the location information of the target vehicle, the location information of each station, and the environmental information of the transmission range from the target vehicle to each station, determine the actual transmission route from the target vehicle to each station.

[0113] Step S306: For each station, determine the transmission cost information from the target vehicle to the station based on the straight transmission route from the target vehicle to the station and the actual transmission route from the target vehicle to the station.

[0114] Step S307: Determine the dispersion of the target vehicles based on the location information of each target vehicle and the location information of each target vehicle in the target vehicle group.

[0115] Step S308: For each target vehicle, based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, calculate the initial transmission solution from the target vehicle to each station using the distributed constraint optimal transmission algorithm corresponding to the target vehicle to each station.

[0116] Step S309: For the location information of each station, determine the transmission distance of the target vehicle based on the location information of the target vehicle and the location information of the station.

[0117] Step S310: Based on the transmission distance and the transmission cost information from the target vehicle to the station, the initial transmission solution from the target vehicle to the station is obtained through the distributed constraint optimal transmission algorithm corresponding to the target vehicle to the station.

[0118] Step S311: Determine the cost of the target vehicle based on the dispersion of the target vehicle and the transmission cost algorithm.

[0119] Step S312: For each initial transmission solution, calculate the cost of the initial transmission solution using the transmission cost algorithm.

[0120] Step S313: Determine the transmission cost of the initial transmission solution based on the cost of the initial transmission solution and the cost of the target vehicle.

[0121] Step S314: Among each transmission cost, select the parameter values ​​of the distributed constraint optimal transmission algorithm corresponding to the minimum transmission cost, update the parameter values ​​of the distributed constraint optimal transmission algorithm corresponding to each target vehicle to each station, and return to execute step S309 until the preset number of iterations is met.

[0122] Step S315: Based on the initial transmission solution corresponding to the minimum transmission cost value among the transmission cost values ​​obtained in the last iteration, determine the target station corresponding to the target vehicle and the target route information from the target vehicle to the target station.

[0123] It should be understood that although the steps in the flowcharts of the embodiments described above are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the embodiments described above may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages of other steps.

[0124] Based on the same inventive concept, this application also provides a vehicle transmission device for implementing the vehicle route determination method described above. The solution provided by this device is similar to the implementation described in the above method; therefore, the specific limitations in one or more vehicle route determination device embodiments provided below can be found in the limitations of the vehicle transmission method described above, and will not be repeated here.

[0125] In one embodiment, as shown in FIG4, a vehicle route determination device is provided, comprising: an acquisition module 410, a determination module 420, a calculation module 430, an iteration module 440, and a filtering module 450, wherein:

[0126] The acquisition module 410 is used to acquire the location information of each target vehicle in each target vehicle group, the location information of each target vehicle group, the location information of multiple stations, and the transmission cost information from each target vehicle to each station; the location information of the target vehicle group is the location information of the center of gravity of the target vehicle group.

[0127] The determining module 420 is used to determine the dispersion of the target vehicles based on the location information of each target vehicle and the location information of each target vehicle in the target vehicle group.

[0128] The calculation module 430 is used to calculate the initial transmission solution from the target vehicle to each station for each target vehicle based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, using the distributed constraint optimal transmission algorithm corresponding to the target vehicle to each station, and to calculate the transmission cost value of each initial transmission solution of the target vehicle based on each initial transmission solution of the target vehicle and the dispersion degree of the target vehicle.

[0129] The iteration module 440 is used to filter the parameter values ​​of the distributed constraint optimal transmission algorithm corresponding to the minimum transmission cost value among the transmission cost values, update the parameter values ​​of the distributed constraint optimal transmission algorithm corresponding to each target vehicle to each station, and return the execution steps of calculating the initial transmission solution from the target vehicle to each station based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, through the distributed constraint optimal transmission algorithm corresponding to each target vehicle to each station, until the preset number of iterations is met;

[0130] The filtering module 450 is used to determine the target station corresponding to the target vehicle and the target route information from the target vehicle to the target station based on the initial transmission solution corresponding to the minimum transmission cost value among the transmission cost values ​​obtained in the last iteration.

[0131] Optionally, the computing module 430 is specifically used for:

[0132] For each station's location information, the transmission distance of the target vehicle is determined based on the target vehicle's location information and the station's location information.

[0133] Based on the transmission distance and the transmission cost information from the target vehicle to the station, the initial transmission solution from the target vehicle to the station is obtained through the distributed constraint optimal transmission algorithm corresponding to the target vehicle to the station.

[0134] Optionally, the computing module 430 is specifically used for:

[0135] Based on the dispersion of the target vehicles and the transmission cost algorithm, the cost of the target vehicles is determined.

[0136] For each initial transmission solution, the cost value of the initial transmission solution is calculated using a transmission cost algorithm;

[0137] The transmission cost of the initial transmission solution is determined based on the cost of the initial transmission solution and the cost of the target vehicle.

[0138] Optionally, the device further includes:

[0139] The evaluation module is used to calculate the evaluation value of the optimal transmission solution for each target vehicle using an evaluation function.

[0140] The judgment module is used to filter the target optimal transmission solution corresponding to each evaluation value that is greater than a preset evaluation threshold from the evaluation values.

[0141] The optimization module is used to input the optimal transmission solutions for each target, the first target vehicle corresponding to each optimal transmission solution, the first station corresponding to each optimal transmission solution, and the transmission cost information from each first target vehicle to the first station into the distributed constraint optimal transmission algorithm, and to train the distributed constraint optimal transmission algorithm to obtain the optimized distributed constraint optimal transmission algorithm.

[0142] Optionally, the acquisition module 410 is specifically used for:

[0143] For each target vehicle group, the location information of all target vehicles in the target vehicle group is connected to obtain the area range of the target vehicle group;

[0144] The location information of the target vehicle group is determined based on the area range of the target vehicle group and the centroid solution algorithm.

[0145] Optionally, the acquisition module 410 is specifically used for:

[0146] Based on the location information of each target vehicle in each target vehicle group and the location information of each station, the transmission range from the target vehicle to the station is determined, and the environmental information of the transmission range is obtained.

[0147] For each target vehicle, the location information of the target vehicle is connected with the location information of each station to obtain the straight-line transmission route from the target vehicle to each station. Based on the location information of the target vehicle, the location information of each station, and the environmental information of the transmission range from the target vehicle to each station, the actual transmission route from the target vehicle to each station is determined.

[0148] For each station, the transmission cost information from the target vehicle to the station is determined based on the straight transmission route from the target vehicle to the station and the actual transmission route from the target vehicle to the station.

[0149] The modules in the aforementioned vehicle route determination device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device, or stored in the memory of a computer device as software, so that the processor can call and execute the operations corresponding to each module.

[0150] In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as shown in Figure 5. The computer device includes a processor, memory, communication interface, display screen, and input device connected via a system bus. The processor of the computer device provides computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and internal memory. The non-volatile storage medium stores an operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage medium. The communication interface of the computer device is used for wired or wireless communication with external terminals. Wireless communication can be achieved through Wi-Fi, mobile cellular networks, NFC (Near Field Communication), or other technologies. When the computer program is executed by the processor, it implements a method for determining vehicle routes. The display screen of the computer device may be a liquid crystal display (LCD) or an e-ink display. The input device of the computer device may be a touch layer covering the display screen, or buttons, a trackball, or a touchpad located on the casing of the computer device, or an external keyboard, touchpad, or mouse, etc.

[0151] Those skilled in the art will understand that the structure shown in Figure 5 is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or may combine certain components, or may have different component arrangements.

[0152] In one embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps of the method described in any one of the first aspects.

[0153] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the steps of the method described in any one of the first aspects.

[0154] In one embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps of the method described in any one of the first aspects.

[0155] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties.

[0156] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, etc., and are not limited to these.

[0157] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0158] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of this patent application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this application should be determined by the appended claims.

Claims

1. A method for determining a vehicle route, characterized in that, The method includes: acquiring the location information of each target vehicle in each target vehicle group, the location information of each target vehicle group, the location information of multiple stations, and the transmission cost information from each target vehicle to each station; the location information of the target vehicle group is the location information of the center of gravity of the target vehicle group; calculating the dispersion of each target vehicle from its location information and the location information of the target vehicle group to which it belongs using a dispersion algorithm; the dispersion degree represents the dispersion of the target vehicle in the target vehicle group to which it belongs; for each target vehicle, based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, calculating the initial transmission solution from the target vehicle to each station using a dispersion-constrained optimal transmission algorithm corresponding to the target vehicle to each station, and according to the target... Given the initial transmission solutions for each vehicle and the dispersion of the target vehicle, calculate the transmission cost value of each initial transmission solution for the target vehicle. Among the transmission costs, select the parameter values ​​of the dispersion-constrained optimal transmission algorithm corresponding to the minimum transmission cost value, update the parameter values ​​of the dispersion-constrained optimal transmission algorithm corresponding to each station from the target vehicle, and return to execute the step of calculating the initial transmission solution from the target vehicle to each station using the dispersion-constrained optimal transmission algorithm corresponding to each station based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, until a preset number of iterations is met. Based on the initial transmission solution corresponding to the minimum transmission cost value among the transmission costs obtained in the last iteration, determine the target station corresponding to the target vehicle and the target route information from the target vehicle to the target station.

2. The method according to claim 1, characterized in that, The step of calculating the initial transmission solution from the target vehicle to each station based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, using the distributed constraint optimal transmission algorithm corresponding to the target vehicle to each station, includes: determining the transmission distance of the target vehicle based on the location information of each station, according to the location information of the target vehicle and the location information of the station; and obtaining the initial transmission solution from the target vehicle to the station based on the transmission distance and the transmission cost information from the target vehicle to the station, using the distributed constraint optimal transmission algorithm corresponding to the target vehicle to the station.

3. The method according to claim 1, characterized in that, The step of calculating the transmission cost of each initial transmission solution of the target vehicle based on each initial transmission solution of the target vehicle and the dispersion of the target vehicle includes: determining the cost of the target vehicle based on the dispersion of the target vehicle and the transmission cost algorithm; calculating the cost of each initial transmission solution using the transmission cost algorithm; and determining the transmission cost of the initial transmission solution based on the cost of the initial transmission solution and the cost of the target vehicle.

4. The method according to claim 1, characterized in that, The method further includes: calculating the evaluation value of the optimal transmission solution for each target vehicle using an evaluation function; selecting the target optimal transmission solutions corresponding to evaluation values ​​greater than a preset evaluation threshold from among the evaluation values; inputting each target optimal transmission solution, the first target vehicle corresponding to each target optimal transmission solution, the first station corresponding to each target optimal transmission solution, and the transmission cost information from each first target vehicle to the first station into the distributed constraint optimal transmission algorithm, and training the distributed constraint optimal transmission algorithm to obtain an optimized distributed constraint optimal transmission algorithm.

5. The method according to claim 1, characterized in that, The step of obtaining the location information of each target vehicle group includes: for each target vehicle group, connecting the location information of all target vehicles in the target vehicle group to obtain the area range of the target vehicle group; and determining the location information of the target vehicle group based on the area range of the target vehicle group and the centroid solution algorithm.

6. The method according to claim 1, characterized in that, The step of obtaining the transmission cost information from each target vehicle to each station includes: determining the transmission range from the target vehicle to the station based on the location information of each target vehicle in each target vehicle group and the location information of each station, and obtaining the environmental information of the transmission range; for each target vehicle, connecting the location information of the target vehicle with the location information of each station to obtain the straight-line transmission route from the target vehicle to each station, and determining the actual transmission route from the target vehicle to each station based on the location information of the target vehicle, the location information of each station, and the environmental information of the transmission range from the target vehicle to each station; for each station, determining the transmission cost information from the target vehicle to the station based on the straight-line transmission route from the target vehicle to the station and the actual transmission route from the target vehicle to the station.

7. A device for determining vehicle routes, characterized in that, The device includes: an acquisition module, configured to acquire the location information of each target vehicle in each target vehicle group, the location information of each target vehicle group, the location information of multiple stations, and the transmission cost information from each target vehicle to each station; the location information of the target vehicle group is the location information of the center of gravity of the target vehicle group; a determination module, configured to calculate the dispersion of each target vehicle from the location information of each target vehicle and the location information of the target vehicle group to which each target vehicle belongs, respectively, using a dispersion algorithm; the dispersion degree represents the dispersion of the target vehicle in the target vehicle group to which the target vehicle belongs; and a calculation module, configured to, for each target vehicle, based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, calculate the initial transmission solution from the target vehicle to each station using a dispersion-constrained optimal transmission algorithm corresponding to the target vehicle to each station, and according to... The initial transmission solutions of the target vehicle and the dispersion of the target vehicle are used to calculate the transmission cost of each initial transmission solution of the target vehicle. An iteration module is used to filter the parameter values ​​of the dispersion-constrained optimal transmission algorithm corresponding to the minimum transmission cost among the transmission cost values, update the parameter values ​​of the dispersion-constrained optimal transmission algorithm corresponding to each station from the target vehicle, and return the execution step of calculating the initial transmission solution from the target vehicle to each station using the dispersion-constrained optimal transmission algorithm corresponding to each station based on the location information of the target vehicle, the location information of each station, and the transmission cost information from the target vehicle to each station, until a preset number of iterations is met. A filtering module is used to determine the target station corresponding to the target vehicle and the target route information from the target vehicle to the target station based on the initial transmission solution corresponding to the minimum transmission cost among the transmission cost values ​​obtained in the last iteration.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 6.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 6.

Images