A method and device for dispatching shared bicycles

Abstract

This specification discloses a method and device for scheduling shared bicycles. First, in response to determining that a target parking spot meets a preset scheduling start condition, the storage record of shared bicycles at the target parking spot is queried from a preset blockchain. Secondly, based on the queried storage record of shared bicycles at the target parking spot, the number of shared bicycles parked at the target parking spot in the current period is determined. Finally, if it is determined that the number of shared bicycles parked exceeds the shared bicycle parking threshold, a scheduling message for the target parking spot is generated and sent to at least one shared bicycle operator corresponding to the shared bicycles parked at the target parking spot, so that at least one shared bicycle operator can schedule the shared bicycles parked at the target parking spot according to the scheduling message. This method can ensure that data will not be tampered with through blockchain technology, so as to combine the data of each shared bicycle operator to schedule the shared bicycles in each parking spot, thereby improving the utilization rate of shared bicycles.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and more particularly to a method and device for dispatching shared bicycles. Background Art

[0002] At present, with the development of shared transportation, shared bicycles have the advantages of easy parking, convenient use, low usage cost and no pollution, and are favored by more and more users.

[0003] In actual applications, shared bicycles provide great convenience for users' lives, but users may park shared bicycles randomly after riding, which may cause shared bicycles to occupy public resources such as motor vehicle lanes and sidewalks, causing great trouble to urban governance. In addition, since each shared bicycle operator only pays attention to the dispatch of its own shared bicycles, the number of shared bicycles in each parking spot in the city may be unevenly distributed, resulting in a low utilization rate of shared bicycles.

[0004] Therefore, how to improve the utilization rate of shared bicycles is an urgent problem to be solved. Summary of the invention

[0005] The present specification provides a method and device for dispatching shared bicycles to solve the problem of low utilization rate of shared bicycles in the prior art.

[0006] This manual adopts the following technical solutions:

[0007] This specification provides a method for dispatching a shared bicycle, including:

[0008] In response to determining that the target parking point meets the preset scheduling start condition, querying the shared bicycle storage record of the target parking point from a preset blockchain, wherein the shared bicycle storage record of each parking point is stored in the blockchain;

[0009] Determine the number of shared bicycles parked at the target parking point in the current period according to the shared bicycle storage record of the target parking point found out;

[0010] If it is determined that the number of shared bicycles parked exceeds the shared bicycle parking threshold corresponding to the determined target parking point, a scheduling message for the target parking point is generated and sent to at least one shared bicycle operator corresponding to the shared bicycles parked in the target parking point, so that the at least one shared bicycle operator schedules the shared bicycles parked in the target parking point according to the scheduling message.

[0011] Optionally, determining that the target parking point meets a preset scheduling start condition specifically includes:

[0012] If a shared bicycle is detected to enter the target parking spot, it is determined that the target parking spot meets the preset dispatch start condition.

[0013] Optionally, monitoring that a shared bicycle enters the target parking spot specifically includes:

[0014] If the radio frequency tag of the shared bicycle is collected by the radio frequency identification device installed at the target parking spot, it is monitored that the shared bicycle enters the target parking spot.

[0015] Optionally, determining a shared bicycle parking threshold corresponding to the target parking point specifically includes:

[0016] Querying basic parameters corresponding to the target parking point from the blockchain, and determining an initial parking threshold corresponding to the target parking point based on the basic parameters, and / or obtaining traffic control information related to the target parking point, wherein the basic parameters include location data corresponding to the target parking point and a parking area of ​​the target parking point;

[0017] According to at least one of the initial parking threshold and the traffic control information, a shared bicycle parking threshold corresponding to the target parking point is determined.

[0018] Optionally, determining an initial parking threshold corresponding to the target parking point according to the basic parameters specifically includes:

[0019] Querying the incremental parking values ​​of the shared bicycles at the target parking spot in different time periods from the blockchain;

[0020] Determining the basic parking quantity corresponding to the target parking point according to the basic parameters;

[0021] According to the basic parking quantity and the parking increment value of the shared bicycles at the target parking point in different time periods, an initial parking threshold corresponding to the target parking point in the current time period is determined.

[0022] Optionally, if it is determined that the number of shared bicycles parked exceeds the determined shared bicycle parking threshold corresponding to the target parking point, a dispatch message for the target parking point is generated and sent to at least one shared bicycle operator corresponding to the shared bicycles parked in the target parking point, so that the at least one shared bicycle operator dispatches the shared bicycles parked in the target parking point according to the dispatch message, specifically including:

[0023] If it is determined that the number of shared bicycles parked is greater than the shared bicycle parking threshold, the number of shared bicycles parked corresponding to each shared bicycle operator in the target parking spot is determined according to the shared bicycle storage record of the target parking spot queried from the blockchain;

[0024] According to the number of shared bicycles parked corresponding to each shared bicycle operator in the target parking spot, a target operator is determined from the shared bicycle operators, and a scheduling message is generated for the target operator, so that the target operator can schedule the shared bicycles belonging to the target operator parked in the target parking spot according to the scheduling message.

[0025] Optionally, the method further comprises:

[0026] For each shared bicycle, if the length of time the shared bicycle stays at the target parking point is greater than the set length of time, the shared bicycle storage record at the target parking point is stored in the blockchain.

[0027] Optionally, the method further comprises:

