CN113869652A - Shared bicycle returning planning method, device, equipment and storage medium - Google Patents
Shared bicycle returning planning method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN113869652A CN113869652A CN202111023743.7A CN202111023743A CN113869652A CN 113869652 A CN113869652 A CN 113869652A CN 202111023743 A CN202111023743 A CN 202111023743A CN 113869652 A CN113869652 A CN 113869652A
- Authority
- CN
- China
- Prior art keywords
- returning
- car
- alternative
- user
- area
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000012216 screening Methods 0.000 claims abstract description 55
- 238000012795 verification Methods 0.000 claims description 9
- 238000012545 processing Methods 0.000 claims description 8
- 238000012163 sequencing technique Methods 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 5
- 238000013507 mapping Methods 0.000 description 2
- 230000006399 behavior Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0637—Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0645—Rental transactions; Leasing transactions
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07F—COIN-FREED OR LIKE APPARATUS
- G07F17/00—Coin-freed apparatus for hiring articles; Coin-freed facilities or services
- G07F17/0042—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for hiring of objects
- G07F17/0057—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for hiring of objects for the hiring or rent of vehicles, e.g. cars, bicycles or wheelchairs
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Educational Administration (AREA)
- Finance (AREA)
- Navigation (AREA)
Abstract
The invention relates to the technical field of shared bicycles, and discloses a shared bicycle returning planning method, a device, equipment and a storage medium, wherein the method comprises the following steps: when a driving destination input by a user is not received, acquiring the current position of a shared bicycle taken by the user, and determining an alternative returning point according to the current position; when a vehicle returning request sent by a user is detected, screening an optimal vehicle returning point from the alternative vehicle returning points according to a preset screening rule; and planning a car returning route based on the current position and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route. Compared with the inconvenience caused by the fact that a user needs to return the vehicle according to the preset parking range in the prior art, the vehicle returning planning method and the vehicle returning planning device realize vehicle returning planning in advance according to the current position of the user through the steps, and send corresponding prompt information in real time based on the planned vehicle returning route so that the user can return the shared vehicle to the optimal vehicle returning point quickly, and the vehicle returning efficiency and the vehicle returning experience of the user are improved.
Description
Technical Field
The invention relates to the technical field of shared bicycles, in particular to a shared bicycle returning planning method, device, equipment and storage medium.
Background
Along with the popularization of shared bicycles, more and more users choose to go out through the shared bicycle, but in the prior art, a lot of inconvenience still exists when the users return the bicycles, and whether the returning behavior meets the returning requirement is judged by judging whether the shared bicycle returned by the users is in the preset parking range or not in most of the prior art, and if the returning requirement is not met, the returning fails. Therefore, how to perform the returning planning in advance when returning the shared bicycle to improve the returning experience of the user becomes a problem to be solved urgently.
The above is only for the purpose of assisting understanding of the technical aspects of the present invention, and does not represent an admission that the above is prior art.
Disclosure of Invention
The invention mainly aims to provide a shared bicycle returning planning method, a device, equipment and a storage medium, and aims to solve the technical problem of how to carry out the returning planning in advance when returning a shared bicycle so as to improve the returning experience of a user.
In order to achieve the purpose, the invention provides a sharing bicycle returning planning method, which comprises the following steps:
judging whether a driving destination input by a user is received;
when the driving destination input by the user is not received, the current position of the shared bicycle taken by the user is obtained, and an alternative returning point is determined according to the current position;
when a car returning request sent by the user is detected, screening an optimal car returning point from the alternative car returning points according to a preset screening rule;
and planning a car returning route based on the current position and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route.
Optionally, the step of obtaining the current position of the shared bicycle taken by the user when the driving destination input by the user is not received, and determining an alternative returning point according to the current position includes:
when the driving destination input by the user is not received, acquiring the current position of the shared bicycle taken by the user;
determining a first target car returning area according to the current position;
carrying out area division on the first target returning area to obtain a first area division result;
and taking all the returning points of the returning areas in the first area division result as alternative returning points.
Optionally, when the car returning request sent by the user is detected, the step of screening an optimal car returning point from the alternative car returning points according to a preset screening rule includes:
when a car returning request sent by the user is detected, the driving distance from the current position to each alternative car returning point is obtained;
sequencing the travelling distances to obtain a distance sequencing result;
and screening out the optimal returning points from the alternative returning points according to the distance sorting result.
Optionally, the step of planning a car returning route based on the current position and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route includes:
planning a car returning route based on the current position and the optimal car returning point;
acquiring the driving distance between the current position and the optimal returning point;
when the driving distance is greater than or equal to a preset driving distance, sending a type of vehicle returning prompt message according to the vehicle returning route;
and when the driving distance is smaller than the preset driving distance, sending secondary vehicle returning prompt information according to the optimal vehicle returning point.
Optionally, after the step of determining whether the driving destination input by the user is received, the method further includes:
when the driving destination input by the user is received, determining an alternative vehicle returning area according to the driving destination;
carrying out preset parking check processing on the alternative car returning area to obtain a parking check result;
and screening out alternative vehicle returning points from the alternative vehicle returning area according to the parking verification result.
Optionally, the step of performing preset parking check processing on the alternative car returning area to obtain a parking check result includes:
obtaining the area, the parking coverage rate, the parking density and the parking flow rate of the parking area of the alternative car returning area;
determining a parking check value of the alternative car returning area according to the area of the parking area, the parking coverage rate, the parking intensity and the parking flow rate;
correspondingly, the step of screening the alternative car returning points from the alternative car returning area according to the parking verification result comprises the following steps:
and screening a target car returning region from the alternative car returning region according to the parking check value, and screening an alternative car returning point from the target car returning region.
Optionally, the step of screening out a target car returning area from the alternative car returning area according to the parking check value, and screening out an alternative car returning point from the target car returning area includes:
sequencing the parking check values to obtain a check value sequencing result;
screening a second target car returning area from the alternative car returning areas according to the checking value sorting result;
carrying out region division on the second target returning region to obtain a second region division result;
and taking all the returning points of the returning areas in the second area division result as alternative returning points.
In addition, in order to achieve the above object, the present invention further provides a shared bicycle returning planning apparatus, including:
the condition judgment module is used for judging whether a driving destination input by a user is received or not;
the alternative determining module is used for acquiring the current position of the shared bicycle taken by the user when the driving destination input by the user is not received, and determining an alternative returning point according to the current position;
the optimal determination module is used for screening optimal car returning points from the alternative car returning points according to a preset screening rule when a car returning request sent by the user is detected;
and the vehicle returning planning module is used for planning a vehicle returning route based on the current position and the optimal vehicle returning point and sending a corresponding vehicle returning prompt message according to the vehicle returning route.
In addition, in order to achieve the above object, the present invention further provides a shared bicycle returning planning apparatus, including: the shared bicycle returning planning program is configured to implement the steps of the shared bicycle returning planning method.
In addition, in order to achieve the above object, the present invention further provides a storage medium, where a shared bicycle returning planning program is stored, and when the shared bicycle returning planning program is executed by a processor, the steps of the shared bicycle returning planning method described above are implemented.
In the invention, whether a driving destination input by a user is received or not is judged; when the driving destination input by the user is not received, the current position of the shared bicycle taken by the user is obtained, and an alternative returning point is determined according to the current position; when a car returning request sent by the user is detected, screening an optimal car returning point from the alternative car returning points according to a preset screening rule; and planning a car returning route based on the current position and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route. Compared with the inconvenience caused by the fact that the user needs to return the vehicle according to the preset parking range in the prior art, when the driving destination input by the user is not received, obtaining the current position of the shared bicycle taken by the user, determining an alternative returning point according to the current position, when a car returning request sent by the user is detected, screening an optimal car returning point from the alternative car returning points according to a preset screening rule, planning a car returning route based on the current position and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route, the method and the device have the advantages that the vehicle returning planning is carried out in advance according to the current position of the user, the corresponding prompt information is sent in real time based on the planned vehicle returning route, so that the user can conveniently and quickly return the shared vehicle to the optimal vehicle returning point, and the vehicle returning efficiency and the vehicle returning experience of the user are improved.
Drawings
FIG. 1 is a schematic structural diagram of a shared bicycle returning planning device of a hardware operating environment according to an embodiment of the present invention;
FIG. 2 is a schematic flow chart illustrating a shared bicycle returning planning method according to a first embodiment of the present invention;
fig. 3 is a schematic diagram of region division related to the first embodiment of the shared bicycle returning planning method of the present invention;
FIG. 4 is a schematic flow chart illustrating a shared bicycle returning planning method according to a second embodiment of the present invention;
FIG. 5 is a schematic view of region screening according to a second embodiment of the shared bicycle returning planning method of the present invention;
fig. 6 is a block diagram of a shared bicycle returning planning apparatus according to a first embodiment of the present invention.
The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Referring to fig. 1, fig. 1 is a schematic structural diagram of a shared bicycle returning planning device in a hardware operating environment according to an embodiment of the present invention.
As shown in fig. 1, the shared bicycle returning planning apparatus may include: a processor 1001, such as a Central Processing Unit (CPU), a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. Wherein a communication bus 1002 is used to enable connective communication between these components. The user interface 1003 may include a Display screen (Display), an input unit such as a Keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a WIreless interface (e.g., a WIreless-FIdelity (WI-FI) interface). The Memory 1005 may be a Random Access Memory (RAM) Memory, or may be a Non-Volatile Memory (NVM), such as a disk Memory. The memory 1005 may alternatively be a storage device separate from the processor 1001.
Those skilled in the art will appreciate that the configuration shown in fig. 1 does not constitute a limitation of the shared bicycle return planning apparatus and may include more or fewer components than those shown, or some components in combination, or a different arrangement of components.
As shown in fig. 1, the memory 1005, which is a storage medium, may include therein an operating system, a data storage module, a network communication module, a user interface module, and a shared bicycle return planning program.
In the shared bicycle returning planning apparatus shown in fig. 1, the network interface 1004 is mainly used for data communication with the network server; the user interface 1003 is mainly used for data interaction with a user; the processor 1001 and the memory 1005 of the shared bicycle returning planning device may be arranged in the shared bicycle returning planning device, and the shared bicycle returning planning device calls the shared bicycle returning planning program stored in the memory 1005 through the processor 1001 and executes the shared bicycle returning planning method provided by the embodiment of the present invention.
An embodiment of the invention provides a shared bicycle returning planning method, and referring to fig. 2, fig. 2 is a schematic flow diagram of a first embodiment of the shared bicycle returning planning method.
In this embodiment, the shared bicycle returning planning method includes the following steps:
step S10: judging whether a driving destination input by a user is received;
step S20: when the driving destination input by the user is not received, the current position of the shared bicycle taken by the user is obtained, and an alternative returning point is determined according to the current position;
it is easy to understand that, the execution subject of this embodiment is the shared bicycle returning planning apparatus, where the driving destination, that is, the destination of the current trip input by the user, may obtain the current position of the shared bicycle taken by the user when the driving destination input by the user is not received, and determine the first target returning area according to the current position, in a specific implementation, a returning area with the closest driving distance in a preset range may be determined according to the current position of the shared bicycle taken by the user, and then, it is determined whether there is a vacant area in the returning area with the closest driving distance, and when there is the vacant area, the returning area with the closest driving distance is taken as the first target returning area; and when the vacant area does not exist, acquiring a returning area which is close to the second distance in the traveling range, then judging whether the returning area which is close to the second distance exists in the traveling range, taking the returning area which is close to the second distance as a first target returning area when the vacant area exists, and so on until the returning area with the vacant area is found, and taking the returning area with the vacant area as the first target returning area. The preset range may be set according to an actual requirement, for example, 100 meters, which is not limited in this embodiment.
Referring to fig. 3, fig. 3 is a schematic diagram of region division related to the first embodiment of the shared bicycle returning planning method of the present invention.
In fig. 3, the current position of the user is X, the first target returning area which is closest to the driving distance of the user (which may be understood as being closest to the center of the area, as in fig. 3, the driving distance is M) and has a vacant area is M, it is easily understood that in a specific implementation, the driving distance is not necessarily a straight-line distance, and may be calculated according to an actual road plan, and the driving distance is set as M in fig. 3 for convenience of illustration.
Further, the first target car returning area is subjected to area division to obtain a first area division result, in fig. 3, a shaded portion may be understood as a car non-returning area, and a non-shaded portion may be understood as a car returning area. The car returning points can be determined according to the area of the car returning area and the floor area of the shared bicycle taken by the user, and can also be determined by combining the actual car returning point distribution situation of the car returning area, which is not limited in this embodiment.
Step S30: when a car returning request sent by the user is detected, screening an optimal car returning point from the alternative car returning points according to a preset screening rule;
in specific implementation, whether a car returning request sent by the user is detected or not can be monitored in real time, and when the car returning request sent by the user is detected, the optimal car returning point is screened from the alternative car returning points according to a preset screening rule. When a vehicle returning request sent by the user is detected, the driving distances from the current position to the alternative vehicle returning points can be obtained, then the driving distances are sorted to obtain distance sorting results, and the optimal vehicle returning point is screened out from the alternative vehicle returning points according to the distance sorting results. For example, the driving distances may be sorted from small to large to obtain distance sorting results, and then, the alternative returning point sorted first in the distance sorting results may be selected as the optimal returning point, that is, the alternative returning point with the shortest driving distance is used as the optimal returning point. In a specific implementation, the actual distribution of the alternative returning points of the returning area can be combined for determination, for example, if it is detected that the optimal returning point is surrounded by the non-returning area, that is, the optimal returning point is located in a circle surrounded by the closed non-returning area, or the optimal returning point is surrounded by the vehicle, if the point is selected for returning, the driving obstacles are too many, it is difficult to plan a driving route reaching the optimal driving point, and it takes too much time to return the vehicle, therefore, the optimal returning point can be abandoned, and the alternative returning point ranked the second in the distance ranking result is used as the optimal returning point.
Step S40: and planning a car returning route based on the current position and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route.
It is easy to understand that after an optimal returning point is obtained, a returning route can be planned based on the current position and the optimal returning point in combination with actual road conditions, and a driving distance between the current position and the optimal returning point is obtained, when the driving distance is greater than or equal to a preset driving distance, a type of returning prompt information can be sent according to the returning route, the type of returning prompt information can be understood as navigation prompt information for guiding the user to drive to the vicinity of the optimal returning point, such as ' 10 m driving along the current road ', ' 5 m turn right after ' and the like, when the driving distance is less than the preset driving distance, a type of returning prompt information can be sent according to the optimal returning point, the type of returning information can be understood as search type indication information for guiding the user to find the optimal returning point, such as ' on the left "to the right", "near", "far", etc. The preset driving distance may be set according to actual requirements, such as 15 meters and 25 meters, which is not limited in this embodiment.
In the embodiment, whether a driving destination input by a user is received is judged; when the driving destination input by the user is not received, the current position of the shared bicycle taken by the user is obtained, and an alternative returning point is determined according to the current position; when a car returning request sent by the user is detected, screening an optimal car returning point from the alternative car returning points according to a preset screening rule; and planning a car returning route based on the current position and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route. Compared with the inconvenience of the prior art that the user needs to return the car according to the preset parking range by himself/herself, in the embodiment, when the driving destination input by the user is not received, obtaining the current position of the shared bicycle taken by the user, determining an alternative returning point according to the current position, when a car returning request sent by the user is detected, screening an optimal car returning point from the alternative car returning points according to a preset screening rule, planning a car returning route based on the current position and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route, the method and the device have the advantages that the vehicle returning planning is carried out in advance according to the current position of the user, the corresponding prompt information is sent in real time based on the planned vehicle returning route, so that the user can conveniently and quickly return the shared vehicle to the optimal vehicle returning point, and the vehicle returning efficiency and the vehicle returning experience of the user are improved.
Referring to fig. 4, fig. 4 is a schematic flow chart of a shared bicycle returning planning method according to a second embodiment of the present invention.
Based on the first embodiment, in this embodiment, after the step S10, the method further includes:
step S201: when the driving destination input by the user is received, determining an alternative vehicle returning area according to the driving destination;
it is easy to understand that, when the driving destination input by the user is received, an alternative car returning area may be determined according to the driving destination, in a specific implementation, all car returning areas planned within a preset range of the driving destination may be used as alternative car returning areas, where the preset range may be set according to an actual requirement, for example, 100 meters, and this embodiment is not limited thereto.
Referring to fig. 5, fig. 5 is a schematic view of region screening related to a second embodiment of the shared bicycle returning planning method of the present invention.
In fig. 5, the driving destination input by the user is P, and all the planned returning areas within the preset range of the driving destination P are a, B, C, D, and E, that is, the returning areas a, B, C, D, and E can be used as alternative returning areas.
In a specific implementation, in addition to determining the alternative car returning area based on the preset range, the alternative car returning area may also be determined based on a driving distance from a central point of the car returning area to the destination, for example, it is determined whether driving distances from all car returning areas planned within the preset range of the driving destination to the destination are smaller than a preset car returning distance, and the car returning area with the driving distance smaller than the preset car returning distance is used as the alternative car returning area, where the preset car returning distance may be set according to an actual requirement, for example, 75 meters, which is not limited in this embodiment. If the distance a from the driving destination P to the returning area A, the distance B from the driving destination P to the returning area B, the distance C from the driving destination P to the returning area C, the distance D from the driving destination P to the returning area D and the distance E from the driving destination P to the returning area E are all smaller than the preset returning distance, the returning areas A, B, C, D and E can be used as the alternative returning areas. It is easy to understand that in a specific implementation, the driving distance is not necessarily a straight distance, and may be calculated according to an actual road plan, in fig. 5, the distance from the driving destination P to the vehicle returning area a is set to be a, the distance from the driving destination P to the vehicle returning area B is set to be B, the distance from the driving destination P to the vehicle returning area C is set to be C, the distance from the driving destination P to the vehicle returning area D is set to be D, and the distance from the driving destination P to the vehicle returning area E is set to be E, which are convenient for illustration.
Step S202: carrying out preset parking check processing on the alternative car returning area to obtain a parking check result;
it should be noted that after the alternative car returning region is determined, the parking region area, the parking coverage, the parking intensity and the parking flow rate of the alternative car returning region may be obtained, and then the parking verification value of the alternative car returning region is determined according to the parking region area, the parking coverage, the parking intensity and the parking flow rate, where the parking region area is an area of a parked car in the alternative car returning region; the parking coverage rate is the ratio of the area of the parking area divided by the total area of the alternative vehicle returning area; the parking density, i.e., the density between parked vehicles in the alternative parking area, may be determined based on the number of parked vehicles per unit area; the parking flow rate can be used for reflecting the fluctuation condition of the parking number of the alternative car returning area, can be obtained based on the vehicle introduction number and the vehicle outflow number, and can be adjusted by listing environmental factors such as time intervals, weather and the like in specific implementation.
Further, a first check value corresponding to the parking area of the alternative car returning area, a second check value corresponding to the parking coverage of the alternative car returning area, a third check value corresponding to the parking intensity of the alternative car returning area, and a fourth check value corresponding to the parking flow rate of the alternative car returning area can be searched through a preset relationship mapping table, wherein the preset relationship mapping table stores the first check value corresponding to the parking area of different sections, the second check value corresponding to the parking coverage of different sections, the third check value corresponding to the parking intensity of different sections, and the fourth check value corresponding to the parking flow rate of different sections, and then obtains the weight corresponding to the first check value, the weight corresponding to the second check value, the weight corresponding to the third check value, and the weight corresponding to the fourth check value, then, determining a parking check value of the alternative car returning area according to the first check value and the corresponding weight thereof, the second check value and the corresponding weight thereof, the third check value and the corresponding weight thereof, and the fourth check value and the corresponding weight thereof, for example, the first check value is n1Its corresponding weight is 0.2; second check value n2Its corresponding weight is 0.3; the third check value is n3Its corresponding weight is 0.3 and the fourth check value is n4And the corresponding weight is 0.2, the parking check value of the alternative car returning area is 0.2n1+0.3n2+0.3n3+0.2n4。
Step S203: and screening out alternative vehicle returning points from the alternative vehicle returning area according to the parking verification result.
It is easy to understand that after the parking check value is obtained, a target car returning area can be screened from the alternative car returning area according to the parking check value, and an alternative car returning point can be screened from the target car returning area. In a specific implementation, the parking check values may be sorted to obtain a check value sorting result, a second target returning area is screened from the alternative returning areas according to the check value sorting result, for example, the parking check values may be sorted from small to large to obtain a check value sorting result, then, the alternative returning area sorted first in the check value sorting result may be selected as the second target returning area, and the selection is performed based on the large area of the parking area, the low parking coverage, the low parking density, and the high parking flow rate, and the specific selection rule is not limited in this embodiment. And then, carrying out area division on the second target car returning area to obtain a second area division result, and taking all car returning points of the car returning area in the second area division result as alternative car returning points. In specific implementation, the division can be performed according to the actual parking situation of the second target car returning area, and all car returning points in the car returning area in the second area division result are used as alternative car returning points. The car returning points can be determined according to the area of the car returning area and the floor area of the shared bicycle taken by the user, and can also be determined by combining the actual car returning point distribution situation of the car returning area, which is not limited in this embodiment.
Further, when a vehicle returning request sent by the user is detected, the driving distances from the current position of the shared vehicle taken by the user to the alternative vehicle returning points can be obtained, then the driving distances are sorted to obtain distance sorting results, and the optimal vehicle returning point is screened out from the alternative vehicle returning points according to the distance sorting results. For example, the driving distances may be sorted from small to large to obtain distance sorting results, and then, the alternative returning point sorted first in the distance sorting results may be selected as the optimal returning point, that is, the alternative returning point with the shortest driving distance is used as the optimal returning point. In a specific implementation, the actual distribution of the alternative returning points of the returning area can be combined for determination, for example, if it is detected that the optimal returning point is surrounded by the non-returning area, that is, the optimal returning point is located in a circle surrounded by the closed non-returning area, or the optimal returning point is surrounded by the vehicle, if the point is selected for returning, the driving obstacles are too many, it is difficult to plan a driving route reaching the optimal driving point, and it takes too much time to return the vehicle, therefore, the optimal returning point can be abandoned, and the alternative returning point ranked the second in the distance ranking result is used as the optimal returning point.
Accordingly, the step S40 includes:
step S401: and planning a car returning route based on the current position of the shared bicycle taken by the user and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route.
It is easy to understand that after an optimal returning point is obtained, a returning route can be planned based on the current position of a shared bicycle taken by a user and the optimal returning point in combination with actual road conditions, and a driving distance between the current position and the optimal returning point is obtained, when the driving distance is greater than or equal to a preset driving distance, a type of returning prompt information can be sent according to the returning route, the type of returning prompt information can be understood as navigation prompt information for guiding the user to drive to the vicinity of the optimal returning point, such as '10 m driving along the current road', '5 m turn right after', and the like, when the driving distance is less than the preset driving distance, a type of returning prompt information can be sent according to the optimal returning point, the type of returning information can be understood as search type prompt information for guiding the user to find the optimal returning point, such as "on the left", "on the right", "near", "far", etc. The preset driving distance may be set according to actual requirements, such as 15 meters and 25 meters, which is not limited in this embodiment.
In the embodiment, whether a driving destination input by a user is received is judged; when the driving destination input by the user is received, determining an alternative vehicle returning area according to the driving destination; carrying out preset parking check processing on the alternative car returning area to obtain a parking check result; screening alternative car returning points from the alternative car returning area according to the parking verification result; when a car returning request sent by the user is detected, screening an optimal car returning point from the alternative car returning points according to a preset screening rule; and planning a car returning route based on the current position of the shared bicycle taken by the user and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route. Compared with the inconvenience caused by the fact that a user needs to return the vehicle according to a preset parking range in the prior art, the alternative vehicle returning area is determined according to the driving destination when the driving destination input by the user is received; carrying out preset parking check processing on the alternative car returning area to obtain a parking check result; screening alternative car returning points from the alternative car returning area according to the parking verification result; when a car returning request sent by the user is detected, screening an optimal car returning point from the alternative car returning points according to a preset screening rule; and planning a returning route based on the current position of the shared bicycle taken by the user and the optimal returning point, sending a corresponding returning prompt message according to the returning route so as to realize that returning planning is carried out in advance according to a driving destination input by the user, and sending a corresponding prompt message in real time based on the planned returning route so that the user can return the shared bicycle to the optimal returning point quickly, so that the returning efficiency and returning experience of the user are improved.
In addition, an embodiment of the present invention further provides a storage medium, where a shared bicycle returning planning program is stored on the storage medium, and the shared bicycle returning planning program is executed by a processor to implement the steps of the shared bicycle returning planning method described above.
Referring to fig. 6, fig. 6 is a block diagram of a shared bicycle returning planning device according to a first embodiment of the present invention.
As shown in fig. 6, the shared bicycle returning planning apparatus provided in the embodiment of the present invention includes:
the condition judgment module 10 is used for judging whether a driving destination input by a user is received;
the alternative determining module 20 is configured to, when the driving destination input by the user is not received, obtain a current position of the shared bicycle taken by the user, and determine an alternative returning point according to the current position;
the optimal determination module 30 is configured to, when a car returning request sent by the user is detected, screen an optimal car returning point from the alternative car returning points according to a preset screening rule;
and the car returning planning module 40 is used for planning a car returning route based on the current position and the optimal car returning point and sending a corresponding car returning prompt message according to the car returning route.
In the embodiment, whether a driving destination input by a user is received is judged; when the driving destination input by the user is not received, the current position of the shared bicycle taken by the user is obtained, and an alternative returning point is determined according to the current position; when a car returning request sent by the user is detected, screening an optimal car returning point from the alternative car returning points according to a preset screening rule; and planning a car returning route based on the current position and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route. Compared with the inconvenience of the prior art that the user needs to return the car according to the preset parking range by himself/herself, in the embodiment, when the driving destination input by the user is not received, obtaining the current position of the shared bicycle taken by the user, determining an alternative returning point according to the current position, when a car returning request sent by the user is detected, screening an optimal car returning point from the alternative car returning points according to a preset screening rule, planning a car returning route based on the current position and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route, the method and the device have the advantages that the vehicle returning planning is carried out in advance according to the current position of the user, the corresponding prompt information is sent in real time based on the planned vehicle returning route, so that the user can conveniently and quickly return the shared vehicle to the optimal vehicle returning point, and the vehicle returning efficiency and the vehicle returning experience of the user are improved.
Based on the first embodiment of the shared bicycle returning planning device, the second embodiment of the shared bicycle returning planning device is provided.
In this embodiment, the alternative determining module 20 is further configured to, when the driving destination input by the user is not received, obtain a current position of the shared bicycle taken by the user;
the alternative determining module 20 is further configured to determine a first target car returning area according to the current position;
the alternative determining module 20 is further configured to perform area division on the first target car returning area to obtain a first area division result;
the alternative determining module 20 is further configured to use all the returning points of the returnable areas in the first area division result as alternative returning points.
Optionally, the optimal determining module 30 is further configured to, when a car return request sent by the user is detected, obtain a driving distance from the current position to each alternative car return point;
the optimal determination module 30 is further configured to rank the driving distances to obtain a distance ranking result;
the optimal determining module 30 is further configured to screen an optimal returning point from the alternative returning points according to the distance sorting result.
Optionally, the car returning planning module 40 is further configured to plan a car returning route based on the current location and the optimal car returning point;
the vehicle returning planning module 40 is further configured to obtain a driving distance between the current position and the optimal vehicle returning point;
the returning planning module 40 is further configured to send a type of returning prompt information according to the returning route when the driving distance is greater than or equal to a preset driving distance;
and the returning planning module 40 is further configured to send a second-class returning prompt message according to the optimal returning point when the driving distance is smaller than the preset driving distance.
Optionally, the alternative determining module 20 is further configured to determine an alternative car returning area according to the driving destination when the driving destination input by the user is received;
the alternative determining module 20 is further configured to perform preset parking check processing on the alternative car returning area to obtain a parking check result;
the alternative determining module 20 is further configured to screen an alternative car returning point from the alternative car returning area according to the parking verification result.
Optionally, the alternative determining module 20 is further configured to obtain a parking area, a parking coverage rate, a parking density, and a parking flow rate of the alternative car returning area;
the alternative determining module 20 is further configured to determine a parking check value of the alternative car returning area according to the area of the parking area, the parking coverage, the parking density, and the parking flow rate;
correspondingly, the alternative determining module 20 is further configured to screen a target car returning area from the alternative car returning area according to the parking check value, and screen an alternative car returning point from the target car returning area.
Optionally, the alternative determining module 20 is further configured to sort the parking check values to obtain a check value sorting result;
the alternative determining module 20 is further configured to screen a second target car returning area from the alternative car returning areas according to the check value sorting result;
the alternative determining module 20 is further configured to perform area division on the second target car returning area to obtain a second area division result;
the alternative determining module 20 is further configured to use all the returning points of the returnable area in the second area division result as alternative returning points.
Other embodiments or specific implementation manners of the shared bicycle returning planning device of the present invention can refer to the above method embodiments, and are not described herein again.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
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.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., a rom/ram, a magnetic disk, an optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method according to the embodiments of the present invention.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (10)
1. The shared bicycle returning planning method is characterized by comprising the following steps:
judging whether a driving destination input by a user is received;
when the driving destination input by the user is not received, the current position of the shared bicycle taken by the user is obtained, and an alternative returning point is determined according to the current position;
when a car returning request sent by the user is detected, screening an optimal car returning point from the alternative car returning points according to a preset screening rule;
and planning a car returning route based on the current position and the optimal car returning point, and sending a corresponding car returning prompt message according to the car returning route.
2. The shared bicycle returning planning method according to claim 1, wherein the step of obtaining a current location of the shared bicycle taken by the user and determining an alternative returning point according to the current location when the driving destination input by the user is not received comprises:
when the driving destination input by the user is not received, acquiring the current position of the shared bicycle taken by the user;
determining a first target car returning area according to the current position;
carrying out area division on the first target returning area to obtain a first area division result;
and taking all the returning points of the returning areas in the first area division result as alternative returning points.
3. The shared bicycle returning planning method according to claim 1, wherein the step of screening the optimal returning points from the alternative returning points according to a preset screening rule when the returning request from the user is detected comprises:
when a car returning request sent by the user is detected, the driving distance from the current position to each alternative car returning point is obtained;
sequencing the travelling distances to obtain a distance sequencing result;
and screening out the optimal returning points from the alternative returning points according to the distance sorting result.
4. The shared bicycle returning planning method according to claim 1, wherein the step of planning a returning route based on the current location and the optimal returning point and sending a corresponding returning prompt message according to the returning route comprises:
planning a car returning route based on the current position and the optimal car returning point;
acquiring the driving distance between the current position and the optimal returning point;
when the driving distance is greater than or equal to a preset driving distance, sending a type of vehicle returning prompt message according to the vehicle returning route;
and when the driving distance is smaller than the preset driving distance, sending secondary vehicle returning prompt information according to the optimal vehicle returning point.
5. The shared bicycle returning planning method according to claim 1, wherein after the step of determining whether the driving destination input by the user is received, the method further comprises:
when the driving destination input by the user is received, determining an alternative vehicle returning area according to the driving destination;
carrying out preset parking check processing on the alternative car returning area to obtain a parking check result;
and screening out alternative vehicle returning points from the alternative vehicle returning area according to the parking verification result.
6. The shared bicycle returning planning method according to claim 5, wherein the step of performing the preset parking check process on the alternative returning area to obtain the parking check result includes:
obtaining the area, the parking coverage rate, the parking density and the parking flow rate of the parking area of the alternative car returning area;
determining a parking check value of the alternative car returning area according to the area of the parking area, the parking coverage rate, the parking intensity and the parking flow rate;
correspondingly, the step of screening the alternative car returning points from the alternative car returning area according to the parking verification result comprises the following steps:
and screening a target car returning region from the alternative car returning region according to the parking check value, and screening an alternative car returning point from the target car returning region.
7. The shared bicycle returning planning method according to claim 6, wherein the step of screening out a target returning area from the alternative returning areas according to the parking check value and screening out an alternative returning point from the target returning area comprises:
sequencing the parking check values to obtain a check value sequencing result;
screening a second target car returning area from the alternative car returning areas according to the checking value sorting result;
carrying out region division on the second target returning region to obtain a second region division result;
and taking all the returning points of the returning areas in the second area division result as alternative returning points.
8. The utility model provides a sharing bicycle still car planning device which characterized in that, sharing bicycle still car planning device includes:
the condition judgment module is used for judging whether a driving destination input by a user is received or not;
the alternative determining module is used for acquiring the current position of the shared bicycle taken by the user when the driving destination input by the user is not received, and determining an alternative returning point according to the current position;
the optimal determination module is used for screening optimal car returning points from the alternative car returning points according to a preset screening rule when a car returning request sent by the user is detected;
and the vehicle returning planning module is used for planning a vehicle returning route based on the current position and the optimal vehicle returning point and sending a corresponding vehicle returning prompt message according to the vehicle returning route.
9. A shared bicycle return planning apparatus, the apparatus comprising: memory, a processor and a shared bicycle return planning program stored on the memory and executable on the processor, the shared bicycle return planning program being configured to implement the steps of the shared bicycle return planning method according to any one of claims 1 to 7.
10. A storage medium having stored thereon a shared bicycle return planning program which, when executed by a processor, implements the steps of the shared bicycle return planning method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111023743.7A CN113869652A (en) | 2021-09-01 | 2021-09-01 | Shared bicycle returning planning method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111023743.7A CN113869652A (en) | 2021-09-01 | 2021-09-01 | Shared bicycle returning planning method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113869652A true CN113869652A (en) | 2021-12-31 |
Family
ID=78989311
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111023743.7A Pending CN113869652A (en) | 2021-09-01 | 2021-09-01 | Shared bicycle returning planning method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113869652A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114446075A (en) * | 2022-04-07 | 2022-05-06 | 北京阿帕科蓝科技有限公司 | Method for recalling vehicle |
| CN116798234A (en) * | 2023-08-28 | 2023-09-22 | 北京阿帕科蓝科技有限公司 | Method, device, computer equipment and storage medium for determining station parameter information |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010257111A (en) * | 2009-04-23 | 2010-11-11 | Mazda Motor Corp | System and method for operating shared vehicle |
| JP2015201058A (en) * | 2014-04-09 | 2015-11-12 | 日産自動車株式会社 | Shared vehicle management apparatus and program |
| CN107705622A (en) * | 2017-09-29 | 2018-02-16 | 深圳市元征科技股份有限公司 | Shared vehicle parks management method and server |
| CN108416452A (en) * | 2017-09-15 | 2018-08-17 | 杭州创屹机电科技有限公司 | A kind of shared bicycle management system and method |
| CN112712722A (en) * | 2020-12-23 | 2021-04-27 | 贵州航天计量测试技术研究所 | Intelligent parking lot traffic optimization navigation method and device and electronic equipment |
-
2021
- 2021-09-01 CN CN202111023743.7A patent/CN113869652A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010257111A (en) * | 2009-04-23 | 2010-11-11 | Mazda Motor Corp | System and method for operating shared vehicle |
| JP2015201058A (en) * | 2014-04-09 | 2015-11-12 | 日産自動車株式会社 | Shared vehicle management apparatus and program |
| CN108416452A (en) * | 2017-09-15 | 2018-08-17 | 杭州创屹机电科技有限公司 | A kind of shared bicycle management system and method |
| CN107705622A (en) * | 2017-09-29 | 2018-02-16 | 深圳市元征科技股份有限公司 | Shared vehicle parks management method and server |
| CN112712722A (en) * | 2020-12-23 | 2021-04-27 | 贵州航天计量测试技术研究所 | Intelligent parking lot traffic optimization navigation method and device and electronic equipment |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114446075A (en) * | 2022-04-07 | 2022-05-06 | 北京阿帕科蓝科技有限公司 | Method for recalling vehicle |
| CN116798234A (en) * | 2023-08-28 | 2023-09-22 | 北京阿帕科蓝科技有限公司 | Method, device, computer equipment and storage medium for determining station parameter information |
| CN116798234B (en) * | 2023-08-28 | 2024-01-26 | 北京阿帕科蓝科技有限公司 | Method, device, computer equipment and storage medium for determining station parameter information |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111580524B (en) | Vehicle lane changing method, device and equipment based on path planning and storage medium | |
| CN111460068B (en) | Interest point searching method, readable storage medium and electronic device | |
| CN106408147B (en) | Dispatching method and system for vehicle insurance survey task | |
| KR102146141B1 (en) | Method, computer program product, and electronic control device for locating parking space for vehicles | |
| US10021243B2 (en) | Telephone call placement | |
| CN113869652A (en) | Shared bicycle returning planning method, device, equipment and storage medium | |
| US20200210905A1 (en) | Systems and Methods for Managing Networked Vehicle Resources | |
| CN109841054B (en) | Method, device, equipment and storage medium for recommending boarding points | |
| CN110222893B (en) | Method and device for recommending delivery places of shared traffic resources and electronic equipment | |
| CN108154253B (en) | Travel mode recommendation method and device | |
| CN111209493A (en) | Charging station recommendation method, device, equipment and medium | |
| CN111261017B (en) | Map fence display method and device | |
| CN111898042B (en) | Riding point recommendation method, riding point recommendation device, riding point recommendation equipment and storage medium | |
| CN111861643A (en) | Riding position recommendation method and device, electronic equipment and storage medium | |
| CN111860904B (en) | Method and device for ordering boarding points | |
| CN111613060A (en) | Data processing method and equipment | |
| CN111651664A (en) | Accident vehicle positioning method and device based on accident position point, storage medium and terminal | |
| CN109615918B (en) | Parking navigation method and related device | |
| CN109916420B (en) | Vehicle navigation method and related device | |
| CN112945253A (en) | Travel route recommendation method, system and device | |
| CN114802305A (en) | Automobile fuel management method, device, equipment and storage medium | |
| CN113706786A (en) | Method, device and equipment for controlling temporary parking of shared bicycle and storage medium | |
| CN113987312A (en) | Method and device for recommending loading and unloading stop points of freight cars and storage medium | |
| CN112304326A (en) | Travel route planning method, equipment and storage medium | |
| CN112747764A (en) | Navigation method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |