Determination Method, Device, Computer Equipment and Readable Storage Medium for Shared Vehicles

Abstract

An embodiment of the present invention discloses a method, device, computer device, and readable storage medium for determining a shared vehicle. The method includes: after the server obtains the starting position and the ending position sent by the user through the terminal, planning a first walking route for the user to go from the starting position to the ending position, and sending the first walking route to the user's terminal; then, determining the points corresponding to the first walking route, taking each point as the center of a circle, and based on the rule that the farther the center of the circle is from the starting position, the smaller the radius corresponding to the center of the circle, determining all circular regions, and determining whether there are available vehicles in the circular regions; if there are, screening out the best vehicle; finally, planning a second walking route from the starting position to the position of the best vehicle, and sending the available vehicle, the best vehicle, and the second walking route to the terminal. Thus, the embodiment of the present invention displays the available vehicles near the first walking route on the terminal, realizing the intelligent display of available vehicles.

Description

Technical Field

[0001] The present invention relates to the field of vehicles, and in particular, to a method, device, computer device, and readable storage medium for determining shared vehicles. Background Art

[0002] When a user wants to view the shared vehicles around through a mobile phone, the server will send all the available vehicles around the user to the terminal for display, so as to ensure that the user can select the required vehicle from the numerous available vehicles.

[0003] However, when there are many available vehicles around the user, it will cause the available vehicles displayed on the terminal to be very dense, that is, the content of the displayed picture is relatively chaotic, and it affects the user's viewing and selecting of vehicles. Summary of the Invention

[0004] In view of this, the present invention provides a method, device, computer device, and readable storage medium for determining shared vehicles, so as to improve the current situation that when there are many available vehicles around the user, the content of the picture displayed on the terminal is relatively chaotic and affects the user's viewing and selecting of vehicles.

[0005] In a first aspect, an embodiment of the present invention provides a method for determining shared vehicles, which is applied to a server, and the method includes:

[0006] Obtain the starting position and the ending position sent by the user through the terminal;

[0007] Plan a first walking route from the starting position to the ending position, and send the first walking route to the terminal, so that the terminal displays the first walking route;

[0008] Determine the points corresponding to the first walking route, and take each of the points as the center of a circle. Based on the rule that the farther the center of the circle is from the starting position, the smaller the radius corresponding to the center of the circle, determine all the circular regions corresponding to the first walking route, where the radius of each circular region is greater than a preset value;

[0009] If there are available vehicles in all the circular regions, screen out the best vehicle from all the available vehicles based on a preset screening rule, where the available driving distance of the available vehicle is greater than or equal to the distance from the position of the available vehicle to the ending position, and the best vehicle means that the time for the user to travel from the starting position to the ending position through the best vehicle is the shortest;

[0010] Plan a second walking route from the starting position to the position of the best vehicle, and send all the available vehicles, the best vehicle, and the second walking route to the terminal, so that the terminal displays all the available vehicles, the best vehicle, and the second walking route.

[0011] In the method for determining a shared vehicle provided by an embodiment of the present invention, after the server obtains the starting position and the ending position sent by the user through the terminal, it will plan a walking route for the user from the starting position to the ending position, that is, the first walking route, and send the first walking route to the user's terminal for display. Then, the user can move towards the ending position according to the first walking route; next, determine the points corresponding to the first walking route, use each point as the center of a circle, and based on the rule that the farther the center of the circle is from the starting position, the smaller the radius corresponding to the center of the circle, determine all circular regions corresponding to the first walking route where all the radii are greater than a preset value, and determine whether there are available vehicles in the circular regions; if there are, based on a preset screening rule, screen out the vehicle that can enable the user to reach the ending position in the shortest time from all the available vehicles, that is, the best vehicle; finally, plan a second walking route from the starting position to the position of the best vehicle, and send all the available vehicles, the best vehicle, and the second walking route to the terminal, so that when the user moves according to the first walking route displayed by the terminal, the user can also reach the ending position according to the available vehicles, the best vehicle, and the second walking route displayed by the terminal.

[0012] Thus, in the embodiment of the present invention, when the terminal displays available vehicles, on the basis of displaying the first walking route, the terminal displays the available vehicles in the vicinity of the first walking route, that is, in all circular regions corresponding to the first walking route, so that the available vehicles displayed by the terminal are in line with the first walking route, and when the user moves according to the first walking route, the user can reach the ending position through the vehicles near the first walking route, thereby realizing the intelligent display of available vehicles. Moreover, since the available vehicles are in line with the first walking route, it is avoided that the terminal displays vehicles that are in the opposite direction and far away from the user's destination, optimizing the display screen of the terminal.

[0013] Optionally, in an implementation manner provided by an embodiment of the present invention, after determining the points corresponding to the first walking route, using each point as the center of a circle, and based on the rule that the farther the center of the circle is from the starting position, the smaller the radius corresponding to the center of the circle, and determining all circular regions corresponding to the first walking route, the method further includes:

[0014] If there are no available vehicles in all the circular regions, then in a preset time period, the current position information of the terminal is obtained in real time;

