Scenic area shared hovercar operation method, device and equipment and storage medium

By optimizing the pick-up and drop-off strategies for shared flying cars in mountain scenic areas, and determining target service areas based on user travel plans and incentive strategies, the problem of low visitor efficiency in mountain scenic areas has been solved, improving the visitor experience and the efficiency of scenic area management.

CN119313533AActive Publication Date: 2025-01-14DONGFENG MOTOR GRP
View PDF 10 Cites 0 Cited by

Patent Information

Application Number
CN202411402728.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-10-09
Publication Date
2025-01-14
Estimated Expiration
2044-10-09

AI Technical Summary

Technical Problem

The mountain scenic area suffers from low visitor efficiency, difficulties in transporting personnel and supplies, especially for those prone to motion sickness, and poses safety hazards.

Method used

By responding to users' car-hailing requests, determining the car-hailing distance based on the user's departure location and service area location, filtering out service areas that meet the preset distance, and combining the user's travel plan and incentive strategies to determine the target departure service area, the system optimizes the user's car-hailing and drop-off strategies and improves the efficiency of tourists' travel.

Benefits of technology

It improved the efficiency of tourists' visits to the mountain scenic area, avoided safety hazards, optimized the allocation of resources in the service area, and enhanced the management efficiency and service quality of the scenic area.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119313533A_ABST
    Figure CN119313533A_ABST
Patent Text Reader

Abstract

The invention discloses a mountain area shared hovercar operation method, device and equipment and a storage medium, and relates to the technical field of hovercars, and the mountain area shared hovercar operation method comprises the steps: responding to a user car use request, and determining a plurality of user car use distances according to a user departure position and each departure service area position; screening the plurality of user vehicle using distances according to a preset vehicle using distance, and determining a distance screening result; determining a departure service area set according to a user travel plan and the distance screening result; and determining a target departure service area according to the departure service area set and a preset excitation strategy. According to the method, a user sends a vehicle using demand, an operator recommends a corresponding service area to the user according to a user travel plan and a distribution strategy, and the user arrives at the specified service area to use a vehicle and gets off the vehicle in the nearby service area when the travel is finished, so that the playing efficiency of tourists in the mountain scenic area is improved, and potential safety hazards existing in the mountain scenic area are avoided.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of flying car technology, and in particular to a method, device, equipment and storage medium for operating a shared flying car in a mountain scenic area. Background Art

[0002] With the rapid development of the market economy, the pace of urban life is getting faster and faster. More and more people like to travel in mountainous areas, such as China's Lushan Mountain, a summer resort. With this, some problems have also arisen. The terrain restrictions in the mountains make it difficult to transport personnel and materials, and it is even more difficult for people who are prone to motion sickness to go up the mountain. The emergence of flying cars has brought new development opportunities to scenic spots. It can provide tourists with a unique sightseeing experience and enjoy the beauty of the scenic area from different perspectives. In addition, flying cars can also be used in patrol and line inspection, emergency rescue and other aspects of scenic spots to improve the management efficiency and service quality of scenic spots. Therefore, how to solve the low efficiency of tourists in mountain scenic spots has become an urgent problem to be solved. Summary of the invention

[0003] The main purpose of this application is to provide a method, device, equipment and storage medium for operating a shared flying car in a mountain scenic area, aiming to solve the technical problem of low travel efficiency for tourists in the mountain scenic area.

[0004] To achieve the above-mentioned purpose, the present application proposes a method for operating a shared flying car in a mountain scenic area, and the method for operating a shared flying car in a mountain scenic area includes:

[0005] Responding to a user's request for a car, determining the car distances of multiple users based on the user's departure location and the locations of each departure service area;

[0006] Filtering the vehicle use distances of the plurality of users according to the preset vehicle use distances, and determining a distance filtering result;

[0007] Determine a departure service area set according to the user's travel plan and the distance screening result;

[0008] A target departure service area is determined according to the departure service area set and a preset incentive strategy.

[0009] In one embodiment, the step of determining a departure service area set according to the user's travel plan and the distance screening result includes:

[0010] Determine the corresponding service area planned route according to the distance screening result;

[0011] Comparing the user's travel plan with the service area's planned route, and determining a travel plan comparison result;

[0012] A departure service area set is determined according to the travel plan comparison result.

[0013] In one embodiment, the step of determining the target departure service area according to the departure service area set and the preset incentive strategy includes:

[0014] When there is a travel service area identical to the user's travel plan in the departure service area set, a plurality of vehicle dispatch bonuses are determined according to a positive incentive strategy in a preset incentive strategy and a user's vehicle use distance corresponding to the travel service area set;

[0015] Determine a target bonus ranking based on a user dispatch bonus and a plurality of vehicle dispatch bonuses;

[0016] The target bonus ranking is displayed to allow the user to determine the target departure service area.

[0017] In one embodiment, the step of determining the target bonus ranking according to the user dispatch bonus and the plurality of vehicle dispatch bonuses comprises:

[0018] Screening the plurality of vehicle dispatch bonuses according to the user dispatch bonus to determine a plurality of screened dispatch bonuses;

[0019] The target bonus ranking is determined based on a preset arrangement order and a plurality of the screening scheduling bonuses.

[0020] In one embodiment, the step of determining the target departure service area according to the departure service area set and the preset incentive strategy includes:

[0021] When there is no travel service area identical to the user's travel plan in the departure service area set, determining multiple parking service fees according to a negative incentive strategy in a preset incentive strategy and a user's vehicle use distance corresponding to the departure service area set;

[0022] Determine the service fee ranking according to the user service fee and the plurality of parking service fees;

[0023] The service fee ranking is displayed to enable the user to determine a target departure service area.

[0024] In one embodiment, the mountain scenic area shared flying car operation method further includes:

[0025] In response to the user's request to get off the vehicle, the parking distances of multiple users are determined according to the user's getting off location and the locations of each parking service area;

