CN107580317B

CN107580317B - Shared vehicle scheduling charging method and device and server

Info

Publication number: CN107580317B
Application number: CN201710764569.9A
Authority: CN
Inventors: 顾泰来
Original assignee: Individual
Current assignee: Gu Tailai; Jiangsu First Link Information System Co ltd; Zhongcheng Chuangzhan Group Shanghai Industrial Co ltd
Priority date: 2017-08-30
Filing date: 2017-08-30
Publication date: 2020-05-12
Anticipated expiration: 2037-08-30
Also published as: CN107580317A

Abstract

The invention provides a shared vehicle scheduling charging method, a device and a server. The method comprises the steps of obtaining scheduling tasks from a server, and selecting a target task from the obtained scheduling tasks; unlocking a target vehicle located at a starting point of the target task; and receiving target task ending information from the server after the target vehicle is locked again. The invention can issue the scheduling task according to the dynamic vehicle distribution condition, thereby guiding the terminal user to schedule the vehicles which are distributed too intensively or too dispersedly to other places so as to realize the rebalancing of the shared vehicles, and considering the vehicle scheduling time quantum to which the current time belongs when issuing the scheduling task, thereby avoiding the conflict between the scheduling task and the traffic tide, and guiding the terminal user to schedule the vehicle in the direction of the tide.

Description

Shared vehicle scheduling charging method and device and server

Technical Field

The invention relates to the field of shared vehicles, in particular to a shared vehicle scheduling charging method, a shared vehicle scheduling charging device and a server.

Background

The shared bicycle is bicycle sharing service provided in a campus, a subway station, a bus station, a residential area, a commercial area, a public service area and the like, is a time-sharing rental mode, is positioned in a vehicle for short trip, and is focused on solving the problem of 'the last kilometer'. Compare in traditional stake bicycle limitation, sharing bicycle has the advantage that any place can get the car of returning nearby, is the product of taking advantage of under the sharing economic model, lets citizen's trip more convenient, more smooth and easy, more green.

With the rapid development of shared bicycles, the number of bicycles is increased explosively, and the problem of operation management is also highlighted. The main reaction is in two aspects: firstly, the problem of disordered parking caused by random returning of the user is solved; one is the problem of vehicle distribution imbalance caused by traffic "tides". The current solutions adopted by shared vehicle enterprises mainly include natural scheduling and manual scheduling. Natural scheduling, which is scheduling completed by natural flow of vehicles in the using process of users; manual scheduling, which means that shared vehicle enterprise workers drive scheduling vehicles to schedule vehicles in each area; but the two scheduling modes have very limited effectiveness. The natural scheduling mode generates traffic tide phenomenon, causes that some areas have no vehicles available and some areas have no place to park in peak time, and seriously reduces the utilization rate of the single vehicle. The manual scheduling can greatly increase the operation cost of an operator, because a large number of scheduling vehicles and scheduling personnel need to be maintained, and the scheduling cost can cause the operator to be overwhelmed along with the rapid increase of the number of the single vehicles.

The invention provides a new scheduling mode aiming at the defects of a vehicle scheduling scheme in the prior art, which can solve the problem of disordered parking caused by returning a vehicle by a user, solve the problem of unbalanced vehicle distribution caused by tidal traffic and greatly reduce the operation cost of scheduling.

Disclosure of Invention

In order to solve the technical problems, improve the scheduling effect of the shared vehicle, and solve the problem of disordered parking caused by random vehicle returning of users and the problem of unbalanced vehicle distribution caused by traffic tide, the invention provides a method, a device and a system for scheduling shared vehicle resources.

The invention is realized by the following technical scheme:

the first aspect of the invention provides a shared vehicle scheduling charging method, which generates and sends a first type of scheduling task, wherein the scheduling task is generated at least according to a first type of scheduling rule and a second type of scheduling rule which are mutually associated; receiving confirmation information of a specified task in the first type of scheduling task; receiving an unlocking request of a target vehicle corresponding to the specified task, and sending an unlocking command; and generating and sending task ending information in response to the relocking information of the target vehicle, wherein the task ending information comprises charging information.

The second aspect of the present invention provides a shared vehicle scheduling charging apparatus, wherein the scheduling task generating and sending module is configured to generate and send a first type of scheduling task, and the scheduling task is generated at least according to a first type of scheduling rule and a second type of scheduling rule that are associated with each other; the confirmation information receiving module is used for receiving the confirmation information of the specified task in the first type of scheduling task; the unlocking module is used for receiving an unlocking request of the target vehicle corresponding to the specified task and sending an unlocking command; and the task ending and charging module is used for responding to the relocking information of the target vehicle, generating and sending task ending information, wherein the task ending information comprises charging information.

In a third aspect of the present invention, a server is provided, which includes the foregoing apparatus.

The invention can achieve the following beneficial effects: the invention can issue the scheduling task according to the dynamic vehicle distribution condition, thereby guiding the terminal user to schedule the vehicles which are distributed too intensively or too dispersedly to other places so as to realize the rebalancing of the shared vehicles, and considering the vehicle scheduling time quantum which the current time belongs to when issuing the scheduling task, thereby avoiding the conflict between the scheduling task and the traffic tide, and guiding the terminal user to schedule the vehicle in the direction of the tide. In addition, the technical scheme of the invention activates external idle scheduling resources, including human resources and vehicle transportation resources, by technical means, and participates in the scheduling of the shared vehicle, thereby realizing the timely scheduling and allocation of the vehicle and reducing the scheduling cost.

Drawings

The following detailed description of embodiments of the invention is provided in conjunction with the appended drawings:

