Method, system and storage medium for designated driving management

Abstract

The invention discloses a designated driver management method and system and a storage medium, and the method comprises the steps: obtaining an ordering request and street data, and building a mathematical model; calculating an initial designated driving path according to the departure place, the destination and the street data; optimizing the initial designated driving path by using a mathematical model to obtain an optimal designated driving path; sending the order placing request and the optimal designated driving path to the designated driver, and establishing an order sending scheme; the vehicle position is monitored in real time, and when the vehicle arrives at the destination, the order sending scheme is ended. The method has the following effects: the order placing request and the street data are acquired, the mathematical model is established, the mathematical model is used to calculate the order placing request and the street data to obtain the optimal designated driving path, and then the optimal designated driving path is sent to the designated driver, so that the management of the designated driving process is realized, and the management efficiency is improved. The operation time is reduced, and the working efficiency is improved. And meanwhile, the route in the designated driving process is recorded, so that the safety of both parties is guaranteed.

Description

Technical Field

[0001] The present invention relates to the field of designated driver technology, and in particular to a method, system and storage medium for designated driver management. Background Art

[0002] With the diversified development of my country's economy and culture, people's material living standards have significantly improved, and their enthusiasm for entertainment activities has also increased. At this time, alcohol, as a medium of emotional communication, plays an important role in enhancing mutual friendship. Unfortunately, people do not fully understand the importance of avoiding alcoholism and drunk driving, and lack awareness of the harm of drunk driving to personal and other people's life safety. At the same time, some drivers may not be aware of the dangers of drunk driving, or are too confident in their driving ability, thus ignoring the risks of drunk driving. However, alcohol can affect the driver's reaction speed, judgment and attention, greatly increasing the risk of traffic accidents.

[0003] In order to effectively deal with this problem, the emergence of designated driver services undoubtedly provides a practical way to solve the problem of drunk driving. Designated driver services can not only help drivers avoid wasting precious time due to drunk driving, but the value of the time saved far exceeds the serious consequences that may be caused by drunk driving. Designated drivers have undergone rigorous professional training, have rich driving experience and good professional qualities, and provide a solid and reliable guarantee for public travel safety. As a service provider, designated driver companies still have huge room for improvement in improving service efficiency and reliability, and have broad development prospects and unlimited potential in the future. In addition, designated driver services have gradually expanded from traditional designated drivers after drinking to a variety of special services such as long-distance designated drivers, business designated drivers, and tourist designated drivers. The innovation of these service models meets the needs of different user groups. This means that the market size of the designated driver industry continues to expand.

[0004] In one prior art, after receiving the received chauffeur order, the system creates a back-propagation BP neural network including an input layer, a hidden layer and an output layer according to the chauffeur order and the currently online chauffeur terminal, and uses the node value of the hidden node as the chauffeur order sequence number for dispatching the order to the corresponding chauffeur terminal and adjusting it based on the gradient descent method of the BP neural network.

[0005] However, the above-mentioned prior art does not take into account the route allocation of the designated driver, resulting in low efficiency in the route planning of the designated driver dispatch. Summary of the invention

[0006] The present invention provides a method and system for designated driver management, so as to solve the problem that the designated driver dispatching route planning efficiency is low and the rapid response to the designated driver demand of the customer cannot be achieved in the prior art.

[0007] In a first aspect, in order to solve the above technical problems, the present invention provides a system method for designated driver management, comprising:

[0008] Obtaining a user order request and street data, and establishing a mathematical model; wherein the user order request includes the user's departure place, destination, and vehicle location; the mathematical model includes a state machine model and a time function;

[0009] Calculate an initial designated driver route according to the departure place, the destination and the street data;

[0010] Using the mathematical model to optimize the initial designated driver path to obtain the optimal designated driver path;

[0011] Sending the user's order request and the optimal designated driving route to the designated driving driver to establish an order dispatching plan;

[0012] Monitor the vehicle position; if the vehicle position reaches the destination, end the current dispatch plan, obtain the completion plan data and end the supervision; if the vehicle position does not reach the destination, continue to record the current vehicle position in the dispatch plan and keep monitoring.

[0013] In an optional implementation, the street data includes street routes, street intersections, traffic regulations, and real-time traffic conditions.

[0014] In an optional implementation, the state machine model includes state description, total number of states, state transition, and state change rules.

[0015] In an optional implementation, the calculating an initial designated driver route according to the departure place, the destination and the street data includes:

[0016] Cleaning and formatting the street data to obtain street information;

[0017] The initial designated driver route is calculated based on the departure place, the destination and the street information.

