A method, medium and device for positioning and dispatching shared bicycles

Abstract

The present invention relates to the field of electronic map technology, and in particular to a method for positioning and deploying shared bicycles. The method provided by the present invention grids the grid map of the shared bicycle deployment area, determines whether the shared bicycle is correctly parked, and generates a heat map of the number of shared bicycles in the grid map of the shared bicycle deployment area, and deploys the shared bicycles according to the heat map to achieve a supply-demand balance state. The method provided by the present invention can quickly draw the effective parking area and prohibited parking area of ​​the shared bicycle; and provide data visualization, and timely provide vehicle dispatching information to operation and maintenance personnel.

Description

Technical Field

[0001] The present invention relates to the field of grid map technology, and in particular to a method, medium and device for positioning and allocating shared bicycles. Background Art

[0002] The emergence of shared bicycles has facilitated people's travel, conformed to the concept of green travel, and promoted social progress to a certain extent. As major cities increase the number of shared bicycles, a series of problems such as parking and safety of shared bicycles have arisen in the operation of shared bicycles, making the requirements for operation and maintenance management more stringent. This has led to the fact that it has become a top priority for operation and maintenance managers and companies to understand the situation of parking areas and prohibited parking areas in the first place and to implement remote command and dispatch in a timely manner.

[0003] At present, the commonly used technical solution to the shared bicycle parking problem is to use the user's mobile terminal positioning and the shared bicycle positioning (such as the disclosed Chinese patent CN107274663A "Shared bicycle positioning system and shared bicycle positioning method") to transmit information through the user's mobile terminal and the shared bicycle lock, and send the location information to the server in real time.

[0004] However, the current technical problems with shared bicycles are that, on the one hand, when users park their bicycles, even if they park them in the designated area, various factors (such as device positioning offset, network fluctuations, different operators, and mismatched parking areas) can cause system positioning errors. On the other hand, as the number of bicycles continues to increase, there is a phenomenon of "more bicycles than people", causing the order of placement to become increasingly chaotic. An efficient and effective allocation and processing method is urgently needed. Summary of the invention

[0005] In order to solve the above-mentioned deficiencies in the prior art, the present invention provides a method for positioning and deploying a shared bicycle, comprising the following steps:

[0006] S10: Gridding and encoding the area where shared bicycles are deployed to obtain a grid map of the area where shared bicycles are deployed;

[0007] S20: superimposing the shared bicycle deployment area grid map and the remote sensing image according to the grid division service, drawing the shared bicycle parking location, and generating a location division grid set, wherein the grid size in the location division grid set is consistent with the grid size of the shared bicycle deployment area grid map;

[0008] S30: When the shared bicycle is parked, the longitude and latitude and grid code conversion technology is used to locate and generate a grid code of the location of the shared bicycle;

[0009] S40: determining the positional relationship between the location grid of the shared bicycle and the grids in the location division grid set according to the location grid code of the shared bicycle parking position, and if the setting requirements are met, determining that the shared bicycle is parked correctly;

[0010] S50: Gridding all shared bicycles within the grid map of the shared bicycle deployment area according to the unique identifier of each shared bicycle, obtaining the location grid and code of each shared bicycle, and establishing a shared bicycle index information table;

[0011] S60: generating a heat map of the number of shared bicycles in the shared bicycle deployment location grid map according to the shared bicycle index information table, and deploying the shared bicycles according to the heat map to achieve a supply-demand balance.

[0012] Furthermore, in step S10, the earth division and grid coding technology based on the Beidou grid location code is used to grid divide and encode the area where shared bicycles are deployed to obtain a grid map of the shared bicycle deployment area.

[0013] Furthermore, the grid code of the shared bicycle location described in step S30 is in the form of converting the longitude and latitude of the shared bicycle into a grid code, that is, utilizing the uniqueness of the grid code to convert the longitude and latitude into a grid code, and the grid code adopts binary code, and uses binary bit operations to reversely infer the longitude and latitude.

[0014] Furthermore, step S20 further includes:

[0015] Constructing a location status information index table for each drawn location division grid set;

[0016] The status information index table includes a shared bicycle parking area identification code ID, a location grid parking status m, a number of shared bicycles n, and a location grid code c.