[0028] Determine a shared bicycle operator that fails to dispatch a shared bicycle from the target parking point within a set time after receiving the dispatch message as a violating operator;

[0029] The violation data of the illegal operator at the target parking point is stored in the blockchain, and the violation data is sent to the supervisory party.

[0030] Optionally, the method further comprises:

[0031] For each shared bicycle operator, determine the response rate and response time of the shared bicycle operator for dispatching the shared bicycles belonging to the shared bicycle operator in the parking spot after receiving the dispatch message. The response rate is used to represent the proportion of the parking spots for which the shared bicycle operator performs the shared bicycle dispatch operation after receiving the dispatch message for each parking spot. The response time is used to represent the average time consumed by the shared bicycle operator for dispatching the shared bicycles in each parking spot.

[0032] Determine the corresponding responsiveness of the shared bicycle operator according to the response rate and / or the response duration;

[0033] According to the corresponding responsiveness of each shared bicycle operator, the shared bicycle deployment quantity corresponding to each shared bicycle operator is determined, and the shared bicycle deployment quantity corresponding to each shared bicycle operator is sent to the regulator, so that the regulator can plan the shared bicycle deployment of each shared bicycle operator according to the shared bicycle deployment quantity.

[0034] This specification provides a scheduling device for a shared bicycle, including:

[0035] A response module, configured to query a shared bicycle storage record of the target parking point from a preset blockchain in response to determining that the target parking point meets a preset scheduling start condition, wherein the blockchain stores the shared bicycle storage record of each parking point;

[0036] A determination module, configured to determine the number of shared bicycles parked at the target parking point in the current period according to the shared bicycle storage record of the target parking point obtained;

[0037] The scheduling module is used to generate a scheduling message for the target parking point if it is determined that the number of shared bicycles parked exceeds the shared bicycle parking threshold corresponding to the determined target parking point, and send it to at least one shared bicycle operator corresponding to the shared bicycles parked in the target parking point, so that the at least one shared bicycle operator can schedule the shared bicycles parked in the target parking point according to the scheduling message.

[0038] This specification provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the above-mentioned shared bicycle scheduling method is implemented.

[0039] This specification provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned shared bicycle dispatching method when executing the program.

[0040] At least one of the above technical solutions adopted in this specification can achieve the following beneficial effects:

[0041] In the shared bicycle scheduling method provided in this specification, first, in response to determining that the target parking point meets the preset scheduling start condition, the shared bicycle storage record of the target parking point is queried from the preset blockchain, and the shared bicycle storage record of each parking point is stored in the blockchain. Secondly, according to the shared bicycle storage record of the queried target parking point, the number of shared bicycles parked at the target parking point in the current period is determined. Finally, if it is determined that the number of shared bicycles parked exceeds the shared bicycle parking threshold corresponding to the determined target parking point, a scheduling message for the target parking point is generated and sent to at least one shared bicycle operator corresponding to the shared bicycle parked in the target parking point, so that at least one shared bicycle operator can schedule the shared bicycles parked in the target parking point according to the scheduling message.

[0042] It can be seen from the above method that this method can ensure that data will not be tampered with through blockchain technology. By querying the shared bicycle storage records of the target parking point from the preset blockchain, the shared bicycles corresponding to each shared bicycle operator in the target parking point can be determined, and the shared bicycles of each shared bicycle operator in each parking point can be obtained. Combined with the data of each shared bicycle operator, the shared bicycles in each parking point can be dispatched, thereby improving the utilization rate of shared bicycles. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] The drawings described herein are used to provide a further understanding of this specification and constitute a part of this specification. The illustrative embodiments and descriptions of this specification are used to explain this specification and do not constitute an improper limitation on this specification. In the drawings:

[0044] Figure 1 This is a flow chart of a method for dispatching shared bicycles in this specification;

[0045] Figure 2 A schematic diagram of the scheduling process of the supervision system provided in the embodiment of this specification;

[0046] Figure 3 A schematic diagram of a shared bicycle dispatching device provided in this specification;

[0047] Figure 4 A method corresponding to the Figure 1 Schematic diagram of an electronic device. DETAILED DESCRIPTION

[0048] In order to make the purpose, technical solutions and advantages of this specification more clear, the technical solutions of this specification will be clearly and completely described below in combination with the specific embodiments of this specification and the corresponding drawings. Obviously, the described embodiments are only part of the embodiments of this specification, not all of them. Based on the embodiments in this specification, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this specification.

[0049] The technical solutions provided by the embodiments of this specification are described in detail below in conjunction with the accompanying drawings.

[0050] Figure 1 The flowchart of a method for dispatching a shared bicycle in this specification includes the following steps:

[0051] S100: In response to determining that a target parking point meets a preset scheduling start condition, querying a shared bicycle storage record of the target parking point from a preset blockchain, wherein the shared bicycle storage record of each parking point is stored in the blockchain.

[0052] In the embodiments of the present specification, the execution entity of the method for determining the scheduling of shared bicycles may be a server or an electronic device such as a desktop computer. For ease of description, the method for determining the scheduling of shared bicycles provided in the present specification is described below using only the server as the execution entity.

[0053] In the embodiment of this specification, in response to determining that the target parking point meets the preset scheduling start condition, the server can query the shared bicycle storage record of the target parking point from the preset blockchain, and the blockchain mentioned here stores the shared bicycle storage record of each parking point. The shared bicycle mentioned in this specification can refer to a shared bicycle or a shared electric motorcycle.