[0018] In an optional implementation, the using the mathematical model to optimize the initial designated driver path to obtain the optimal designated driver path includes:

[0019] Divide the initial designated driver path into a number of path segments of equal length, each of the path segments being regarded as a non-continuous time automaton;

[0020] Calculating the Cartesian product operation on all the non-continuous time automata to obtain a Cartesian product result under a finite state machine; wherein the Cartesian product result includes all sub-results from one path segment to another path segment;

[0021] Substitute the street data and the Cartesian product result into the mathematical model to calculate and obtain the optimal designated driver route.

[0022] In an optional implementation, the calculating the initial designated driver route according to the departure place, the destination and the street information includes:

[0023] Parsing the departure place, the destination and the street information to obtain a simplified route map;

[0024] Establishing a path matrix according to the simplified path map;

[0025] According to the path matrix, a path planning algorithm is used to calculate and obtain the initial designated driver path;

[0026] The initial designated driver path is calculated according to the following formula:

[0027] dist=min(d[u]+w(u,v),dist)

[0028] Wherein, dist represents the initial designated driver route, and the initial value of dist is infinite, d[u] represents the current distance from the starting point to the node u, w(u, v) represents the distance value of the uth row and the vth column in the path matrix, and min() represents selecting the smallest number from the numbers in the brackets.

[0029] In an optional implementation, substituting the street data and the Cartesian product result into the mathematical model to calculate the optimal designated driver route includes:

[0030] According to the street data, the travel time is calculated using the time function;

[0031] The optimal designated driver route is calculated using the state machine model according to the Cartesian product result and the travel time.

[0032] In an optional implementation, calculating the travel time using the time function according to the street data includes:

[0033] According to the street data, the path edges and path points of the street path are obtained, as well as the time required to travel on each path edge;

[0034] The travel time is calculated using the time function according to the path edge, the path point, and the time;

[0035] The travel time is calculated according to the following formula:

[0036]

[0037] Wherein, T represents the travel time, e j represents the jth path edge, p i represents the i-th path point, t(e j , p i ) indicates that the path edge e j To the path point p i The time required, N represents the total number of path points, M i Indicates that the path point p can be reached i The total number of edges in the path.

[0038] In an optional implementation, the step of calculating the optimal designated driver route using the state machine model according to the Cartesian product result and the travel time includes:

[0039] Check the Cartesian product result to find all sub-results that can reach the destination from the departure point;

[0040] The current time of the path represented by each sub-result is calculated and compared with the travel time; if the current time is less than the travel time, the path represented by the current sub-result is output as the optimal designated driver path; if the current time is greater than the travel time, the next current time and the travel time are continuously determined; if all the current times are greater than the travel time, the initial designated driver path is output as the optimal designated driver path.

[0041] In a second aspect, the present invention provides a system for designated driver management, comprising:

[0042] An information acquisition module, used to acquire user order requests and street data, and establish a mathematical model; wherein the user order request includes the user's departure place, destination and vehicle location;

[0043] An initial route calculation module, used to calculate an initial designated driver route according to the departure place, the destination and the street data;

[0044] A path optimization module, used to optimize the initial designated driver path using the mathematical model to obtain an optimal designated driver path;

[0045] A plan establishment module, used to send the user's order request and the optimal designated driving route to the designated driving driver to establish an order dispatch plan;

[0046] The result feedback module is used to monitor the vehicle position; if the vehicle position reaches the destination, the current dispatch plan is terminated, the completion plan data is obtained and the supervision is terminated; if the vehicle position does not reach the destination, the current vehicle position is continuously recorded in the dispatch plan and supervision is maintained.

[0047] In a third aspect, the present invention further provides an electronic device, comprising a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor implements any one of the above-mentioned methods for designated driver management when executing the computer program.

[0048] In a fourth aspect, the present invention further provides a computer-readable storage medium, which includes a stored computer program, wherein when the computer program is running, the device where the computer-readable storage medium is located is controlled to execute any one of the above-mentioned methods for designated driver management.

[0049] Compared with the prior art, the present invention has the following beneficial effects:

[0050] The present invention provides a method for designated driver management, comprising obtaining a user order request and street data, and establishing a mathematical model; wherein the user order request includes the user's departure place, destination and vehicle position; the mathematical model includes a state machine model and a time function; an initial designated driver path is calculated based on the departure place, the destination and the street data; the initial designated driver path is optimized using the mathematical model to obtain an optimal designated driver path; the user order request and the optimal designated driver path are sent to the designated driver, and an order dispatching plan is established; the vehicle position is monitored; if the vehicle position reaches the destination, the current order dispatching plan is terminated, completion plan data is obtained and supervision is terminated; if the vehicle position does not reach the destination, the current vehicle position is continuously recorded in the order dispatching plan, and supervision is maintained.