[0015] When the current location information is within the recognizable range of the first walking route, set the current location information as the new starting position, execute the step of planning the first walking route from the starting position to the ending position, and send the first walking route to the terminal.

[0016] In this embodiment, the beneficial effects that can be achieved by the embodiments of the present invention are as follows: Even if the user deviates from the first walking route, the server will re-plan the first walking route according to the user's real-time location, that is, the current location information sent by the terminal, thereby realizing the dynamic update of the first walking route. Moreover, since the server will also adjust the circular area in real time according to the dynamically updated first walking route and determine the shared vehicles in the circular area, the server will send the real-time updated shared vehicles to the terminal in the subsequent steps, and the user can select a vehicle for travel according to the real-time updated shared vehicles on the terminal, thereby improving the user's vehicle use experience.

[0017] Further, in an embodiment provided by the embodiments of the present invention, the recognizable range includes all circular areas corresponding to the first walking route.

[0018] Optionally, in an embodiment provided by the embodiments of the present invention, after screening out the best vehicle from all available vehicles based on a preset screening rule if there are available vehicles in all the circular areas, the method further includes:

[0019] Bind the user to the best vehicle so that the best vehicle can only be unlocked by the user.

[0020] In this embodiment, the beneficial effects that can be achieved by the embodiments of the present invention are as follows: It avoids the situation where the best vehicle is occupied by other users on the way for the user to go to the best vehicle, resulting in the user being unable to use the best vehicle, and ensures the user's vehicle use experience.

[0021] Further, in an embodiment provided by the embodiments of the present invention, after binding the user to the best vehicle so that the best vehicle can only be unlocked by the user, the method further includes:

[0022] Obtain the binding release instruction sent by the user through the terminal, and release the binding between the user and the best vehicle.

[0023] Optionally, in an embodiment provided by the embodiments of the present invention, if there are available vehicles in all the circular areas, screening out the best vehicle from all available vehicles based on a preset screening rule includes:

[0024] If there are available vehicles in all the circular areas, obtain the walking speed of the user;

[0025] For each of the available vehicles, calculate a first duration required for the user to move from the starting position to the position of the available vehicle based on the walking speed, and calculate a second duration required to move from the position of the available vehicle to the ending position based on a preset driving speed;

[0026] Use the available vehicle with the minimum sum of the first duration and the corresponding second duration as the optimal vehicle.

[0027] Under this implementation manner, the beneficial effects that can be achieved by the embodiments of the present invention are as follows: Based on the calculation of the first time and the second time, the server effectively estimates the time required for the user to reach the ending position through each available vehicle, and then uses the vehicle with the shortest total time, that is, the vehicle with the minimum sum of the first time and the second time, as the optimal vehicle, realizing the accurate selection of the optimal vehicle.

[0028] Optionally, in an implementation manner provided by the embodiments of the present invention, after planning a second walking route from the starting position to the position of the optimal vehicle and sending all the available vehicles, the optimal vehicle, and the second walking route to the terminal for the terminal to display all the available vehicles, the optimal vehicle, and the second walking route, the method further includes:

[0029] Obtain an optimal vehicle change instruction sent by the user through the terminal, and change the optimal vehicle to the available vehicle corresponding to the optimal vehicle change instruction;

[0030] Plan a third walking route from the starting position to the position of the changed optimal vehicle, and send the third walking route to the terminal for the terminal to display the third walking route.

[0031] Under this implementation manner, the beneficial effects that can be achieved by the embodiments of the present invention are as follows: Realize the route planning after the change of the optimal vehicle, meet the user's free selection of the optimal vehicle, and improve the user's vehicle use experience.

[0032] In a second aspect, an embodiment of the present invention provides a determining device for shared vehicles, which is applied to a server, and the device includes:

[0033] An obtaining module, configured to obtain a starting position and an ending position sent by a user through a terminal;

[0034] A first planning module, configured to plan a first walking route from the starting position to the ending position, and send the first walking route to the terminal for the terminal to display the first walking route;

[0035] A determination module, configured to determine points corresponding to the first walking route, and use each of the points as a center. Based on the rule that the farther the center is from the starting position, the smaller the radius corresponding to the center, determine all circular regions corresponding to the first walking route, where the radius of each circular region is greater than a preset value;

[0036] A screening module, configured to, if there is an available vehicle among all the circular regions, screen out the best vehicle from all the available vehicles based on a preset screening rule, where the available driving distance of the available vehicle is greater than or equal to the distance from the position of the available vehicle to the end position, and the best vehicle means that the time for the user to travel from the starting position to the end position by the best vehicle is the shortest;

[0037] A second planning module, configured to plan a second walking route from the starting position to the position of the best vehicle, and send all the available vehicles, the best vehicle, and the second walking route to the terminal, so that the terminal displays all the available vehicles, the best vehicle, and the second walking route.

[0038] In a third aspect, an embodiment of the present invention provides a computer device, including a memory and a processor. The memory stores a computer program, and when the computer program runs on the processor, it executes the method for determining a shared vehicle disclosed in any one of the first aspects.