[0054] In the embodiments of this specification, there may be multiple preset dispatch start conditions. For example, if a shared bicycle is detected to enter a target parking spot, the server may determine that the target parking spot meets the preset dispatch start condition, that is, once a user rides a shared bicycle to enter the target parking spot, the server may determine whether it is necessary to dispatch the shared bicycle parked in the target parking spot; for another example, the server may determine whether it is necessary to dispatch the shared bicycle parked in the target parking spot at regular intervals, wherein, if it is detected that the current time reaches the preset time period, the server may determine that the target parking spot meets the preset dispatch start condition.

[0055] In actual applications, since shared bicycle operators are private enterprises, the operating data of each shared bicycle operator is private. Government regulatory departments cannot obtain the operating data of each shared bicycle operator, and the operating data will not be shared among different shared bicycle operators. Based on this, it is necessary to set up equipment with identification function in the target parking point to identify the shared bicycle operator to which the shared bicycle in the target parking point belongs, so as to achieve the purpose of sharing part of the data.

[0056] In the embodiments of this specification, there are many ways to monitor the shared bicycles entering the target parking spot. For example, if the radio frequency tag of the shared bicycle is collected by the radio frequency identification device (RFID) installed at the target parking spot, the shared bicycle is monitored to enter the target parking spot, and the shared bicycle storage record of the shared bicycle entering the target parking spot is stored in the blockchain, thereby ensuring that the shared bicycle storage record in the target parking spot will not be tampered with.

[0057] Each shared bicycle is equipped with a unique radio frequency tag, which can store the shared bicycle operator to which the shared bicycle belongs and the identification of the shared bicycle. Non-contact data communication can be carried out between the radio frequency identification device and the radio frequency tag. It should be noted that since the recognition range of the radio frequency identification device may be smaller than the parking area corresponding to the target parking spot, multiple radio frequency identification devices can be set in the target parking spot so that the recognition range of the radio frequency identification device covers the entire target parking spot.

[0058] For another example, the target parking point may be equipped with at least one camera. If the camera installed at the target parking point captures the corresponding image of a shared bicycle, it can be determined that the shared bicycle has entered the target parking point, and the storage record of the shared bicycle entering the target parking point can be stored in the blockchain, thereby ensuring that the storage record of the shared bicycle in the target parking point will not be tampered with.

[0059] Among them, since the body color of the shared bicycles of each shared bicycle operator is often quite different from the body color of the shared bicycles of other shared bicycle operators, it has a high degree of recognition. Based on this, the server can not only determine whether the shared bicycle has entered the target parking spot, but also determine the shared bicycle operator to which the shared bicycle belongs based on the body color of the shared bicycle in the image captured by the camera set at the target parking spot. Of course, there are other ways to monitor the shared bicycle entering the target parking spot, which will not be elaborated here one by one, and this manual does not limit the way to monitor the shared bicycle entering the target parking spot.

[0060] In actual applications, it is possible that a user rides a shared bicycle past a target parking spot. In order to avoid the server sending an erroneous scheduling message, the server can determine whether the shared bicycle is parked at the target parking spot by the length of time the shared bicycle stays at the target parking spot.

[0061] In an embodiment of the present specification, the server can store the shared bicycle storage record at the target parking point in the blockchain for each shared bicycle if the shared bicycle stays at the target parking point for a period longer than the set period.

[0062] Furthermore, for each shared bicycle, if the user does not park the shared bicycle at the target parking spot after riding it, and the shared bicycle operator fails to collect the RFID tag corresponding to the shared bicycle through the RFID equipment at the target parking spot, the shared bicycle operator will refuse to lock the shared bicycle.

[0063] S102: Determine the number of shared bicycles parked at the target parking point in the current period according to the queried shared bicycle storage record of the target parking point.

[0064] In the embodiment of the present specification, the server can determine the number of shared bicycles parked at the target parking point in the current period based on the shared bicycle storage records of the queried target parking point.

[0065] Specifically, the shared bicycle storage records of the target parking spot are stored in the blockchain, and the shared bicycle storage records record when each shared bicycle enters and leaves the target parking spot. For example, shared bicycle A enters the target parking spot at 12:30, shared bicycle B enters the target parking spot at 13:10, and shared bicycle C leaves the target parking spot at 13:40. Based on this, the server can determine the number of shared bicycles parked at the target parking spot in the current period by integrating the shared bicycle storage records queried from the blockchain.

[0066] S104: If it is determined that the number of shared bicycles parked exceeds the shared bicycle parking threshold corresponding to the determined target parking point, a scheduling message for the target parking point is generated and sent to at least one shared bicycle operator corresponding to the shared bicycles parked in the target parking point, so that the at least one shared bicycle operator schedules the shared bicycles parked in the target parking point according to the scheduling message.

[0067] In actual applications, since each shared bicycle operator only pays attention to the dispatch of its own shared bicycles, the number of shared bicycles in each parking spot in the city may be unevenly distributed, resulting in a low utilization rate of shared bicycles. For example, each shared bicycle operator usually puts more shared bicycles in more prosperous places in the city, resulting in a large number of shared bicycles in more prosperous places in the city and a small number of shared bicycles in more remote places in the city. Based on this, the server can dispatch shared bicycles in the target parking spot in combination with the data of each shared bicycle operator.

