Mountain scenic area shared flying car operation methods, devices, equipment and storage media

Abstract

This application discloses a method, apparatus, equipment, and storage medium for operating shared flying cars in mountain scenic areas, relating to the field of flying car technology. The method includes: responding to user requests for vehicles; determining multiple user vehicle distances based on the user's departure location and the locations of various departure service areas; filtering the multiple user vehicle distances according to preset distances to determine distance filtering results; determining a set of departure service areas based on the user's travel plan and the distance filtering results; and determining a target departure service area based on the set of departure service areas and a preset incentive strategy. By having users submit vehicle requests, operators recommend corresponding service areas to users based on their travel plans and allocation strategies. Users pick up vehicles at designated service areas and disembark at nearby service areas upon completion of their trip, improving the efficiency of tourists visiting mountain scenic areas and avoiding potential safety hazards.

Description

Technical Field

[0001] This application relates to the field of flying car technology, and in particular to the operation method, device, equipment and storage medium of shared flying cars in mountain scenic areas. Background Technology

[0002] With the rapid development of the market economy, the pace of urban life is accelerating. More and more people are choosing to travel to mountainous areas, such as Lushan Mountain in China, a popular summer resort. However, this has also brought some problems. The mountainous terrain makes transporting people and supplies difficult, and it's even more challenging for those prone to motion sickness. The emergence of flying cars has brought new development opportunities to scenic areas. They can provide tourists with a unique sightseeing experience, allowing them to appreciate the beauty of the scenery from different perspectives. Furthermore, flying cars can be used for patrolling and emergency rescue within scenic areas, improving management efficiency and service quality. Therefore, addressing the low efficiency of tourist visits to mountain scenic areas 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 shared flying cars in mountain scenic areas, aiming to solve the technical problem of low efficiency for tourists in mountain scenic areas.

[0004] To achieve the above objectives, this application proposes a method for operating shared flying cars in mountain scenic areas, the method comprising:

[0005] In response to user car requests, determine the car-hailing distance for multiple users based on the user's departure location and the location of each departure service area;

[0006] The distances of multiple users are filtered according to the preset vehicle distance to determine the distance filtering results;

[0007] The set of departure service areas is determined based on the user's travel plan and the distance filtering results.

[0008] The target departure service area is determined based on the set of departure service areas and the preset incentive strategy.

[0009] In one embodiment, the step of determining the set of departure service areas based on the user's travel plan and the distance filtering results includes:

[0010] Based on the distance filtering results, the corresponding service area planned routes are determined;

[0011] Compare the user's travel plan with the planned routes of the service area to determine the travel plan comparison result;

[0012] The departure service area set is determined based on the comparison results of the travel plans.

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

[0014] When there is a travel service area in the set of departure service areas that is the same as the user's travel plan, multiple vehicle dispatch bonuses are determined according to the positive incentive strategy in the preset incentive strategy and the user's vehicle distance corresponding to the set of travel service areas.

[0015] The target bonus ranking is determined based on the user dispatch bonus and the multiple vehicle dispatch bonuses mentioned above;

[0016] The target bonus ranking is displayed to help users determine their target departure service area.

[0017] In one embodiment, the step of determining the target bonus order based on the user dispatch bonus and the plurality of vehicle dispatch bonuses includes:

[0018] Multiple vehicle dispatch bonuses are filtered based on user dispatch bonuses to determine multiple filtered dispatch bonuses;

[0019] The target bonus order is determined based on the preset arrangement order and multiple screening and scheduling bonuses.

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

[0021] When there is no travel service area in the set of departure service areas that matches the user's travel plan, multiple parking service fees are determined based on the negative incentive strategy in the preset incentive strategy and the user's vehicle distance corresponding to the set of departure service areas.

[0022] The service fee ranking is determined based on the user service fee and the multiple parking service fees mentioned above;

[0023] The service fee ranking is displayed to help users determine their target departure service area.

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

[0025] In response to a user's request to get off the vehicle, determine the parking distance for multiple users based on the user's drop-off location and the location of each parking service area;

[0026] The parking distances of multiple users are filtered according to the preset driving distance to determine the parking filtering results;

[0027] The target parking service area is determined based on the preset incentive strategy and the distance filtering results.

[0028] In one embodiment, the step of determining the target parking service area based on the preset incentive strategy and the distance filtering result includes:

[0029] Multiple parking service fees are determined based on the negative incentive strategy in the preset incentive strategy and the parking service area corresponding to the distance screening result;

[0030] The target service fee is ranked based on the user's parking fee and multiple parking service fees.

[0031] The target service fee is displayed in order to help the user identify the target parking service area.

[0032] Furthermore, to achieve the above objectives, this application also proposes a shared flying car operation device for mountain scenic areas, the shared flying car operation device for mountain scenic areas comprising:

[0033] The response module is used to respond to user car requests and determine the car distance for multiple users based on the user's departure location and the location of each departure service area.

[0034] The filtering module is used to filter the vehicle usage distances of multiple users based on preset usage distances and determine the distance filtering results;

[0035] The processing module is used to determine the set of departure service areas based on the user's travel plan and the distance filtering results;

[0036] The processing module is further configured to determine the target departure service area based on the set of departure service areas and the preset incentive strategy.

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

[0038] In addition, to achieve the above objectives, this application also proposes a storage medium, which is a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, it implements the steps of the mountain scenic area shared flying car operation method described above.

[0039] In addition, to achieve the above objectives, this application also provides a computer program product, which includes a computer program that, when executed by a processor, implements the steps of the mountain scenic area shared flying car operation method described above.

[0040] This application, in response to user car-hailing requests, determines multiple user car-hailing distances based on the user's departure location and the locations of various departure service areas; filters these multiple user car-hailing distances according to preset car-hailing distances to determine distance filtering results; determines a set of departure service areas based on the user's travel plan and the distance filtering results; and determines a target departure service area based on the set of departure service areas and a preset incentive strategy. By having users submit car-hailing requests, operators recommend corresponding service areas to users based on their travel plans and allocation strategies. Users pick up cars at designated service areas and disembark at nearby service areas upon completion of their trip, improving the efficiency of tourists visiting mountain scenic areas and avoiding potential safety hazards. Attached Figure Description

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

[0042] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, for those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0043] Figure 1 This is a flowchart illustrating the first embodiment of the shared flying car operation method in the mountain scenic area presented in this application.

[0044] Figure 2 This is a schematic diagram of a detachable flying car provided in Embodiment 1 of the shared flying car operation method for mountain scenic areas in this application;

[0045] Figure 3 This is a schematic diagram of the operation of a detachable flying car provided in Embodiment 1 of the shared flying car operation method for mountain scenic areas in this application;

[0046] Figure 4 This is a schematic diagram of the unmanned operation system architecture of the shared flying car in the mountain scenic area provided in Embodiment 1 of the application.

[0047] Figure 5 This is a schematic diagram illustrating the positive incentives faced by users in the first embodiment of the shared flying car operation method in the mountain scenic area of ​​this application;

[0048] Figure 6 This is a schematic diagram illustrating the negative incentives faced by users in the first embodiment of the shared flying car operation method in the mountain scenic area of ​​this application;

[0049] Figure 7 This is a schematic diagram of the user vehicle service area allocation strategy provided in Embodiment 1 of the shared flying car operation method in the mountain scenic area of ​​this application.

[0050] Figure 8 This is a flowchart illustrating Embodiment 2 of the shared flying car operation method for mountain scenic areas provided in this application;

[0051] Figure 9 This is a schematic diagram of the user drop-off service area strategy provided in Embodiment 2 of the shared flying car operation method in the mountain scenic area of ​​this application;

[0052] Figure 10 This is a schematic diagram of the modular structure of the shared flying car operation device in the mountain scenic area, as described in this application embodiment.

[0053] Figure 11 This is a schematic diagram of the equipment structure of the hardware operating environment involved in the shared flying car operation method in the Zhongshan Scenic Area of ​​this application.

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

[0055] It should be understood that the specific embodiments described herein are merely illustrative of the technical solutions of this application and are not intended to limit this application.

[0056] To better understand the technical solution of this application, a detailed description will be provided below in conjunction with the accompanying drawings and specific implementation methods.

[0057] The main solution of this application embodiment is: responding to a user's car-hailing request, determining multiple user car-hailing distances based on the user's departure location and the locations of each departure service area; filtering the multiple user car-hailing distances based on preset car-hailing distances to determine distance filtering results; determining a set of departure service areas based on the user's travel plan and the distance filtering results; and determining a target departure service area based on the set of departure service areas and a preset incentive strategy.

[0058] With the rapid development of the market economy, the pace of urban life is accelerating. More and more people are choosing to travel to mountainous areas, such as Lushan Mountain in China, a popular summer resort. However, this has also brought some problems. The mountainous terrain makes transporting people and supplies difficult, and it's even more challenging for those prone to motion sickness. The emergence of flying cars has brought new development opportunities to scenic areas. They can provide tourists with a unique sightseeing experience, allowing them to appreciate the beauty of the scenery from different perspectives. Furthermore, flying cars can be used for patrolling and emergency rescue within scenic areas, improving management efficiency and service quality. Therefore, addressing the low efficiency of tourist visits to mountain scenic areas has become an urgent problem to be solved.

[0059] This application, in response to user car-hailing requests, determines multiple user car-hailing distances based on the user's departure location and the locations of various departure service areas; filters these multiple user car-hailing distances according to preset car-hailing distances to determine distance filtering results; determines a set of departure service areas based on the user's travel plan and the distance filtering results; and determines a target departure service area based on the set of departure service areas and a preset incentive strategy. By having users submit car-hailing requests, operators recommend corresponding service areas to users based on their travel plans and allocation strategies. Users pick up cars at designated service areas and disembark at nearby service areas upon completion of their trip, improving the efficiency of tourists visiting mountain scenic areas and avoiding potential safety hazards.

[0060] It should be noted that the executing entity in this embodiment can be a computing service device with data processing, network communication, and program execution functions, such as a tablet computer, personal computer, or mobile phone, or a shared flying car operation device in a mountain scenic area capable of achieving the above functions. The following description uses a shared flying car operation device in a mountain scenic area as the executing entity to illustrate this embodiment and the subsequent embodiments.

[0061] Based on this, the embodiments of this application provide a method for operating shared flying cars in mountain scenic areas, referring to... Figure 1 , Figure 1 This is a flowchart illustrating the first embodiment of the shared flying car operation method for mountain scenic areas in this application.

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

[0063] Step S10: Respond to the user's car request and determine the car-hailing distance for multiple users based on the user's departure location and the location of each departure service area;

[0064] It should be noted that, as Figure 2 As shown, the detachable flying car in this embodiment mainly comprises three modules: a flight module, a passenger cabin, and a ground driving module. It can achieve two operating modes: the flight module and passenger cabin combine to form an aerial flight mode, and the ground driving module and passenger cabin combine to form a ground driving mode.

[0065] Understandably, due to the limited energy carrying capacity of flying cars and the significant energy loss during flight, long-distance flights are currently difficult to achieve. A combination of airborne flight and ground-based driving allows for rapid commercial deployment. Separable flying cars have n specific mode-switching stations or service areas at various tourist attractions. At these stations or service areas, the transition between airborne and ground-based modes occurs, sequentially undergoing four phases: takeoff, cruise, autonomous guided landing, and ground driving to complete the transportation mission. Before takeoff, the flight module docks and locks with the passenger cabin using autonomous guided landing technology, then disconnects the passenger cabin from the ground driving module. The flight module then uses its rotors to generate lift, propelling the passenger cabin into the air. During the cruise phase, the flight module carries the passenger cabin safely along a predetermined trajectory to the designated mode-switching station or service area. During the autonomous guided landing phase, the flight module uses autonomous guided landing technology to precisely land the passenger cabin on the stationary ground driving module, completing the docking and locking. Simultaneously, the flight module and passenger cabin unlock and separate. During the ground travel phase, the ground travel module carries the passenger cabin to transport passengers from the mode conversion station or service area to their destination.

[0066] It should be noted that, such as Figure 3 As shown, the autonomous driving ride-hailing system has functions such as remote vehicle monitoring, remote control, autonomous driving, and operation management. Figure 4 This is an architecture diagram of an autonomous ride-hailing system. The system includes: a mobile client, perception sensors, an autonomous driving controller, an in-vehicle network terminal, vehicle chassis actuators, a flight module, a remote control platform, a dispatch cloud platform, and a remote driving console. The mobile client is used for users to book vehicles. Perception sensors, including cameras, LiDAR, millimeter-wave radar, and ultrasonic radar, are used to acquire information about the vehicle's driving environment. The autonomous driving controller controls the vehicle chassis actuators or flight module to ensure safe and stable operation based on the external driving environment information acquired by the perception sensors. The in-vehicle network terminal receives remote driving signals and uploads vehicle driving status information. The dispatch cloud platform receives driving environment information and vehicle driving status information from remote vehicles, receives customer booking information, allocates vehicles for tasks, and forwards vehicle control signals output from the remote driving console. The remote driving console allows remote drivers to remotely take over vehicle control.

[0067] It is understandable that a user's car request refers to a car request initiated by a user through a mobile terminal, the user's departure location refers to the location where the user departs, 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 practice, a service area is an area that allows users to get on and off the vehicle normally and has temporary parking spaces. Due to the shortage of service areas in scenic areas, service areas can be divided into three categories: self-built by operators, long-term leased, and temporary leased. Then, when a user initiates a car rental request 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, thus obtaining the car rental distance for multiple users.

[0069] Step S20: Filter the vehicle usage distances of multiple users according to the preset vehicle usage distance, and determine the distance filtering results;

[0070] It is understandable that the preset vehicle distance refers to the distance threshold used to determine whether a service area meets the user's distance requirements. In this embodiment, 3km is used as an example. The distance filtering results include multiple service areas that meet the user's distance requirements.

[0071] In practice, the distance threshold used to determine whether a service area meets the user's distance requirements is compared with the distance between multiple users and the departure service area. Based on market experience, users in scenic areas usually choose service areas that are less than 1km away, and the furthest away cannot exceed 3km. This allows for the selection of multiple service areas where the distance between users and the departure service area is less than 3km, and finally, the distance selection results are obtained.

[0072] Step S30: Determine the set of departure service areas based on the user's travel plan and the distance filtering results;

[0073] It is understandable that a user's travel plan includes the location of the departure point O, the location of the destination P, the location of the departure service area Q, the location of the drop-off service area R, the time T when the ride request is made, the dispatch intention w1, and the stop intention w2. The set of departure service areas refers to the set of multiple user ride service areas.

[0074] In practice, the user's travel plan is compared with multiple service areas corresponding to the distance filtering results. Multiple service areas with planned routes that are the same as the user's travel plan are grouped into one service area set, and multiple service areas without planned routes that are the same as the user's travel plan are grouped into another service area set. Finally, the two service area sets are combined to obtain the departure service area set.

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

[0076] Step A31: Determine the corresponding service area planned route based on the distance filtering results;

[0077] It is understandable that the planned route for a service area refers to the planned route corresponding to the service area.

[0078] In practice, multiple car service areas are determined based on the distance screening results, and then the planned routes corresponding to each of the multiple car service areas are determined.

[0079] Step A32: Compare the user's travel plan with the service area's planned routes to determine the travel plan comparison result;

[0080] It is understandable that the comparison results of travel plans include results of identical travel plans and results of different travel plans.

[0081] In practice, the user's travel plan is compared with the planned routes corresponding to multiple car service areas. If the user's travel plan and the planned routes of the car service areas are the same, the comparison result is determined to be the same. If the user's travel plan and the planned routes of the car service areas are not the same, the comparison result is determined to be the different.

[0082] Step A33: Determine the set of departure service areas based on the comparison results of the travel plans.

[0083] Understandably, multiple service areas with the same travel plan result are grouped into one service area set, and multiple service areas with different travel plans result in another service area set. Then, the two service area sets are combined to obtain the departure service area set.

[0084] Step S40: Determine the target departure service area based on the set of departure service areas and the preset incentive strategy.

[0085] It is understandable that the preset incentive strategy refers to the incentive mechanism of the pre-set car-sharing operation strategy. The incentive mechanism of the car-sharing operation strategy is set for users to participate in dispatching vehicles and returning them 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 service area that the user finally chooses to use the car.

[0086] In practice, the incentive mechanism based on the set of departure service areas and the pre-set car-sharing operation strategy is used to calculate and determine the bonus or service fee for participating in vehicle operation corresponding to different service areas, and display it to users so that users can select the final car 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 of charging service fees and not charging service fees according to different parking space situations. By charging service fees, it meets the diverse drop-off needs of vehicle use, and by not charging service fees, it increases the number of user services of the operator. The sizes 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 by the operator independently).

[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 an incentive strategy that attracts users to participate in 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 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 positive incentives: in terms of users participating in vehicle dispatching, to alleviate the problem of insufficient dispatching capacity of the operator, an incentive strategy of attracting users to participate in dispatching work by giving bonuses is adopted. The willingness w1 of users to participate in vehicle dispatching 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 a service area with a distance less than 1 km, and the farthest cannot exceed 3 km), the operator calculates the bonus bonc based on the size of d(O, Q). The larger the distance d(O, Q), the larger bonc. When w 1g ≤ bonc, the user participates in vehicle dispatching. For example Figure 5 As shown, when a user submits a ride request, the service area of ​​Route 1 has vehicles that meet the user's needs and have a planned destination consistent with the user's travel. According to the bonus strategy, if the customer participates in dispatching, a Bonc (determined by the system's single-mile reward parameter) is calculated. Route 2 has vehicles that meet the user's needs but no planned destination consistent with the user's travel. When the user's w 1g When the number of passengers is less than or equal to 1, the customer will choose route 1; otherwise, the customer will choose route 2.

[0093] Step A42: Determine the target bonus order based on the user dispatch bonus and the multiple vehicle dispatch bonuses;

[0094] It is understandable that the user dispatch bonus refers to the amount of bonus corresponding to a user's willingness to participate in vehicle dispatch, and the target bonus ranking refers to the order in which the vehicle dispatch bonuses corresponding to different service areas are arranged from largest to smallest.

[0095] In practice, multiple vehicle dispatch bonuses are filtered based on the bonus size corresponding to the user's willingness to participate in vehicle dispatching. Then, the vehicle dispatch bonuses that meet the user's willingness to participate in vehicle dispatching are arranged in descending order to obtain the target bonus ranking.

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

[0097] Step B421: Filter the multiple vehicle dispatch bonuses based on the user dispatch bonus to determine multiple filtered dispatch bonuses;

[0098] It is understandable that the screening and dispatch bonus refers to selecting vehicle dispatch bonuses that meet the user's dispatch bonus requirements.

[0099] In this specific implementation, the willingness of users to participate in vehicle dispatching is measured in monetary terms. Specifically, this can be achieved by analyzing or statistically analyzing different users to determine their willingness to participate in vehicle dispatching. Then, the willingness of users to participate in vehicle dispatching is measured in monetary terms to obtain the user dispatching bonus. The user dispatching bonus is then compared with multiple vehicle dispatching bonuses to select the vehicle dispatching bonus that meets the user dispatching bonus, i.e., multiple selected dispatching bonuses.

[0100] Step B422: Determine the target bonus order based on the preset arrangement order and the multiple screening and scheduling bonuses.

[0101] It is understandable that the preset arrangement order refers to the pre-set order of the prizes from largest to smallest.

[0102] In practice, the vehicle dispatch bonuses corresponding to the size of the bonus for satisfying users' willingness to participate in vehicle dispatch are arranged in descending order, which is the target bonus ranking.

[0103] Step A43 displays the target bonus sorting to allow the user to determine the target departure service area.

[0104] Understandably, the order in which vehicle dispatch bonuses are displayed is intended to help users determine their target departure service area. The service area with the highest bonus (bonc) is selected and prioritized for recommendation to the user, while other service areas can be selected by the user based on the information displayed in the platform's push list.

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

[0106] Step B41: When there is no travel service area in the set of departure service areas that is the same as the user's travel plan, determine multiple parking service fees according to the negative incentive strategy in the preset incentive strategy and the user's vehicle distance corresponding to the set of departure service areas.

[0107] It is understandable that a 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 bus according to the operator's regulations. The parking service fee refers to the service fee that needs to be paid when getting off the bus in different service areas.

[0108] In practice, when there is no service area in the departure service area set that matches the user's travel plan, the parking service fee for different service areas is 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 distance corresponding to the service area set, thus obtaining multiple parking service fees.

[0109] It should be noted that negative incentives are mainly used to regulate users' disembarkation behavior. When users do not disembark according to the operator's regulations, a service fee is charged in addition to the fare. Since there are three types of service areas, users have three parking spaces to choose from when disembarking, differing in whether a service fee (peac) is charged and their willingness to park (w2). The user's willingness (w2) to pay the service fee and park in a non-self-built service area is measured in monetary terms. User g's willingness to disembark is w. 2g=f, f∈(0,+∞). The closer f is to 0, the less willing users are to pay the parking service fee; the larger f is, the more willing users are to pay the service fee. The operator charges a service fee to encourage users unwilling to pay to park in designated service area i (self-built service area), while allowing users willing to pay to park in service areas j (long-term leased service area) and k (temporary leased service area), thus meeting the personalized needs of various users and the operator's operational needs. The operator calculates the service fee peac based on the size of d(P,R); the smaller d(P,R), the larger peac. When w 2g ≥peac, customers are willing to pay a service fee for parking.

[0110] It should be noted that there are two main scenarios for charging service fees. First, if a user parks in a non-self-built service area j when there are available spaces in service area i, a service fee will be charged. Second, if a user parks in a non-self-built service area k when there are available spaces in both service areas i and j, a service fee will also be charged. When a user needs parking, such as... Figure 6 As shown, there are three parking space options: i, j, and k. Service area k, represented by route 3, is closest to the destination P; service area j, represented by route 2, is next closest; and service area i, represented by route 1, is furthest from the destination P. Assume that parking in service area j incurs a service fee of peac1, and parking in service area k incurs a service fee of peac2. If the user's peac2 ≥ w 2g If ≥peac1, the user will park at j; if the user's w 2g If peac2 ≥ peac1, the user will stop at k; if the user's peac2 ≥ peac1 ≥ w 2g Users will use iParking. Considering operating costs, operators typically build their own service areas far from high-traffic areas such as residential areas, tourist attractions, and commercial districts.

[0111] Step B42: Determine the service fee ranking based on the user service fee and the multiple parking service fees;

[0112] It is understandable 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 smallest to largest.

[0113] In practice, multiple parking service fees are filtered based on the service fee corresponding to the user's willingness to pay. The parking service fees that are lower than the service fee corresponding to the user's willingness to pay are then selected and arranged in ascending order to obtain the final service fee ranking.

[0114] Step B43 displays the service fee sorting to allow the user to determine the target departure service area.

[0115] In practice, multiple parking service fees are displayed in ascending order to help users determine their target departure service area. The service area with the lowest service fee is selected and recommended to the user first, while users can choose other service areas based on the information displayed in the platform's push list.

[0116] It should be noted that, such as Figure 7 As shown, the general principle of the user car service area allocation strategy in this embodiment is the user priority principle. As long as there are vacant vehicles in the station, they are prioritized to meet user needs. Based on the user's origin location, the operator recommends the user to the corresponding service area according to the principles of closest distance and highest incentive. The user chooses to accept the system recommendation or abandon the car service plan. After obtaining the user's travel plan, firstly, the operator finds all service areas q, q∈{i,j,k} that can provide car service. Secondly, it calculates the distance d between the user's origin O and the service area, finds the set Q1 of service areas where d<3, finds the set Q2 of service areas with planned routes that match the user's needs, and then the set Q3 of service areas with planned routes that do not match the user's needs.

[0117] It should be noted that when When, calculate Q in the service area 2i Q 2j Q 2k bond, Q of each service area in the three sets 2i Q represents the set of self-built service areas in Q2. 2j This represents the collection of medium- and long-term rental service areas in Q2. 2k This represents the set of temporarily rented service areas in Q2. The service area with the largest number of services listed on the platform is selected and prioritized for user recommendations. Users can choose other service areas from the information displayed in the platform's push notification list. When, calculate Q in the service area 3i Q 3j Q 3k In the three sets, each service area's peer, P 1i P represents the set of self-built service areas in P1. 1j P1 represents the collection of medium- and long-term rental service areas. 1k This represents the set of temporarily rented service areas in P1. The service areas with the smallest peak value (peac≤w2) are prioritized for recommendation to users. Users can choose other service areas based on the information displayed in the platform's push notification list.

[0118] This embodiment responds to user car-hailing requests by determining multiple user car-hailing distances based on the user's departure location and the locations of various departure service areas; it then filters these multiple user car-hailing distances according to preset car-hailing distances to determine the distance filtering results; it determines a set of departure service areas based on the user's travel plan and the distance filtering results; and finally, it determines a target departure service area based on the set of departure service areas and a preset incentive strategy. By having users submit car-hailing requests, operators recommend appropriate service areas to users based on their travel plans and allocation strategies. Users pick up cars at the designated service areas and disembark at nearby service areas at the end of their trip, improving the efficiency of tourists visiting mountain scenic areas and avoiding potential safety hazards.

[0119] Based on the first embodiment of this application, in the second embodiment of this application, the content that is the same as or similar to that in the first embodiment described above can be referred to the above description, and will not be repeated hereafter. Based on this, please refer to... Figure 8 The method for operating shared flying cars in mountain scenic areas further includes steps S01 to S03:

[0120] Step S01: Respond to the user's drop-off request and determine the parking distance for multiple users based on the user's drop-off location and the location of each parking service area;

[0121] It is understandable that a user's drop-off request refers to a user's request to drop off the vehicle via a mobile terminal, the user's drop-off location refers to the location of the user's destination, and the user's parking distance refers to the distance between the user's drop-off location and the parking service area.

[0122] In practice, when a user initiates a drop-off request via a mobile terminal, the distance between the user and different parking service areas is calculated based on the location of the user's destination and the location of each parking service area, thus obtaining the parking distance for multiple users.

[0123] Step S02: Filter the parking distances of multiple users according to the preset vehicle distance to determine the parking filtering results;

[0124] Understandably, the parking filter results include service areas that meet the user's parking distance requirements.

[0125] In practice, the preset vehicle distance is compared with the parking distances of multiple users to select service areas that meet the users' parking distance requirements, thus obtaining the parking selection results.

[0126] Step S03: Determine the target parking service area based on the preset incentive strategy and the distance filtering results.

[0127] Understandably, the service fees for multiple parking service areas corresponding to the distance filtering results are calculated based on a preset incentive strategy, and then these multiple parking service fees are displayed to the user so that the user can choose the final parking service area.

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

[0129] Step A031: Determine multiple parking service fees based on the negative incentive strategy in the preset incentive strategy and the parking service area corresponding to the distance screening result;

[0130] Understandably, the parking service fee for the parking service area corresponding to the distance screening result is calculated based on the negative incentive strategy in the preset incentive strategy. That is, the service fee payable for different parking service areas is calculated based on the incentive strategy that charges users a service fee in addition to the fare when they do not get off the car according to the operator's regulations, and finally multiple parking service fees are obtained.

[0131] Step A032: Determine the target service fee ranking based on the user's parking fee and multiple parking service fees;

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

[0133] In practice, multiple parking service fees are filtered based on the service fee corresponding to the user's parking intention, and then the parking service fees that meet the user's parking intention are obtained. The parking service fees that meet the user's parking intention are then arranged in ascending order, and finally the target service fee ranking is obtained.

[0134] Step A033: Display the target service fee sorting to enable the user to determine the target parking service area.

[0135] In practice, the service fees are presented to users in ascending order so that they can choose the final parking service area.

[0136] It should be noted that, such as Figure 9 As shown, in this embodiment, the strategy for allocating user drop-off service areas involves the operator recommending the user to drop off at the corresponding service area based on the user's destination location, following the principles of proximity and lowest cost. First, the operator identifies all service areas q, where q∈{i,j,k}, that provide parking services. Then, it calculates the distance d between the user's destination P and the service areas, finding a set P1 of service areas where d<3. The calculation of service areas P... 1i P 1j P 1k In the three sets, each service area's peer, P 1i P represents the set of self-built service areas in P1. 1j P1 represents the collection of medium- and long-term rental service areas. 1kLet P1 represent the set of temporarily rented service areas. Service areas with peak ≤ w2 are selected and recommended to users in ascending order of peak.

[0137] This embodiment responds to user drop-off requests and determines multiple user parking distances based on the user's drop-off location and the locations of various parking service areas. It then filters these multiple user parking distances according to a preset driving distance to determine the parking selection results. Finally, it determines the target parking service area based on a preset incentive strategy and the distance selection results. This method solves the problem of tourists often having insufficient time and low efficiency in their visits.

[0138] It should be noted that the above examples are only for understanding this application and do not constitute a limitation on the shared flying car operation method in the mountain scenic area of ​​this application. Any simple modifications based on this technical concept are within the protection scope of this application.

[0139] This application also provides a shared flying car operation device for mountain scenic areas; please refer to [reference needed]. Figure 10 The shared flying car operation device in the mountain scenic area includes:

[0140] Response module 10 is used to respond to user car rental requests and determine the car rental distance for multiple users based on the user's departure location and the location of each departure service area;

[0141] The filtering module 20 is used to filter the vehicle distances of multiple users according to the preset vehicle distance and determine the distance filtering results;

[0142] Processing module 30 is used to determine the set of departure service areas based on the user's travel plan and the distance filtering results;

[0143] The processing module 30 is further configured to determine the target departure service area based on the set of departure service areas and the preset incentive strategy.

[0144] Optionally, the processing module 30 is further configured to:

[0145] Based on the distance filtering results, the corresponding service area planned routes are determined;

[0146] Compare the user's travel plan with the planned routes of the service area to determine the travel plan comparison result;

[0147] The departure service area set is determined based on the comparison results of the travel plans.

[0148] Optionally, the processing module 30 is further configured to:

[0149] When there is a travel service area in the set of departure service areas that is the same as the user's travel plan, multiple vehicle dispatch bonuses are determined according to the positive incentive strategy in the preset incentive strategy and the user's vehicle distance corresponding to the set of travel service areas.

[0150] The target bonus ranking is determined based on the user dispatch bonus and the multiple vehicle dispatch bonuses mentioned above;

[0151] The target bonus ranking is displayed to help users determine their target departure service area.

[0152] Optionally, the processing module 30 is further configured to:

[0153] Multiple vehicle dispatch bonuses are filtered based on user dispatch bonuses to determine multiple filtered dispatch bonuses;

[0154] The target bonus order is determined based on the preset arrangement order and multiple screening and scheduling bonuses.

[0155] Optionally, the processing module 30 is further configured to:

[0156] When there is no travel service area in the set of departure service areas that matches the user's travel plan, multiple parking service fees are determined based on the negative incentive strategy in the preset incentive strategy and the user's vehicle distance corresponding to the set of departure service areas.

[0157] The service fee ranking is determined based on the user service fee and the multiple parking service fees mentioned above;

[0158] The service fee ranking is displayed to help users determine their target departure service area.

[0159] Optionally, the processing module 30 is further configured to:

[0160] In response to a user's request to get off the vehicle, determine the parking distance for multiple users based on the user's drop-off location and the location of each parking service area;

[0161] The parking distances of multiple users are filtered according to the preset driving distance to determine the parking filtering results;

[0162] The target parking service area is determined based on the preset incentive strategy and the distance filtering results.

[0163] Optionally, the processing module 30 is further configured to:

[0164] Multiple parking service fees are determined based on the negative incentive strategy in the preset incentive strategy and the parking service area corresponding to the distance screening result;

[0165] The target service fee is ranked based on the user's parking fee and multiple parking service fees.

[0166] The target service fee is displayed in order to help the user identify the target parking service area.

[0167] The shared flying car operation device for mountain scenic areas provided in this application, employing the shared flying car operation method for mountain scenic areas described in the above embodiments, can solve the technical problem of low tourist efficiency in mountain scenic areas. Compared with the prior art, the beneficial effects of the shared flying car operation device for mountain scenic areas provided in this application are the same as those of the shared flying car operation method for mountain scenic areas provided in the above embodiments, and other technical features in the shared flying car operation device for mountain scenic areas are the same as those disclosed in the methods of the above embodiments, and will not be repeated here.

[0168] This application provides a shared flying car operation device for mountain scenic areas. The shared flying car operation device for mountain scenic areas includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the shared flying car operation method for mountain scenic areas in the above embodiment 1.

[0169] The following is for reference. Figure 11 The diagram illustrates a structural schematic suitable for implementing the shared flying car operation equipment in mountain scenic areas according to the embodiments of this application. The shared flying car operation equipment in mountain scenic areas according to the embodiments of this application may include, but is not limited to, mobile terminals such as mobile phones, laptops, digital radio receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Description), PMPs (Portable Media Players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and fixed terminals such as digital TVs and desktop computers. Figure 11 The shared flying car operation equipment shown in the mountain scenic area is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of this application.

[0170] like Figure 11As shown, the shared flying car operation equipment in the mountain scenic area may include a processing unit 1001 (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to programs stored in read-only memory (ROM) 1002 or programs loaded from storage device 1003 into random access memory (RAM) 1004. The RAM 1004 also stores various programs and data required for the operation of the shared flying car operation equipment in the mountain scenic area. The processing unit 1001, ROM 1002, and RAM 1004 are interconnected via a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Typically, the following systems can be connected to I / O interface 1006: input devices 1007 including, for example, touchscreens, touchpads, keyboards, mice, image sensors, microphones, accelerometers, gyroscopes, etc.; output devices 1008 including, for example, liquid crystal displays (LCDs), speakers, vibrators, etc.; storage devices 1003 including, for example, magnetic tapes, hard disks, etc.; and communication devices 1009. Communication device 1009 allows the shared flying car operation equipment in the mountain scenic area to communicate wirelessly or wiredly with other devices to exchange data. Although the figure shows a shared flying car operation equipment in the mountain scenic area with various systems, it should be understood that it is not required to implement or possess all the systems shown. More or fewer systems can be implemented alternatively.

[0171] Specifically, according to the embodiments disclosed in this application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments disclosed in this application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication device, or installed from storage device 1003, or installed from ROM 1002. When the computer program is executed by processing device 1001, it performs the functions defined in the methods of the embodiments disclosed in this application.

[0172] The shared flying car operation equipment for mountain scenic areas provided in this application, employing the shared flying car operation method for mountain scenic areas described in the above embodiments, can solve the technical problem of low tourist efficiency in mountain scenic areas. Compared with the prior art, the beneficial effects of the shared flying car operation equipment for mountain scenic areas provided in this application are the same as those of the shared flying car operation method for mountain scenic areas provided in the above embodiments, and other technical features of the shared flying car operation equipment for mountain scenic areas are the same as those disclosed in the previous embodiment method, and will not be repeated here.

[0173] It should be understood that the various parts disclosed in this application can be implemented using 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 suitable manner in one or more embodiments or examples.

[0174] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

[0175] This application provides a computer-readable storage medium having computer-readable program instructions (i.e., a computer program) stored thereon, the computer-readable program instructions being used to execute the mountain scenic area shared flying car operation method in the above embodiments.

[0176] The computer-readable storage medium provided in this application may be, for example, a USB flash drive, but is not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. 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 conjunction with an instruction execution system, system, or device. The program code contained on the computer-readable storage medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination thereof.

[0177] The aforementioned computer-readable storage medium may be included in the shared flying car operation equipment in the mountain scenic area; or it may exist independently and not be installed in the shared flying car operation equipment in the mountain scenic area.

[0178] The aforementioned computer-readable storage medium carries one or more programs that, when executed by the shared flying car operation equipment in the mountain scenic area, cause the shared flying car operation equipment in the mountain scenic area to: respond to user car requests; determine multiple user car distances based on the user's departure location and the locations of various departure service areas; filter the multiple user car distances according to preset car distances to determine distance filtering results; determine a set of departure service areas based on the user's travel plan and the distance filtering results; and determine a target departure service area based on the set of departure service areas and a preset incentive strategy.

[0179] Computer program code for performing the operations of this application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, and conventional procedural programming languages ​​such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a Local Area Network (LAN) or a Wide Area Network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0180] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0181] The modules described in the embodiments of this application can be implemented in software or hardware. The names of the modules do not necessarily limit the functionality of the unit itself.

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

[0183] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the above-described method for operating shared flying cars in mountain scenic areas.

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

[0185] The above description is only a part of the embodiments of this application and does not limit the patent scope of this application. All equivalent structural transformations made under the technical concept of this application and using the contents of the specification and drawings of this application, or direct / indirect applications in other related technical fields, are included in the patent protection scope of this application.

Claims

1. A method for operating shared flying cars in a mountain scenic area, characterized in that, The operation method of the shared flying car in the mountain scenic area includes: In response to user car requests, determine the car-hailing distance for multiple users based on the user's departure location and the location of each departure service area; The distances of multiple users are filtered according to the preset vehicle distance to determine the distance filtering results; The set of departure service areas is determined based on the user's travel plan and the distance filtering results. The target departure service area is determined based on the set of departure service areas and the preset incentive strategy; The step of determining the set of departure service areas based on the user's travel plan and the distance filtering results includes: The corresponding service area planned route is determined based on the distance filtering results; Compare the user's travel plan with the planned routes of the service area to determine the travel plan comparison result; The departure service area set is determined based on the comparison results of the travel plans.

2. The method as described in claim 1, characterized in that, The step of determining the target departure service area based on the set of departure service areas and the preset incentive strategy includes: When there is a travel service area in the departure service area set that matches the user's travel plan, multiple vehicle dispatch bonuses are determined based on the positive incentive strategy in the preset incentive strategy and the user's vehicle distance corresponding to the travel service area set. The departure service area set is a set composed of multiple user vehicle service areas. The target bonus ranking is determined based on the user dispatch bonus and multiple vehicle dispatch bonuses. The user dispatch bonus is the bonus amount corresponding to the user's willingness to participate in vehicle dispatch, and the vehicle dispatch bonus is the bonus for participating in vehicle dispatch corresponding to different service areas. The target bonus ranking is displayed to help users determine their target departure service area.