[0039] In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored. When the computer program runs on a processor, it executes the method for determining a shared vehicle disclosed in any one of the first aspects. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] In order to more clearly illustrate the technical solutions of the present invention, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present invention, and therefore should not be regarded as limiting the protection scope of the present invention. In each drawing, similar components are numbered similarly.

[0041] Figure 1 The flowchart showing the method for determining a shared vehicle provided by an embodiment of the present invention is shown;

[0042] Figure 2 The first route schematic diagram provided by an embodiment of the present invention is shown;

[0043] Figure 3 The second route schematic diagram provided by an embodiment of the present invention is shown;

[0044] Figure 4The third route schematic diagram provided by the embodiment of the present invention is shown;

[0045] Figure 5 The structural schematic diagram of the determination device of the shared vehicle provided by the embodiment of the present invention is shown. Detailed implementation manners

[0046] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments.

[0047] Generally, the components of the embodiments of the present invention described and shown in the drawings here can be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present invention provided in the drawings is not intended to limit the scope of the claimed present invention, but merely represents the selected embodiments of the present invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts belong to the scope of protection of the present invention.

[0048] Hereinafter, the terms "including", "having" and their cognates that can be used in various embodiments of the present invention are only intended to represent specific features, numbers, steps, operations, elements, components or combinations of the foregoing items, and should not be construed as first excluding the existence of one or more other features, numbers, steps, operations, elements, components or combinations of the foregoing items or increasing the possibility of one or more features, numbers, steps, operations, elements, components or combinations of the foregoing items.

[0049] In addition, the terms "first", "second", "third", etc. are only used for distinguishing descriptions and cannot be construed as indicating or implying relative importance.

[0050] Unless otherwise defined, all terms (including technical terms and scientific terms) used herein have the same meaning as commonly understood by those of ordinary skill in the art to which various embodiments of the present invention belong. The terms (such as those defined in a general-use dictionary) will be construed to have the same meaning as the contextual meaning in the relevant technical field and will not be construed to have an idealized meaning or an overly formal meaning unless clearly defined in various embodiments of the present invention.

[0051] Refer to Figure 1 , Figure 1 The flowchart of the first method for determining a shared vehicle provided by the embodiment of the present invention is shown. The method for determining a shared vehicle provided by the embodiment of the present invention is applied to a server, and the method includes:

[0052] S110, obtain the starting position and the ending position sent by the user through the terminal.

[0053] That is, after the user sets the starting position and the ending position through the terminal, the terminal sends the starting position and the ending position to the server for the server to obtain.

[0054] It can be understood that the starting position can be a location that can be located by GPS (Global Positioning System) or Beidou satellite, such as the nearest parking lot or the nearest community exit, or it can be the current position of the terminal. The embodiments of the present invention do not limit this.

[0055] S120, Plan a first walking route from the starting position to the ending position, and send the first walking route to the terminal so that the terminal displays the first walking route.

[0056] That is, the server constructs a route for the user to walk from the starting position to the ending position according to the starting position and the ending position.

[0057] Exemplarily, referring to Figure 2 , Figure 2 shows a first route schematic diagram provided by an embodiment of the present invention, including a starting position 101 and an ending position 102. Figure 2 Each rectangle formed by solid lines in represents a building, and the dotted line represents the first walking route.

[0058] S130, Determine the points corresponding to the first walking route, use each of the points as the center of a circle, and based on the rule that the farther the center of the circle is from the starting position, the smaller the radius corresponding to the center of the circle, determine all circular regions corresponding to the first walking route, where the radius of each circular region is greater than a preset value.

[0059] Exemplarily, referring to Figure 3 , Figure 3 shows a second route schematic diagram provided by an embodiment of the present invention. It should be understood that Figure 3 is based on Figure 2 and adds all circular regions corresponding to the first walking route, that is, 4 dotted circles.

[0060] It can be understood that a line segment can be split into multiple points. Therefore, in the embodiments of the present invention, the first walking route is divided into multiple points to be used as the centers of circles. Then, after determining the centers of the circles, according to the rule that the farther the center of the circle is from the starting position, the smaller the radius corresponding to the center of the circle, the radius of each center of the circle is determined, and then all circles on the first walking route, that is, circular regions, are determined according to the center of the circle and the radius corresponding to the center of the circle.

[0061] It can also be understood that in fact, a line segment can be split into countless points. However, to improve the efficiency of the server in determining the center of the circle, the radius corresponding to the center of the circle, and the circular area, the server in the embodiments of the present invention does not divide the first walking route into countless points. Instead, starting from the starting position of the first walking route, a point in the first walking route is taken as the center of the circle at every preset distance, so as to reduce the computing load of the server and improve the operation efficiency.

[0062] Further, when the center of the circle coincides with the starting position, that is, when the distance between the center of the circle and the starting position is zero, the radius corresponding to the center of the circle is the largest. And as the distance between the center of the circle and the starting position gradually increases, the radius corresponding to the center of the circle gradually decreases. When the distance between the center of the circle and the starting position is greater than the preset distance, the radius corresponding to the center of the circle is the smallest, that is, zero.

[0063] In a feasible manner, when the distance between the center of the circle and the starting position is greater than 1 kilometer, the radius corresponding to the center of the circle is zero.

[0064] Further, since the radius of each circular area is greater than the preset value, and when the center of the circle is too far from the starting position, the radius corresponding to the center of the circle will be 0, only some points in the first walking route will be used as the center of the circle. For example, Figure 3 only four points in the first walking route in

[0065] It should also be noted that since the center of the circle of the circular area in the embodiments of the present invention is a point constituting the first walking route, if there is a shared vehicle that can be used by the user in the circular area, it indicates that the shared vehicle is near the first walking route. Therefore, when the user moves from the starting position to the ending position based on the first walking route, the user can walk to a shared vehicle not far from the user's current position and use it.

[0066] Therefore, although the embodiments of the present invention do not limit the maximum value of the radius corresponding to the center of the circle, when actually setting the maximum value of the radius corresponding to the center of the circle, it is necessary to adjust according to the actual situation to avoid the situation that the maximum value of the radius corresponding to the center of the circle is too large, resulting in the server displaying a shared vehicle that is far from the starting position or far from the points on the first walking route on the user's terminal when the user moves based on the first walking route.

[0067] S140, if there is a vehicle that can be used in all the circular areas, then screen out the best vehicle from all the vehicles that can be used based on a preset screening rule, where the travelable distance corresponding to the vehicle that can be used is greater than or equal to the distance from the position of the vehicle that can be used to the ending position, and the best vehicle means that the time for the user to travel from the starting position to the ending position through the best vehicle is the shortest.

[0068] That is, after determining all circular areas where the radius corresponding to the first walking route is greater than the preset value, the server will detect whether there are available vehicles in all circular areas whose battery power can support the vehicle to travel to the end position, that is, vehicles whose available travel distance is greater than or equal to the distance from the position of the available vehicle to the end position.

[0069] It can be understood that available vehicles refer to vehicles reserved by other users, vehicles not occupied by other users, and vehicles without failures.

[0070] Further, when there are available vehicles, the server will screen out the best vehicle from all available vehicles that can enable the user to reach the end position in the shortest time. Then, in the subsequent steps, the server will send the position of the best vehicle to the terminal so that the user can quickly reach the end position through the best vehicle.

[0071] It can also be understood that the screening method of the best vehicle can be set according to the actual situation. For example, in a feasible method, the screening method of the best vehicle is: based on the preset driving speed, calculate the time required for each available vehicle to reach the end position from its own location, and then use the available vehicle with the minimum required time as the best vehicle.

[0072] In a feasible implementation manner, the screening method of the best vehicle, that is, S140, includes:

[0073] If there are available vehicles in all the circular areas, obtain the walking speed of the user;

[0074] For each available vehicle, based on the walking speed, calculate the first duration required for the user to move from the starting position to the position of the available vehicle, and based on the preset driving speed, calculate the second duration required to move from the position of the available vehicle to the end position;

[0075] Use the available vehicle with the minimum sum of the first duration and the corresponding second duration as the best vehicle.

[0076] That is, after the server determines that there are available vehicles in the circular area, it will obtain the walking speed of the user to calculate the first time required for the user to go to the position of each available vehicle.

[0077] It can be understood that the process of obtaining the walking speed of the user can be set according to the actual situation. For example, in a feasible method, the process for the server to obtain the walking speed of the user includes: the server obtains the position information sent by the terminal in real time, and then determines the position change rate of the terminal according to the change of the position information over time, and then obtains the walking speed of the user.

[0078] In another feasible way, the process for the server to obtain the user's walking speed includes: the terminal obtains the speed according to the speed sensor carried by itself, that is, the user's walking speed, and sends the user's walking speed to the server.

[0079] Further, while obtaining the user's walking speed and calculating the first time required for the user to reach the position of each available vehicle, the server will also calculate the second time required for each available vehicle to travel from its own position to the end position according to the preset driving speed of the shared vehicle stored in advance.

[0080] It can also be understood that the preset driving speed represents the speed of the shared vehicle when most users use the shared vehicle.

[0081] Furthermore, the server calculates the total time for the user to reach the end position through each available vehicle according to the first time and the corresponding second time corresponding to each available vehicle, so as to select the available vehicle corresponding to the minimum total time as the best vehicle, and the server will send the position information of the best vehicle to the user's terminal in the subsequent steps, so that the user knows which available vehicle can enable the user to reach the end position fastest.

[0082] Thus, based on the calculation of the first time and the second time, the server in the embodiment of the present invention effectively estimates the time required for the user to reach the end position through each available vehicle, and then takes the vehicle with the shortest corresponding total time, that is, the vehicle with the minimum sum of the first time and the second time, as the best vehicle, realizing the accurate selection of the best vehicle.

[0083] In addition, it can be understood that when there are no available vehicles in all circular areas, the steps to be executed by the server can be set according to the actual situation. For example, in a feasible way, the server will send a prompt message indicating that there are no available shared vehicles to the terminal, so that the user knows that there are no available vehicles near the walking route.