[0068] In an embodiment of the present specification, if it is determined that the number of shared bicycles parked exceeds the shared bicycle parking threshold corresponding to the determined target parking point, the server can generate a scheduling message for the target parking point and send it to at least one shared bicycle operator corresponding to the shared bicycles parked in the target parking point, so that at least one shared bicycle operator can schedule the shared bicycles parked in the target parking point according to the scheduling message.

[0069] In actual applications, since the parking areas corresponding to different parking spots are of different sizes, the server can determine the number of shared bicycles that can be parked in the parking spot based on the parking area corresponding to the parking spot.

[0070] In the embodiment of the specification, the server can query the basic parameters corresponding to the target parking point from the blockchain, and determine the initial parking threshold corresponding to the target parking point based on the basic parameters. The basic parameters mentioned here include the parking area of ​​the target parking point. In other words, the larger the parking area corresponding to the target parking point, the larger the initial parking threshold corresponding to the target parking point.

[0071] Furthermore, the basic parameters may also include location data corresponding to the target parking point. The location data may refer to the longitude and latitude of the location of the target parking point. Since the more prosperous places in the city have a large volume of traffic and a higher utilization rate of shared bicycles, the initial parking threshold of the target parking points in the more prosperous places in the city can be increased to ensure a high utilization rate of shared bicycles. Based on this, the server can determine whether the target parking point is a prosperous place in the city through the location data corresponding to the target parking point. The more prosperous the location of the target parking point, the larger the initial parking threshold corresponding to the target parking point. At the same time, the server can also determine the initial parking threshold corresponding to the target parking point based on the location data corresponding to the target parking point and the parking area of ​​the target parking point.

[0072] In actual applications, since the two periods from 8:00 to 9:00 in the morning and from 5:00 to 7:00 in the evening on weekdays are the rush hour for most companies and the rush hour for school, traffic congestion may occur. Therefore, in order to improve the efficiency of scheduling shared bicycles, the server can temporarily increase the number of shared bicycles parked at the target parking spot.

[0073] In the embodiment of this specification, the server can query the incremental parking value of shared bicycles at the target parking point in different time periods from the blockchain. Secondly, according to the basic parameters, the basic parking quantity corresponding to the target parking point is determined. Finally, according to the basic parking quantity and the incremental parking value of shared bicycles at the target parking point in different time periods, the initial parking threshold corresponding to the target parking point in the current period is determined.

[0074] In other words, the server needs to first determine the basic parking quantity corresponding to the target parking point based on the location data corresponding to the target parking point and the parking area of ​​the target parking point. Then, the server needs to query the incremental parking value of shared bicycles at the target parking point in different time periods from the blockchain, calculate the two, and determine the initial parking threshold corresponding to the target parking point in the current time period.

[0075] It should be noted that the parking increment value can refer to a specific numerical value or a percentage. For example, the basic parking quantity in the target parking spot is 100, and the parking increment value of shared bicycles in the target parking spot during the peak commuting period is 20 as queried from the blockchain. The server can increase the basic parking quantity in the target parking spot to 120. For another example, the basic parking quantity in the target parking spot is 100, and the parking increment value of shared bicycles in the target parking spot during the peak commuting period is 30% as queried from the blockchain. The server can increase the basic parking quantity in the target parking spot to 130. Based on this, the server can increase the number of shared bicycles for a single dispatch, thereby improving the overall efficiency of dispatching shared bicycles.

[0076] In the embodiments of this specification, some parking spots may encounter special circumstances, which may cause these parking spots to be temporarily unavailable. For example, when encountering a large-scale meeting, traffic control may occur, making some parking spots temporarily unavailable. Based on this, the server can obtain traffic control information related to the target parking spot. And according to at least one of the initial parking threshold and the traffic control information, determine the shared bicycle parking threshold corresponding to the target parking spot. Among them, if the target parking spot is unavailable, it can be considered that the shared bicycle parking threshold corresponding to the target parking spot is zero.

[0077] It should be noted that the location data corresponding to the target parking point and the parking area of ​​the target parking point can be planned by the regulator in accordance with relevant regulations and uploaded to the blockchain in advance to regulate the parking of shared bicycles.

[0078] In actual applications, there may be a situation where the number of shared bicycles parked corresponding to each shared bicycle operator in the target parking spot is quite different. For example, in the target parking spot, the number of shared bicycles parked corresponding to shared bicycle operator A is 100, the number of shared bicycles parked corresponding to shared bicycle operator B is 20, and the number of shared bicycles parked corresponding to shared bicycle operator C is 1. It can be seen that the number of shared bicycles parked by shared bicycle operator C in the target parking spot is very small, and sending a dispatch message to shared bicycle operator C will increase the operating cost of shared bicycle operator C to dispatch shared bicycles. Therefore, the server can determine the shared bicycle operator to which the dispatch message needs to be sent based on the number of shared bicycles parked corresponding to each shared bicycle operator in the target parking spot.

[0079] In the embodiment of this specification, if the server determines that the number of shared bicycles parked is greater than the shared bicycle parking threshold, the server determines the number of shared bicycles parked corresponding to each shared bicycle operator in the target parking spot based on the shared bicycle storage record of the target parking spot queried from the blockchain. Then, based on the number of shared bicycles parked corresponding to each shared bicycle operator in the target parking spot, the server determines the target operator from among the shared bicycle operators, and generates a dispatch message for the target operator, so that the target operator dispatches the shared bicycles belonging to the target operator parked in the target parking spot according to the dispatch message.