3. The method as described in claim 2, characterized in that, The step of determining the target bonus order based on the user dispatch bonus and the multiple vehicle dispatch bonuses includes: Multiple vehicle dispatch bonuses are filtered based on user dispatch bonuses to determine multiple filtered dispatch bonuses; The target bonus order is determined based on the preset arrangement order and multiple screening and scheduling bonuses.

4. The method as described in claim 1, characterized in that, The step of determining the target departure service area based on the set of departure service areas and the preset incentive strategy includes: When there is no travel service area in the departure service area set that matches the user's travel plan, multiple parking service fees are determined based on the negative incentive strategy in the preset incentive strategy and the user's vehicle distance corresponding to the departure service area set. The departure service area set is a set of multiple user vehicle service areas. The service fee ranking is determined based on the user service fee and the multiple parking service fees mentioned above; The service fee sorting is displayed to help users determine their target departure service area.

5. The method as described in claim 1, characterized in that, The shared flying car operation method in the mountain scenic area also includes: In response to a user's request to get off the vehicle, determine the parking distance for multiple users based on the user's drop-off location and the location of each parking service area; The parking distances of multiple users are filtered according to the preset driving distance to determine the parking filtering results; The target parking service area is determined based on the preset incentive strategy and the distance filtering results.

6. The method as described in claim 5, characterized in that, The step of determining the target parking service area based on the preset incentive strategy and the distance filtering results includes: Multiple parking service fees are determined based on the negative incentive strategy in the preset incentive strategy and the parking service area corresponding to the distance screening result; The target service fee is ranked based on the user's parking fee and multiple parking service fees. The target service fee is displayed in order to help the user identify the target parking service area.

7. A shared flying car operation device for mountain scenic areas, characterized in that, The device includes: The response module is used to respond to user car requests and determine the car-hailing distance for multiple users based on the user's departure location and the location of each departure service area. The filtering module is used to filter the vehicle usage distances of multiple users based on preset usage distances and determine the distance filtering results; The processing module is used to determine the set of departure service areas based on the user's travel plan and the distance filtering results; The processing module is further configured to determine the target departure service area based on the set of departure service areas and the preset incentive strategy; The processing module is also used to determine the corresponding service area planned route based on the distance filtering results; Compare the user's travel plan with the planned routes of the service area to determine the travel plan comparison result; The departure service area set is determined based on the comparison results of the travel plans.

8. A shared flying car operation device for mountain scenic areas, characterized in that, The device includes: a memory, a processor, and a computer program stored in 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 in any one of claims 1 to 6.

9. 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, it implements the steps of the mountain scenic area shared flying car operation method as described in any one of claims 1 to 6.

Images