[0084] In a feasible way provided by the embodiment of the present invention, when there are no available vehicles in all circular areas, that is, after S130, the method includes:

[0085] If there are no available vehicles in all the circular areas, the current position information of the terminal is obtained in real time within a preset time period;

[0086] When the current position information is within the recognizable range of the first walking route, the current position information is set as the new starting position, and the step of planning the first walking route from the starting position to the end position and sending the first walking route to the terminal is executed.

[0087] It should be understood that in this implementation manner, the starting position can be a location set by the user that can be accurately detected by positioning satellites. Therefore, when the user sets the starting position, the user's terminal may not be at the starting position, that is, the user needs to move from the current position to the starting position.

[0088] Furthermore, when the server determines that there are no available vehicles in all the circular areas, it will continuously obtain the current position information sent by the terminal within a preset time period, that is, the real-time position of the user.

[0089] Next, based on the current position information sent by the server terminal, it will continuously detect whether the user is within the recognizable range of the first walking route, that is, determine whether the user is near the first walking route. It can be understood that the user may not pass through the starting position during the process of moving towards the ending position.

[0090] When the user is within the recognizable range of the first walking route, the server will use the user's real-time position, that is, the current position information continuously sent by the terminal within the preset time period, as the starting position, that is, the starting position will change to the current position information that changes in real time.

[0091] Based on this, the server will continuously plan the first walking route for the user to move from the current position information to the ending position according to the current position information that changes in real time. At the same time, the server will also continuously adjust the circular area corresponding to the first walking route and re-determine the vehicles that can be used by the user according to the adjusted circular area.

[0092] Thus, the embodiment of the present invention realizes that even if the user deviates from the first walking route, the server will re-plan the first walking route according to the user's real-time position, that is, the current position information sent by the terminal, and then realizes the dynamic update of the first walking route. Moreover, since the server will also continuously adjust the circular area according to the dynamically updated first walking route and determine the shared vehicles in the circular area, the server will send the continuously updated shared vehicles to the terminal in the subsequent steps, and the user can select a vehicle to travel according to the continuously updated shared vehicles on the terminal, thereby improving the user's vehicle usage experience.

[0093] In addition, it can also be understood that the recognizable range of the first walking route can be set according to the actual situation. For example, in a feasible manner, when the first walking route is a straight line segment, the recognizable range of the first walking route is a rectangular area range formed by using the first walking route as the length and matching a preset width.

[0094] In an implementation manner provided by the embodiment of the present invention, the recognizable range includes all the circular areas corresponding to the first walking route.

[0095] S150, plan a second walking route from the starting position to the position of the best vehicle, and send all the available vehicles, the best vehicle, and the second walking route to the terminal, so that the terminal displays all the available vehicles, the best vehicle, and the second walking route.

[0096] That is, after the server determines the best vehicle and the second walking route for the user to go from the starting position to the position of the best vehicle, it sends the best vehicle, the second walking route, and all the available vehicles to the terminal of the user side. Then, while the terminal displays the first walking route, it will also display all the available vehicles, the best vehicle, and the second walking route.

[0097] Therefore, after the terminal displays the second walking route and the best vehicle, the user can go from the starting position to the position where the best vehicle is located according to the second walking route, and thus quickly reach the end position. And since all the available vehicles are also displayed on the terminal, the user can also independently select the vehicle to be used according to the positions of the available vehicles.

[0098] Exemplarily, referring to Figure 4 , Figure 4 shows the third route schematic diagram provided by the embodiment of the present invention, including the first available vehicle 103 and the second available vehicle 104. The solid line connecting the first available vehicle 103 and the starting position 101 is the second walking route. Among them, the first available vehicle 103 is the best vehicle.

[0099] It is not difficult to understand that Figure 4 is based on Figure 3 and adds the illustrations of the first available vehicle 103 and the second available vehicle 104.

[0100] In the method for determining a shared vehicle provided by an embodiment of the present invention, after the server obtains the starting position and the ending position sent by the user through the terminal, it will plan a walking route for the user to go from the starting position to the ending position, that is, the first walking route, and send the first walking route to the user's terminal for display. Then, the user can go to the ending position according to the first walking route. Next, the points corresponding to the first walking route are determined. Taking each point as the center of a circle, based on the rule that the farther the center of the circle is from the starting position, the smaller the radius corresponding to the center of the circle, circular areas where all the radii corresponding to the first walking route are greater than a preset value are determined, and it is determined whether there are available vehicles in the circular areas. If there are, based on a preset screening rule, the vehicle that can enable the user to reach the ending position in the shortest time is selected from all the available vehicles, that is, the best vehicle. Finally, a second walking route from the starting position to the position of the best vehicle is planned, and all the available vehicles, the best vehicle, and the second walking route are sent to the terminal, so that when the user moves according to the first walking route displayed on the terminal, the user can also reach the ending position according to the available vehicles, the best vehicle, and the second walking route displayed on the terminal.