FIG. 1 is a flow chart of a method for analyzing flow laws according to an embodiment of the present invention;

FIG. 2 is a flow chart of a method for analyzing distribution rules according to an embodiment of the present invention;

FIG. 3A is a flowchart of a shared vehicle scheduling method provided by an embodiment of the present invention;

fig. 3B is a schematic diagram of a shared bicycle scheduling correction method according to an embodiment of the present invention;

3C-3F are relationships between a shared bicycle schedule and a grid provided by embodiments of the present invention;

FIG. 4 is a schematic diagram of a scheduling task issuing interface according to an embodiment of the present invention;

fig. 5 is a schematic diagram of an unlocking scenario provided in the embodiment of the present invention;

fig. 6 is a flowchart of a method for generating target task end information according to an embodiment of the present invention;

FIG. 7 is a block diagram of a shared vehicle dispatching device provided by an embodiment of the invention;

FIG. 8 is a block diagram of an unlocking module provided by an embodiment of the present invention;

fig. 9 is a schematic diagram of a shared vehicle dispatching terminal according to an embodiment of the invention.

Detailed Description

In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

With the rapid development of shared vehicles, the problem of operation management is also highlighted. The main reaction is in two aspects: firstly, the problem of disordered parking caused by random returning of the user is solved; one is the problem of vehicle distribution imbalance caused by traffic "tides". The traffic tide phenomenon is closely related to time, and the shared vehicles usually have the phenomenon of unidirectional concentration and unidirectional diffusion at the early/late peak. For example, in early rush hours, a large number of users travel shared vehicles to a company or a transfer site of a vehicle, such as a subway station or a bus station, resulting in a sudden drop in the distribution of shared vehicles in other regions; in late-peak hours, a large number of users ride the shared vehicles at the transfer sites of companies or vehicles, such as subway stations or bus stations, resulting in scarcity of the shared vehicles at the transfer sites of companies or vehicles.

In order to relieve the problem of disordered parking caused by random vehicle returning of users and the inconvenience brought to the users by traffic tide phenomenon, the embodiment of the invention provides a technical scheme for carrying out partition scheduling on shared vehicles.

And (4) partition scheduling, namely performing partition on the use areas of the shared vehicles, and scheduling the shared vehicles according to the partition result.

In one embodiment of the invention, the division of the use area for the shared vehicle may be performed by a server or a cluster of servers. Specifically, the server or the server cluster may divide the shared vehicle usage area into a plurality of partitions, and partition the shared vehicle usage area according to the distribution rule, the flow rule, and/or the shared vehicle aggregation point determination condition of the shared vehicle.

Specifically, the server or the server cluster may acquire the positions of all shared vehicles in the use area of the shared vehicles in real time, and analyze the distribution rule and the flow rule of the shared vehicles according to the acquired position data.

The invention discloses a flow law analysis method in one embodiment. Specifically, as shown in fig. 1, the method for analyzing the flow law includes:

s1, monitoring position information of the shared vehicle in real time.

And S2, when the position information of the shared vehicle changes, generating and storing a position change data set.

Preferably, the position information is stored in the position change data set in the form of data pairs, each data pair includes time and position information of the shared vehicle at the current time, and further, the server or the server cluster may draw a position change curve for representing variation of the position information of the shared vehicle according to the position change data set. The capacity of the position change data set corresponding to each shared vehicle is limited, and when the capacity reaches an upper limit, the data pair obtained first is deleted.

And S3, analyzing the position change data set of each shared vehicle, so as to finally obtain the flow rule of the shared vehicles.

The flow law may be represented by a flow law table, which includes a time interval field and a flow direction field.

Further, after a preset time interval, the server or the server cluster may analyze the position change data set of each shared vehicle again to update the flow rule table.

In another possible embodiment of the invention, a method for analyzing distribution rules is disclosed. Specifically, as shown in fig. 2, the method for analyzing the distribution rule includes:

and S10, obtaining a snapshot of the position information of all current shared vehicles.

Specifically, the starting of S10 may be in response to a certain trigger instruction, or may be triggered automatically at a certain preset time point.

And S20, according to the snapshot, aggregating the positions of the vehicles by using a preset aggregation algorithm, and obtaining a shared vehicle aggregation point according to an aggregation result.

And S30, carrying out second aggregation on the shared vehicle aggregation points, and obtaining area centers according to aggregation results, wherein each area center corresponds to one partition.

And S40, dividing the use areas of the shared vehicles according to the area centers to obtain partition results.

As can be seen from the above analysis method, snapshots of the position information of the shared vehicle may be different at different times, and accordingly, the partitioning result may also be different. In addition, the partition result can be manually adjusted or intelligently and automatically adjusted according to actual needs.

The partition result obtained by the analysis method comprises one or more partitions, each partition can comprise one or more aggregation points, and one or more shared vehicles are arranged near each aggregation point.

The invention discloses a shared vehicle scheduling method, a device and a terminal, aiming at scientifically issuing scheduling tasks to users on the premise of fully mastering the partition results and the flow rules of shared vehicles, and selecting the scheduling tasks according to the needs of the users, so that the shared vehicle management is assisted by the shared vehicle operators to achieve the purpose of using the shared vehicles, and the effect of killing two birds with one stone is achieved.

In another embodiment of the present invention, a shared vehicle scheduling method is disclosed, as shown in fig. 3A, the method includes the steps of:

s110, receiving a first type of scheduling task, wherein the scheduling task is generated at least according to a first type of scheduling rule and a second type of scheduling rule.