[0026] Screening the parking distances of the plurality of users according to the preset vehicle use distances to determine a parking screening result;

[0027] The target parking service area is determined according to the preset incentive strategy and the distance screening result.

[0028] In one embodiment, the step of determining the target parking service area according to the preset incentive strategy and the distance screening result includes:

[0029] Determine multiple parking service fees according to the negative incentive strategy in the preset incentive strategy and the parking service area corresponding to the distance screening result;

[0030] Determine the target service fee ranking according to the user parking fee and the multiple parking service fees;

[0031] The target service fee ranking is displayed to enable the user to determine the target parking service area.

[0032] In addition, to achieve the above-mentioned purpose, the present application also proposes a mountain scenic area shared flying car operation device, the mountain scenic area shared flying car operation device comprising:

[0033] A response module, used to respond to a user's car request and determine the car distances of multiple users according to the user's starting location and the locations of each starting service area;

[0034] A screening module, used to screen the vehicle use distances of multiple users according to a preset vehicle use distance, and determine the distance screening result;

[0035] A processing module, used to determine a departure service area set according to the user's travel plan and the distance screening result;

[0036] The processing module is further used to determine a target departure service area according to the departure service area set and a preset incentive strategy.

[0037] In addition, to achieve the above-mentioned purpose, the present application also proposes a mountain scenic area shared flying car operation device, the device comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, the computer program being configured to implement the steps of the mountain scenic area shared flying car operation method as described above.

[0038] In addition, to achieve the above-mentioned purpose, the present application also proposes a storage medium, which is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by the processor, the steps of the method for operating a shared flying car in a mountain scenic area as described above are implemented.

[0039] In addition, to achieve the above-mentioned purpose, the present application also provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, it implements the steps of the mountain scenic area shared flying car operation method as described above.

[0040] This application responds to user car use requests, determines multiple user car use distances according to the user's departure location and the location of each departure service area; screens multiple user car use distances according to the preset car use distance to determine the distance screening result; determines the departure service area set according to the user's travel plan and the distance screening result; and determines the target departure service area according to the departure service area set and the preset incentive strategy. When the user issues a car use demand, the operator recommends the corresponding service area to the user based on the user's travel plan and allocation strategy. The user arrives at the designated service area to use the car and gets off at a nearby service area when the trip ends, which improves the efficiency of tourists in the mountain scenic area and avoids safety hazards in the mountain scenic area. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0042] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0043] Figure 1 A flow chart of the first embodiment of the method for operating a shared flying car in a mountain scenic area of ​​the present application;

[0044] Figure 2 A schematic diagram of a detached flying car provided in Example 1 of the mountain scenic area shared flying car operation method of the present application;

[0045] Figure 3 A schematic diagram of the operation of a detached flying car provided in Embodiment 1 of the method for operating a shared flying car in a mountain scenic area of ​​the present application;

[0046] Figure 4 A schematic diagram of the architecture of an unmanned flying car sharing system provided in Example 1 of the mountain scenic area flying car sharing operation method of the present application;

[0047] Figure 5 A schematic diagram of positive incentives faced by users provided in Example 1 of the method for operating a shared flying car in a mountain scenic area of ​​the present application;

[0048] Figure 6 A schematic diagram of negative incentives faced by users provided in Example 1 of the method for operating a shared flying car in a mountain scenic area of ​​the present application;

[0049] Figure 7 A schematic diagram of a strategy flow for allocating user car service areas provided in Example 1 of the mountain scenic area shared flying car operation method of the present application;

[0050] Figure 8 A flow chart of the second embodiment of the method for operating a shared flying car in a mountain scenic area of ​​the present application;

[0051] Fig. 9 A schematic diagram of the strategy flow for allocating user drop-off service areas provided in Embodiment 2 of the method for operating a shared flying car in a mountain scenic area of ​​the present application;

[0052] Fig.10 This is a schematic diagram of the module structure of a shared flying car operating device for a mountain scenic area according to an embodiment of the present application;

[0053] Fig.11 This is a schematic diagram of the equipment structure of the hardware operating environment involved in the method for operating a shared flying car in a Zhongshan scenic area in an embodiment of the present application.

[0054] The purpose, features and advantages of this application will be further described in conjunction with the embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0055] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of the present application and are not used to limit the present application.

[0056] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.

[0057] The main solution of the embodiment of the present application is: responding to the user's car use request, determining multiple user car use distances according to the user's departure location and the location of each departure service area; filtering the multiple user car use distances according to the preset car use distances to determine the distance filtering results; determining the departure service area set according to the user's travel plan and the distance filtering results; determining the target departure service area according to the departure service area set and the preset incentive strategy.

[0058] With the rapid development of the market economy, the pace of urban life is getting faster and faster. More and more people like to travel in mountainous areas, such as China's Lushan Mountain, a summer resort. With this, some problems have also arisen. The terrain restrictions in the mountains make it difficult to transport personnel and materials, and it is even more difficult for people who are prone to motion sickness to go up the mountain. The emergence of flying cars has brought new development opportunities to scenic spots. It can provide tourists with a unique sightseeing experience and enjoy the beauty of the scenic area from different perspectives. In addition, flying cars can also be used in patrol and line inspection, emergency rescue and other aspects of scenic spots to improve the management efficiency and service quality of scenic spots. Therefore, how to solve the low efficiency of tourists in mountain scenic spots has become an urgent problem to be solved.

[0059] This application responds to user car use requests, determines multiple user car use distances according to the user's departure location and the location of each departure service area; screens multiple user car use distances according to the preset car use distance to determine the distance screening result; determines the departure service area set according to the user's travel plan and the distance screening result; and determines the target departure service area according to the departure service area set and the preset incentive strategy. When the user issues a car use demand, the operator recommends the corresponding service area to the user based on the user's travel plan and allocation strategy. The user arrives at the designated service area to use the car and gets off at a nearby service area when the trip ends, which improves the efficiency of tourists in the mountain scenic area and avoids safety hazards in the mountain scenic area.