[0051] The method obtains user order requests and street data, establishes a mathematical model including a state machine model and a time function, and uses the mathematical model to calculate the user order request and the street data to obtain the optimal designated driving path, and then sends the optimal designated driving path to the designated driving driver, thereby realizing the management of the designated driving process. The method improves the efficiency of path planning in the designated driving dispatch process, thereby effectively realizing a rapid response to the customer's designated driving needs. In addition, the method also has the function of recording the specific route during the designated driving process, ensuring the traceability of the designated driving process, and providing a strong guarantee for the safety of both the user and the designated driving driver. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] Figure 1is a flow chart of a method for designated driver management provided by a first embodiment of the present invention;

[0053] Figure 2 It is a schematic diagram of the structure of a system for designated driver management provided by the second embodiment of the present invention. DETAILED DESCRIPTION

[0054] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0055] Reference Figure 1 The first embodiment of the present invention provides a method for designated driver management, comprising the following steps:

[0056] S1, obtaining a user order request and street data, and establishing a mathematical model; wherein the user order request includes the user's departure place, destination and vehicle location; the mathematical model includes a state machine model and a time function.

[0057] S2, calculating an initial designated driver route according to the departure place, the destination and the street data.

[0058] S3, using the mathematical model to optimize the initial designated driving path to obtain an optimal designated driving path.

[0059] S4, sending the user order request and the optimal designated driving route to the designated driving driver, and establishing an order dispatching plan.

[0060] S5, monitor the vehicle position; if the vehicle position reaches the destination, end the current dispatch plan, obtain the completion plan data and end the supervision; if the vehicle position does not reach the destination, continue to record the current vehicle position in the dispatch plan and keep monitoring.

[0061] It should be noted that in some existing methods, after receiving the user's order request, the system can use the trained neural network model to send a dispatch request to the designated driver based on the distance of the designated driver, the order time and the distance, so as to achieve the dispatch of the designated driver service with a balanced supply and demand upstream and downstream. However, these technologies do not consider the path allocation problem in the designated driver process, which leads to the problem that the planning efficiency of the designated driver dispatch path is not high and the rapid response to the customer's designated driver demand cannot be achieved.

[0062] In this method, by accurately obtaining the user's order request and detailed street data, a mathematical model including a state machine model and a time function is established. This mathematical model can efficiently and accurately calculate the user's order request and street data, thereby obtaining the optimal designated driver path. The optimal designated driver path is then sent to the designated driver, thereby achieving comprehensive management and optimization of the designated driver process. The method not only significantly shortens the operation time but also improves work efficiency through the optimal path generated in real time. In addition, the method also has the function of recording the specific route during the designated driver process, ensuring the traceability of the designated driver process, and providing a strong guarantee for the safety of both users and designated drivers.

[0063] In step S1, the user order request and the street data are first obtained, and then a suitable mathematical model is established according to the specific situation. The user order request needs to include the user's departure place, destination and vehicle location; the mathematical model includes a state machine model and a time function.

[0064] In one implementation, the street data includes street paths, street intersections, traffic rules, and real-time traffic conditions; the state machine model includes state description, total number of states, state transition, and state change rules.

[0065] Specifically, first obtain the detailed street data from the cooperating map service provider, and obtain the user order request from the system's internal database. Then, according to the specific characteristics and requirements of the actual application scenario, select a suitable state machine model and a matching time function, which together constitute a mathematical model for subsequent use. The street data should include sufficiently detailed street paths, street intersections, traffic rules, and real-time traffic conditions, so that more accurate results can be obtained when planning the path.

[0066] It should be noted that in addition to the necessary information mentioned above, the user order request may also record other relevant information, such as the type of vehicle, the user's route requirements, etc., so that the user and the designated driver can achieve a better personalized service relationship. In addition, the street data and the user order request involve issues of data security and privacy protection. Therefore, the system needs to take strict data encryption and access control measures to ensure the security of this information during transmission and storage, and prevent data leakage or illegal use.

[0067] In step S2, firstly, according to the locations of the departure place and the destination, their specific locations are put into the street data, and then the initial designated driver route is calculated and obtained according to the street data.

[0068] In one implementation, the calculating of the initial designated driver route according to the departure place, the destination and the street data comprises the following steps:

[0069] S21, cleaning and formatting the street data to obtain street information.

[0070] S22, calculating the initial designated driver route according to the departure place, the destination and the street information.

[0071] In step S21, the street data is first cleaned and formatted to obtain the street information. The cleaning operation includes removing duplicate data, supplementing data with missing attributes, and deleting data with redundant attributes or data with values ​​that are obviously beyond the normal range; the formatting operation includes converting the data into a unified format and standard, and performing standardization, normalization, unit conversion and other operations.

[0072] It should be noted that since the street data may contain various erroneous, incomplete, duplicate or irrelevant information to actual needs during the collection and collation process, the existence of these bad data will greatly reduce the accuracy and reliability of subsequent data analysis. Through data cleaning, these bad data can be removed to improve the accuracy and credibility of the data. At the same time, inaccurate street data may bring security risks, such as leaking privacy information or causing navigation errors. The data cleaning process can accurately identify and correct these problems, thereby significantly reducing potential safety risks and ensuring the smooth operation of the designated driver service. Therefore, it is extremely necessary and crucial to clean and format the street data.

[0073] In step S22, the initial designated driver path is calculated based on the departure place, the destination and the street information, including: parsing the departure place, the destination and the street information to obtain a simplified path map; establishing a path matrix based on the simplified path map; and calculating based on the path matrix using a path planning algorithm to obtain the initial designated driver path; wherein the initial designated driver path is calculated according to the following formula,

[0074] dist=min(d[u]+w(u,v),dist)

[0075] Wherein, dist represents the initial designated driver route, and the initial value of dist is infinite, d[u] represents the current distance from the departure point to node u, w(u,v) represents the distance value of the uth row and the vth column in the path matrix, and min() represents the smallest number selected from the numbers in the brackets. The result calculated in the formula represents the distance from the departure point to the destination under the path, and the specific route needs to be output in each iteration of the formula.

[0076] It should be noted that the path matrix records in detail the shortest distance from each path point to all other path points in the simplified path map that has been simplified and abstracted. Using the path matrix, the program can quickly and accurately find the path with the shortest distance from the starting point to the end point. However, since the formula only considers the distance factor, it does not consider other factors in reality, such as road congestion, traffic light timing, road construction, traffic restriction policies, and weather conditions. This means that the path with the shortest current distance found according to the path matrix is ​​not necessarily the path with the least time. Therefore, the initial chauffeur path is only a preliminary result based on an ideal state, and may not necessarily reflect the optimal choice in the actual traffic environment. Further judgment and optimization are still needed.

[0077] In step S3, the previously obtained initial designated driving path is first obtained, and then the initial designated driving path is substituted into the mathematical model for optimization, and finally the optimal designated driving path is calculated.

[0078] In one embodiment, the use of the mathematical model to optimize the initial designated driver path to obtain the optimal designated driver path includes the following steps:

[0079] S31, dividing the initial designated driver path into a number of path segments of equal length, each of the path segments being regarded as a discontinuous time automaton.

[0080] S32, performing a Cartesian product operation on all the non-continuous time automata to obtain a Cartesian product result under a finite state machine; wherein the Cartesian product result includes all sub-results from one path segment to another path segment.

[0081] S33, substituting the street data and the Cartesian product result into the mathematical model to calculate and obtain the optimal designated driver route.

[0082] In step S31, the calculated initial designated driver path is first obtained, and then the initial designated driver path is divided into a number of path segments of equal length, and each of the path segments is regarded as a discontinuous time automaton to be substituted into the subsequent mathematical model.

[0083] Specifically, since the state machine model in the mathematical model requires multiple short-term states, the initial driving route needs to be divided into a number of equal-length path segments. Then, each of the path segments is regarded as a discontinuous time automaton, so that the dynamic behavior of the vehicle on the path (such as driving time, possible waiting or parking, etc.) can be accurately substituted into the previously set state machine model.

[0084] It should be noted that the length of a path segment should be determined according to the actual situation. Generally, if the vehicle is expected to travel slower on a certain path, more path segments need to be divided, that is, the path segments are divided into a larger number to simulate the interference of more traffic lights, pedestrians, and non-motor vehicles.

[0085] In step S32, all discontinuous time automata are first obtained, and then the Cartesian product operation is calculated on the discontinuous time automata to obtain the Cartesian product result under the finite state machine; wherein the Cartesian product result includes all sub-results, and each of the sub-results represents from one path segment to another path segment.