In one embodiment, the first type of scheduling task is a scheduling task from a server, the scheduling task is generated according to a first type of scheduling rule and a second type of scheduling rule, the first type of scheduling rule is a scheduling rule related to shared bicycle distribution, and the second type of scheduling task is a scheduling rule related to time. For example, the vehicle is generated from the shared vehicle partition condition of the shared vehicle distribution region and the vehicle scheduling time period to which the current time belongs.

In one embodiment, the first type of scheduling task may also be associated with only the first type of scheduling rule. Specifically, the distribution rule and the flow rule of the shared vehicle may be obtained by the server or the server cluster, and sent to the terminal held by the user. The distribution law of the shared vehicles can be used for partitioning the use area of the shared vehicles, and the flow law can map the flow law of the shared vehicles in traffic tide, namely the real-time flow direction of the shared vehicles.

Specifically, the client acquires one or more scheduling tasks from the server, wherein the scheduling tasks comprise a starting point, an end point and a time constraint condition. And the starting point and the end point in the scheduling task are generated according to the shared vehicle partition condition of the shared vehicle distribution region and the vehicle scheduling time period to which the current time belongs. The shared vehicle zone case includes the shared vehicle cluster point case in each zone and each zone. Generating dispatch tasks based on the shared vehicle zone conditions helps guide users to dispatch vehicles that are too concentrated or too dispersed in distribution to other locations, thereby alleviating the problem of too concentrated and out-of-order parking of shared vehicles. The general flow direction of the current sharing vehicle can be known according to the vehicle scheduling time period and the flow rule to which the current time belongs, and the scheduling task generated according to the vehicle scheduling time period to which the current time belongs is helpful for guiding a user to drive the sharing vehicle in the direction of 'reverse tide', so that the 'tide' problem of the sharing vehicle is relieved.

Specifically, the first type of scheduling tasks include intra-partition scheduling tasks and inter-partition scheduling tasks, and the intra-partition scheduling tasks can guide a user to assist in achieving rebalancing of shared vehicles inside the partitions. The inter-partition scheduling task can guide a user to cross-partition travel the shared vehicles, so that the shared vehicles in the area with the excessive distribution of the shared vehicles can be driven to the area with the insufficient distribution of the shared vehicles, and the cross-partition shared vehicles can be re-balanced.

In cooperation with the first type of scheduling task, a scoring mechanism for the first type of scheduling task exists, and factors influencing the scoring mechanism include: path navigation factors, constraint time factors, cumulative completion factors, and the like.

The path navigation factors include at least: the planning distance between the starting point and the end point of the first type of scheduling task and the actual path between the starting point and the end point of the scheduling task. Specifically, the server increases the score of the scheduling task according to the length of the planning distance according to the scheduling, and corrects the score according to the actual path between the starting point and the end point of the final scheduling task. The actual path is used for correction in consideration of the influence of the actual terrain on the scheduled task. For example, the start and end points of a scheduled task, although located in close proximity, may be far greater than the planned distance due to impassable terrain.

As shown in fig. 3B, a river is located between the start point and the end point of the scheduling task, the path of the actual scheduling process needs to pass through a bridge, and the planning distance is far shorter than the actual scheduling distance, so that the scheduling server corrects the score of the scheduling task according to the actual scheduling distance. Because the distance of the scheduling execution user for completing the scheduling task is far longer than the planned route of the server, the correction of the server can reflect the actual scheduling situation, and is vital to the calculation and settlement of subsequent grading and time constraint conditions. The server also uses the rectified data as a scheduling task plan at the beginning of the planning according to the big data statistics.

The constraint time factors include at least: the server plans a designated time starting point and a time ending point which need to be scheduled to be completed in order to relieve the tide phenomenon, and the server calculates the time required for completing the task according to the planned path.

The accumulated completion factor refers to the historical condition that the user completes the scheduling task, and the higher the completion rate and the completion degree of the user are, the higher the score addition given to the user is.

In one embodiment, the server may award the user a reward based on the user's scoring of completing the scheduled task. Specifically, rewards include, but are not limited to: title, value-added service, credit, shoe-shaped gold ingot, gold bean, gift certificate, exchange coupon, greeting card, currency, icon, member and so on. The embodiment of the present invention does not limit the type of reward.

In one embodiment, as shown in fig. 3C-3F, if the actual trajectory of the shared bicycle is as shown in fig. 3C, the vehicle information in each grid will appear as the number "+ 1" "-1" in fig. 3D-3F during the scheduling process, so as to quickly locate the trajectory of the vehicle, thereby also avoiding the erroneous estimation of the vehicle driving trajectory due to the GPS positioning deviation. And positioning is carried out based on grids, and the vehicle dispatching driving distance can be calculated according to the grid number of the vehicle driving, so that final task scoring and settlement are carried out.

In order to facilitate users to select the most suitable scheduling task in real life by combining the driving requirements of the users on the shared vehicle, as shown in fig. 4, the scheduling tasks provided in the embodiment of the present invention each include a task identifier, a starting point, a destination, and a time constraint condition.

And S120, confirming the specified task in the first type of scheduling task.

Specifically, the user can select the most suitable target task from the numerous scheduling tasks of the first type as the designated task according to the requirement of the user.

For example, if a user wants to go from a to B to work, the starting point C of a certain scheduling task is very close to the position of a, the destination D is very close to the position of B, and the user can complete the scheduling task under the time constraint condition, the user can select the scheduling task as the target task. Therefore, the user can complete the target task to obtain the reward, and the self routing arrangement is not delayed.