[0017] Furthermore, step S20 further includes:

[0018] Construct a status information index table for each shared bicycle's corresponding location grid;

[0019] The status information index table includes a shared bicycle identification code ID, a shared bicycle working status m, and a location grid code c.

[0020] Further, step S40 meets the setting requirements including:

[0021] If the shared bicycle location grid is c0; the location division grid set is B 1 ; Location division location grid set B 1 ={c n |n=1…N}, N is the number of grids within the location division grid range, cn For the Nth parking location grid, then determine B 1 Is there a grid of c0 in the ? If so, and the grid meets the set conditions, it is judged to be parked correctly;

[0022] For the nth monitoring location grid c in the location grid set, n , and the shared bicycle location grid c0, if the following conditions are met at the same time, then the shared bicycle location grid is the correct parking grid:

[0023] Condition 1: equal(c n , c0) is true; where equal (c n , c0) represents c n Equal to c0, that is, satisfying c n The encoding of is equal to the encoding of c0;

[0024] Condition 2: c n The parking status of is parkable;

[0025] Condition 3: c n The number of shared bicycles n is less than the set value.

[0026] Furthermore, step S60 includes: for the location division grid, querying the number of shared bicycles in the location division grid, establishing multiple parking congestion levels, setting different level states respectively, and the thresholds set for different level states are the range of the number of shared bicycles parked.

[0027] The present invention also provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer instructions, and when the computer is executed by a processor, a shared bicycle positioning and deployment processing method as described in any of the above is implemented.

[0028] The present invention also provides a computer device, comprising at least one processor and a memory communicatively connected to the processor, wherein the memory stores instructions executable by at least one processor, and the instructions are executed by at least one processor so that the processor executes a shared bicycle positioning and deployment processing method as described in any of the foregoing.

[0029] The method provided by the present invention determines the correct parking of shared bicycles by gridding the grid map of the shared bicycle deployment area, and generates a heat map of the number of shared bicycles in the grid map of the shared bicycle deployment area, and allocates shared bicycles according to the heat map to achieve a supply-demand balance state. The method provided by the present invention can quickly draw the effective parking areas and prohibited parking areas of shared bicycles; and provide data visualization, and timely provide vehicle dispatch information for operation and maintenance personnel.

[0030] Other features and beneficial effects of the present invention will be described in the following description, and partly become apparent from the description, or understood by practicing the present invention. The purpose and other beneficial effects of the present invention can be realized and obtained by the structures particularly pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. The positional relationships described in the drawings in the following description are based on the directions in which the components are drawn in the diagrams, unless otherwise specified.

[0032] Figure 1 The present invention provides a flow chart of a method for positioning and deploying shared bicycles. DETAILED DESCRIPTION

[0033] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all the embodiments; the technical features designed in different implementation modes of the present invention described below can be combined with each other as long as they do not conflict with each other; based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0034] The terms used herein are only for describing specific embodiments and are not intended to limit exemplary embodiments. Unless the context clearly indicates otherwise, the singular forms "one", "one" and "item" used herein are also intended to include plural numbers. It should also be understood that the terms "include" and / or "comprise" used herein specify the existence of stated features, integers, steps, operations, units and / or components, without excluding the existence or addition of one or more other features, integers, steps, operations, units, components and / or combinations thereof.

[0035] like Figure 1 As shown, an embodiment of the present invention provides a method for positioning and dispatching a shared bicycle, comprising the following steps:

[0036] S10: Gridding and encoding the area where shared bicycles are deployed to obtain a grid map of the area where shared bicycles are deployed;

[0037] In the specific implementation, in step S10, the earth division and grid coding technology based on the Beidou grid location code is used to grid divide and encode the area where shared bicycles are deployed to obtain a grid map of the shared bicycle deployment area.

[0038] S20: superimposing the shared bicycle deployment area grid map and the remote sensing image according to the grid division service, drawing the shared bicycle parking location, and generating a location division grid set, wherein the grid size in the location division grid set is consistent with the grid size of the shared bicycle deployment area grid map;

[0039] In specific implementation, step S20 also includes:

[0040] Constructing a location status information index table for each drawn location division grid set;