[0060] It should be noted that the execution subject of this embodiment can be a computing service device with data processing, network communication and program running functions, such as a tablet computer, a personal computer, a mobile phone, etc., or a mountain scenic area shared flying car operation device that can realize the above functions. The following takes the mountain scenic area shared flying car operation device as an example of the execution subject to illustrate this embodiment and the following embodiments.

[0061] Based on this, the embodiment of the present application provides a method for operating a shared flying car in a mountain scenic area, referring to Figure 1 , Figure 1 This is a flow chart of the first embodiment of the method for operating a shared flying car in a mountain scenic area of ​​the present application.

[0062] In this embodiment, the mountain scenic area shared flying car operation method includes steps S10 to S40:

[0063] Step S10, responding to a user's car use request, determining a plurality of user car use distances according to the user's starting location and the locations of each starting service area;

[0064] It should be noted that if Figure 2 As shown, the detachable flying car in this embodiment mainly includes three modules: a flight module, a passenger cabin and a ground driving module. It can realize two operating modes: the flight module and the passenger cabin are combined to form an air flight mode, and the ground driving module and the passenger cabin are combined to form a ground driving mode.

[0065] It is understandable that due to the limited energy carrying space of flying cars and the large energy consumption during flight, it is still difficult to achieve long-distance flight. The combination of aerial flight and ground driving can be quickly put into commercial operation. Separated flying cars have n specific mode conversion stations or service areas at each scenic spot. The conversion of aerial flight mode or ground driving mode is carried out at the conversion station or service area. It will go through four stages of take-off, cruising, autonomous guidance landing, and ground driving to complete the transportation task. Before the take-off stage, the flight module docks with the passenger cabin through the autonomous guidance landing technology and locks it, and releases the connection between the passenger cabin and the ground driving module. Then the flight module generates lift by rotating the rotor to bring the passenger cabin into the air. In the cruising stage, the flight module carries the passenger cabin in the air and flies safely to the mode conversion station or service area of ​​the destination according to the predetermined track. In the autonomous guidance landing stage, the flight module uses the autonomous guidance landing technology to accurately land the passenger cabin on the stationary ground driving module and complete the docking and locking. At the same time, the flight module is unlocked and separated from the passenger cabin. During the ground travel phase, the ground travel module carries the passenger cabin to transport the passengers from the modal conversion station or service area to the destination.

[0066] It should be noted that if Figure 3 As shown in the figure, the unmanned operation system of flying autonomous driving online car-hailing has the functions of remote monitoring, remote control, autonomous driving and operation management of vehicles. Figure 4 This is the architecture diagram of the unmanned operation system of flying autonomous driving online car-hailing. This system includes: mobile client, perception sensor, autonomous driving controller, vehicle-mounted network terminal, vehicle chassis actuator, flight module, remote control platform, scheduling cloud platform and remote driving platform. The mobile client is used for users to make vehicle reservations. The perception sensors include cameras, laser radars, millimeter-wave radars and ultrasonic radars, which are used to obtain vehicle driving environment information; the autonomous driving controller controls the vehicle chassis actuator or flight module to drive safely and stably according to the external driving environment information obtained by the perception sensor; the vehicle-mounted network terminal is used to receive remote driving signals and upload vehicle driving status information; the scheduling cloud platform is used to receive driving environment information and vehicle driving status information fed back by remote vehicles, receive customer reservation information, allocate vehicles for mission execution and forward vehicle control signals output by the remote driving platform; the remote driving platform is used for remote drivers to remotely take over and control the vehicle.

[0067] It can be understood that the user's car request refers to the car request initiated by the user through the mobile terminal, the user's starting location refers to the location of the user's departure, the departure service area location refers to the location of the departure service area, and the user's car distance refers to the distance between the user and the departure service area location.

[0068] In the specific implementation, the service area is an area that allows users to get on and off the vehicle normally and has temporary parking spaces for vehicles. Due to the shortage of service areas in scenic spots, the service areas can be divided into three categories: operator-built, long-term leased, and temporary leased. Then, when a user initiates a car demand through a mobile terminal, the distance between the user and different service areas is calculated based on the user's departure location and the location of each departure service area, that is, the car usage distance of multiple users is obtained.

[0069] Step S20, screening the multiple user vehicle use distances according to the preset vehicle use distances, and determining the distance screening result;

[0070] It can be understood that the preset vehicle use distance refers to a distance threshold used to determine whether a service area meets the user's distance requirements. In this embodiment, 3 km is taken as an example, and the distance screening result includes multiple service areas that meet the user's distance requirements.

[0071] In the specific implementation, the distance critical value used to determine whether the service area meets the user's distance requirements is compared with the distances between multiple users and the departure service area locations. According to market experience, users in scenic spots usually choose service areas with a distance of less than 1km and the farthest cannot exceed 3km. Then, multiple service areas with a distance of less than 3km between the user and the departure service area locations are screened out, and finally the distance screening results are obtained.

[0072] Step S30, determining a departure service area set according to the user's travel plan and the distance screening result;

[0073] It can be understood that the user's travel plan includes the departure location O, the destination location P, the departure service area location Q, the drop-off service area location R, the time T of issuing the car request, and the dispatch willingness w 1 and docking intention w 2 ,The departure service area set refers to a set of multiple user car service areas.

[0074] In a specific implementation, the user's travel plan is compared with multiple service areas corresponding to the distance screening results, and multiple service areas with the same planned route as the user's travel plan are grouped into one service area set. Then, multiple service areas without the same planned route as the user's travel plan are grouped into another service area set. Finally, the above two service area sets are summarized to obtain a departure service area set.

[0075] In a feasible implementation, step S30 may include steps A31 to A33:

[0076] Step A31, determining the corresponding service area planned route according to the distance screening result;