Specifically, after the user selects the target task, the terminal may obtain a task identifier of the target task, and upload the task identifier to the server. The server can lock the number of target vehicles corresponding to the target task in a specified time period according to the selection of the user, so that the task is avoided. The server can also mark the state of the target task as a locking state in time after acquiring the target task identifier, so that other users are prevented from repeatedly selecting the target task.

And S130, unlocking the target vehicle corresponding to the specified task.

Specifically, as shown in fig. 5, after the user reaches the trigger point of the target task, the user may acquire the identification code of the target vehicle, specifically, the identification code of the target vehicle may be a barcode or a two-dimensional code, and after the user scans the code through the terminal to obtain the identification code, the identification code is uploaded to the server, and the server may send an unlocking instruction to the vehicle-mounted terminal on the target vehicle to unlock the target vehicle, or the server sends an unlocking instruction to the smart lock on the target vehicle to unlock the target vehicle. After the target vehicle is unlocked, the server records the unlocking time and formally starts to execute a target task with the user as a dispatcher.

During the execution of the target task, the user may need to know the execution progress in real time. The embodiment of the invention provides two execution progress display methods.

The method comprises the following steps: after the target vehicle is unlocked, acquiring and displaying the position information of the target vehicle in real time; and calculating and displaying a difference value between the position information of the target vehicle and the destination.

The second method comprises the following steps: after the target vehicle is unlocked, acquiring the position information of the target vehicle in real time and transmitting the position information to a server so that the server calculates the difference value between the position information of the target vehicle and a destination; and displaying the difference value and acquiring scheduling task execution progress information pushed by the server.

It should be noted that, if the user picks up the target task in real life and scans the identification code of the non-target vehicle at the starting point of the non-target task, the server may still unlock the non-target vehicle for the user. In order to improve user experience, the server can also send a notification to ask the user whether the user still receives the target task, if the user abandons the target task, the server unlocks the target task, and at the moment, other users can receive the project mark task.

S140, locking operation of the target vehicle is executed, and task ending information from a server is received.

When the user drives the target vehicle to a certain position and does not want to continue to drive the target vehicle, the target vehicle is locked, and after the target vehicle is locked, the server can receive a notice that the target vehicle is locked. Specifically, after the target vehicle is locked again, the location information of the target vehicle may be transmitted to a server so that the server records the location information and the locking time of the target vehicle and generates target task end information.

Receiving target task ending information from a server, wherein the target task ending information comprises execution information of a target task and payment information of the target task, the execution information of the target task is generated by the server according to a first judgment result and a second judgment result, the first judgment result is used for identifying whether an actual task execution process meets an area constraint condition of the target task, the area constraint condition comprises a starting point and an end point, the second judgment result is used for identifying whether the actual task execution process meets a time constraint condition, and the target payment information is generated by the server according to the execution information of the target task.

In one embodiment, the task end information further includes settlement information according to completion of the scheduled task by the user. Specifically, the settlement information of the user completing the scheduling task may include information of fees for the user to use the shared bicycle, and the settlement information of the user completing the scheduling task may include reward information given to the user according to a user completion score.

In one embodiment, a shared vehicle dispatch billing method is provided, comprising the steps of:

s301, receiving a first type of scheduling task, wherein the scheduling task is generated at least according to a first type of scheduling rule and a second type of scheduling rule which are associated with each other;

s302, sending confirmation information of a specified task in the first type of scheduling task;

s303, unlocking the target vehicle corresponding to the specified task;

s304, after the target vehicle is locked again, task ending information from the server is received, wherein the task ending information comprises charging information.

In the step S301, the first type of scheduling rule is a scheduling rule related to a shared vehicle area distribution; the second type of scheduling rule is a scheduling rule related to shared vehicle usage time.

Specifically, the first type of scheduling rule includes obtaining distribution information of shared vehicles in real time, obtaining a vehicle distribution function according to the distribution information, obtaining a vehicle distribution function change rate associated with time, and taking an area with the highest change rate as a target area of the first type of scheduling rule.