[0041] The status information index table includes a shared bicycle parking area identification code ID, a location grid parking status m, a number of shared bicycles n, and a location grid code c.

[0042] In specific implementation, step S20 also includes:

[0043] Construct a status information index table for each shared bicycle's corresponding location grid;

[0044] The status information index table includes a shared bicycle identification code ID, a shared bicycle working status m, and a location grid code c.

[0045] S30: When the shared bicycle is parked, the longitude and latitude and grid code conversion technology is used to locate and generate a grid code of the location of the shared bicycle;

[0046] In specific implementation, the grid code of the shared bicycle location described in step S30 is in the form of converting the longitude and latitude of the shared bicycle into a grid code, that is, utilizing the uniqueness of the grid code to convert the longitude and latitude into a grid code, and the grid code adopts binary code, and uses binary bit operations to reversely infer the longitude and latitude.

[0047] S40: determining the positional relationship between the location grid of the shared bicycle and the grids in the location division grid set according to the location grid code of the shared bicycle parking position, and if the setting requirements are met, determining that the shared bicycle is parked correctly;

[0048] In specific implementation, step S40 meets the setting requirements including:

[0049] If the shared bicycle location grid is c0; the location division grid set is B 1 ; Location division location grid set B 1 ={c n |n=1…N}, N is the number of grids within the location division grid range, cn For the Nth parking location grid, then determine B 1 Is there a grid of c0 in the ? If so, and the grid meets the set conditions, it is judged to be parked correctly;

[0050] For the nth monitoring location grid c in the location grid set, n , and the shared bicycle location grid c0, if the following conditions are met at the same time, then the shared bicycle location grid is the correct parking grid:

[0051] Condition 1: equal(c n , c0) is true; where equal (c n , c0) represents c n Equal to c0, that is, satisfying c n The encoding of is equal to the encoding of c0;

[0052] Condition 2: c n The parking status of is parkable;

[0053] Condition 3: c n The number of shared bicycles n is less than the set value.

[0054] S50: According to the unique identification of each shared bicycle, all shared bicycles within the range of the shared bicycle deployment area grid map are gridded to obtain the location grid and code of each shared bicycle, and establish a shared bicycle index information table; for example, the shared bicycle location grid size is 8-level grid, which is about 1 meter.

[0055] S60: generating a heat map of the number of shared bicycles in the shared bicycle deployment location grid map according to the shared bicycle index information table, and deploying the shared bicycles according to the heat map to achieve a supply-demand balance.

[0056] In specific implementation, step S60 includes: for the location division grid, querying the number of shared bicycles in the location division grid, establishing multiple parking congestion levels, setting different level states respectively, and setting the thresholds of different level states as the range of the number of shared bicycles parked. For example, for the location division grid, querying the number of shared bicycles in the location division grid, establishing three parking congestion levels, namely, free, general, and crowded, and setting the thresholds as the number of shared bicycles parked is 0, 1 to 3, and 4 to 5.

[0057] The method provided by the present invention uses Beidou grid to establish an index information table, which provides timely data support for operation and maintenance personnel, so that they can promptly increase the configuration of vehicles and dispatch personnel, and remove illegally parked vehicles in a timely manner. By gridding the grid map of the shared bicycle deployment area, it is determined whether the shared bicycle is correctly parked, and a heat map of the number of shared bicycles in the shared bicycle deployment area grid map is generated, and the shared bicycles are deployed according to the heat map to achieve a supply and demand balance. The method provided by the present invention can quickly draw effective parking areas and prohibited parking areas for shared bicycles; and provide data visualization, and provide vehicle dispatch information to operation and maintenance personnel in a timely manner.

[0058] An embodiment of the present invention also provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer instructions, and when the computer is executed by a processor, a shared bicycle positioning and deployment processing method as described in any of the above is implemented.

[0059] An embodiment of the present invention also provides a computer device, comprising at least one processor and a memory communicatively connected to the processor, wherein the memory stores instructions executable by at least one processor, and the instructions are executed by at least one processor so that the processor executes a shared bicycle positioning and deployment processing method as described in any of the foregoing.