[0080] There are many ways to determine the target operator. For example, from the number of shared bicycles parked corresponding to each shared bicycle operator in the target parking spot, the shared bicycle operator with the largest number of shared bicycles parked is determined as the target operator. For another example, from the number of shared bicycles parked corresponding to each shared bicycle operator in the target parking spot, the shared bicycle operator whose number of shared bicycles parked is greater than the set parking threshold is determined as the target operator. Of course, there are other ways to determine the target operator, which will not be described one by one here, and this specification does not limit the way to determine the target operator.

[0081] In actual applications, shared bicycle operators may ignore scheduling messages and fail to schedule shared bicycles at target parking spots, resulting in reduced utilization of shared bicycles. Therefore, the server can urge shared bicycle operators to perform scheduling or improvements through regulators.

[0082] In the embodiment of this specification, the server can determine the shared bicycle operator who fails to dispatch the shared bicycle from the target parking point within the set time after receiving the dispatch message as the illegal operator, and then store the illegal operator's violation data at the target parking point in the blockchain, and send the violation data to the supervisor.

[0083] In the embodiments of this specification, the supervision system can be built on the basis of blockchain, and the supervision system includes a server, radio frequency identification devices in each parking spot, each shared bicycle operator and a supervisor. The server, radio frequency identification devices in each parking spot, each shared bicycle operator and a supervisor can be considered as each node in the blockchain. In the supervision system, the server monitors the number of shared bicycles parked in each parking spot and publishes scheduling information to each shared bicycle operator. Specifically, Figure 2 shown.

[0084] Figure 2 A schematic diagram of the operation process of the monitoring system provided in the embodiments of this specification.

[0085] exist Figure 2In the process, the supervisor uploads the basic parameters corresponding to each parking spot to the supervision system and stores them on the blockchain. The storage records of shared bicycles in each parking spot uploaded by the radio frequency identification devices in each parking spot can be stored on the blockchain after consensus is reached through the entire consensus network. The server can monitor the changes in the number of shared bicycles in each parking spot in real time. For each parking spot, if the server determines that the number of shared bicycles parked exceeds the determined shared bicycle parking threshold corresponding to the parking spot, it generates a scheduling message for the parking spot and sends it to at least one shared bicycle operator corresponding to the shared bicycles parked in the parking spot, so that at least one shared bicycle operator can schedule the shared bicycles parked in the parking spot according to the scheduling message.

[0086] Furthermore, the server can determine the shared bicycle operator who fails to dispatch the shared bicycle from the target parking spot within the set time after receiving the dispatch message as the illegal operator, and then store the illegal operator's violation data at the target parking spot in the blockchain, and send the violation data to the supervisor.

[0087] In actual applications, in order to ensure the efficiency of each shared bicycle operator in dispatching shared bicycles, the server can determine the number of shared bicycles released by each shared bicycle operator according to the responsiveness of each shared bicycle operator in dispatching shared bicycles, and send the number of shared bicycles released by each shared bicycle operator to the supervisor, so that the supervisor can plan the release of shared bicycles of each shared bicycle operator to improve the efficiency of each shared bicycle operator in dispatching shared bicycles.

[0088] In an embodiment of the present specification, the server can determine, for each shared bicycle operator, the response rate and response time of the shared bicycle operator for scheduling the shared bicycles belonging to the shared bicycle operator in the parking spot after receiving the scheduling message. The response rate mentioned here is used to characterize the proportion of parking spots for which the shared bicycle operator performs shared bicycle scheduling operations after receiving the scheduling message for each parking spot. The response time mentioned here is used to characterize the average time consumed by the shared bicycle operator to schedule the shared bicycles in each parking spot.

[0089] Secondly, the corresponding responsiveness of the shared bicycle operator is determined according to the response rate and / or response time. Finally, the corresponding number of shared bicycles deployed by each shared bicycle operator is determined according to the corresponding responsiveness of each shared bicycle operator, and the corresponding number of shared bicycles deployed by each shared bicycle operator is sent to the supervisor, so that the supervisor can plan the deployment of shared bicycles for each shared bicycle operator according to the number of shared bicycles deployed.

[0090] In the embodiments of the present specification, the server may encrypt the dispatch messages corresponding to each shared bicycle operator to protect the data privacy between the shared bicycle operators.

[0091] Specifically, each shared bicycle operator and regulator holds their own private key, and the blockchain can store the public keys corresponding to each shared bicycle operator and regulator. The server can sign the dispatch message to be sent with the private key it holds, and obtain the digital signature corresponding to the dispatch message. The shared bicycle operator can verify the digital signature corresponding to the dispatch message with the public key corresponding to the stored server. If it is determined that the digital signature corresponding to the dispatch message passes the signature verification, the shared bicycle operator can determine that the dispatch message is provided by the server.

[0092] For each shared bicycle operator, the server can encrypt the dispatch message to be sent by using the public key corresponding to the shared bicycle operator to obtain the encrypted dispatch message. If the shared bicycle operator determines that the dispatch message is provided by the server, the shared bicycle operator can decrypt the encrypted dispatch message by using the private key held by the shared bicycle operator to obtain the dispatch message corresponding to the shared bicycle operator, and dispatch the shared bicycles in the parking spot according to the dispatch message corresponding to the shared bicycle operator.