[0086] Specifically, the Cartesian product of all non-continuous time automata is calculated by treating all non-continuous time automata as a set, then combining each element in the set with another element to form an element pair, and then putting all element pairs into a new set, which is the Cartesian product result. Each of the sub-results can represent the process from one path segment to another path segment.

[0087] It should be noted that the Cartesian product result obtained after the Cartesian product operation includes all path results, that is, all paths from one path point to another path point. However, in actual situations, not all path points can reach all other path points. Moreover, after the Cartesian product operation, the number of results obtained will increase to the square of the number of original sets, which may result in the inability to store all possible results under complex paths. Therefore, after the Cartesian product operation, the Cartesian product results need to be screened to delete those paths that cannot be reached or that take a very long time to reach, so as to reduce the storage burden and improve the computing efficiency.

[0088] In step S33, the determined street data, the Cartesian product result, and the mathematical model are first obtained, and then the street data and the Cartesian product result are substituted into the mathematical model for optimization operation to calculate the optimal designated driver route.

[0089] In one implementation, substituting the street data and the Cartesian product result into the mathematical model to calculate the optimal designated driver route includes the following steps:

[0090] S331, calculating the travel time using the time function according to the street data.

[0091] S332: According to the Cartesian product result and the travel time, the optimal designated driver route is calculated using the state machine model.

[0092] In step S331, the travel time is calculated using the time function according to the street data, including: obtaining the path edge and path points of the street path and the time required to travel on each path edge according to the street data; calculating the travel time using the time function according to the path edge and the path point, and the time; wherein the travel time is calculated according to the following formula,

[0093]

[0094] Wherein, T represents the travel time, e j represents the jth path edge, p i represents the i-th path point, t(e j ,p i ) indicates that the path edge e j To the path point p i The time required, N represents the total number of path points, M i Indicates that the path point p can be reached i By calculating the time it takes to reach a path point through different path edges, an optimal designated driver path with the shortest overall time can be selected.

[0095] It should be noted that when calculating the time to reach a path point through different path edges, it is necessary not only to consider the vehicle speed and path length, but also the actual situation. For example, during peak hours in the morning and evening, the time required to pass different roads may change, and some shorter paths may take more time; on roads with temporary traffic control, the time required to pass will also be longer than normal. Therefore, when calculating the optimal designated driver route, it is also necessary to use additional information collection equipment to obtain the actual road conditions in a timely manner, so as to more accurately find the optimal designated driver route.

[0096] In step S332, the optimal designated driver route is calculated using the state machine model based on the Cartesian product result and the travel time, including: checking the Cartesian product result to find all sub-results that can reach the destination from the departure place; calculating the current time of the route represented by each sub-result, and comparing it with the travel time; if the current time is less than the travel time, outputting the path represented by the current sub-result as the optimal designated driver route; if the current time is greater than the travel time, continuing to judge the next current time and the travel time; if all the current times are greater than the travel time, outputting the initial designated driver route as the optimal designated driver route.

[0097] Specifically, after obtaining the Cartesian product result and the travel time, a comparison and judgment is required to find the optimal designated driver route. If the time taken by a path represented by a certain sub-result is less than the travel time of the initial designated driver route, then the path represented by the sub-result can be output as the optimal designated driver route; if the time taken by the paths represented by all the sub-results is more than the travel time of the initial designated driver route, then it means that the initial designated driver route is already optimal, and it is output as the optimal designated driver route.

[0098] It should be noted that the optimal driving route only refers to the optimal route calculated by the program software. The determination of this route depends on many factors, including but not limited to real-time traffic conditions, road rules, vehicle performance parameters and specific needs of users (such as the fastest driving time, the shortest driving distance, avoiding certain specific areas, etc.). The program software collects and analyzes a large amount of real-time data to plan a relatively optimal driving route under current conditions. However, since the actual situation may change at any time, this does not mean that the path is absolutely optimal under any circumstances. In addition, the optimal driving route may also be affected by the user's personal preferences. For example, some users may prefer to choose to drive on a scenic road, even if it means a slightly longer driving time; while some users may pay more attention to efficiency and hope to reach their destination as soon as possible. Therefore, when calculating the optimal path, the program software usually needs to consider these personalized needs of users.

[0099] In step S4, the user order request and the optimal designated driver route are first obtained, and a suitable designated driver is found. Then, the user order request and the optimal designated driver route are sent to the designated driver, and the dispatch plan is established.

[0100] Specifically, the user's order request and the optimal designated driver route are obtained, and they are quickly notified to a suitable designated driver nearby. After receiving the notification, the designated driver can decide whether to accept the current designated driver task based on personal circumstances, and finally determine a suitable designated driver to perform the designated driver service this time. Then, based on the above information, a dispatch plan is established. The dispatch plan includes the user's order request, the optimal designated driver route, the determined designated driver, and a record of the actual itinerary of this dispatch plan.