[0077] It can be understood that the service area planned route refers to the planned route corresponding to the service area.

[0078] In a specific implementation, multiple corresponding vehicle service areas are determined according to the distance screening results, and then the planned routes corresponding to the multiple vehicle service areas are determined.

[0079] Step A32, comparing the user's travel plan with the service area planned route to determine a travel plan comparison result;

[0080] It can be understood that the travel plan comparison results include results of identical travel plans and results of different travel plans.

[0081] In a specific implementation, the user's travel plan and the planned routes corresponding to multiple car service areas are compared. When the planned routes of the user's travel plan and the car service area are the same, the travel plan comparison result is determined to be that the travel plans are the same; when the planned routes of the user's travel plan and the car service area are not the same, the travel plan comparison result is determined to be that the travel plans are different.

[0082] Step A33, determining a departure service area set according to the travel plan comparison result.

[0083] It can be understood that multiple vehicle service areas corresponding to the same travel plan results are formed into a service area set, and multiple vehicle service areas corresponding to different travel plan results are formed into another service area set, and then the above two service area sets are aggregated to obtain the departure service area set.

[0084] Step S40: determining a target departure service area according to the departure service area set and a preset incentive strategy.

[0085] It can be understood that the preset incentive strategy refers to the incentive mechanism of the pre-set shared car operation strategy, and the incentive mechanism of the shared car operation strategy is set for users to participate in dispatching vehicles and returning the vehicles to self-built service areas. The incentive mechanism is divided into positive incentive mechanism and negative incentive mechanism. The target departure service area refers to the car service area finally selected by the user.

[0086] In the specific implementation, calculations are performed based on the departure service area set and the incentive mechanism of the pre-set shared car operation strategy, and the bonuses or service fees for participating in vehicle operations corresponding to different service areas are determined and displayed to users so that users can choose the final vehicle service area, that is, determine the target departure service area.

[0087] It should be noted that the incentive mechanism of the shared car operation strategy is set for users to participate in vehicle dispatching and return the vehicle to the self-built service area. The incentive mechanism is divided into a positive incentive mechanism and a negative incentive mechanism. The positive incentive mechanism calculates the bonus amount based on the distance, and uses the bonus to encourage users to participate in vehicle dispatching, that is, to use the vehicle in the service area designated by the operator. The negative incentive mechanism is divided into two methods: charging service fees and not charging service fees according to different parking space situations. By charging service fees, it meets the diverse getting-off needs of vehicle use, and by not charging service fees, it improves the number of user services of the operator. The magnitudes of the bonus and the service fee are related to the distance traveled by the user (the specific association method cannot be fixed, is related to the current operation status of the scenic area, and is determined independently by the operator).

[0088] In a feasible implementation manner, step S40 may include steps A41 to A43:

[0089] Step A41, when there is a travel service area in the departure service area set that is the same as the user's travel plan, determine multiple vehicle dispatching bonuses according to the positive incentive strategy in the preset incentive strategy and the user's vehicle use distance corresponding to the travel service area set;

[0090] It can be understood that the positive incentive strategy refers to the incentive strategy of attracting users to participate in the dispatching work by giving bonuses, and the vehicle dispatching bonus refers to the bonus for participating in vehicle dispatching corresponding to different service areas.

[0091] In specific implementation, when there is a travel service area in the departure service area set that is the same as the user's travel plan, calculate the vehicle dispatching bonuses corresponding to different service areas according to the incentive strategy of attracting users to participate in the dispatching work by giving bonuses and the user's vehicle use distance corresponding to the travel service area set, that is, obtain multiple vehicle dispatching bonuses.

[0092] It should be noted that for the positive incentive: in terms of users participating in vehicle dispatching, to alleviate the problem of insufficient dispatching capacity of the operator, users are attracted to participate in the dispatching work by giving bonuses. The willingness w of users to participate in vehicle dispatching 1 is measured in currency. Assume that at time t there are w user vehicle use demands, w 1g is the dispatching willingness of user g, w 1g = e, e ∈ (0, +∞). The closer e is to 0, the higher the willingness to participate in dispatching, and the larger it is, the less willing to participate in vehicle dispatching. The operator encourages users to participate in vehicle dispatching by providing bonuses. When the distance from the user to the service area is 1 < d(O, P) ≤ 3 (according to market experience, in the scenic area, users usually choose service areas with a distance less than 1 km, and the farthest cannot exceed 3 km), the operator calculates the bonus bonc based on the magnitude of d(O, Q). The larger the distance d(O, Q), the larger bonc. When w 1g≤bonc, the user participates in vehicle dispatch. Figure 5 As shown in the figure, when a user issues a car demand, the service area of ​​route 1 has a vehicle that meets the user's demand and has a plan to travel to the same destination as the user. According to the bonus strategy, if the customer participates in the dispatch, bonc (determined by the system's single mileage bonus parameter) is calculated. Route 2 has a vehicle that meets the user's demand but has no plan to travel to the same destination as the user. 1g When ≤bonc, the customer will choose route 1 to take the bus, otherwise the customer will choose route 2 to take the bus.

[0093] Step A42, determining a target bonus ranking according to the user dispatch bonus and the plurality of vehicle dispatch bonuses;

[0094] It can be understood that the user dispatch bonus refers to the bonus size corresponding to the user's willingness to participate in vehicle dispatch, and the target bonus ranking refers to the order of the vehicle dispatch bonuses corresponding to different service areas from large to small.

[0095] In a specific implementation, multiple vehicle dispatch bonuses are screened according to the bonus size corresponding to the user's willingness to participate in vehicle dispatch, and then the vehicle dispatch bonuses that meet the bonus size corresponding to the user's willingness to participate in vehicle dispatch are arranged in order from large to small, and finally the target bonus ranking is obtained.

[0096] In a feasible implementation, step A42 may include steps B421 to B422:

[0097] Step B421, screening the plurality of vehicle dispatch bonuses according to the user dispatch bonus, and determining a plurality of screened dispatch bonuses;

[0098] It can be understood that screening the dispatch bonus refers to screening out the vehicle dispatch bonuses that meet the user's dispatch bonus.

[0099] In the specific implementation, in this embodiment, the user's willingness to participate in dispatching vehicles is measured by currency. Specifically, different users can be analyzed or counted to determine the user's willingness to participate in dispatching vehicles, and then the user's willingness to participate in dispatching vehicles is measured by currency to obtain the user's dispatch bonus, and then the user's dispatch bonus is compared with multiple vehicle dispatch bonuses to screen out the vehicle dispatch bonus that meets the user's dispatch bonus, that is, multiple screened dispatch bonuses.

[0100] Step B422, determining the target bonus ranking according to the preset arrangement order and the multiple screening scheduling bonuses.

[0101] It is understandable that the preset arrangement order refers to a preset order of bonuses from large to small.

[0102] In a specific implementation, the vehicle dispatch bonuses corresponding to the bonus sizes that satisfy the user's willingness to participate in vehicle dispatch are arranged in order from large to small, that is, the target bonus ranking is obtained.

[0103] Step A43, displaying the target bonus ranking to enable the user to determine the target departure service area.

[0104] It is understandable that the order of vehicle dispatch bonuses is displayed so that users can determine the target departure service area, among which the service area with the largest bonus (bonc) is screened out and recommended to the user first. Users can choose other service areas based on the information displayed in the list pushed by the platform.

[0105] In a feasible implementation, step S40 may include steps B41 to B43:

[0106] Step B41, when there is no travel service area identical to the user's travel plan in the departure service area set, determining multiple parking service fees according to a negative incentive strategy in a preset incentive strategy and a user's vehicle use distance corresponding to the departure service area set;

[0107] It can be understood that the negative incentive strategy refers to an incentive strategy that charges users a service fee in addition to the fare when they do not get off the vehicle according to the operator's regulations. The parking service fee refers to the service fee required to get off the vehicle at different service areas.

[0108] In a specific implementation, when there is no travel service area identical to the user's travel plan in the departure service area set, the parking service fees corresponding to different service areas are calculated based on the incentive strategy of charging the user a service fee in addition to the fare when the user does not get off the vehicle according to the operator's regulations and the user's vehicle usage distance corresponding to the travel service area set, so as to obtain multiple parking service fees.

[0109] It should be noted that negative incentives are mainly used to regulate the user's getting off the bus. When the user does not get off the bus according to the operator's regulations, the user will be charged a service fee in addition to the fare. Since there are three types of service areas, users have three parking spaces to choose from when they get off the bus. The difference lies in whether the service fee is charged and the willingness to park w 2 , the user's willingness to pay service fees to park in non-self-built service areas w 2 Measured in monetary terms, user g’s willingness to get off the bus is w 2g=f, f∈(0,+∞). The closer f is to 0, the less willing the user is to pay the service fee for parking, and the larger f is, the more willing the user is to pay the service fee for parking. Operators collect service fees to allow users who are unwilling to pay the service fee to park in designated service area i (self-built service area), and allow users who are willing to pay the service fee to park in service area j (long-term rental service area) and service area k (temporary rental service area) to meet the personalized needs of various users and the operating needs of operators. Operators calculate the service fee peac based on the size of d(P,R). The smaller d(P,R) is, the larger peac is. When w 2g ≥peac, customers are willing to pay a service fee for parking.

[0110] It should be noted that there are two main situations in which service fees are charged. The first is when a user has a surplus in self-built service area i and parks the car in non-self-built service area j, a service fee is charged. The second is when a user has a surplus in service areas i and j and parks the car in non-self-built service area k, a service fee is also charged. Figure 6 As shown in the figure, there are three parking space options: i, j, and k. The service area k represented by route 3 is closest to the end point P, the service area j represented by route 2 is the second closest to the end point P, and the service area i represented by route 1 is the farthest from the end point P. Assume that the service fee required to park in service area j is peac 1 Parking in the service area k requires a service fee of peac 2 , if the user's peac 2 ≥w 2g ≥peac 1 , the user will park at j; if the user's w 2g ≥peac 2 ≥peac 1 , the user will park at k; if the user's peac 2 ≥peac 1 ≥w 2g , users will park at i. Considering the operating costs, operators usually build their own service areas far away from areas with large traffic such as living areas, scenic spots and commercial areas.

[0111] Step B42, determining a service fee ranking according to the user service fee and the plurality of parking service fees;

[0112] It can be understood that the user service fee refers to the service fee corresponding to the user's willingness to pay the service fee, and the service fee ranking refers to the order in which multiple parking service fees are arranged from small to large.

[0113] In a specific implementation, multiple parking service fees are screened according to the service fees corresponding to the user's willingness to pay the service fees, so as to screen out the parking service fees that are less than the service fees corresponding to the user's willingness to pay the service fees, and then the multiple parking service fees that are less than the service fees corresponding to the user's willingness to pay the service fees are arranged in order from small to large, and finally the service fee ranking is obtained.

[0114] Step B43, displaying the service fee ranking to enable the user to determine the target departure service area.

[0115] In a specific implementation, multiple parking service fees are displayed in ascending order so that the user can determine the target departure service area. Among them, the service area with the lowest service fee is screened out and recommended to the user as a priority. Users can choose other service areas based on the information displayed in the list pushed by the platform.

[0116] It should be noted that if Figure 7 As shown, the general principle of the strategy for allocating user car service areas in this embodiment is the user priority principle. As long as there are idle vehicles in the station, they will be used to meet user needs first. The operator recommends the user to go to the corresponding service area based on the location of the user's departure point, the principle of closest distance and the principle of highest incentive. The user chooses to accept the system recommendation or give up the car plan. After obtaining the user's travel plan, first, the operator will find all service areas q that can provide car services, q∈{i,j,k}, and then calculate the distance d between the user's starting point O and the service area, and find the service area set Q with d<3 1 , find the set Q with the same planned routes and user needs 2 , then the combination of planned routes and user needs is Q 3 .