[0093] Similarly, the server can sign the violation data corresponding to the violating operator through the private key it holds, and obtain the digital signature corresponding to the violation data corresponding to the violating operator. The supervisor can verify the digital signature corresponding to the violation data corresponding to the violating operator through the public key corresponding to the stored server. If it is determined that the digital signature corresponding to the violation data corresponding to the violating operator passes the signature verification, the supervisor can determine that the violation data corresponding to the violating operator is provided by the server.

[0094] The server can encrypt the violation data corresponding to the violating operator to be sent through the public key corresponding to the supervisor, and obtain the encrypted violation data corresponding to the violating operator. If the supervisor determines that the violation data corresponding to the violating operator is provided by the server, the supervisor can decrypt the encrypted violation data corresponding to the violating operator through the private key held by the supervisor, and obtain the violation data corresponding to the violating operator.

[0095] It can be seen from the above process that this method can ensure that the data will not be tampered with through blockchain technology. By querying the shared bicycle storage records of the target parking point from the preset blockchain, the shared bicycles corresponding to each shared bicycle operator in the target parking point can be determined to obtain the situation of the shared bicycles of each shared bicycle operator at each parking point, and the shared bicycles in each parking point can be dispatched in combination with the data of each shared bicycle operator, thereby improving the utilization rate of shared bicycles. Moreover, this method can encrypt the dispatching messages separately and send them to the shared bicycle operators to which each shared bicycle in the target parking point belongs, so as to ensure the data privacy of each shared bicycle operator.

[0096] The above is a method for dispatching shared bicycles provided in one or more embodiments of this specification. Based on the same idea, this specification also provides a corresponding dispatching device for shared bicycles, such as Figure 3 shown.

[0097] Figure 3 A schematic diagram of a shared bicycle dispatching device provided in this specification includes:

[0098] A response module 300 is used to query the shared bicycle storage record of the target parking point from a preset blockchain in response to determining that the target parking point meets the preset scheduling start condition, wherein the blockchain stores the shared bicycle storage record of each parking point;

[0099] A determination module 302 is used to determine the number of shared bicycles parked at the target parking point in the current period according to the shared bicycle storage record of the target parking point found out;

[0100] The scheduling module 304 is used to generate a scheduling message for the target parking point if it is determined that the number of shared bicycles parked exceeds the shared bicycle parking threshold corresponding to the determined target parking point, and send it to at least one shared bicycle operator corresponding to the shared bicycles parked in the target parking point, so that the at least one shared bicycle operator can schedule the shared bicycles parked in the target parking point according to the scheduling message.

[0101] Optionally, the response module 300 is specifically used to determine whether the target parking point meets a preset scheduling start condition if a shared bicycle is detected to enter the target parking point.

[0102] Optionally, the response module 300 is specifically used to monitor the shared bicycle entering the target parking spot if the radio frequency tag of the shared bicycle is collected by a radio frequency identification device set at the target parking spot.

[0103] Optionally, the scheduling module 304 is specifically used to query the basic parameters corresponding to the target parking point from the blockchain, and determine the initial parking threshold corresponding to the target parking point based on the basic parameters, and / or obtain traffic control information related to the target parking point, the basic parameters include the location data corresponding to the target parking point and the parking area of ​​the target parking point, and determine the shared bicycle parking threshold corresponding to the target parking point based on the initial parking threshold and at least one of the traffic control information.

[0104] Optionally, the scheduling module 304 is specifically used to query the parking increment value of the shared bicycles at the target parking point in different time periods from the blockchain, determine the basic parking quantity corresponding to the target parking point according to the basic parameters, and determine the initial parking threshold corresponding to the target parking point in the current time period according to the basic parking quantity and the parking increment value of the shared bicycles at the target parking point in different time periods.

[0105] Optionally, the scheduling module 304 is specifically used to, if it is determined that the number of parked shared bicycles is greater than the shared bicycle parking threshold, determine the number of shared bicycles parked corresponding to each shared bicycle operator in the target parking point according to the shared bicycle storage record of the target parking point queried from the blockchain, determine the target operator from the shared bicycle operators according to the number of shared bicycles parked corresponding to each shared bicycle operator in the target parking point, and generate a scheduling message for the target operator, so that the target operator schedules the shared bicycles belonging to the target operator parked in the target parking point according to the scheduling message.

[0106] Optionally, the scheduling module 304 is specifically used to, for each shared bicycle, store a shared bicycle storage record at the target parking point in the blockchain if the shared bicycle stays at the target parking point for a duration greater than a set duration.

[0107] Optionally, the scheduling module 304 is specifically used to determine a shared bicycle operator who fails to dispatch a shared bicycle from the target parking point within a set time after receiving the scheduling message, as a violating operator, store the violation data of the violating operator at the target parking point in the blockchain, and send the violation data to the supervisor.

[0108] Optionally, the scheduling module 304 is specifically used to determine, for each shared bicycle operator, a response rate and a response time for the shared bicycle operator to schedule the shared bicycles belonging to the shared bicycle operator in the parking spot after receiving the scheduling message. The response rate is used to characterize the proportion of parking spots for which the shared bicycle operator performs shared bicycle scheduling operations after receiving the scheduling message for each parking spot. The response time is used to characterize the average time consumed by the shared bicycle operator to schedule the shared bicycles in each parking spot. According to the response rate and / or the response time, the corresponding responsiveness of the shared bicycle operator is determined. According to the corresponding responsiveness of each shared bicycle operator, the corresponding shared bicycle deployment quantity of each shared bicycle operator is determined, and the corresponding shared bicycle deployment quantity of each shared bicycle operator is sent to the regulator, so that the regulator plans the shared bicycle deployment of each shared bicycle operator according to the shared bicycle deployment quantity.