[0101] It should be noted that the dispatch plan will record the actual trip of the dispatch plan, including the specific time spent, the actual distance, and the recording in the car. In addition, the dispatch plan will be saved in the enterprise data for a period of time after it is completed to ensure that in the event of an unexpected situation, the dispatch plan can be used to divide responsibilities, thereby effectively safeguarding the legitimate rights and interests of users, designated drivers and enterprises.

[0102] In step S5, the vehicle position is continuously monitored. If the vehicle position reaches the destination, the current dispatching plan is terminated, the completion plan data is obtained and the supervision is terminated, and the completion plan data is recorded; if the vehicle position does not reach the destination, the current vehicle position is continuously recorded in the dispatching plan and the supervision is maintained.

[0103] Specifically, the vehicle position is continuously monitored to determine whether the vehicle has reached the destination. If the vehicle position has reached the destination, the current dispatching plan can be terminated, and completion plan data is obtained to indicate the end of the trip, and the completion plan data is recorded; if the vehicle position has not reached the destination, the current vehicle position is continuously recorded in the dispatching plan to form information of the actual trip and to maintain monitoring.

[0104] It should be noted that during the real-time recording process, if it is detected that the actual journey is not on the optimal designated driving route, or the actual road conditions have changed, it is necessary to recalculate the new optimal designated driving route and prompt the designated driver; if the actual journey is too far away from the optimal designated driving route, it is necessary to issue an alarm to the designated driver to prevent accidents.

[0105] To facilitate understanding of the present invention, the working process of the present invention is described below using a relatively common scenario as an example.

[0106] In this embodiment, a certain enterprise plans to use a system for designated driver management. The system is designed to collect passenger order information in a timely manner and help designated drivers reach their destinations safely and quickly.

[0107] Step 1: The system collects detailed street data in advance and establishes a complete mathematical model.

[0108] Step 2: The system collects user order requests in real time.

[0109] Step 3: The system calculates the shortest initial designated driver route based on the user's order request and street data.

[0110] Step 4: The system uses a mathematical model to optimize the initial designated driving route, and calculates the optimal designated driving route with the shortest time based on real-time traffic conditions.

[0111] Step 5: The system sends the order request and the optimal designated driving route to the designated driver and establishes an order dispatch plan.

[0112] Step 6: After the designated driver arrives at the vehicle and starts driving, the system continues to monitor the vehicle's location and record relevant information.

[0113] Step 7: After the vehicle arrives at the destination, the system terminates the dispatch plan, generates and stores the completed dispatch data.

[0114] Through the above steps, the method for designated driver management can realize the management of the designated driver process, reduce the operation time, and increase the work efficiency. At the same time, the route of the designated driver process is also recorded, thereby ensuring the safety of both parties.

[0115] In summary, the present invention provides a method for designated driver management, including obtaining user order requests and street data, and establishing a mathematical model; wherein the user order request includes the user's departure place, destination and vehicle position; the mathematical model includes a state machine model and a time function; according to the departure place, the destination and the street data, an initial designated driver path is calculated; the initial designated driver path is optimized using the mathematical model to obtain an optimal designated driver path; the user order request and the optimal designated driver path are sent to the designated driver, and a dispatch plan is established; the vehicle position is monitored; if the vehicle position reaches the destination, the current dispatch plan is terminated, the completion plan data is obtained and the supervision is terminated; if the vehicle position does not reach the destination, the current vehicle position is continuously recorded in the dispatch plan, and supervision is maintained.

[0116] The method obtains user order requests and street data, establishes a mathematical model including a state machine model and a time function, and uses the mathematical model to calculate the user order request and the street data to obtain the optimal designated driving path, and then sends the optimal designated driving path to the designated driver, thereby achieving the management of the designated driving process. The method not only significantly shortens the operation time but also improves work efficiency by generating the optimal path in real time. In addition, the method also has the function of recording the specific route during the designated driving process, ensuring the traceability of the designated driving process, and providing a strong guarantee for the safety of both the user and the designated driver.

[0117] Reference Figure 2 The second embodiment of the present invention provides a system for designated driver management, including:

[0118] An information acquisition module, used to acquire user order requests and street data, and establish a mathematical model; wherein the user order request includes the user's departure place, destination and vehicle location;

[0119] Among them, the information acquisition module includes a data collection module for obtaining user order requests and street data; and a model building module for building a mathematical model.