[0101] Thus, in the embodiment of the present invention, when the terminal displays available vehicles, on the basis of displaying the first walking route, the terminal displays the available vehicles in the vicinity of the first walking route, that is, in all the circular areas corresponding to the first walking route, making the available vehicles displayed on the terminal close to the first walking route, and enabling the user to reach the ending position by the vehicles near the first walking route when moving according to the first walking route, thereby realizing the intelligent display of available vehicles. Moreover, since the available vehicles are close to the first walking route, the terminal is prevented from displaying vehicles that are in the opposite direction and far away from the user's destination, optimizing the display screen of the terminal.

[0102] Optionally, to further improve the user's car - using experience, in an embodiment provided by the embodiment of the present invention, after step 140, the method further includes:

[0103] Binding the user to the best vehicle so that the best vehicle can only be unlocked by the user.

[0104] That is, after the server determines the best vehicle among all the available vehicles, it will bind the best vehicle to the user, that is, the user - corresponding account information or terminal, so that the best vehicle can only be unlocked by the user through the terminal, avoiding the situation that the best vehicle is occupied by other users on the way when the user goes to the best vehicle, and improving the user's car - using experience.

[0105] In a feasible manner, the server will trigger a vehicle reservation operation to complete the binding of the user to the best vehicle.

[0106] Further, in an implementation provided by an embodiment of the present invention, after binding the user to the optimal vehicle so that the optimal vehicle can only be unlocked by the user, the method further includes:

[0107] Obtain a binding release instruction sent by the user through the terminal, and release the binding between the user and the optimal vehicle.

[0108] That is, the user can send a binding release instruction to the server through the terminal to release the binding between the user and the optimal vehicle, so that the optimal vehicle can be occupied / used by other users.

[0109] It can be understood that this implementation is only one of the feasible ways to release the binding between the user and the optimal vehicle, and other ways can also be set / compatible for releasing the binding.

[0110] Exemplarily, in a feasible way, when the server binds the user to the optimal vehicle, it records the distance between the user and the optimal vehicle as the first distance; then, the server will regularly obtain the location information sent by the user terminal, and judge whether the current distance between the user and the optimal vehicle exceeds the first distance according to the location information. If so, the binding between the user and the optimal vehicle will be released.

[0111] In another feasible way, when the server binds the user to the optimal vehicle, it records the binding time of the optimal vehicle, that is, the cumulative value of the time when the optimal vehicle is bound to the user; when the binding time exceeds the preset time value, the binding between the user and the optimal vehicle will be released.

[0112] Optionally, to improve the user's vehicle use experience, in an implementation provided by an embodiment of the present invention, after S150, the method further includes:

[0113] Obtain an optimal vehicle change instruction sent by the user through the terminal, and change the optimal vehicle to the available vehicle corresponding to the optimal vehicle change instruction;

[0114] Plan a third walking route from the starting position to the position of the changed optimal vehicle, and send the third walking route to the terminal so that the terminal can display the third walking route.

[0115] That is, when the user believes that the best vehicle displayed on the terminal cannot reach the end position fastest, the user can set other available vehicles displayed on the terminal as the best vehicle. After the terminal receives the operation triggered by the user and determines the best vehicle set by the user, it will generate and send a best vehicle change instruction to the server. After receiving the best vehicle change instruction, the server will change the previously recognized best vehicle to the best vehicle set by the user, that is, the available vehicle corresponding to the best vehicle change instruction, and plan the third walking route for the user to go from the starting position to the position of the changed best vehicle, and send the third walking route to the user's terminal for the terminal to display.

[0116] Based on this, the embodiment of the present invention realizes the route planning after the best vehicle is changed, meets the user's free selection of the best vehicle, and improves the user's car - using experience.

[0117] In addition, in an implementation manner provided by the embodiment of the present invention, after determining the best vehicle, the server will bind the best vehicle to the user so that the best vehicle can only be unlocked and used by the user. Further, after the server binds the user to the best vehicle, when the server receives the best vehicle change instruction sent by the user through the terminal, it will unbind the user from the best vehicle and bind the user to the vehicle corresponding to the best vehicle change instruction.

[0118] Corresponding to the method for determining a shared vehicle provided by the embodiment of the present invention, the embodiment of the present invention also provides a device for determining a shared vehicle. Refer to Figure 5 , Figure 5 which shows a schematic structural diagram of the device for determining a shared vehicle provided by the embodiment of the present invention. The device for determining a shared vehicle 200 provided by the embodiment of the present invention is applied to the server, and the device includes:

[0119] An acquisition module 210, configured to acquire the starting position and the end position sent by the user through the terminal;

[0120] A first planning module 220, configured to plan a first walking route from the starting position to the end position, and send the first walking route to the terminal so that the terminal displays the first walking route;

[0121] A determination module 230, configured to determine the points corresponding to the first walking route, and use each of the points as the center of a circle. Based on the rule that the farther the center of the circle is from the starting position, the smaller the radius corresponding to the center of the circle, determine all circular regions corresponding to the first walking route, where the radius of each circular region is greater than a preset value;