[0109] This specification also provides a computer-readable storage medium, which stores a computer program, which can be used to execute the above Figure 1 A scheduling method for shared bicycles is provided.

[0110] This manual also provides Figure 4 The one shown corresponds to Figure 1 A schematic diagram of the electronic device. Figure 4 As mentioned above, at the hardware level, the electronic device includes a processor, an internal bus, a network interface, a memory, and a non-volatile memory, and may also include other hardware required for the business. The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs it to achieve the above Figure 1 The scheduling method of shared bicycles. Of course, in addition to the software implementation, this specification does not exclude other implementation methods, such as logic devices or a combination of software and hardware, etc., that is, the execution subject of the following processing flow is not limited to each logic unit, but can also be hardware or logic devices.

[0111] In the 1990s, improvements to a technology could be clearly distinguished as hardware improvements (for example, improvements to the circuit structure of diodes, transistors, switches, etc.) or software improvements (improvements to the method flow). However, with the development of technology, many improvements to the method flow today can be regarded as direct improvements to the hardware circuit structure. Designers almost always obtain the corresponding hardware circuit structure by programming the improved method flow into the hardware circuit. Therefore, it cannot be said that an improvement in a method flow cannot be implemented using a hardware entity module. For example, a programmable logic device (PLD) (such as a field programmable gate array (FPGA)) is such an integrated circuit whose logical function is determined by the user's programming of the device. Designers can "integrate" a digital system on a PLD by programming it themselves, without having to ask a chip manufacturer to design and produce a dedicated integrated circuit chip. Moreover, nowadays, instead of manually making integrated circuit chips, this kind of programming is mostly implemented by "logic compiler" software, which is similar to the software compiler used when developing and writing programs, and the original code before compilation must also be written in a specific programming language, which is called hardware description language (HDL). There is not only one HDL, but many kinds, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, RHDL (Ruby Hardware Description Language), etc. The most commonly used ones are VHDL (Very-High-Speed ​​Integrated Circuit Hardware Description Language) and Verilog. Those skilled in the art should also know that it is only necessary to program the method flow slightly in the above-mentioned hardware description languages ​​and program it into the integrated circuit, and then it is easy to obtain the hardware circuit that implements the logic method flow.

[0112] The controller can be implemented in any appropriate manner, for example, the controller can take the form of a microprocessor or processor and a computer-readable medium storing a computer-readable program code (such as software or firmware) that can be executed by the (micro)processor, a logic gate, a switch, an application-specific integrated circuit (ASIC), a programmable logic controller, and an embedded microcontroller. Examples of controllers include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320. The memory controller can also be implemented as part of the control logic of the memory. Those skilled in the art also know that in addition to implementing the controller in a purely computer-readable program code manner, the controller can be implemented in the form of a logic gate, a switch, an application-specific integrated circuit, a programmable logic controller, and an embedded microcontroller by logically programming the method steps. Therefore, this controller can be considered as a hardware component, and the devices included therein for implementing various functions can also be regarded as structures within the hardware component. Or even, the devices for implementing various functions can be regarded as both software modules for implementing the method and structures within the hardware component.

[0113] The systems, devices, modules or units described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

[0114] For the convenience of description, the above device is described in various units according to their functions. Of course, when implementing this specification, the functions of each unit can be implemented in the same or multiple software and / or hardware.

[0115] Those skilled in the art will appreciate that the embodiments of this specification may be provided as methods, systems, or computer program products. Therefore, this specification may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, this specification may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0116] This specification is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of this specification. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0117] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0118] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0119] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0120] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0121] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0122] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0123] Those skilled in the art will appreciate that the embodiments of this specification may be provided as methods, systems or computer program products. Therefore, this specification may take the form of a complete hardware embodiment, a complete software embodiment or an embodiment combining software and hardware. Moreover, this specification may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0124] This specification may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. This specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules may be located in local and remote computer storage media, including storage devices.

[0125] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0126] The above description is only an embodiment of the present specification and is not intended to limit the present specification. For those skilled in the art, the present specification may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present specification shall be included in the scope of the claims of the present specification.

Claims

1. A method for dispatching a shared bicycle, comprising: In response to determining that the target parking point meets the preset scheduling start condition, querying the shared bicycle storage record of the target parking point from a preset blockchain, wherein the shared bicycle storage record of each parking point is stored in the blockchain; Determine the number of shared bicycles parked at the target parking point in the current period according to the shared bicycle storage record of the target parking point found out; If it is determined that the number of shared bicycles parked exceeds the determined shared bicycle parking threshold corresponding to the target parking point, a dispatch message for the target parking point is generated and sent to at least one shared bicycle operator corresponding to the shared bicycles parked in the target parking point, so that the at least one shared bicycle operator dispatches the shared bicycles parked in the target parking point according to the dispatch message; Determine the responsiveness of each shared bicycle operator, and determine the shared bicycle deployment quantity of each shared bicycle operator according to the responsiveness of each shared bicycle operator, so as to plan the shared bicycle deployment of each shared bicycle operator according to the responsiveness of each shared bicycle operator; the responsiveness is determined according to the proportion of parking spots where the shared bicycle operator performs shared bicycle dispatching operations, and / or the average time consumed by the shared bicycle operator to dispatch shared bicycles in each parking spot.