[0117] It should be noted that when When Q in the service area is calculated 2i , Q 2j , Q 2k bonc,Q of each service area in the three types of sets 2i Indicates Q 2 Collection of self-built service areas in China, Q 2j Indicates Q 2 Mid- and long-term rental service area collection, Q 2k Indicates Q 2 The temporary rental service area collection in the platform. The service area with the largest bonc is selected as the service area recommended to users first. Users can choose other service areas based on the information displayed in the platform push list. When Q in the service area is calculated 3i , Q 3j , Q 3k peac,P of each service area in the three types of sets 1i Indicates P1 The collection of self-built service areas in China, P 1j Indicates P 1 Medium and long-term rental service area collection, P 1k Indicates P 1 Temporary rental service area collection. Filter out peac≤w 2 The smallest service area is the service area recommended to users first, and users can choose other service areas based on the information displayed in the list pushed by the platform.

[0118] This embodiment responds to the user's car request, determines the car distances of multiple users according to the user's departure location and the location of each departure service area; screens the multiple user car distances according to the preset car distance to determine the distance screening result; determines the departure service area set according to the user's travel plan and the distance screening result; and determines the target departure service area according to the departure service area set and the preset incentive strategy. When the user issues a car demand, the operator recommends the corresponding service area to the user based on the user's travel plan and allocation strategy. The user arrives at the designated service area to use the car and gets off at a nearby service area when the trip ends, which improves the travel efficiency of tourists in the mountain scenic area and avoids safety hazards in the mountain scenic area.

[0119] Based on the first embodiment of the present application, in the second embodiment of the present application, the same or similar contents as those in the above-mentioned embodiment 1 can be referred to the above introduction, and will not be repeated in the following. Figure 8 The mountain scenic area shared flying car operation method also includes steps S01 to S03:

[0120] Step S01, responding to a user's request to get off the vehicle, and determining parking distances for multiple users according to the user's getting off location and the locations of each parking service area;

[0121] It can be understood that the user's get-off request refers to the get-off request initiated by the user through the mobile terminal, the user's get-off location refers to the location of the user's travel destination, and the user's parking distance refers to the distance between the user's get-off location and the parking service area.

[0122] In a specific implementation, when a user initiates a request to get off the vehicle through a mobile terminal, a calculation is performed based on the location of the user's destination and the locations of various parking service areas to obtain the distance between the user and different service areas, that is, the parking distances of multiple users.

[0123] Step S02, screening the parking distances of the plurality of users according to the preset vehicle use distance, and determining the parking screening result;

[0124] It is understandable that the parking screening result includes service areas that meet the user's parking distance requirements.

[0125] In a specific implementation, the preset vehicle use distance is compared with the parking distances of multiple users to screen out service areas that meet the parking distance requirements of the users, that is, to obtain a parking screening result.

[0126] Step S03: determining a target parking service area according to a preset incentive strategy and the distance screening result.

[0127] It is understandable that the service fees of multiple parking service areas corresponding to the distance screening results are calculated according to the preset incentive strategy, and then the multiple parking service fees are displayed to the user so that the user can select the final parking service area.

[0128] In a feasible implementation, step S03 may include steps A031 to A033:

[0129] Step A031, determining a plurality of parking service fees according to the negative incentive strategy in the preset incentive strategy and the parking service area corresponding to the distance screening result;

[0130] It can be understood that the parking service fee of the parking service area corresponding to the distance screening result is calculated according to the negative incentive strategy in the preset incentive strategy, that is, the service fees required to be paid in different parking service areas are calculated according to the incentive strategy of charging users a service fee in addition to the fare when the user does not get off the car according to the operator's regulations, and finally multiple parking service fees are obtained.

[0131] Step A032, determining a target service fee ranking according to the user parking fee and multiple parking service fees;

[0132] It can be understood that the target service fee ranking refers to the order in which the service fees are arranged from the smallest to the largest.

[0133] In a specific implementation, multiple parking service fees are screened according to the service fees corresponding to the user's parking intention, and then the parking service fees corresponding to the service fees that meet the user's parking intention are obtained, and then the parking service fees corresponding to the service fees that meet the user's parking intention are arranged in order from small to large, and finally the target service fee ranking is obtained.

[0134] Step A033, displaying the target service fee ranking to enable the user to determine the target parking service area.

[0135] In a specific implementation, the service fees are pushed to the user in order from small to large, so that the user can select the final parking service area.

[0136] It should be noted that if Fig. 9As shown in the figure, in this embodiment, the service area strategy for assigning users to get off the bus is that the operator recommends users to get off at the corresponding service area based on the location of the user's destination, the principle of closest distance and the principle of lowest cost. First, the operator will find all service areas q that can provide parking services, q∈{i,j,k}, and then calculate the distance d between the user's destination P and the service area, and find the service area set P with d<3. 1 Calculate P in the service area 1i , P 1j , P 1k peac,P of each service area in the three types of sets 1i Indicates P 1 The collection of self-built service areas in China, P 1j Indicates P 1 Medium and long-term rental service area collection, P 1k Indicates P 1 Temporary rental service area collection. Filter out peac≤w 2 The service areas are recommended to users in the order of PEAC from small to large.

[0137] This embodiment responds to the user's request to get off the car, determines the parking distances of multiple users according to the user's getting off location and the location of each parking service area; screens the multiple user parking distances according to the preset vehicle use distance to determine the parking screening result; and determines the target parking service area according to the preset incentive strategy and the distance screening result. Through the above method, the problem that tourists often have insufficient time for sightseeing and low sightseeing efficiency is solved.