[0122] A screening module 240 is configured to screen out the best vehicle from all the available vehicles based on a preset screening rule if there are available vehicles in all the circular areas, wherein the drivable distance corresponding to the available vehicle is greater than or equal to the distance from the location of the available vehicle to the destination location, and the best vehicle indicates that the time for the user to travel from the starting location to the destination location by the best vehicle is the shortest;

[0123] The second planning module 250 is used to plan a second walking route from the starting position to the position of the best vehicle, and send all the available vehicles, the best vehicle and the second walking route to the terminal so that the terminal displays all the available vehicles, the best vehicle and the second walking route.

[0124] Optionally, in an implementation manner provided by an embodiment of the present invention, the device further includes:

[0125] A current location acquisition module, used for acquiring the current location information of the terminal in real time within a preset time period if there is no available vehicle in all the circular areas;

[0126] A starting point setting module is used to set the current location information as a new starting point when the current location information is within the recognizable range of the first walking route, and execute the steps of planning the first walking route from the starting point to the end point, and sending the first walking route to the terminal.

[0127] Furthermore, in an implementation manner provided by an embodiment of the present invention, the identifiable range includes all circular areas corresponding to the first walking route.

[0128] Optionally, in an implementation manner provided by an embodiment of the present invention, the device further includes:

[0129] A binding module is used to bind the user to the best vehicle so that the best vehicle can only be unlocked by the user.

[0130] Furthermore, in an implementation manner provided by an embodiment of the present invention, the device further includes:

[0131] The binding release module is used to obtain a binding release instruction sent by the user through the terminal, and release the binding between the user and the best vehicle.

[0132] Optionally, in an implementation manner provided by an embodiment of the present invention, the screening module includes:

[0133] A walking speed acquisition submodule, used for acquiring the walking speed of the user if there are available vehicles in all the circular areas;

[0134] A duration calculation sub-module, configured to, for each of the available vehicles, calculate a first duration required for the user to move from the starting position to the position of the available vehicle based on the walking speed, and calculate a second duration required to move from the position of the available vehicle to the ending position based on a preset driving speed;

[0135] An optimal vehicle determination module, configured to use the available vehicle with the minimum sum of the first duration and the corresponding second duration as the optimal vehicle.

[0136] Optionally, in an implementation manner provided in an embodiment of the present invention, the device further includes:

[0137] A change instruction acquisition module, configured to acquire an optimal vehicle change instruction sent by the user through the terminal, and change the optimal vehicle to the available vehicle corresponding to the optimal vehicle change instruction;

[0138] A third planning module, configured to plan a third walking route from the starting position to the position of the changed optimal vehicle, and send the third walking route to the terminal so that the terminal displays the third walking route.

[0139] The shared vehicle determination device provided in an embodiment of the present application can implement Figure 1 each process of the shared vehicle determination method in the disclosed method embodiment, and can achieve the same technical effect. To avoid repetition, details are not described herein again.

[0140] An embodiment of the present invention further provides a computer device, including a memory and a processor. The memory stores a computer program, and when the computer program runs on the processor, it executes the shared vehicle determination method disclosed in the corresponding Figure 1 method embodiment.

[0141] An embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored. When the computer program runs on a processor, it executes the shared vehicle determination method disclosed in the corresponding Figure 1 method embodiment.

[0142] In several embodiments provided in this application, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device embodiments described above are merely illustrative. For example, the flowcharts and structure diagrams in the accompanying drawings show the possible architectures, functions, and operations of devices, methods, and computer program products according to multiple embodiments of the present invention. In this regard, each block in the flowchart or block diagram can represent a module, a program segment, or a part of code, and the module, program segment, or part of code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in an alternative implementation, the functions marked in the blocks can occur in a different order from that marked in the accompanying drawings. For example, two consecutive blocks can actually be executed substantially in parallel, and they can sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the structure diagram and / or flowchart, as well as the combination of blocks in the structure diagram and / or flowchart, can be implemented by a dedicated hardware-based system that performs the specified functions or actions, or can be implemented by a combination of dedicated hardware and computer instructions.

[0143] In addition, in each embodiment of the present invention, each functional module or unit can be integrated together to form an independent part, or each module can exist separately, or two or more modules can be integrated to form an independent part.

[0144] If the above functions are implemented in the form of software functional modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a smart phone, a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in each embodiment of the present invention. The aforementioned storage medium includes various media that can store program codes, such as USB flash drives, mobile hard disks, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), magnetic disks, or optical discs.

[0145] The above is only the specific implementation manner of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art within the technical scope disclosed by the present invention can easily think of changes or substitutions, which should all be covered by the protection scope of the present invention.

Claims