[0060] In addition, those skilled in the art should understand that, although there are many problems in the prior art, each embodiment or technical solution of the present invention can be improved in only one or several aspects, without having to solve all the technical problems listed in the prior art or background technology at the same time. Those skilled in the art should understand that the content not mentioned in a claim should not be used as a limitation on the claim.

[0061] Although some terms are used more frequently in this article, the possibility of using other terms is not excluded. These terms are used only to more conveniently describe and explain the essence of the present invention; interpreting them as any additional restrictions is contrary to the spirit of the present invention.

[0062] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein with equivalents. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for positioning and deploying shared bicycles, characterized in that: The following steps are involved: S10: Gridding and encoding the area where shared bicycles are deployed to obtain a grid map of the area where shared bicycles are deployed; S20: superimposing the shared bicycle deployment area grid map and the remote sensing image according to the grid division service, drawing the shared bicycle parking location, and generating a location division grid set, wherein the grid size in the location division grid set is consistent with the grid size of the shared bicycle deployment area grid map; S30: When the shared bicycle is parked, the longitude and latitude and grid code conversion technology is used to locate and generate a grid code of the location of the shared bicycle; S40: determining the positional relationship between the location grid of the shared bicycle and the grids in the location division grid set according to the location grid code of the shared bicycle parking position, and if the setting requirements are met, determining that the shared bicycle is parked correctly; S50: Gridding all shared bicycles within the grid map of the shared bicycle deployment area according to the unique identifier of each shared bicycle, obtaining the location grid and code of each shared bicycle, and establishing a shared bicycle index information table; S60: generating a heat map of the number of shared bicycles in the shared bicycle deployment location grid map according to the shared bicycle index information table, and deploying the shared bicycles according to the heat map to achieve a supply-demand balance state; Step S20 also includes: Constructing a location status information index table for each drawn location division grid set; The state information index table includes a shared bicycle parking area identification code ID, a location grid parking state m, a number of shared bicycles n, and a location grid code c; Construct a status information index table for each shared bicycle's corresponding location grid; The state information index table includes a shared bicycle identification code ID, a shared bicycle working state m, and a location grid code c; Step S40 meets the setting requirements including: If the shared bicycle location grid is c0; the location division grid set is B 1 ; Location division location grid set B 1 ={c n |n=1…N}, N is the number of grids within the location division grid range, c n For the Nth parking location grid, then determine B 1 Is there a grid of c0 in the ? If so, and the grid meets the set conditions, it is judged to be parked correctly; For the nth monitoring location grid c in the location grid set, n , and the shared bicycle location grid c0, if the following conditions are met at the same time, then the shared bicycle location grid is the correct parking grid: Condition 1: equal(c n , c0) is true; where equal (c n , c0) represents c n Equal to c0, that is, satisfying c n The encoding of is equal to the encoding of c0; Condition 2: c n The parking status of is parkable; Condition 3: c n The number of shared bicycles n is less than the set value.

2. A shared bicycle positioning and deployment processing method according to claim 1, characterized in that: In step S10, the earth division and grid coding technology based on the Beidou grid location code is used to grid and code the area where shared bicycles are deployed to obtain a grid map of the shared bicycle deployment area.

3. A shared bicycle positioning and deployment processing method according to claim 1, characterized in that: The grid code of the shared bicycle location described in step S30 is in the form of converting the longitude and latitude of the shared bicycle into a grid code, that is, utilizing the uniqueness of the grid code to convert the longitude and latitude into a grid code, wherein the grid code adopts binary code and uses binary bit operations to infer the longitude and latitude.

4. A shared bicycle positioning and deployment processing method according to claim 1, characterized in that: Step S60 includes: for the location division grid, querying the number of shared bicycles in the location division grid, establishing multiple parking congestion levels, setting different level states respectively, and the thresholds set for different level states are the range of the number of shared bicycles parked.

5. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and when the computer is executed by a processor, it implements a shared bicycle positioning and deployment processing method as described in any one of claims 1-4.

6. A computer device, characterized in that: It includes at least one processor and a memory that is communicatively connected to the processor, wherein the memory stores instructions that can be executed by at least one processor, and the instructions are executed by at least one processor so that the processor executes a shared bicycle positioning and deployment processing method as described in any one of claims 1-4.

Images