[0138] It should be noted that the above examples are only used to understand the present application and do not constitute a limitation on the method for operating a shared flying car in a mountain scenic area of ​​the present application. More simple transformations based on this technical concept are all within the scope of protection of the present application.

[0139] This application also provides a mountain scenic area shared flying car operation device, please refer to Fig.10 The mountain scenic area shared flying car operation device includes:

[0140] A response module 10 is used to respond to a user's car use request and determine the car use distances of multiple users according to the user's starting location and the locations of each starting service area;

[0141] A screening module 20, for screening the vehicle use distances of multiple users according to a preset vehicle use distance, and determining a distance screening result;

[0142] A processing module 30, configured to determine a departure service area set according to the user's travel plan and the distance screening result;

[0143] The processing module 30 is further configured to determine a target departure service area according to the departure service area set and a preset incentive strategy.

[0144] Optionally, the processing module 30 is further used for:

[0145] Determine the corresponding service area planned route according to the distance screening result;

[0146] Comparing the user's travel plan with the service area's planned route, and determining a travel plan comparison result;

[0147] A departure service area set is determined according to the travel plan comparison result.

[0148] Optionally, the processing module 30 is further used for:

[0149] When there is a travel service area identical to the user's travel plan in the departure service area set, a plurality of vehicle dispatch bonuses are determined according to a positive incentive strategy in a preset incentive strategy and a user's vehicle use distance corresponding to the travel service area set;

[0150] Determine a target bonus ranking based on a user dispatch bonus and a plurality of vehicle dispatch bonuses;

[0151] The target bonus ranking is displayed to allow the user to determine the target departure service area.

[0152] Optionally, the processing module 30 is further used for:

[0153] Screening the plurality of vehicle dispatch bonuses according to the user dispatch bonus to determine a plurality of screened dispatch bonuses;

[0154] The target bonus ranking is determined based on a preset arrangement order and a plurality of the screening scheduling bonuses.

[0155] Optionally, the processing module 30 is further used for:

[0156] When there is no travel service area identical to the user's travel plan in the departure service area set, determining multiple parking service fees according to a negative incentive strategy in a preset incentive strategy and a user's vehicle use distance corresponding to the departure service area set;

[0157] Determine the service fee ranking according to the user service fee and the plurality of parking service fees;

[0158] The service fee ranking is displayed to enable the user to determine a target departure service area.

[0159] Optionally, the processing module 30 is further used for:

[0160] In response to the user's request to get off the vehicle, the parking distances of multiple users are determined according to the user's getting off location and the locations of each parking service area;

[0161] Screening the parking distances of the plurality of users according to the preset vehicle use distances to determine a parking screening result;

[0162] The target parking service area is determined according to the preset incentive strategy and the distance screening result.

[0163] Optionally, the processing module 30 is further used for:

[0164] Determine multiple parking service fees according to the negative incentive strategy in the preset incentive strategy and the parking service area corresponding to the distance screening result;

[0165] Determine the target service fee ranking according to the user parking fee and the multiple parking service fees;

[0166] The target service fee ranking is displayed to enable the user to determine the target parking service area.

[0167] The mountain scenic area shared flying car operation device provided by the present application adopts the mountain scenic area shared flying car operation method in the above embodiment, which can solve the technical problem of low efficiency of tourists in the mountain scenic area. Compared with the prior art, the mountain scenic area shared flying car operation device provided by the present application has the same beneficial effects as the mountain scenic area shared flying car operation method provided by the above embodiment, and other technical features in the mountain scenic area shared flying car operation device are the same as the features disclosed in the above embodiment method, which will not be repeated here.

[0168] The present application provides a mountain scenic area shared flying car operation device, the mountain scenic area shared flying car operation device includes: at least one processor; and a memory connected to the at least one processor in communication; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the mountain scenic area shared flying car operation method in the above-mentioned embodiment 1.

[0169] Reference below Fig.11 , which shows a schematic diagram of the structure of a mountain scenic area shared flying car operation device suitable for implementing the embodiment of the present application. The mountain scenic area shared flying car operation device in the embodiment of the present application may include but is not limited to mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Fig.11 The mountain scenic area shared flying car operation equipment shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0170] like Fig.11 As shown, the mountain scenic area shared flying car operation equipment may include a processing device 1001 (such as a central processing unit, a graphics processor, etc.), which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM: Read Only Memory) 1002 or the program loaded from the storage device 1003 to the random access memory (RAM: Random Access Memory) 1004. In RAM1004, various programs and data required for the operation of the mountain scenic area shared flying car operation equipment are also stored. The processing device 1001, ROM1002 and RAM1004 are connected to each other through a bus 1005. The input / output (I / O) interface 1006 is also connected to the bus. Typically, the following systems can be connected to the I / O interface 1006: input devices 1007 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 1003 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 1009. The communication device 1009 can allow the mountain scenic area shared flying car operation device to communicate wirelessly or wired with other devices to exchange data. Although the figure shows a mountain scenic area shared flying car operation device with various systems, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems may be implemented or have alternatively.

[0171] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.

[0172] The mountain scenic area shared flying car operation equipment provided by the present application adopts the mountain scenic area shared flying car operation method in the above embodiment, which can solve the technical problem of low efficiency of tourists in the mountain scenic area. Compared with the prior art, the mountain scenic area shared flying car operation equipment provided by the present application has the same beneficial effects as the mountain scenic area shared flying car operation method provided by the above embodiment, and the other technical features of the mountain scenic area shared flying car operation equipment are the same as the features disclosed in the previous embodiment method, which will not be repeated here.

[0173] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0174] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0175] The present application provides a computer-readable storage medium having computer-readable program instructions (i.e., computer programs) stored thereon, and the computer-readable program instructions are used to execute the mountain scenic area shared flying car operation method in the above-mentioned embodiment.

[0176] The computer-readable storage medium provided in the present application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination of the above.