[0120] An initial route calculation module, used to calculate an initial designated driver route according to the departure place, the destination and the street data;

[0121] The initial route calculation module includes a data sorting module for cleaning and formatting the street data; and a route calculation module for calculating the initial designated driver route based on the departure place, the destination and the street information.

[0122] A path optimization module, used to optimize the initial designated driver path using the mathematical model to obtain an optimal designated driver path;

[0123] Among them, the path optimization module includes a path division module, which is used to divide the initial designated driver path into a number of equal-length path segments and record them as the non-continuous time automaton; a result calculation module, which is used to calculate the Cartesian product operation of all the non-continuous time automata to obtain the Cartesian product result under the finite state machine; and a result optimization module, which is used to substitute the street data and the Cartesian product result into the mathematical model to calculate the optimal designated driver path.

[0124] A plan establishment module, used to send the user's order request and the optimal designated driving route to the designated driving driver to establish an order dispatch plan;

[0125] Among them, the plan establishment module includes a plan dispatching module, which is used to send the user order request and the optimal designated driving route to the designated driver; the dispatch establishment module is used to record the user order request and the optimal designated driving route, as well as the designated driver's information, and establish an order dispatch plan.

[0126] The result feedback module is used to monitor the vehicle position; if the vehicle position reaches the destination, the current dispatch plan is terminated, the completion plan data is obtained and the supervision is terminated; if the vehicle position does not reach the destination, the current vehicle position is continuously recorded in the dispatch plan and supervision is maintained.

[0127] The result feedback module includes a vehicle monitoring module for real-time monitoring of the vehicle position; and an information recording module for recording information such as the actual distance, time spent, and conversations during the vehicle's travel.

[0128] It should be noted that the system for designated driver management provided in the embodiment of the present invention is used to execute all the process steps of the method for designated driver management in the above embodiment, and the working principles and beneficial effects of the two correspond one to one, so they will not be repeated here.

[0129] The embodiment of the present invention further provides an electronic device. The electronic device includes: a processor, a memory, and a computer program stored in the memory and executable on the processor, such as a program for designated driver management. When the processor executes the computer program, the steps in the above-mentioned method embodiments for designated driver management are implemented, such as Figure 1 Alternatively, when the processor executes the computer program, the functions of the modules / units in the above-mentioned system embodiments are realized, such as the initial path calculation module.

[0130] Exemplarily, the computer program may be divided into one or more modules / units, which are stored in the memory and executed by the processor to implement the present invention. The one or more modules / units may be a series of computer program instruction segments capable of implementing specific functions, which are used to describe the execution process of the computer program in the electronic device.

[0131] The electronic device may be a computing device such as a desktop computer, a notebook, a PDA, and a smart tablet. The electronic device may include, but is not limited to, a processor and a memory. Those skilled in the art will appreciate that the above components are merely examples of electronic devices and do not constitute a limitation on the electronic device. The electronic device may include more or fewer components than the above components, or may combine certain components, or different components. For example, the electronic device may also include input and output devices, network access devices, buses, etc.

[0132] The processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc. The processor is the control center of the electronic device, and uses various interfaces and lines to connect various parts of the entire electronic device.

[0133] The memory can be used to store the computer program and / or module, and the processor realizes various functions of the electronic device by running or executing the computer program and / or module stored in the memory, and calling the data stored in the memory. The memory can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, an application required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the data storage area can store data created according to the use of the mobile phone (such as audio data, a phone book, etc.), etc. In addition, the memory can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0134] Wherein, if the module / unit integrated in the electronic device is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such an understanding, the present invention implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. Wherein, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or system that can carry the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium. It should be noted that the content contained in the computer-readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer-readable media do not include electric carrier signals and telecommunication signals.

[0135] It should be noted that the system embodiment described above is merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. In addition, in the drawings of the system embodiment provided by the present invention, the connection relationship between the modules indicates that there is a communication connection between them, which may be specifically implemented as one or more communication buses or signal lines. A person of ordinary skill in the art may understand and implement it without paying any creative effort.

[0136] The specific embodiments described above further illustrate the purpose, technical solutions and beneficial effects of the present invention. It should be understood that the above description is only a specific embodiment of the present invention and is not intended to limit the scope of protection of the present invention. It is particularly pointed out that for those skilled in the art, any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the scope of protection of the present invention.

Claims

