Driving route selection method, device, computer readable medium and electronic device
By acquiring and calculating the waiting time at service counters in the vehicle's planned route, the route with the shortest waiting time or the shortest total duration is selected, solving the problem of inaccurate route selection in existing technologies and achieving more reasonable route selection.
Patent Information
- Application Number
- CN201911182238.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2019-11-27
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2040-01-17
AI Technical Summary
Existing technologies typically select the route with the shortest mileage when choosing a vehicle's route, resulting in a non-optimal route selection and a lack of accuracy and rationality in considering service counter waiting times.
By obtaining the planned route from the vehicle's starting point to its destination and the information on the service counters it includes, the waiting time at the service counters along each route is calculated, and the route with the shortest waiting time or the shortest total duration is selected as the driving route.
It improves the accuracy and rationality of route selection, takes into account the waiting time at the service counter, and selects a more suitable route.
Smart Images

Figure CN110926490B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the fields of computer and communication technology, and more specifically, to a method, apparatus, computer-readable medium, and electronic device for selecting a driving route. Background Technology
[0002] In related technologies, when determining the driving route of a vehicle from the starting point to the destination, the route with the shortest mileage is usually selected from the planned routes between the starting point and the destination. However, the driving route selected in this way is not the optimal driving route. Summary of the Invention
[0003] The embodiments of this application provide a method, apparatus, computer-readable medium, and electronic device for selecting driving routes, which can at least to some extent improve the accuracy and rationality of driving route selection.
[0004] Other features and advantages of this application will become apparent from the following detailed description, or may be learned in part from practice of this application.
[0005] According to one aspect of the embodiments of this application, a method for selecting a driving route is provided, comprising: obtaining at least one planned route from the starting position of a vehicle to the destination position, and information on each service counter included in each planned route; determining the waiting time required for the vehicle to travel along each planned route based on the information on each service counter included in each planned route; and selecting the driving route of the vehicle from the at least one planned route based on the waiting time required for the vehicle to travel along each planned route.
[0006] According to one aspect of the embodiments of this application, a route selection device is provided, comprising: an acquisition unit configured to acquire at least one planned route from a vehicle's starting position to a destination position, and information on each service station included in each planned route; a determination unit configured to determine, based on the information on each service station included in each planned route, the waiting time required for the vehicle to travel along each planned route; and a selection unit configured to select a route for the vehicle from the at least one planned route based on the waiting time corresponding to each planned route.
[0007] In some embodiments of this application, based on the foregoing scheme, the determining unit is configured to: calculate the waiting time of the vehicle at each service station included in each planned route according to the information of each service station included in each planned route; and determine the waiting time required for the vehicle to travel along each planned route based on the waiting time of the vehicle at each service station included in each planned route.
[0008] In some embodiments of this application, based on the foregoing scheme, the information of each service station includes the number of vehicles served by each service station within a unit time, the number of vehicles waiting for service at each service station, and the number of vehicles arriving at each service station within a unit time; the determining unit is configured to: calculate the number of vehicles that each service station needs to serve when a vehicle travels from the starting position to the location of each service station, based on the number of vehicles served by each service station within a unit time, the number of vehicles waiting for service at each service station, the number of vehicles arriving at each service station within a unit time, and the time taken for a vehicle to travel from the starting position to the location of each service station; and calculate the waiting time of a vehicle at each service station based on the number of vehicles that each service station needs to serve and the number of vehicles served by each service station within a unit time.
[0009] In one embodiment of this application, the determining unit is configured to calculate the waiting time of the vehicle at each service counter included in each planned route using the following formula:
[0010]
[0011] Among them, w i,j q represents the waiting time of a vehicle at the j-th service counter included in the i-th planned route; i,j μ represents the number of vehicles waiting for service at the j-th service counter included in the i-th planned route; i,j λ represents the number of vehicles served by the j-th service station within a unit of time in the i-th planned route; i,j t represents the number of vehicles arriving at the j-th service station included in the i-th planned route per unit time; i,j This represents the time it takes for a vehicle to travel from its starting position along the i-th planned route to the j-th service station.
[0012] In some embodiments of this application, based on the foregoing scheme, when information about each service station included in each planned route is obtained from a designated device, the determining unit is configured to: determine the waiting time of the vehicle at each service station included in each planned route based on the information about each service station included in each planned route and the information acquisition delay with the designated device.
[0013] In some embodiments of this application, based on the foregoing scheme, the information of each service station includes the number of vehicles served by each service station within a unit time, the number of vehicles waiting for service at each service station, and the number of vehicles arriving at each service station within a unit time; the determining unit is configured to: calculate the number of vehicles that each service station needs to serve when a vehicle arrives at the location of each service station from the starting position, based on the number of vehicles served by each service station within a unit time, the number of vehicles waiting for service at each service station, the number of vehicles arriving at each service station within a unit time, the time taken for a vehicle to travel from the starting position to the location of each service station, and the information acquisition delay with the designated device; and calculate the waiting time of vehicles at each service station based on the number of vehicles that each service station needs to serve and the number of vehicles served by each service station within a unit time.
[0014] In one embodiment of this application, the determining unit is configured to calculate the waiting time of the vehicle at each service counter included in each planned route using the following formula:
[0015]
[0016] Among them, w i,j q represents the waiting time of a vehicle at the j-th service counter included in the i-th planned route; i,j μ represents the number of vehicles waiting for service at the j-th service counter included in the i-th planned route; i,j λ represents the number of vehicles served by the j-th service station within a unit of time in the i-th planned route; i,j t represents the number of vehicles arriving at the j-th service station included in the i-th planned route per unit time; i,j Δt represents the time it takes for a vehicle to travel from its starting position along the i-th planned route to the j-th service station, and Δt represents the information acquisition delay with the designated device.
[0017] In some embodiments of this application, based on the foregoing scheme, the determining unit is further configured to: determine the information acquisition delay with the designated device based on the timestamp contained in the information sent by the designated device and the local timestamp when the information sent by the designated device is received.
[0018] In some embodiments of this application, based on the foregoing scheme, the determining unit is further configured to: obtain the travel time of the vehicle from the starting position to the j-th service station when traveling along the i-th planned route, and the waiting time of the vehicle at each service station before the j-th service station; and calculate the time t taken by the vehicle to travel from the starting position to the j-th service station along the i-th planned route based on the travel time of the vehicle from the starting position to the j-th service station and the waiting time of the vehicle at each service station before the j-th service station. i,j .
[0019] In some embodiments of this application, based on the foregoing scheme, the determining unit is configured to: accumulate the travel time of the vehicle from the starting position to the j-th service station and the waiting time of the vehicle at each service station before the j-th service station, to obtain the time t taken by the vehicle to travel from the starting position to the j-th service station along the i-th planned route. i,j .
[0020] In some embodiments of this application, based on the foregoing scheme, the determining unit is configured to: accumulate the waiting time of the vehicle at each service counter included in each planned route to obtain the waiting time corresponding to each planned route.
[0021] In some embodiments of this application, based on the foregoing scheme, the acquisition unit is configured to: acquire at least one planned route whose mileage between the starting position and the destination position is less than or equal to a predetermined value, according to the starting position and the destination position.
[0022] In some embodiments of this application, based on the foregoing scheme, the selection unit is configured to: select the planned route with the shortest required waiting time from the at least one planned route as the driving route of the vehicle.
[0023] In some embodiments of this application, based on the foregoing scheme, the selection unit is configured to: calculate the travel time of the vehicle along each planned route based on the mileage of each planned route; calculate the total travel time of the vehicle along each planned route based on the waiting time corresponding to each planned route and the travel time of the vehicle along each planned route; and select the planned route with the shortest total travel time from the at least one planned route as the vehicle's travel route.
[0024] According to one aspect of the embodiments of this application, a computer-readable medium is provided having a computer program stored thereon, which, when executed by a processor, implements the route selection method as described in the above embodiments.
[0025] According to one aspect of the embodiments of this application, an electronic device is provided, including: one or more processors; and a storage device for storing one or more programs, which, when executed by the one or more processors, cause the one or more processors to implement the route selection method as described in the above embodiments.
[0026] In some embodiments of this application, the technical solutions provided calculate the waiting time required for a vehicle to travel along each planned route based on the information of each service counter included in each planned route. Based on the waiting time required for the vehicle to travel along each planned route, a driving route for the vehicle is selected from at least one planned route. This allows the selection of a driving route to take into account each service counter included in the planned route and the waiting time required for the vehicle at each service counter, thereby selecting a more suitable driving route and improving the accuracy and rationality of the driving route selection.
[0027] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and do not limit this application. Attached Figure Description
[0028] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application. It is obvious that the drawings described below are merely some embodiments of this application, and those skilled in the art can obtain other drawings based on these drawings without any inventive effort. In the drawings:
[0029] Figure 1 A schematic diagram of an exemplary system architecture to which the technical solutions of the embodiments of this application can be applied is shown;
[0030] Figure 2 A flowchart of a method for selecting a driving route according to an embodiment of this application is shown;
[0031] Figure 3 A flowchart illustrating the calculation of waiting time required for a vehicle to travel along each planned route, according to one embodiment of this application, is shown.
[0032] Figure 4 A schematic diagram of a planned route according to an embodiment of this application is shown;
[0033] Figure 5 A block diagram of a route selection device according to an embodiment of this application is shown;
[0034] Figure 6A schematic diagram of the structure of a computer system suitable for implementing the electronic device of the present application is shown. Detailed Implementation
[0035] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided to make this application more comprehensive and complete, and to fully convey the concept of the exemplary embodiments to those skilled in the art.
[0036] Furthermore, the described features, structures, or characteristics can be combined in any suitable manner in one or more embodiments. Numerous specific details are provided in the following description to give a thorough understanding of embodiments of this application. However, those skilled in the art will recognize that the technical solutions of this application can be practiced without one or more of the specific details, or other methods, components, apparatuses, steps, etc., can be employed. In other instances, well-known methods, apparatuses, implementations, or operations are not shown or described in detail to avoid obscuring various aspects of this application.
[0037] The block diagrams shown in the accompanying drawings are merely functional entities and do not necessarily correspond to physically independent entities. That is, these functional entities can be implemented in software, in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.
[0038] The flowcharts shown in the accompanying drawings are merely illustrative and do not necessarily include all content and operations / steps, nor do they necessarily have to be performed in the described order. For example, some operations / steps can be broken down, while others can be combined or partially combined; therefore, the actual execution order may change depending on the specific circumstances.
[0039] Figure 1 A schematic diagram of an exemplary system architecture to which the technical solutions of the embodiments of this application can be applied is shown.
[0040] like Figure 1 As shown, system architecture 100 may include vehicle terminal 101, network 102, and server 103. Network 102 serves as the medium for providing a communication link between vehicle terminal 101 and server 103. Network 102 may include various connection types, such as wired communication links, wireless communication links, etc. It should be understood that... Figure 1 The number of vehicle terminals 101 and servers 103 shown is merely illustrative; any number of vehicle terminals 101 and servers 103 can be used depending on implementation needs. For example, server 103 can be a server cluster composed of multiple servers.
[0041] In one embodiment of this application, a user can input the desired destination on the vehicle terminal 101, and the vehicle terminal 101 can then generate at least one planned route based on the vehicle's starting position (which may be the current position of the vehicle terminal 101) and the destination location. Alternatively, the vehicle terminal 101 can send its starting position and the destination location to the server 103 via the network 102, so that the server 103 can generate at least one planned route based on the vehicle terminal 101's starting position and destination location, and then send it back to the vehicle terminal 101.
[0042] In one embodiment of this application, the vehicle terminal 101, upon acquiring at least one planned route, can obtain information about each service station included in the planned route from the server 103. The information about each service station may include the number of vehicles served by each service station per unit time, the number of vehicles waiting for service at each service station, and the number of vehicles arriving at each service station per unit time. After acquiring the information about each service station included in each planned route, the vehicle terminal 101 can calculate the waiting time required for the vehicle terminal 101 to travel along each planned route (this waiting time includes the waiting time when the vehicle terminal 101 passes each service station). Then, based on the waiting time required for the vehicle terminal 101 to travel along each planned route, a travel route for the vehicle terminal 101 is selected from these at least one planned route. For example, the planned route with the shortest required waiting time can be selected as the travel route for the vehicle terminal 101; or the planned route with the shortest total travel time can be selected as the travel route for the vehicle terminal 101.
[0043] As can be seen, since the technical solution of this application takes into account the waiting time of each service station and vehicle in the planned route, a more suitable driving route can be selected, thus improving the accuracy and rationality of the driving route selection.
[0044] It should be noted that the route selection method provided in this application embodiment can be executed by the vehicle terminal 101, and correspondingly, the route selection device can be set in the vehicle terminal 101. However, in other embodiments of this application, the server 103 may also have similar functions to the vehicle terminal 101, thereby executing the route selection scheme provided in this application embodiment.
[0045] The implementation details of the technical solutions in the embodiments of this application are described in detail below:
[0046] Figure 2A flowchart illustrating a route selection method according to an embodiment of this application is shown. This route selection method can be executed by a processor, which can be a processor within a vehicle terminal (e.g., the processor of an onboard computer installed in the vehicle, or the driver's smart terminal seated in the vehicle), or a processor within a server. (Refer to...) Figure 2 As shown, the method for selecting the driving route includes at least steps S210 to S230, which are described in detail below:
[0047] In step S210, at least one planned route from the vehicle's starting position to its destination position is obtained, along with information about each service station included in each planned route.
[0048] In one embodiment of this application, at least one planned route between the vehicle's starting position and destination position can be generated by the vehicle based on its starting position (which may be the vehicle's current position) and destination position. Alternatively, the vehicle can send its starting position and destination position to a server via a network, and the server can generate and send back a route to the vehicle based on the vehicle's starting position and destination position. The service counters included in the planned route can be any facility that can provide service resources to the vehicle, such as toll booths, gas stations, bus stations, repair shops, road departments, transportation departments, etc.
[0049] In step S220, the waiting time required for the vehicle to travel along each planned route is calculated based on the information of each service station included in each planned route.
[0050] In one embodiment of this application, such as Figure 3 As shown, the process of calculating the waiting time required for a vehicle to travel along each planned route, based on the information of each service counter included in each planned route, may include the following steps S310 and S320, which are described in detail below:
[0051] In step S310, the waiting time of the vehicle at each service station included in each planned route is calculated based on the information of each service station included in each planned route.
[0052] In one embodiment of this application, the information of the service counter may include the number of vehicles served by the service counter per unit time, the number of vehicles waiting for service at the service counter, and the number of vehicles arriving at the service counter per unit time. The unit time may be 1 minute, 1 hour, etc.
[0053] In one embodiment of this application, the number of vehicles that each service station needs to serve when a vehicle arrives at the location of each service station can be calculated based on the number of vehicles served by each service station within a unit time, the number of vehicles waiting for service at each service station, the number of vehicles arriving at each service station within a unit time, and the time taken for a vehicle to travel from its starting position to the location of each service station. Then, based on the number of vehicles that each service station needs to serve and the number of vehicles served by each service station within a unit time, the waiting time of the vehicle at each service station can be calculated.
[0054] In one embodiment of this application, when determining the time it takes for a vehicle to travel from its starting position to each service counter, the travel time from the starting position to each service counter along each planned route, and the waiting time at each service counter before each service counter, can be obtained. Then, based on the travel time from the starting position to each service counter and the waiting time at each service counter before each service counter, the total time taken for the vehicle to travel from the starting position to each service counter can be calculated. For example, the travel time from the starting position to each service counter and the waiting time at each service counter before each service counter can be summed to obtain the total time taken for the vehicle to travel from the starting position to each service counter.
[0055] Specifically, in one embodiment of this application, the waiting time of a vehicle at each service counter included in each planned route can be calculated using the following formula (1):
[0056]
[0057] Among them, w i,j q represents the waiting time of a vehicle at the j-th service counter included in the i-th planned route; i,j μ represents the number of vehicles waiting for service at the j-th service counter included in the i-th planned route; i,j λ represents the number of vehicles served by the j-th service station within a unit of time in the i-th planned route; i,j t represents the number of vehicles arriving at the j-th service station included in the i-th planned route per unit time; i,j This represents the time it takes for a vehicle to travel from its starting position along the i-th planned route to the j-th service station.
[0058] In one embodiment of this application, the time taken for a vehicle to travel from its starting position to the j-th service station along the i-th planned route includes: the travel time from the starting position to the j-th service station (wherein, the travel time does not include the waiting time at the service station and is the time the vehicle spends traveling on the road), and the waiting time at each service station before the j-th service station.
[0059] Specifically, the waiting time for the vehicle at the first service counter included in the i-th planned route is... Since it is the first service counter, therefore t i,1 This is the travel time for the vehicle to travel from its starting position to the first service counter;
[0060] The waiting time for the vehicle at the second service counter included in the i-th planned route is . Since it's the second service counter, therefore t i,2 This refers to the travel time from the starting point to the second service counter via the first service counter, and the waiting time (w) at the first service counter. i,1 ;
[0061] The waiting time for the vehicle at the third service counter included in the i-th planned route is . Since it is the third service counter, therefore t i,3 This refers to the travel time of the vehicle from its starting point, through the first and second service counters, to the third service counter, and the waiting time (w) at the first service counter. i,1 and the waiting time of the vehicle at the second service counter w i,2 ;
[0062] The waiting time for a vehicle at the j-th service counter included in the i-th planned route is . Since it is the j-th service desk, therefore t i,j This refers to the travel time of the vehicle from its starting position, passing through the first service counter, the second service counter, ..., and the (j-1)th service counter to the jth service counter, as well as the waiting time w of the vehicle at the first service counter. i,1 The waiting time for the vehicle at the second service counter (w) i,2 ..., the waiting time w for the vehicle at the (j-1)th service counter i,j-1 .
[0063] In a specific example, such as Figure 4As shown, a planned route includes service counter 1, service counter 2, service counter 3 and service counter 4. The path length between the starting position and service counter 1 is s1, the path length between service counter 1 and service counter 2 is s2, the path length between service counter 2 and service counter 3 is s3, the path length between service counter 3 and service counter 4 is s4, and the path length between service counter 4 and the destination position is s5.
[0064] based on Figure 4 In the example shown, the time taken for the vehicle to travel from the starting position to service counter 1 includes the time taken for the vehicle to travel s1; the time taken for the vehicle to travel from the starting position to service counter 2 includes the time taken for the vehicle to travel s1 and s2, as well as the time taken for the vehicle to wait at service counter 1; the time taken for the vehicle to travel from the starting position to service counter 3 includes the time taken for the vehicle to travel s1, s2, and s3, as well as the time taken for the vehicle to wait at service counter 1 and service counter 2; the time taken for the vehicle to travel from the starting position to service counter 4 includes the time taken for the vehicle to travel s1, s2, s3, and s4, as well as the time taken for the vehicle to wait at service counter 1, service counter 2, and service counter 3.
[0065] In one embodiment of this application, if the processor obtains information about each service station included on each planned route from a designated device, there may be an information acquisition delay between the processor and the designated device. In this case, when calculating the waiting time of the vehicle at each service station included on each planned route, the information acquisition delay between the processor and the designated device needs to be taken into account, so as to ensure that the calculated waiting time is more accurate.
[0066] In one embodiment of this application, the information acquisition delay between the processor and the specified device can be calculated based on the timestamp contained in the information sent by the specified device and the local timestamp of the processor when it receives the information sent by the specified device. That is, the difference between the two timestamps is taken as the information acquisition delay between the processor and the specified device.
[0067] In one embodiment of this application, considering the information acquisition delay between the processor and the designated device, the number of vehicles that each service station needs to serve when a vehicle travels from its starting position to the location of each service station can be calculated based on the number of vehicles served by each service station per unit time, the number of vehicles waiting for service at each service station, the number of vehicles arriving at each service station per unit time, the time taken for a vehicle to travel from its starting position to each service station, and the information acquisition delay with the designated device. Then, based on the number of vehicles that each service station needs to serve and the number of vehicles served by each service station per unit time, the waiting time of the vehicle at each service station can be calculated.
[0068] Specifically, in one embodiment of this application, when considering the information acquisition delay between the processor and the designated device, the waiting time of the vehicle at each service station included in each planned route can be calculated using the following formula (2):
[0069]
[0070] Among them, w i,j q represents the waiting time of a vehicle at the j-th service counter included in the i-th planned route; i,j μ represents the number of vehicles waiting for service at the j-th service counter included in the i-th planned route; i,j λ represents the number of vehicles served by the j-th service station within a unit of time in the i-th planned route; i,j t represents the number of vehicles arriving at the j-th service station included in the i-th planned route per unit time; i,j Δt represents the time it takes for a vehicle to travel from its starting position along the i-th planned route to the j-th service station, and Δt represents the information acquisition delay with the specified device.
[0071] Similar to the above embodiments, the time taken for a vehicle to travel from its starting position to the j-th service station along the i-th planned route includes: the travel time from the starting position to the j-th service station (wherein, the travel time does not include the waiting time at the service station, but is the time the vehicle spends traveling on the road), and the waiting time at each service station before the j-th service station.
[0072] Specifically, the waiting time for the vehicle at the first service counter included in the i-th planned route is... Since it is the first service counter, therefore t i,1 This is the travel time for the vehicle to travel from its starting position to the first service counter;
[0073] The waiting time for the vehicle at the second service counter included in the i-th planned route is . Since it's the second service counter, therefore t i,2 This refers to the travel time from the starting point to the second service counter via the first service counter, and the waiting time (w) at the first service counter. i,1 ;
[0074] The waiting time for the vehicle at the third service counter included in the i-th planned route is . Since it is the third service counter, therefore t i,3 This refers to the travel time of the vehicle from its starting point, through the first and second service counters, to the third service counter, and the waiting time (w) at the first service counter. i,1 and the waiting time of the vehicle at the second service counter wi,2 ;
[0075] The waiting time for a vehicle at the j-th service counter included in the i-th planned route is . Since it is the j-th service desk, therefore t i,j This refers to the travel time of the vehicle from its starting position, passing through the first service counter, the second service counter, ..., and the (j-1)th service counter to the jth service counter, as well as the waiting time w of the vehicle at the first service counter. i,1 The waiting time for the vehicle at the second service counter (w) i,2 ..., the waiting time w for the vehicle at the (j-1)th service counter i,j-1 .
[0076] Continue to refer to Figure 3 As shown, in step S320, the waiting time required for the vehicle to travel along each planned route is calculated based on the waiting time of the vehicle at each service counter included in each planned route.
[0077] In one embodiment of this application, the waiting time of a vehicle at each service counter included in each planned route can be summed to obtain the waiting time corresponding to each planned route. For example, in Figure 4 As shown in the example, the vehicle along Figure 4 The waiting time required when driving along the planned route shown includes the waiting time at service counter 1, service counter 2, service counter 3 and service counter 4.
[0078] Continue to refer to Figure 2 As shown, in step S230, the vehicle's travel route is selected from at least one planned route based on the waiting time required for the vehicle to travel along each planned route.
[0079] In one embodiment of this application, if the distance of at least one planned route obtained in step S210 is less than or equal to a predetermined value, then the planned route with the shortest waiting time can be selected from these at least one planned route as the vehicle's driving route.
[0080] In one embodiment of this application, the travel time of the vehicle along each planned route can be calculated based on the mileage of each planned route. Then, based on the waiting time corresponding to each planned route and the travel time of the vehicle along each planned route, the total travel time of the vehicle along each planned route can be calculated. Thus, the planned route with the shortest total travel time can be selected from these at least one planned route as the vehicle's travel route.
[0081] In one embodiment of this application, after a vehicle's driving route is selected, navigation can be performed based on the driving route, and autonomous driving or assisted driving can also be performed based on the driving route.
[0082] The technical solution of this application embodiment will be described in detail below using a specific application scenario:
[0083] In one application scenario of this application, the vehicle can be an autonomous driving vehicle. After the user inputs the vehicle's starting and destination locations, multiple planned routes can be calculated based on these locations (multiple planned routes can be understood as two or more planned routes). These planned routes include several service stations, and the average service rate of each service station (the average service rate of a service station refers to the number of vehicles that a service station can serve per unit of time; if a service station malfunctions, its average service rate will decrease) and the average arrival rate of vehicles to service stations (the average arrival rate of vehicles to service stations refers to the number of vehicles arriving at a service station within a unit of time, i.e., the increase in the number of vehicles queuing at the service station within a unit of time) can be obtained. Simultaneously, the number of vehicles queuing at each service station, the mileage of each planned route, and the mileage between each service station and the starting location (or the mileage between different service stations) can be obtained.
[0084] In this application scenario, the vehicle's starting location can be its current location, such as the location of a service counter; of course, the starting location can also be any selected location. The vehicle's route can be selected by following these steps:
[0085] 1. The vehicle obtains all planned routes and mileages from the starting point to the destination in real time from the cloud or other channels, and selects planned routes L1, L2, ..., L from those routes whose mileage meets preset requirements (the preset requirements can be planned routes with mileage less than or equal to a predetermined value). n (In this embodiment, it is assumed that there are a total of n routes that meet the preset requirements, and that these n planned routes are L1, L2, ..., L... n (The mileage increases sequentially).
[0086] 2. Calculate the routes L1, L2, ..., L from the starting position for each vehicle. n How long will it take? The specific calculation method is as follows:
[0087] Vehicles obtain location information from the cloud or other channels at location L on the planned route. i Average service rate μ of all service desks i,1 ,μ i,2 ,···,μi,m (Assume there are m service counters located on route L) i (middle) Average arrival rate λ of vehicles to each service counter i,1 ,λ i,2 ,···,λ i,m The number of vehicles q waiting in line at each service counter i,1 ,q i,2 ,···,q i,m Meanwhile, the delay t2-t1 for the vehicle to obtain service desk information from the cloud can be calculated based on the timestamp t1 of the cloud information and the vehicle's own timestamp t2. The timestamp t1 of the cloud information is included in the information requested by the vehicle and is the moment when the cloud sends the message to the vehicle. The vehicle's own timestamp t2 is the moment when the vehicle receives the message sent by the cloud.
[0088] The waiting time for a vehicle at service counter j can be expressed by the following formula (3):
[0089]
[0090] Among them, t i,j This indicates that the vehicle travels from its starting position along the planned route L. i The time taken to reach the j-th service counter.
[0091] Therefore, the distance L of the vehicle from its starting position along the planned route can be calculated using the following formula (4). i Waiting time required to reach the destination:
[0092]
[0093] Then you can choose the route with the shortest waiting time as the vehicle's driving route.
[0094] It should be noted that in this embodiment, the calculation of the waiting time for vehicles mainly considers the time vehicles spend queuing at the service counter, and assumes that the service counter provides services on a "first-come, first-served" basis, meaning that vehicles arriving at the service counter first receive service first, and vehicles arriving later receive service later. In other embodiments of this application, road conditions, such as the waiting time for vehicles in congested situations, may also be considered.
[0095] In one embodiment of this application, when implementing the technical solution of this application, a software and hardware development platform can be built and a development environment can be configured. For example, a computer with an Intel(R) Core(TM) i5-5200U CPU@2.20GHz processor, 8.00G of memory, and a 64-bit operating system can be used as the development platform, and Python language can be used as the development environment.
[0096] Under the premise of a preset mileage, 10 experiments were conducted based on the technical solution of this application embodiment. The relative waiting time was calculated according to formula (4) (relative waiting time = waiting time calculated by the technical solution of this application / waiting time calculated by related technologies) as shown in Table 1:
[0097] Experimental sequence relative waiting time first 0.83 The second 0.79 The third 0.81 Fourth 0.82 Fifth 0.79 Sixth 0.78 The seventh 0.85 Eighth time 0.84 Ninth 0.78 The tenth 0.83
[0098] Table 1
[0099] As can be seen from Table 1, the relative waiting time is only 78% to 85% of the waiting time calculated by related technologies. This indicates that the waiting time of the planned route calculated by the technical solution of this application embodiment is less than the waiting time calculated by related technologies, and the calculated waiting time is more accurate. Therefore, a more suitable planned route can be selected as the vehicle's driving route.
[0100] Based on the technical solution of this application embodiment, the driving route can be dynamically and effectively adjusted according to the vehicle driving conditions, and the delay in obtaining information from the cloud can be taken into account. At the same time, by taking into account the vehicle's waiting time, the waiting service time can be minimized while the mileage requirement is met.
[0101] The following describes an embodiment of the apparatus described in this application, which can be used to execute the route selection method described in the above embodiments of this application. For details not disclosed in the apparatus embodiments of this application, please refer to the embodiments of the route selection method described above.
[0102] Figure 5 A block diagram of a route selection device according to an embodiment of this application is shown. The route selection device may be located in a processor, which may be a processor in a vehicle terminal (such as the processor of an on-board computer installed in the vehicle, or the smart terminal of the driver sitting in the vehicle), or a processor in a server.
[0103] Reference Figure 5 As shown, a route selection device 500 according to an embodiment of this application includes: an acquisition unit 502, a determination unit 504, and a selection unit 506.
[0104] The acquisition unit 502 is configured to acquire at least one planned route from the vehicle's starting position to its destination position, as well as information on each service station included in each planned route; the determination unit 504 is configured to calculate the waiting time required for the vehicle to travel along each planned route based on the information on each service station included in each planned route; and the selection unit 506 is configured to select the vehicle's travel route from the at least one planned route based on the waiting time corresponding to each planned route.
[0105] In some embodiments of this application, based on the foregoing scheme, the determining unit 504 is configured to: calculate the waiting time of the vehicle at each service station included in each planned route according to the information of each service station included in each planned route; and calculate the waiting time required for the vehicle to travel along each planned route based on the waiting time of the vehicle at each service station included in each planned route.
[0106] In some embodiments of this application, based on the foregoing scheme, the information of each service station includes the number of vehicles served by each service station per unit time, the number of vehicles waiting for service at each service station, and the number of vehicles arriving at each service station per unit time.
[0107] The determination unit 504 is configured to calculate the waiting time of the vehicle at each service counter included in each of the planned routes using the following formula:
[0108]
[0109] Among them, w i,j q represents the waiting time of a vehicle at the j-th service counter included in the i-th planned route; i,j μ represents the number of vehicles waiting for service at the j-th service counter included in the i-th planned route; i,j λ represents the number of vehicles served by the j-th service station within a unit of time in the i-th planned route; i,j t represents the number of vehicles arriving at the j-th service station included in the i-th planned route per unit time; i,j This represents the time it takes for a vehicle to travel from its starting position along the i-th planned route to the j-th service station.
[0110] In some embodiments of this application, based on the foregoing scheme, when information about each service station included in each planned route is obtained from a designated device, the determining unit 504 is configured to: calculate the waiting time of the vehicle at each service station included in each planned route based on the information about each service station included in each planned route and the information acquisition delay with the designated device.
[0111] In some embodiments of this application, based on the foregoing scheme, the information of each service station includes the number of vehicles served by each service station per unit time, the number of vehicles waiting for service at each service station, and the number of vehicles arriving at each service station per unit time.
[0112] The determination unit 504 is configured to calculate the waiting time of the vehicle at each service counter included in each of the planned routes using the following formula:
[0113]
[0114] Among them, w i,j q represents the waiting time of a vehicle at the j-th service counter included in the i-th planned route; i,j μ represents the number of vehicles waiting for service at the j-th service counter included in the i-th planned route; i,j λ represents the number of vehicles served by the j-th service station within a unit of time in the i-th planned route; i,j t represents the number of vehicles arriving at the j-th service station included in the i-th planned route per unit time; i,j Δt represents the time it takes for a vehicle to travel from its starting position along the i-th planned route to the j-th service station, and Δt represents the information acquisition delay with the designated device.
[0115] In some embodiments of this application, based on the foregoing scheme, the determining unit 504 is further configured to: calculate the information acquisition delay with the designated device based on the timestamp contained in the information sent by the designated device and the local timestamp when the information sent by the designated device is received.
[0116] In some embodiments of this application, based on the foregoing scheme, the determining unit 504 is further configured to: obtain the travel time of the vehicle from the starting position to the j-th service station when traveling along the i-th planned route, and the waiting time of the vehicle at each service station before the j-th service station; and calculate the time t taken by the vehicle to travel from the starting position to the j-th service station along the i-th planned route based on the travel time of the vehicle from the starting position to the j-th service station and the waiting time of the vehicle at each service station before the j-th service station. i,j .
[0117] In some embodiments of this application, based on the foregoing scheme, the determining unit 504 is configured to: accumulate the travel time of the vehicle from the starting position to the j-th service station and the waiting time of the vehicle at each service station before the j-th service station, to obtain the time t taken by the vehicle to travel from the starting position to the j-th service station along the i-th planned route. i,j .
[0118] In some embodiments of this application, based on the foregoing scheme, the determining unit 504 is configured to: accumulate the waiting time of the vehicle at each service counter included in each planned route to obtain the waiting time corresponding to each planned route.
[0119] In some embodiments of this application, based on the foregoing scheme, the acquisition unit 502 is configured to: acquire at least one planned route whose mileage between the starting position and the destination position is less than or equal to a predetermined value, based on the starting position and the destination position.
[0120] In some embodiments of this application, based on the foregoing scheme, the selection unit 506 is configured to: select the planned route with the shortest required waiting time from the at least one planned route as the driving route of the vehicle.
[0121] In some embodiments of this application, based on the foregoing scheme, the selection unit 506 is configured to: calculate the travel time of the vehicle along each planned route based on the mileage of each planned route; calculate the total travel time of the vehicle along each planned route based on the waiting time corresponding to each planned route and the travel time of the vehicle along each planned route; and select the planned route with the shortest total travel time from the at least one planned route as the vehicle's travel route.
[0122] Figure 6 A schematic diagram of the structure of a computer system suitable for implementing the electronic device of the present application is shown.
[0123] It should be noted that, Figure 6 The computer system 600 of the electronic device shown is merely an example and should not impose any limitation on the functionality and scope of use of the embodiments of this application.
[0124] like Figure 6 As shown, the computer system 600 includes a Central Processing Unit (CPU) 601, which can perform various appropriate actions and processes based on programs stored in Read-Only Memory (ROM) 602 or programs loaded from storage portion 608 into Random Access Memory (RAM) 603, such as performing the methods described in the above embodiments. The RAM 603 also stores various programs and data required for system operation. The CPU 601, ROM 602, and RAM 603 are interconnected via a bus 604. An Input / Output (I / O) interface 605 is also connected to the bus 604.
[0125] The following components are connected to I / O interface 605: an input section 606 including a keyboard, mouse, etc.; an output section 607 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.; a storage section 608 including a hard disk, etc.; and a communication section 609 including a network interface card such as a LAN (Local Area Network) card, modem, etc. The communication section 609 performs communication processing via a network such as the Internet. A drive 610 is also connected to I / O interface 605 as needed. A removable medium 611, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on drive 610 as needed so that computer programs read from it can be installed into storage section 608 as needed.
[0126] Specifically, according to embodiments of this application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of this application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program including a computer program for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication section 609, and / or installed from removable medium 611. When the computer program is executed by central processing unit (CPU) 601, it performs various functions defined in the system of this application.
[0127] It should be noted that the computer-readable medium shown in the embodiments of this application can be a computer-readable signal medium or a computer-readable storage medium, or any combination of the two. A computer-readable storage medium can be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), flash memory, optical fiber, portable compact disc read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In this application, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In this application, a computer-readable signal medium can include a data signal propagated in baseband or as part of a carrier wave, carrying a computer-readable computer program. The transmitted data signal can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. The computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The computer program contained on the computer-readable medium can be transmitted using any suitable medium, including but not limited to wireless, wired, etc., or any suitable combination thereof.
[0128] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. Each block in a flowchart or block diagram may represent a module, segment, or portion of code, which contains one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.
[0129] The units described in the embodiments of this application can be implemented in software or hardware, and the described units can also be located in a processor. The names of these units do not necessarily limit the specific unit itself.
[0130] In another aspect, this application also provides a computer-readable medium, which may be included in the electronic device described in the above embodiments; or it may exist independently and not assembled into the electronic device. The computer-readable medium carries one or more programs, which, when executed by the electronic device, cause the electronic device to perform the methods described in the above embodiments.
[0131] It should be noted that although several modules or units for the device used to perform actions have been mentioned in the detailed description above, this division is not mandatory. In fact, according to the embodiments of this application, the features and functions of two or more modules or units described above can be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided and embodied by multiple modules or units.
[0132] Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, touch terminal, or network device, etc.) to execute the method according to the embodiments of this application.
[0133] Other embodiments of this application will readily occur to those skilled in the art upon consideration of the specification and practice of the embodiments disclosed herein. This application is intended to cover any variations, uses, or adaptations of this application that follow the general principles of this application and include common knowledge or customary techniques in the art not disclosed herein.
[0134] It should be understood that this application is not limited to the precise structure described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from its scope. The scope of this application is limited only by the appended claims.
Claims
1. A method for selecting a driving route, It is characterized in that include: Acquire at least one planned route from the starting position to the destination position of the vehicle, and information of each service station included in each planned route; wherein the information of each service station includes the number of vehicles served by each service station in a unit time, the number of vehicles waiting for service at each service station, and the number of vehicles arriving at each service station in a unit time; According to the number of vehicles served by each service station in a unit time, the number of vehicles arriving at each service station in a unit time, and the time taken for a vehicle to arrive at each service station from the starting position, the difference between the number of vehicles served by each service station in the time taken and the number of vehicles arriving at each service station is calculated; Calculate the number of vehicles that need to be served by each service station when the vehicle departs from the starting position and arrives at the location of each service station according to the number of vehicles waiting for service at each service station and the difference between the number of vehicles; Calculate the waiting time of the vehicle at each service station included in each planned route according to the number of vehicles that each service station needs to serve and the number of vehicles served by each service station within a unit time; Determining the waiting time required for the vehicle to travel along each of the planned routes based on the waiting time of the vehicle at each of the service stations included in each of the planned routes; A driving route of the vehicle is selected from the at least one planned route based on a waiting time required for the vehicle to travel along the planned routes.
2. The method for selecting a driving route according to claim 1, It is characterized in that In the case of obtaining information of each service station included in each planned route from a designated device, the driving route selection method further includes: determining the waiting time of the vehicle at each service station included in each planned route in combination with the information acquisition delay between the designated device.
3. The method for selecting a driving route according to claim 2, It is characterized in that Determining the waiting time of the vehicle at each service station included in each planned route in combination with the information acquisition delay between the vehicle and the designated device, including: Based on the number of vehicles served by each service station within a unit time, the number of vehicles arriving at each service station within a unit time, the time taken for vehicles to reach each service station from the starting position, and the information acquisition delay between the vehicle and the designated device, the difference between the number of vehicles served by each service station and the number of vehicles arriving at each service station within the time taken and the information acquisition delay is calculated, so as to calculate the waiting time of the vehicle at each service station based on the calculated difference in the number of vehicles.
4. The method for selecting a driving route according to claim 2, It is characterized in that Also includes: The information acquisition delay between the designated device and the designated device is determined according to the timestamp contained in the information sent by the designated device and the local timestamp when the information sent by the designated device is received.
5. The method for selecting a driving route according to claim 1, It is characterized in that Also includes: Obtaining the driving time of the vehicle from the starting position to each service station when traveling along each planned route, and the waiting time of the vehicle at each service station before each service station; The time taken by the vehicle to reach each service station from the starting position is calculated based on the driving time taken by the vehicle to reach each service station from the starting position and the waiting time taken by the vehicle at each service station before the service station.
6. The method for selecting a driving route according to claim 5, It is characterized in that The time taken by the vehicle to reach each service station from the starting position is calculated according to the driving time taken by the vehicle to reach each service station from the starting position and the waiting time taken by the vehicle at each service station before each service station, including: The driving time of the vehicle from the starting position to each service station and the waiting time of the vehicle at each service station before each service station are accumulated to obtain the time taken by the vehicle to reach each service station from the starting position.
7. The method for selecting a driving route according to claim 1, It is characterized in that Determining the waiting time required for the vehicle to travel along each of the planned routes based on the waiting time of the vehicle at each of the service stations included in each of the planned routes, including: The waiting time of the vehicle at each service station included in each planned route is accumulated to obtain the waiting time corresponding to each planned route.
8. The method for selecting a driving route according to claim 1, It is characterized in that Obtain at least one planned route from the vehicle's starting position to the destination position, including: At least one planned route is obtained according to the starting position and the destination position, the mileage between the starting position and the destination position being less than or equal to a predetermined value.
9. The method for selecting a driving route according to claim 8, It is characterized in that Selecting a driving route of the vehicle from the at least one planned route based on the waiting times corresponding to the planned routes includes: A planned route with the shortest waiting time is selected from the at least one planned route as the driving route of the vehicle.
10. The method for selecting a driving route according to claim 1, It is characterized in that Selecting a driving route of the vehicle from the at least one planned route based on the waiting times corresponding to the planned routes includes: Calculating the driving time taken by the vehicle along each of the planned routes according to the mileage of each of the planned routes; Calculate the total time taken by the vehicle to travel along each of the planned routes according to the waiting time corresponding to each of the planned routes and the driving time taken by the vehicle to travel along each of the planned routes; A planned route with the shortest total duration is selected from the at least one planned route as the driving route of the vehicle.
11. A device for selecting a driving route, It is characterized in that include: an acquisition unit configured to acquire at least one planned route from a starting position to a destination position of a vehicle, and information of each service station included in each planned route; wherein the information of each service station includes the number of vehicles served by each service station in a unit time, the number of vehicles waiting for service at each service station, and the number of vehicles arriving at each service station in a unit time; The determination unit is configured to calculate the difference between the number of vehicles served by each service station and the number of vehicles arriving at each service station within the time taken, based on the number of vehicles served by each service station within a unit time, the number of vehicles arriving at each service station within a unit time, and the time taken by the vehicle to arrive at each service station from the starting position; calculate the number of vehicles that need to be served by each service station when the vehicle arrives at the location of each service station from the starting position, based on the number of vehicles waiting for service at each service station and the difference in the number of vehicles; calculate the waiting time of the vehicle at each service station included in each planned route, based on the number of vehicles that need to be served by each service station and the number of vehicles served by each service station within a unit time; determine the waiting time required for the vehicle to travel along each planned route based on the waiting time of the vehicle at each service station included in each planned route; The selection unit is configured to select a driving route of the vehicle from the at least one planned route based on the waiting times corresponding to the various planned routes.
12. A computer readable medium having a computer program stored thereon, It is characterized in that When the computer program is executed by a processor, the method for selecting a driving route according to any one of claims 1 to 10 is implemented.
13. An electronic device, It is characterized in that include: one or more processors; A storage device for storing one or more programs, when the one or more programs are executed by the one or more processors, enables the one or more processors to implement the method for selecting a driving route as described in any one of claims 1 to 10.
14. A computer program product, It is characterized in that The computer program product includes a computer program, which is stored in a computer-readable storage medium. A processor of an electronic device reads and executes the computer program from the computer-readable storage medium, so that the electronic device executes the method for selecting a driving route according to any one of claims 1 to 10.
Citation Information
Patent Citations
Method and device for planning route of electric vehicle, computer equipment and storage medium
CN109506668A