2. The method according to claim 1, determining that the target parking point meets the preset scheduling start condition, specifically comprises: If a shared bicycle is detected to enter the target parking spot, it is determined that the target parking spot meets the preset dispatch start condition.

3. The method according to claim 2, wherein monitoring a shared bicycle entering the target parking spot specifically comprises: If the radio frequency tag of the shared bicycle is collected by the radio frequency identification device installed at the target parking spot, it is monitored that the shared bicycle enters the target parking spot.

4. The method according to claim 1, determining the shared bicycle parking threshold corresponding to the target parking point, specifically comprising: Querying basic parameters corresponding to the target parking point from the blockchain, and determining an initial parking threshold corresponding to the target parking point based on the basic parameters, and / or obtaining traffic control information related to the target parking point, wherein the basic parameters include location data corresponding to the target parking point and a parking area of ​​the target parking point; According to at least one of the initial parking threshold and the traffic control information, a shared bicycle parking threshold corresponding to the target parking point is determined.

5. The method according to claim 4, determining the initial parking threshold corresponding to the target parking point according to the basic parameters, specifically comprising: Querying the incremental parking values ​​of the shared bicycles at the target parking spot in different time periods from the blockchain; Determining the basic parking quantity corresponding to the target parking point according to the basic parameters; According to the basic parking quantity and the parking increment value of the shared bicycles at the target parking point in different time periods, an initial parking threshold corresponding to the target parking point in the current time period is determined.

6. The method according to claim 1, if it is determined that the number of shared bicycles parked exceeds the determined shared bicycle parking threshold corresponding to the target parking point, generating a scheduling message for the target parking point and sending it to at least one shared bicycle operator corresponding to the shared bicycles parked in the target parking point, so that the at least one shared bicycle operator schedules the shared bicycles parked in the target parking point according to the scheduling message, specifically comprising: If it is determined that the number of shared bicycles parked is greater than the shared bicycle parking threshold, the number of shared bicycles parked corresponding to each shared bicycle operator in the target parking spot is determined according to the shared bicycle storage record of the target parking spot queried from the blockchain; According to the number of shared bicycles parked corresponding to each shared bicycle operator in the target parking spot, a target operator is determined from the shared bicycle operators, and a scheduling message is generated for the target operator, so that the target operator can schedule the shared bicycles belonging to the target operator parked in the target parking spot according to the scheduling message.

7. The method of claim 1, further comprising: For each shared bicycle, if the length of time the shared bicycle stays at the target parking point is greater than the set length of time, the shared bicycle storage record at the target parking point is stored in the blockchain.

8. The method of claim 1, further comprising: Determine a shared bicycle operator that fails to dispatch a shared bicycle from the target parking point within a set time after receiving the dispatch message as a violating operator; The violation data of the illegal operator at the target parking point is stored in the blockchain, and the violation data is sent to the supervisory party.

9. The method of claim 1, further comprising: For each shared bicycle operator, determine the response rate and response time of the shared bicycle operator for dispatching the shared bicycles belonging to the shared bicycle operator in the parking spot after receiving the dispatch message. The response rate is used to represent the proportion of the parking spots for which the shared bicycle operator performs the shared bicycle dispatch operation after receiving the dispatch message for each parking spot. The response time is used to represent the average time consumed by the shared bicycle operator for dispatching the shared bicycles in each parking spot. Determine the corresponding responsiveness of the shared bicycle operator according to the response rate and / or the response duration; According to the corresponding responsiveness of each shared bicycle operator, the shared bicycle deployment quantity corresponding to each shared bicycle operator is determined, and the shared bicycle deployment quantity corresponding to each shared bicycle operator is sent to the regulator, so that the regulator can plan the shared bicycle deployment of each shared bicycle operator according to the shared bicycle deployment quantity.

10. A dispatching device for a shared bicycle, comprising: A response module, configured to query a shared bicycle storage record of the target parking point from a preset blockchain in response to determining that the target parking point meets a preset scheduling start condition, wherein the blockchain stores the shared bicycle storage record of each parking point; A determination module, configured to determine the number of shared bicycles parked at the target parking point in the current period according to the shared bicycle storage record of the target parking point obtained; a scheduling module, for generating a scheduling message for the target parking point if it is determined that the number of shared bicycles parked exceeds the determined shared bicycle parking threshold corresponding to the target parking point, and sending the message to at least one shared bicycle operator corresponding to the shared bicycles parked at the target parking point, so that the at least one shared bicycle operator schedules the shared bicycles parked at the target parking point according to the scheduling message; The scheduling module is also used to: determine the corresponding responsiveness of each shared bicycle operator, and determine the corresponding shared bicycle deployment quantity of each shared bicycle operator according to the corresponding responsiveness of each shared bicycle operator, so as to plan the shared bicycle deployment of each shared bicycle operator according to the corresponding responsiveness of each shared bicycle operator; the responsiveness is determined according to the proportion of parking spots where the shared bicycle operator performs shared bicycle scheduling operations, and / or the average time consumed by the shared bicycle operator to schedule shared bicycles in each parking spot.

11. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the method according to any one of claims 1 to 9.

12. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method according to any one of claims 1 to 9 when executing the program.

Images