In one embodiment, the server obtains the position of the vehicle on the map according to the positioning information of the vehicle terminal, and of course, in addition to obtaining the position information of the vehicle, other relevant information of the vehicle, such as vehicle number, driving distance and the like, can be obtained, and the information can be recorded through a vector or an array. Such as [ NO13567, 40 ° 11' 22 "N, 116,0,0 ° E, …, LOCK, DATE ]. The vehicle, designated by reference numeral 13567, is in the 40 ° 11' 22 "N, 116,0,0 ° E position, is in the locked state, and is scheduled. The server is represented on the map by a vehicle distribution function according to the obtained position information, the vehicle distribution function represents the vehicle distribution, the function representation can be NoB ═ f (x, y), and NoB represents the number of vehicles divided per the minimum grid. On the map, there are included multilevel divisions of the shared single-vehicle distribution, for example beijing belongs to the highest level division, under which the next highest level division is included, and so on, the lowest level division being for the purpose of clearly counting the positions of the vehicles. For example, a 50 meter radius of a subway entrance may be used as a lowest level partition, and a lowest level partition may further comprise at least one minimum grid partition for vehicle counting. The lowest level partition is dynamically variable and includes at least one minimum grid division for vehicle counting, which is dynamically variable as the vehicle moves, so that the boundary of the lowest level partition dynamically changes as the grid changes. And the vehicle condition in each grid is recorded in an array which changes in real time, and the change condition of the vehicle in each partition can be obtained according to the change condition of each grid. During peak periods of vehicle use, the vehicle flow is very fast, the scheduling starting point of 'inverse tide' can be accurately obtained by utilizing the number of vehicles in each grid, the traffic flow direction of 'tide' can be accurately obtained by utilizing the change speed of the vehicles in each grid, and then scheduling parameters are provided for 'inverse tide' scheduling on the basis of big data. In particular, the dispatching condition of the vehicle can be accurately judged through the vehicle change rate in each grid.

In one embodiment, the calculation amount of the server can be greatly reduced by fitting the vehicle distribution into a distribution function and performing Fourier transformation.

Specifically, the second scheduling rule includes obtaining historical statistical information of the distribution of the shared vehicles; and obtaining a time interval with the distribution concentration degree of the shared vehicles larger than a preset threshold value based on the historical statistical information, and taking the time interval as a constraint time interval of a second scheduling rule.

In step S304, the charging information includes normal charging information and scheduling charging information, the normal charging information is related to the length of time used by the shared vehicle, and the scheduling charging information is related to the distance of the scheduling task, the completion score of the scheduling task, and the region where the scheduling task is located.

Specifically, the scheduling charging information is also related to the distance correction of the scheduling task by the actual scheduling path.

Specifically, the scheduling charging information is also related to the distribution uniformity of the shared vehicles in the area where the scheduling task is located.

In one embodiment, the scheduling information, the payment information, and the like are performed by a background server or a server cluster. As shown, background server clusters include, but are not limited to: a front-end server, a dispatch server, a settlement server, etc.

And the front-end server is used for receiving the information from the user terminal and forwarding the downlink information from the server cluster to the user terminal.

The dispatching server calculates 'tide information' according to the current vehicle distribution condition, and calculates 'reverse tide' vehicle dispatching tasks according to the vehicle distribution condition. Specifically, the scheduling task may be a set of start and end positions of the unplanned path.

The dispatching server sends the vehicle dispatching task of 'reverse tide' to the foreground server, and the foreground server forwards the task to the appointed terminal. In one embodiment, when the user terminal starts the application, the terminal location is sent to the front-end server, and the front-end server retrieves a starting location matching the terminal location from a starting location set of the scheduling server according to the terminal location information, where the matching rule includes, but is not limited to: the server executes retrieval operation according to the priority sequence of the matching rules and obtains starting point position information matched with the terminal position. After obtaining the start location information, the server obtains the end location information. The obtaining of the endpoint location information includes a variety of ways, including but not limited to: the method comprises the steps of user input, user historical input information, user historical riding records, and starting point and end point matching relation based on deep neural network learning. And the scheduling server acquires an end point position information set of the scheduling task according to the end point position information, and sends the start point position set and the end point position set as the scheduling task to the user terminal.

In a particular embodiment, the set of starting and ending positions is determined from a distribution of the number of shared vehicles among the zones. For example, the partition may be divided into grids according to unit area, the number of vehicles in each grid may be calculated by the positioning system based on the shared vehicles, a function of vehicle distribution may be established according to grid information, and then gradient information of the vehicle information distribution function may be calculated, so that the vehicle distribution uniformity may be calibrated. Furthermore, the tidal profile of the user's demand for the vehicle can be obtained by counting and recording the flow pattern of the vehicle over a longer period of time. Therefore, the server can plan the scheduling task of the vehicle in advance according to the 'expectation' of the vehicle demand and issue the pre-scheduling task to the terminal.

After the user terminal receives the shared vehicle scheduling task sent by the server, the user can combine the starting point position set and the end point position in the scheduling task to select the starting point and the end point of the received task, so as to confirm the reception of the scheduling task and return the information of the received task to the front-end server in the selection process, and the method comprises the following steps: start point, end point, completion time, reward information, etc. The front-end server receives the confirmation acceptance information of the user for the scheduling task and sends the confirmation acceptance information to the scheduling server, the scheduling server locks the user to accept the task, the locked task cannot be accepted by other users, and meanwhile, the user in the task accepting state cannot receive a new task until the user finishes, gives up or fails the task. As previously mentioned, the rewards of scheduled tasks for users include, but are not limited to: title, value-added service, point, shoe-shaped gold ingot, gold bean, gift certificate, exchange coupon, greeting card, currency, icon, member, virtual gift, physical gift, etc., and the embodiment of the invention does not limit the type of reward.

After the user accepts the specified task, the background scheduling server locks the scheduling task. And the user can move to the starting point of the scheduling task according to the prompt message of the terminal, and the unlocking operation of the shared vehicle is executed at the starting point position. After receiving the unlocking operation from the user terminal, the front-end server verifies the consistency of the unlocking operation position and the starting point of the scheduling task received by the user, and if the unlocking operation position is consistent with the starting point of the scheduling task, the front-end server sends an unlocking instruction to a shared single vehicle for executing an unlocking vehicle to execute the unlocking operation and simultaneously binds the vehicle I D with the scheduling task; if the unlocking operation is continued, the front-end server sends an unlocking instruction to a shared bicycle for executing the unlocking vehicle to execute the unlocking operation, and simultaneously sends a user abandoning task message to the scheduling server to enable the scheduling server to lock the task and the task user.

After the user performs the unlocking operation and starts to perform the scheduling task, the user can drive the vehicle to the designated position according to the designated task end point in the scheduling task. If the user locks the vehicle at the specified position, the front-end server receives a vehicle locking instruction returned by the specified vehicle and the position of the vehicle. The scheduling server verifies whether the vehicle position is matched with the end point of the corresponding user vehicle locking task, if the vehicle position is the same as the end point of the corresponding user vehicle locking task, the scheduling server judges that the completion of the scheduling task meets a first type of scheduling rule, further, the scheduling server judges whether the completion time meets preset constraint time, and if the completion time is the same as the preset constraint time, the scheduling server judges that the completion of the scheduling task meets a second type of scheduling rule. And the scheduling service judges that the scheduling task is completed under the condition that the first type scheduling rule and the second type scheduling rule are both satisfied. The dispatch server will send completion information for completing the task to the settlement server.

And the settlement server is used for performing settlement operation with the user account. In the case of using a general shared vehicle, the settlement server deducts the usage charge from the user account according to the information such as the time length, mileage information, usage time period, etc. of the user using the shared vehicle, and in the case of using a coupon, voucher, or enjoying discount information, the settlement server deducts the coupon, voucher, or discount charge according to the total cost of the usage. And after the user finishes the scheduling task, the settlement server sends a task completion reward to the user account for finishing the task according to the information sent by the scheduling server.

In summary, the present embodiment can issue the scheduling task according to the dynamic vehicle distribution condition, so as to guide the end user to schedule the vehicles that are distributed too intensively or too dispersedly to other locations, thereby implementing the "rebalancing" of the shared vehicles, and can consider the vehicle scheduling time period to which the current time belongs when issuing the scheduling task, thereby avoiding the conflict between the scheduling task and the traffic "tide", so as to guide the end user to schedule the vehicle in the direction of "tide reversion".

In one embodiment, a method for generating target task end information is shown in fig. 6, and includes:

s100, obtaining a first judgment result according to the regional constraint condition of the target task.

Specifically, a difference between the parking point of the target vehicle after being locked again and the destination of the target task may be calculated, and the difference is compared with a preset distance threshold, and if the difference is not greater than the threshold, a first determination result is true, which indicates that the user rides the shared vehicle to the specified position in the current driving process.

Specifically, the difference may be greater than or equal to 0.

S200, obtaining a second judgment result according to the time constraint condition of the target task.

Specifically, the time constraint condition includes a deadline of the target task, and it may be determined whether the time for the target vehicle to be locked again is before the deadline, and if so, the second determination result is true.

And S300, generating the execution information of the target task according to the first judgment result and the second judgment result.

Specifically, the target task is successfully executed only when the first judgment result and the second judgment result are both true, otherwise, the execution fails.

And S400, generating payment information of the target task according to the execution information of the target task.

And S500, generating target task ending information according to the execution information and payment of the target task.

The invention provides a shared vehicle scheduling method, a device and a terminal. The invention can issue the scheduling task according to the dynamic vehicle distribution condition, thereby guiding the terminal user to schedule the vehicles which are distributed too intensively or too dispersedly to other places so as to realize the rebalancing of the shared vehicles, and considering the vehicle scheduling time quantum which the current time belongs to when issuing the scheduling task, thereby avoiding the conflict between the scheduling task and the traffic tide, and guiding the terminal user to schedule the vehicle in the direction of the tide.

In another embodiment provided by the present invention, each sharing vehicle may be provided with a vehicle-mounted terminal, the vehicle-mounted terminal may also send location information of the sharing vehicle to a server, and record rental status information of the sharing vehicle, and the vehicle-mounted terminal and the server may directly perform information interaction, or may indirectly perform information interaction with the control center through a terminal held by a user.

In another embodiment of the present invention, the target vehicle may also be a vehicle being rented, and after a user who is renting the target vehicle receives a scheduling request for the vehicle from a server, the user may choose to accept the scheduling request; at this time, the server can obtain the authority of scheduling the target vehicle and generate a scheduling task for the target vehicle, and after receiving the scheduling task and selecting the scheduling task as the target task, other users can schedule the target vehicle.

In another embodiment of the present invention, the server or the server cluster may also perform integrated management of the location and the rental status of the shared vehicle, and specifically, may generate two tables, a location status management table and a rental status management table of the shared vehicle. And updating the position state management table and the renting state management table of the shared vehicle according to the information fed back by the vehicle-mounted terminal and/or the terminal used by the user.

An embodiment of the present invention provides a shared vehicle scheduling apparatus, as shown in fig. 7, the apparatus includes:

the scheduling task obtaining module 100 is configured to obtain one or more scheduling tasks from a server, where the scheduling tasks include a departure point, a destination, and a time constraint condition, and the scheduling tasks are generated according to a partition condition of a shared vehicle in a shared vehicle distribution region and a vehicle scheduling time period to which a current time belongs.

And a target task selection module 200, configured to select a target task from the obtained scheduling tasks. Specifically, the target task selection module is further configured to obtain a task identifier of the target task, and upload the task identifier to a server.

And the unlocking module 300 is used for unlocking the target vehicle positioned at the starting point of the target task.

And a target task ending information receiving module 400, configured to receive target task ending information from the server after the target vehicle is locked again. Specifically, the target task ending information receiving module 400 is configured to receive target task ending information from a server, where the target task ending information includes execution information of a target task and payment information of the target task, the execution information of the target task is generated by the server according to a first determination result and a second determination result, the first determination result is used to identify whether an actual task execution process meets an area constraint condition of the target task, the area constraint condition includes a departure point and a destination, the second determination result is used to identify whether the actual task execution process meets a time constraint condition, and the target payment information is generated by the server according to the execution information of the target task.

As shown in fig. 8, the unlocking module 300 includes:

a scanning unit 310 for acquiring an identification code of a target vehicle;

an uploading unit 320 for uploading the identification code to enable the server to unlock the target vehicle and record the unlocking time.

In a possible embodiment of the present invention, the apparatus may further include:

the position information processing module 400 is used for acquiring and displaying the position information of the target vehicle in real time after the target vehicle is unlocked;

and a difference processing module 500, configured to calculate and display a difference between the position information of the target vehicle and the destination.

In another possible embodiment of the present invention, the apparatus may further include:

the position information uploading module 600 is configured to obtain position information of the target vehicle in real time after the target vehicle is unlocked and transmit the position information to the server so that the server calculates a difference between the position information of the target vehicle and a destination;

and an execution process display module 700, configured to display the difference value and obtain scheduling task execution progress information pushed by the server.

The present embodiment provides a shared vehicle scheduling apparatus based on the same inventive concept, and can be used to implement the shared vehicle scheduling method provided in the above embodiments. In addition, the shared vehicle scheduling device provided by this embodiment can be disposed on a terminal held by a user, so as to bring convenience to the user for traveling, and facilitate the user to execute a scheduling task, thereby realizing "rebalancing" of the shared vehicle, avoiding the scheduling task from conflicting with traffic "tide", and guiding the terminal user to schedule the vehicle in the direction of "tide reversion".

The embodiment of the invention also provides a storage medium. Optionally, in this embodiment, the storage medium may be configured to store program codes executed by the shared vehicle scheduling method implemented in the foregoing embodiment.

Optionally, in this embodiment, the storage medium may be located in at least one network device of a plurality of network devices of a computer network.

Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps:

the method comprises the steps that firstly, one or more scheduling tasks from a server are obtained, the scheduling tasks comprise a starting point, a destination and a time constraint condition, and the scheduling tasks are generated according to the partition condition of shared vehicles in a shared vehicle distribution region and the vehicle scheduling time period to which the current time belongs;

secondly, selecting a target task from the obtained scheduling tasks:

thirdly, unlocking a target vehicle positioned at the starting point of the target task;

and fourthly, receiving target task ending information from the server after the target vehicle is locked again.

Optionally, the storage medium is further arranged to store program code for performing the steps of:

the selecting the target task comprises: and acquiring a task identifier of the target task, and uploading the task identifier to a server.

the method comprises the steps of firstly, acquiring an identification code of a target vehicle;

and secondly, uploading the identification code to enable the server to unlock the target vehicle and record unlocking time.

after the target vehicle is unlocked, acquiring and displaying the position information of the target vehicle in real time;

and calculating and displaying a difference value between the position information of the target vehicle and the destination.

after the target vehicle is unlocked, acquiring the position information of the target vehicle in real time and transmitting the position information to a server so that the server calculates the difference value between the position information of the target vehicle and a destination;

and displaying the difference value and acquiring scheduling task execution progress information pushed by the server.

after the target vehicle is locked again, the position information of the target vehicle is sent to a server so that the server records the position information and the locking time of the target vehicle and generates target task end information.

receiving target task ending information from a server, wherein the target task ending information comprises execution information of a target task and payment information of the target task, the execution information of the target task is generated by the server according to a first judgment result and a second judgment result, the first judgment result is used for identifying whether an actual task execution process meets an area constraint condition of the target task, the area constraint condition comprises a starting point and a destination, the second judgment result is used for identifying whether the actual task execution process meets a time constraint condition, and the target payment information is generated by the server according to the execution information of the target task.

Optionally, in this embodiment, the storage medium may include, but is not limited to: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.

The embodiment of the invention also provides a shared vehicle dispatching terminal which comprises a shared vehicle dispatching device. The terminal may be a mobile terminal or the like. Optionally, in this embodiment, the terminal may also be a computer terminal, and may also be replaced by any one computer terminal device in a computer terminal group.

Optionally, in this embodiment, the computer terminal or the mobile terminal may be located in at least one of a plurality of network devices of a computer network.

Alternatively, fig. 9 is a block diagram of a terminal according to an embodiment of the present invention. As shown in fig. 9, the terminal may include: one or more processors (only one of which is shown), memory, and transmission means.

The memory may be used for storing software programs and modules, and the processor may execute various functional applications and data processing by operating the software programs and modules stored in the memory. The memory may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory may further include memory located remotely from the processor, which may be connected to a computer terminal or a mobile terminal through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The above-mentioned transmission device is used for receiving or transmitting data via a network. Examples of the network may include a wired network and a wireless network. In one example, the transmission device includes a network adapter that is connectable to the router via a network cable to communicate with the internet or a local area network. In one example, the transmission device is a radio frequency module, which is used for communicating with the internet in a wireless manner.

Wherein the memory is specifically configured to store instructions to implement shared vehicle scheduling.

The integrated unit in the above embodiments may be stored in a readable storage medium if it is implemented in the form of a software functional unit and sold or used as a separate product. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing one or more mobile terminals or computer devices (which may be personal computers, servers, network devices, etc.) to execute all or part of the steps of the method according to the embodiments of the present invention.

The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.

The integrated unit in the above embodiments, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in the above computer-readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing one or more computer devices (which may be personal computers, servers, network devices, etc.) to execute all or part of the steps of the method according to the embodiments of the present invention.

In the above embodiments of the present invention, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.

The shared vehicles comprise shared vehicles such as a shared bicycle, a shared electric vehicle, a shared automobile and an unmanned automobile.

In the several embodiments provided in this application, the described apparatus embodiments are only illustrative, for example, the division of the units is only one logical function division, and there may be other division manners in actual implementation, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

It should be understood that reference to "a plurality" herein means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.

It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, where the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.

The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.

Claims

1. A shared vehicle dispatch billing method, the method comprising the steps of:

generating and sending a first type of scheduling task, wherein the scheduling task is generated at least according to a first type of scheduling rule and a second type of scheduling rule which are mutually associated, the first type of scheduling rule is a scheduling rule related to the area distribution of shared vehicles, and the second type of scheduling rule is a scheduling rule related to the use time of the shared vehicles;

receiving confirmation information of a specified task in the first type of scheduling task;

receiving an unlocking request of a target vehicle corresponding to the specified task, and sending an unlocking command;

responding to the re-locking information of the target vehicle, and generating and sending task ending information, wherein the task ending information comprises charging information;

the method further comprises the following steps:

after the target vehicle is locked again, sending the position information of the target vehicle to a server so that the server records the position information and the locking time of the target vehicle and generates target task end information; the target task ending information comprises execution information of a target task, the execution information of the target task is generated by a server according to a first judgment result and a second judgment result, the first judgment result is used for identifying whether an actual task execution process meets a regional constraint condition of the target task, the regional constraint condition comprises a starting point and a destination, and the second judgment result is used for identifying whether the actual task execution process meets a time constraint condition.

2. The method of claim 1, wherein:

the first type of scheduling rule comprises the steps of obtaining distribution information of shared vehicles in real time, obtaining vehicle distribution functions according to the distribution information, obtaining vehicle distribution function change rates related to time, and taking the area with the highest change rate as a target area of the first type of scheduling rule.

3. The method of claim 1, wherein:

the second type of scheduling rule comprises obtaining historical statistical information of the distribution of the shared vehicles;

and obtaining a time interval with the distribution concentration degree of the shared vehicles larger than a preset threshold value based on the historical statistical information, and taking the time interval as a constraint time interval of a second scheduling rule.

4. The method of claim 1, wherein the first type of scheduling rules comprises dividing a shared vehicle distribution zone into zones; and the subareas judge conditions according to the distribution rule and the flow rule of the shared vehicles and/or the shared vehicle gathering point.

5. The method of claim 4, wherein the partition is a multi-level partition; the first type of scheduling task comprises vehicle scheduling in a subarea and vehicle scheduling across subareas.

6. The method of claim 1, wherein the target vehicle corresponding to the designated task is unlocked;

acquiring an identification code of a target vehicle;

uploading the identification code to a server to enable the server to unlock the target vehicle and record unlocking time.

7. The method of claim 1, further comprising:

8. The method of claim 1, wherein the billing information comprises normal billing information and scheduled billing information, wherein the normal billing information relates to a length of time the shared vehicle is in use, and wherein the scheduled billing information relates to a distance of the scheduled task, a completion score of the scheduled task, and an area where the scheduled task is located.

9. The method of claim 8, wherein the scheduling accounting information is further related to a modification of a distance of the scheduling task by an actual scheduling path.

10. The method of claim 8, wherein the scheduling accounting information is further related to a shared vehicle distribution uniformity of an area where the scheduled task is located.

11. A shared vehicle dispatch billing apparatus, the apparatus comprising the following modules:

the scheduling task generating and sending module is used for generating and sending a first type of scheduling tasks, the scheduling tasks are generated at least according to a first type of scheduling rules and a second type of scheduling rules which are mutually associated, the first type of scheduling rules are scheduling rules related to the regional distribution of shared vehicles, and the second type of scheduling rules are scheduling rules related to the service time of the shared vehicles;

the confirmation information receiving module is used for receiving the confirmation information of the specified task in the first type of scheduling task;

the unlocking module is used for receiving an unlocking request of the target vehicle corresponding to the specified task and sending an unlocking command;

the task ending and charging module is used for responding to the relocking information of the target vehicle, generating and sending task ending information, wherein the task ending information comprises charging information; after the target vehicle is locked again, sending the position information of the target vehicle to a server so that the server records the position information and the locking time of the target vehicle and generates target task end information; the target task ending information comprises execution information of a target task, the execution information of the target task is generated by a server according to a first judgment result and a second judgment result, the first judgment result is used for identifying whether an actual task execution process meets a regional constraint condition of the target task, the regional constraint condition comprises a starting point and a destination, and the second judgment result is used for identifying whether the actual task execution process meets a time constraint condition.

12. The apparatus of claim 11, wherein:

13. The apparatus of claim 11, wherein:

14. The apparatus of claim 11, wherein the first type of scheduling rules comprises dividing a shared vehicle distribution zone into zones; and the subareas judge conditions according to the distribution rule and the flow rule of the shared vehicles and/or the shared vehicle gathering point.

15. The apparatus of claim 14, wherein the partition is a multi-level partition; the first type of scheduling task comprises vehicle scheduling in a subarea and vehicle scheduling across subareas.

16. The apparatus of claim 11, wherein the unlocking module comprises;

the vehicle identification code acquisition module is used for acquiring an identification code of a target vehicle;

and the vehicle identification code uploading module uploads the identification code to the server so that the server unlocks the target vehicle and records the unlocking time.

17. The apparatus of claim 11, further comprising:

the distance difference calculating module is used for acquiring the position information of the target vehicle in real time and transmitting the position information to the server after the target vehicle is unlocked so that the server calculates the difference between the position information of the target vehicle and the destination;

and the display module is used for displaying the difference value and acquiring scheduling task execution progress information pushed by the server.

18. The apparatus of claim 11, wherein the billing information comprises normal billing information and scheduled billing information, wherein the normal billing information relates to a length of time the shared vehicle is in use, and wherein the scheduled billing information relates to a distance of the scheduled task, a completion score of the scheduled task, and a region where the scheduled task is located.

19. The apparatus of claim 11, wherein the scheduling accounting information further relates to a modification of a distance of an actual scheduling path to a scheduling task.

20. The apparatus of claim 11 wherein the dispatch billing information is further related to a shared vehicle distribution uniformity of an area in which the dispatch task is located.

21. A server, characterized in that it comprises a device according to one of claims 11 to 20.