1. A method for determining a shared vehicle, characterized in that, Applied to a server, the method includes: Obtain the starting position and the ending position sent by the user through the terminal; Plan a first walking route from the starting position to the ending position, and send the first walking route to the terminal so that the terminal displays the first walking route; Determine the points corresponding to the first walking route. Taking each of the points as the center of a circle, based on the rule that the farther the center of the circle is from the starting position, the smaller the radius corresponding to the center of the circle, determine all the circular regions corresponding to the first walking route. Wherein, the radius of each circular region is greater than a preset value. The step of determining the points corresponding to the first walking route includes: starting from the starting position of the first walking route, taking a point in the first walking route as the center of the circle every first preset distance, and the distance between the center of the circle and the starting position gradually increases, and the radius corresponding to the center of the circle gradually decreases. When the distance between the center of the circle and the starting position is greater than the second preset distance, the radius corresponding to the center of the circle is zero; If there are available vehicles among all the circular regions, screen out the best vehicle from all the available vehicles based on a preset screening rule. Wherein, the available driving distance of the available vehicle is greater than or equal to the distance from the position of the available vehicle to the ending position, and the best vehicle means that the time for the user to travel from the starting position to the ending position by the best vehicle is the shortest; Plan a second walking route from the starting position to the position of the best vehicle, and send all the available vehicles, the best vehicle and the second walking route to the terminal so that the terminal displays all the available vehicles, the best vehicle and the second walking route.

2. The determination method of the shared vehicle according to claim 1, wherein After determining the points corresponding to the first walking route, taking each of the points as the center of a circle, and determining all the circular regions corresponding to the first walking route based on the rule that the farther the center of the circle is from the starting position, the smaller the radius corresponding to the center of the circle, the method further includes: If there are no available vehicles among all the circular regions, obtain the current position information of the terminal in real time within a preset time period; When the current position information is within the recognizable range of the first walking route, set the current position information as the new starting position, and execute the step of planning the first walking route from the starting position to the ending position and sending the first walking route to the terminal.

3. The determination method of the shared vehicle according to claim 2, characterized in that, The recognizable range includes all the circular regions corresponding to the first walking route.

4. The method for determining a shared vehicle according to claim 1, wherein After the step of if there are available vehicles among all the circular regions, screen out the best vehicle from all the available vehicles based on a preset screening rule, the method further includes: Bind the user to the best vehicle so that the best vehicle can only be unlocked by the user.

5. The method for determining a shared vehicle according to claim 4, wherein After the step of binding the user to the best vehicle so that the best vehicle can only be unlocked by the user, the method further includes: Obtain the binding release instruction sent by the user through the terminal, and release the binding between the user and the best vehicle.

6. The method for determining a shared vehicle according to claim 1, wherein If there are available vehicles in all the circular regions, screening out the best vehicle from all the available vehicles based on a preset screening rule includes: If there are available vehicles in all the circular regions, obtaining the walking speed of the user; For each available vehicle, calculating a first duration required for the user to move from the starting position to the position of the available vehicle based on the walking speed, and calculating a second duration required to move from the position of the available vehicle to the ending position based on a preset driving speed; Taking the available vehicle with the minimum sum of the first duration and the corresponding second duration as the best vehicle.

7. The determination method of the shared vehicle according to claim 1, wherein After planning a second walking route from the starting position to the position of the best vehicle and sending all the available vehicles, the best vehicle, and the second walking route to the terminal for the terminal to display all of them, the method further includes: Obtaining a best vehicle change instruction sent by the user through the terminal, and changing the best vehicle to the available vehicle corresponding to the best vehicle change instruction; Planning a third walking route from the starting position to the position of the changed best vehicle, and sending the third walking route to the terminal for the terminal to display the third walking route.

8. A determining device for shared vehicles, characterized in that, Applied to a server, the device includes: An obtaining module, configured to obtain a starting position and an ending position sent by a user through a terminal; A first planning module, configured to plan a first walking route from the starting position to the ending position, and send the first walking route to the terminal for the terminal to display the first walking route; A determining module, configured to determine points corresponding to the first walking route, taking each of the points as a center, and determining all circular regions corresponding to the first walking route based on the rule that the farther the center is from the starting position, the smaller the radius corresponding to the center, wherein the radius of each circular region is greater than a preset value; wherein the step of determining points corresponding to the first walking route includes: starting from the starting position of the first walking route, taking a point in the first walking route as a center every first preset distance, and the distance between the center and the starting position gradually increases, and the radius corresponding to the center gradually decreases, and when the distance between the center and the starting position is greater than a second preset distance, the radius corresponding to the center is zero; A screening module, configured to, if there are available vehicles in all the circular regions, screen out the best vehicle from all the available vehicles based on a preset screening rule, wherein the available driving distance of the available vehicle is greater than or equal to the distance from the position of the available vehicle to the ending position, and the best vehicle means the vehicle that takes the shortest time for the user to travel from the starting position to the ending position through the best vehicle; A second planning module, configured to plan a second walking route from the starting position to the position of the optimal vehicle, and send all the available vehicles, the optimal vehicle, and the second walking route to the terminal, so that the terminal displays all the available vehicles, the optimal vehicle, and the second walking route.

9. A computer device, characterized in that, It includes a memory and a processor. The memory stores a computer program, and when the computer program runs on the processor, it executes the method for determining a shared vehicle according to any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, A computer program is stored on the computer-readable storage medium, and when the computer program runs on the processor, it executes the method for determining a shared vehicle according to any one of claims 1-7.

Images