1. A method for designated driver management, characterized in that: include: Obtaining a user order request and street data, and establishing a mathematical model; wherein the user order request includes the user's departure place, destination, and vehicle location; the mathematical model includes a state machine model and a time function; Calculate an initial designated driver route according to the departure place, the destination and the street data; Using the mathematical model to optimize the initial designated driver path to obtain the optimal designated driver path; Sending the user's order request and the optimal designated driving route to the designated driving driver to establish an order dispatching plan; Monitor the vehicle position; if the vehicle position reaches the destination, end the current dispatch plan, obtain the completion plan data and end the supervision; if the vehicle position does not reach the destination, continue to record the current vehicle position in the dispatch plan and keep monitoring.

2. The method for designated driver management according to claim 1, characterized in that: The street data includes street routes, street intersections, traffic regulations, and real-time traffic conditions.

3. The method for designated driver management according to claim 1, characterized in that: The calculating an initial designated driver route according to the departure place, the destination and the street data includes: Cleaning and formatting the street data to obtain street information; The initial designated driver route is calculated based on the departure place, the destination and the street information.

4. The method for designated driver management according to claim 1, characterized in that: The method of using the mathematical model to optimize the initial designated driver path to obtain the optimal designated driver path includes: Divide the initial designated driver path into a number of path segments of equal length, each of the path segments being regarded as a non-continuous time automaton; Performing a Cartesian product operation on all the non-continuous time automata to obtain a Cartesian product result under a finite state machine; wherein the Cartesian product result includes all sub-results from one path segment to another path segment; Substitute the street data and the Cartesian product result into the mathematical model to calculate and obtain the optimal designated driver route.

5. The method for designated driver management according to claim 3, characterized in that: The calculating an initial designated driver route according to the departure place, the destination and the street information includes: Parsing the departure place, the destination and the street information to obtain a simplified route map; Establishing a path matrix according to the simplified path map; According to the path matrix, a path planning algorithm is used to calculate and obtain the initial designated driver path; The initial designated driver path is calculated according to the following formula: dist=min(d[u]+w(u,v),dist) Wherein, dist represents the initial designated driver route, and the initial value of dist is infinite, d[u] represents the current distance from the departure point to the node u, w(u,v) represents the distance value of the uth row and the vth column in the path matrix, and min() represents selecting the smallest number from the numbers in the brackets.

6. The method for designated driver management according to claim 4, characterized in that: Substituting the street data and the Cartesian product result into the mathematical model to calculate the optimal designated driver route includes: According to the street data, the travel time is calculated using the time function; The optimal designated driver route is calculated using the state machine model according to the Cartesian product result and the travel time.

7. The method for designated driver management according to claim 6, characterized in that , the travel time is calculated using the time function according to the street data, including: According to the street data, the path edges and path points of the street path are obtained, as well as the time required to travel on each path edge; The travel time is calculated using the time function according to the path edge, the path point, and the time; The travel time is calculated according to the following formula: Wherein, T represents the travel time, e j represents the jth path edge, p i represents the i-th path point, t(e j ,p i ) indicates that the path edge e j To the path point p i The time required, N represents the total number of path points, M i Indicates that the path point p can be reached i The total number of edges in the path.

8. The method for designated driver management according to claim 6, characterized in that , the optimal designated driver route is calculated using the state machine model according to the Cartesian product result and the travel time, including: Check the Cartesian product result to find all sub-results that can reach the destination from the departure point; The current time of the path represented by each sub-result is calculated and compared with the travel time; if the current time is less than the travel time, the path represented by the current sub-result is output as the optimal designated driver path; if the current time is greater than the travel time, the next current time and the travel time are continuously determined; if all the current times are greater than the travel time, the initial designated driver path is output as the optimal designated driver path.

9. A system for designated driver management, characterized in that: include: An information acquisition module, used to acquire user order requests and street data, and establish a mathematical model; wherein the user order request includes the user's departure place, destination and vehicle location; An initial route calculation module, used to calculate an initial designated driver route according to the departure place, the destination and the street data; A path optimization module, used to optimize the initial designated driver path using the mathematical model to obtain an optimal designated driver path; A plan establishment module, used to send the user's order request and the optimal designated driving route to the designated driving driver to establish an order dispatch plan; The result feedback module is used to monitor the vehicle position; if the vehicle position reaches the destination, the current dispatch plan is terminated, the completion plan data is obtained and the supervision is terminated; if the vehicle position does not reach the destination, the current vehicle position is continuously recorded in the dispatch plan and supervision is maintained.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a stored computer program, wherein when the computer program is executed, the device where the computer-readable storage medium is located is controlled to execute the method for designated driver management as described in any one of claims 1 to 8.

Images