[0177] The computer-readable storage medium may be included in the mountain scenic area shared flying car operation equipment; or it may exist independently without being assembled into the mountain scenic area shared flying car operation equipment.

[0178] The computer-readable storage medium carries one or more programs. When the one or more programs are executed by the mountain scenic area shared flying car operating device, the mountain scenic area shared flying car operating device: responds to a user's car use request, determines multiple user car use distances according to the user's departure location and the locations of each departure service area; screens the multiple user car use distances according to a preset car use distance to determine a distance screening result; determines a departure service area set according to the user's travel plan and the distance screening result; and determines a target departure service area according to the departure service area set and a preset incentive strategy.

[0179] Computer program code for performing the operations of the present application may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0180] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0181] The modules involved in the embodiments described in this application may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.

[0182] The readable storage medium provided by the present application is a computer-readable storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned mountain scenic area shared flying car operation method, and can solve the technical problem of low efficiency of tourists in mountain scenic areas. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided by the present application are the same as the beneficial effects of the mountain scenic area shared flying car operation method provided by the above-mentioned embodiment, and will not be repeated here.

[0183] The present application also provides a computer program product, including a computer program, which, when executed by a processor, implements the steps of the above-mentioned mountain scenic area shared flying car operation method.

[0184] The computer program product provided by this application can solve the technical problem of low efficiency of tourists in mountain scenic areas. Compared with the prior art, the beneficial effects of the computer program product provided by this application are the same as the beneficial effects of the mountain scenic area shared flying car operation method provided by the above embodiment, which will not be repeated here.

[0185] The above descriptions are only some embodiments of the present application, and are not intended to limit the patent scope of the present application. All equivalent structural changes made using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect applications in other related technical fields are included in the patent protection scope of the present application.

Claims

1. A method for operating a shared flying car in a mountain scenic area, characterized in that: The mountain scenic area shared flying car operation method comprises: Responding to a user's request for a car, determining the car distances of multiple users based on the user's departure location and the locations of each departure service area; Filtering the vehicle use distances of the plurality of users according to the preset vehicle use distances, and determining a distance filtering result; Determine a departure service area set according to the user's travel plan and the distance screening result; A target departure service area is determined according to the departure service area set and a preset incentive strategy.

2. The method according to claim 1, characterized in that The step of determining the departure service area set according to the user's travel plan and the distance screening result includes: Determine the corresponding service area planned route according to the distance screening result; Comparing the user's travel plan with the service area's planned route, and determining a travel plan comparison result; A departure service area set is determined according to the travel plan comparison result.

3. The method according to claim 1, characterized in that The step of determining the target departure service area according to the departure service area set and the preset incentive strategy includes: When there is a travel service area identical to the user's travel plan in the departure service area set, a plurality of vehicle dispatch bonuses are determined according to a positive incentive strategy in a preset incentive strategy and a user's vehicle use distance corresponding to the travel service area set; Determine a target bonus ranking based on a user dispatch bonus and a plurality of vehicle dispatch bonuses; The target bonus ranking is displayed to allow the user to determine the target departure service area.

4. The method according to claim 3, characterized in that The step of determining the target bonus ranking according to the user dispatch bonus and the plurality of vehicle dispatch bonuses comprises: Screening the plurality of vehicle dispatch bonuses according to the user dispatch bonus to determine a plurality of screened dispatch bonuses; The target bonus ranking is determined based on a preset arrangement order and a plurality of the screening scheduling bonuses.

5. The method according to claim 1, characterized in that The step of determining the target departure service area according to the departure service area set and the preset incentive strategy includes: When there is no travel service area identical to the user's travel plan in the departure service area set, determining multiple parking service fees according to a negative incentive strategy in a preset incentive strategy and a user's vehicle use distance corresponding to the departure service area set; Determine the service fee ranking according to the user service fee and the plurality of parking service fees; The service fee ranking is displayed to enable the user to determine a target departure service area.

6. The method according to claim 1, characterized in that The mountain scenic area shared flying car operation method also includes: In response to the user's request to get off the vehicle, the parking distances of multiple users are determined according to the user's getting off location and the locations of each parking service area; Screening the parking distances of the plurality of users according to the preset vehicle use distances to determine a parking screening result; The target parking service area is determined according to the preset incentive strategy and the distance screening result.

7. The method according to claim 6, characterized in that The step of determining the target parking service area according to the preset incentive strategy and the distance screening result includes: Determine multiple parking service fees according to the negative incentive strategy in the preset incentive strategy and the parking service area corresponding to the distance screening result; Determine the target service fee ranking according to the user parking fee and the multiple parking service fees; The target service fee ranking is displayed to enable the user to determine the target parking service area.

8. A flying car operation device for sharing in a mountain scenic area, characterized in that: The device comprises: A response module, used to respond to a user's car request and determine the car distances of multiple users according to the user's starting location and the locations of each starting service area; A screening module, used to screen the vehicle use distances of multiple users according to a preset vehicle use distance, and determine the distance screening result; A processing module, used to determine a departure service area set according to the user's travel plan and the distance screening result; The processing module is further used to determine a target departure service area according to the departure service area set and a preset incentive strategy.

9. A flying car operation device for sharing in a mountain scenic area, characterized in that: The device includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the mountain scenic area shared flying car operation method according to any one of claims 1 to 7.

10. A storage medium, characterized in that: The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the mountain scenic area shared flying car operation method according to any one of claims 1 to 7 are implemented.

Citation Information

Patent Citations

  • Shared vehicle dispatching method, device and server

    CN107657477A

  • A management platform and service method of share unmanned aerial vehicle for scenic spot

    CN109102433A

  • Construction and operation management and control method and system for full-automatic flight operation system of shared flight

    CN114548531A

  • Price incentive shared electric vehicle scheduling method based on inverse reinforcement learning

    CN115099718A

  • Aircraft service reservation system and method

    CN118278551A