WO2023124159A1 - 共享车辆的智能调度方法、系统、设备及存储介质 - Google Patents

共享车辆的智能调度方法、系统、设备及存储介质 Download PDF

Info

Publication number
WO2023124159A1
WO2023124159A1 PCT/CN2022/115286 CN2022115286W WO2023124159A1 WO 2023124159 A1 WO2023124159 A1 WO 2023124159A1 CN 2022115286 W CN2022115286 W CN 2022115286W WO 2023124159 A1 WO2023124159 A1 WO 2023124159A1
Authority
WO
WIPO (PCT)
Prior art keywords
parking
area
information
parking area
shared
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.)
Ceased
Application number
PCT/CN2022/115286
Other languages
English (en)
French (fr)
Inventor
孙德彪
龚磊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Sensetime Intelligent Technology Co Ltd
Original Assignee
Shanghai Sensetime Intelligent Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shanghai Sensetime Intelligent Technology Co Ltd filed Critical Shanghai Sensetime Intelligent Technology Co Ltd
Publication of WO2023124159A1 publication Critical patent/WO2023124159A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07F—COIN-FREED OR LIKE APPARATUS
    • G07F17/00—Coin-freed apparatus for hiring articles; Coin-freed facilities or services
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/017—Detecting movement of traffic to be counted or controlled identifying vehicles

Definitions

  • the present disclosure relates to the technical field of shared vehicles, and in particular to an intelligent scheduling method, system, device, storage medium and computer program for shared vehicles.
  • Shared vehicles are widely used because of their convenience, and with the popularity of shared vehicles in people's daily life, there are more and more types of shared vehicles, such as shared bicycles, shared cars, and shared electric vehicles.
  • the present disclosure provides an intelligent scheduling method, system, device, storage medium and computer program for shared vehicles.
  • an intelligent scheduling method for shared vehicles includes: acquiring an image of a parking area of a shared vehicle; the parking area includes a parking area and/or a no-parking area; analyzing the image to identify the current parking information of the shared vehicle in the parking area; based on the current parking information and the parking The preset parking information of the area generates the scheduling information of the shared vehicles in the parking area.
  • the current parking information of the shared vehicles in the area generates the scheduling information of the shared vehicles in real time, and schedules the shared vehicles in the current parking area in real time, so as to avoid the problem of centralized parking of shared vehicles in some areas, while shared vehicles cannot be found in some areas. Effectively improve the utilization rate of shared vehicles.
  • the current parking information of the shared vehicles in the parking area includes the on-site parking quantity of the shared vehicles in the parking area; the preset parking information of the parking area includes the parking quantity of the shared vehicles in the parking area.
  • the shared vehicles in the current parking area are crowded, the shared vehicles in the current area can be dispatched in real time.
  • the step of generating the scheduling information of the shared vehicles in the parking area includes: based on the number of on-site parking of the shared vehicles in the parking area and the number of shared vehicles that can be parked in the parking area , determine the congestion information of the shared vehicles in the parkable area; based on the congestion information of the shared vehicles in the parkable area, generate the scheduling information of the shared vehicles in the parkable area.
  • the shared vehicles can be dispatched in time when the shared vehicles in the parking area are congested, so as to avoid affecting the traffic in the current parking area.
  • the step of determining the congestion information of the shared vehicles in the parkable area based on the on-site parking quantity of the shared vehicles in the parkable area and the parkable quantity of the shared vehicles in the parkable area it also includes: responding to the shared vehicles in the parkable area If the congestion information is greater than the first threshold, the area information of other parkable areas whose congestion information is less than the second threshold is acquired; based on the congestion information of the shared vehicles in the parkable area, the step of generating the scheduling information of the shared vehicles in the parkable area specifically includes : Based on the area information of the parking area closest to the current parking area, generate the scheduling information of the shared vehicles in the current parking area.
  • the area information of other parking areas whose congestion information is smaller than the second threshold is further obtained, and the current parking area is generated based on the area information of other parking areas closest to the current parking area
  • the scheduling information of shared vehicles can not only improve the utilization rate of shared vehicles, but also improve the scheduling efficiency.
  • the step of determining the congestion information of the shared vehicles in the parkable area based on the on-site parking quantity of the shared vehicles in the parkable area and the parkable quantity of the shared vehicles in the parkable area including: responding to the number of shared vehicles in the parkable area
  • the congestion information is greater than a third threshold, and a congestion warning signal is generated and sent; wherein, the third threshold is greater than the second threshold and less than the first threshold.
  • the current parking information of the shared vehicle in the parking area includes the parking position information of the shared vehicle in the parking area; the parking position information is the position information of the shared vehicle projected to the detection frame corresponding to the parking area; the preset parking information in the parking area includes no parking The location information of the area.
  • the current parking information and the preset parking information of the shared vehicles in the parking area respectively include position information, it is possible to schedule the shared vehicles in the current area in real time when the shared vehicles in the current parking area illegally park.
  • the step of generating the scheduling information of the shared vehicle in the parking area further includes: based on the parking position information of the shared vehicle in the parking area and the location information of the no-parking area in the parking area, Determine the illegal parking information of the shared vehicles in the parking area; generate the scheduling information of the shared vehicles based on the illegal parking information of the shared vehicles in the parking area.
  • the shared vehicles can be dispatched in time when the shared vehicles in the parking area are illegally parked, so as to avoid affecting the traffic in the current parking area.
  • the step of determining the illegal parking information of the shared vehicle in the parking area includes: based on the parking position information and the parking area of the shared vehicle in the parking area The location information of the no-parking area, determine the overlapping area of the parking position of the shared vehicle in the parking area and the no-parking area; in response to the ratio of the area of the overlapping area to the area of the detection frame corresponding to the shared vehicle projected to the parking area is not less than the fourth threshold, it is determined that the shared vehicle is illegally parked.
  • determining the illegal parking information of the shared vehicle based on the size relationship between the area of the overlapping area and the fourth threshold can reduce the number of dispatches when the intersection of the shared vehicle and the no-parking area is small and will not affect the surrounding conditions. Save manpower and material resources, thereby reducing costs.
  • the step of determining the overlapping area of the parking position of the shared vehicle in the parking area and the no-parking area specifically includes: obtaining the location of the no-parking area The third coordinate information of the third position and the fourth coordinate information of the fourth position; wherein, the first position and the second position are the apex positions of the detection frame corresponding to the shared vehicle projected to the parking area, and the third position and the fourth position is the vertex position of the no-stop area, and the first position and the second position are diagonally distributed, and the third position and the fourth position are diagonally distributed; according to the first coordinate information, the second coordinate information, the third coordinate information and The fourth coordinate information determines the overlapping area of the parking position of the shared vehicle in the parking area and the no-parking area.
  • the area of the overlapping area can be determined effectively. Improve the accuracy of the obtained coincident area area.
  • the step of generating the scheduling information of the shared vehicles in the parking area includes: identifying at least one of the color, type, manufacturer, and quantity of the shared vehicles as the scheduling information.
  • the background staff can schedule and manage the shared vehicles differently according to the color, type, manufacturer, and quantity of the shared vehicles, which can not only improve the dispatching efficiency, but also help to improve the utilization rate of the shared vehicles.
  • the image before analyzing the image, it also includes: pre-defining the parkable area in the image and configuring the parkable quantity of the shared vehicles in the parkable area; and/or pre-defining the no-parking area in the image.
  • an intelligent dispatching system for shared vehicles includes: a file acquisition module, a file processing module, and an information generation module; wherein, the file acquisition module is used to obtain images of the parking area of the shared vehicle; the parking area includes a parking area and/or a no-parking area; the file processing module and The file acquisition module is connected to analyze the image and identify the current parking information of the shared vehicle in the parking area; the information generation module is connected to the file processing module to generate parking information based on the current parking information and the preset parking information of the parking area. Scheduling information of shared vehicles in the area.
  • an intelligent dispatching device for shared vehicles including: a memory and a processor, wherein the memory stores program instructions, and the processor is connected to the memory to call the program instructions and execute the above-mentioned An intelligent scheduling method for shared vehicles is involved.
  • a computer-readable storage medium including: storing program instructions, the program instructions can be executed by a processor to implement the above-mentioned intelligent scheduling method for shared vehicles.
  • a computer program including computer readable codes.
  • the computer readable codes are run in an electronic device, a processor in the electronic device executes the above method.
  • the intelligent scheduling method for shared vehicles acquires the images of the parking areas of the shared vehicles, and then analyzes the images to identify the current parking information of the shared vehicles in the parking areas; then based on the current parking information and the parking areas
  • the preset parking information can generate the scheduling information of the shared vehicles in the parking area in real time, so that the dispatching unit can schedule the shared vehicles in the parking area in real time according to the scheduling information, which not only greatly improves the scheduling efficiency of the shared vehicles, but also avoids the Centralized parking of shared vehicles, or the problem that shared vehicles cannot be found in some areas, effectively reduces the probability of traffic accidents caused by centralized parking of shared vehicles occupying sidewalks or lanes, and improves the utilization rate of shared vehicles.
  • FIG. 1 is a flowchart of an intelligent scheduling method for shared vehicles provided by an embodiment of the present disclosure
  • Fig. 2 is a subflow chart of step S3 in Fig. 1 provided by an embodiment of the present disclosure
  • Fig. 3 is a sub-flow chart of step S3 in Fig. 1 provided by another embodiment of the present disclosure
  • Fig. 4 is the sub-flow chart of step S33 in Fig. 3;
  • Fig. 5 is a schematic diagram of orientations of a first position, a second position, a third position and a fourth position provided by an embodiment of the present disclosure
  • Fig. 6 is a structural diagram of an intelligent dispatching system for shared vehicles provided by an embodiment of the present disclosure
  • FIG. 7 is a schematic structural diagram of an intelligent scheduling device for shared vehicles provided by an embodiment of the present disclosure.
  • Fig. 8 is a schematic structural diagram of a computer-readable storage medium provided by an embodiment of the present disclosure.
  • first”, “second”, and “third” in the present disclosure are used for descriptive purposes only, and cannot be interpreted as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Thus, features defined as “first”, “second”, and “third” may explicitly or implicitly include at least one of these features.
  • “plurality” means at least two, such as two, three, etc., unless otherwise specifically defined. All directional indications (such as up, down, left, right, front, back%) in the embodiments of the present disclosure are only used to explain the relative positional relationship between the various components in a certain posture (as shown in the drawings) , sports conditions, etc., if the specific posture changes, the directional indication also changes accordingly.
  • an embodiment means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the present disclosure.
  • the occurrences of this phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is understood explicitly and implicitly by those skilled in the art that the embodiments described herein can be combined with other embodiments.
  • an intelligent scheduling method for shared vehicles is provided.
  • the method combines the existing video analysis algorithm with the preset parking information of the shared vehicle parking area, through intelligent analysis, intelligent analysis, and in-depth cooperation with the dispatching unit Fusion can perform real-time scheduling of shared vehicles, realize real-time scheduling of crowded areas of shared vehicles and idle areas of shared vehicles, so as to avoid centralized parking of shared vehicles in subway stations, bus stations and other traffic areas, affecting the travel of pedestrians and vehicles; and
  • the problem that some community residents cannot find available shared vehicles is suitable for urban management.
  • the shared vehicles may be shared bicycles, shared cars, shared electric cars, and the like.
  • Fig. 1 is a flowchart of an intelligent scheduling method for shared vehicles provided by an embodiment of the present disclosure; the method specifically includes:
  • Step S1 Acquiring the image of the parking area of the shared vehicle.
  • the parking area of the shared vehicle includes a parking area and/or a no-parking area; wherein, the parking area refers to an area within the parking area where the shared vehicle is allowed to be parked.
  • the parking area may also include other surrounding areas, such as driveways, sidewalks, and the like.
  • the images include at least one of video streams and pictures.
  • images include video streams; the following embodiments take this as an example.
  • the images include pictures.
  • the images include video streams and pictures, so as to improve the accuracy of the current parking information of the shared vehicles in the parking area acquired subsequently.
  • step S1 the image of the parking area of the shared vehicle can be obtained through a file obtaining module, such as a camera, a camera, and the like.
  • a file obtaining module such as a camera, a camera, and the like.
  • Step S2 Analyze the image to identify the current parking information of the shared vehicle in the parking area.
  • before analyzing the image it also includes: pre-defining the parkable area in the image and configuring the parkable number of shared vehicles in the parkable area; and/or pre-defining the no-parking area in the image , or designate the area outside the parkable area as a no-parking area; this will facilitate the subsequent determination of whether the shared vehicles in the current parking area are congested or illegally parked.
  • a video analysis algorithm may be used to analyze the acquired video stream in real time, and identify the current parking information in the video stream.
  • the current parking information of the shared vehicles in the parking area may include the parking quantity of the shared vehicles in the parking area and/or the parking position information of the shared vehicles in the parking area. Among them, if there is a situation where shared vehicles intersect with no-parking areas, you can choose to include such shared vehicles or not include them in the number of on-site parking of shared vehicles in the current parking area.
  • the parking position information of the shared vehicle in the parking area may be the coordinate information of the position of the corresponding detection frame after the shared vehicle is projected into the parking area.
  • the detection frame is a rectangular frame.
  • the shared vehicles in the parking area include the shared vehicles in the parkable area, the shared vehicles in the no-parking area, and the shared vehicles in the no-parking area. There are overlapping shared vehicles in both zones and parkable areas.
  • the current parking information of the shared vehicles in the parking area can also include the name of the area, the color, type, brand, and bicycle company of the shared vehicles, so as to facilitate the different scheduling and management of the shared vehicles according to the color, type, and brand of the shared vehicles. , which can not only improve scheduling efficiency, but also help to improve the utilization rate of shared vehicles.
  • the area name may be a bus station, a subway entrance, etc.
  • the types of shared vehicles may include shared bicycles, shared electric vehicles, shared cars, and the like.
  • Step S3 Based on the current parking information and the preset parking information of the parking area, generate scheduling information of the shared vehicles in the parking area.
  • one parking area corresponds to one preset parking information.
  • the preset parking information of the parking area includes the number of shared vehicles that can be parked in the parking area and/or the location information of the no-parking area in the parking area.
  • the number of shared vehicles that can be parked in the parking area specifically refers to the maximum number of shared vehicles allowed to be parked in the parking area.
  • by making the current parking information and the preset parking information of the shared vehicles in the parking area respectively include a variety of different information, it is possible to monitor the current situation in real time when the shared vehicles in the current parking area have different conditions (such as congestion or illegal parking).
  • the shared vehicles in the area are dispatched.
  • the preset parking information in the parking area may also include the preset color, type, brand, bicycle company, etc. of the shared vehicle.
  • the current parking information of shared vehicles in the parking area includes the number of shared vehicles parked on site in the parking area, and the preset parking information in the parking area includes the number of shared vehicles in the parking area that can be parked.
  • FIG. 2 is a subflow chart of step S3 in FIG. 1 provided by an embodiment of the present disclosure; step S3 specifically includes:
  • Step S31 Determine the congestion information of the shared vehicles in the parkable area based on the on-site parking quantity of the shared vehicles in the parkable area and the parkable quantity of the shared vehicles in the parkable area.
  • the percentage of the parking quantity of the shared vehicles in the current parking area is determined. In an embodiment, in response to the percentage of the number of shared vehicles parked in the current parkable area being greater than a first threshold, it is determined that the shared vehicles in the current parkable area are in a congested state. In response to the parking quantity percentage of the shared vehicles in the current parkable area being less than the second threshold, it is determined that the shared vehicles in the current parkable area are in an idle state.
  • the first threshold is greater than the second threshold
  • the first threshold can be 80%
  • the second threshold can be 50%
  • the first threshold can also be 75%, 85%, 90%, etc.
  • the second The threshold can be 30%, 45%, 60%, etc.
  • Step S32 Based on the congestion information of the shared vehicles in the parkable area, generate scheduling information of the shared vehicles in the parkable area.
  • the dispatch information for transferring the shared vehicles away from the current parking area is generated in real time, so as to avoid causing traffic congestion and causing traffic accidents, and at the same time, the shared vehicles can be further dispatched to other idle parking areas to improve the utilization rate of shared vehicles. It can be understood that, when the shared vehicles in the current parking area are in an idle state or in a normal state, there is no need to schedule the shared vehicles in the current parking area.
  • At least one of the color, type, manufacturer, and quantity of the shared vehicle can be identified as scheduling information; in order to facilitate different scheduling and management of the shared vehicle according to the color, type, manufacturer, and quantity of the shared vehicle, such It can not only improve dispatching efficiency, but also help to improve the utilization rate of shared vehicles.
  • step S31 it may further include: responding If the congestion information of the shared vehicles in the parking area is greater than the first threshold, the area information of other parking areas whose congestion information is smaller than the second threshold is acquired. That is, in response to the shared vehicle in the parkable area being in a congested state, obtain the parkable area in which the percentage of the number of shared vehicles parked in the parkable area is less than the second threshold among several other parkable areas of the surrounding shared vehicles in the current parkable area region information. That is, area information of an idle parking area among several parking areas is obtained.
  • the area information of the parking area includes area location, person in charge information, street and town units, and the like.
  • step S32 specifically includes: generating scheduling information of shared vehicles in the current parking area based on area information of other parking areas closest to the current parking area.
  • the dispatching unit can dispatch the shared vehicles in the current parking area to other parking areas closest to the current parking area according to the dispatching information; among them, compared with other parking areas that are farther away, the dispatching time can be greatly shortened , improve the scheduling rate; and can timely notify the relevant person in charge for scheduling processing according to the obtained area information of other parking areas closest to the current parking area, so as to ensure that the shared vehicles in the parking area are managed in real time and further reduce congestion caused by accidents and increase the utilization of shared vehicles.
  • the method further includes generating and sending a congestion warning signal in response to the congestion information of the shared vehicles in the parkable area being greater than the third threshold.
  • the third threshold is larger than the second threshold and smaller than the first threshold; the specific value of the third threshold can be set according to actual conditions.
  • Generate and send a congestion warning signal by generating and sending a congestion warning signal when the congestion information of the shared vehicles in the parking area is greater than the third threshold, so that the staff can According to the congestion warning signal, the corresponding scheduling process is made to avoid the occurrence of congestion as much as possible, resulting in traffic accidents or other unexpected situations.
  • the congestion warning signal can be an alarm of different colors or a language broadcast according to different congestion information.
  • the current parking information of the shared vehicle in the parking area includes parking location information of the shared vehicle in the parking area; the preset parking information in the parking area includes location information of a no-parking area in the parking area.
  • FIG. 3 is a subflow chart of step S3 in FIG. 1 provided by another embodiment of the present disclosure; step S3 specifically includes:
  • Step S33 Based on the parking location information of the shared vehicle in the parking area and the location information of the no-parking area in the parking area, determine the illegal parking information of the shared vehicle in the parking area.
  • FIG. 4 is a subflow chart of step S33 in FIG. 3; step S33 specifically includes:
  • Step S331 Based on the parking location information of the shared vehicle in the parking area and the location information of the no-parking area in the parking area, determine the overlapping area of the parking location of the shared vehicle in the parking area and the no-parking area.
  • step S331 specifically includes: obtaining the first coordinate information (x1, y1) of the first position A of the shared vehicle in the parking area and the second coordinate information (x2, y2) of the second position B; The third coordinate information (x3, y3) of the third position C and the fourth coordinate information (x4, y4) of the fourth position D; wherein, the first position A and the second position B are corresponding to the shared vehicle projected to the parking area The apex position of the detection frame; the third position C and the fourth position D are the apex positions of the no-stop area.
  • the information determines the overlapping area of the parking position of the shared vehicle in the parking area and the no-parking area.
  • the first position A and the second position B are diagonally distributed, and The third position C and the fourth position D are diagonally distributed; in one embodiment, the first position A specifically refers to the upper left corner of the parking position of the shared vehicle; the second position B specifically refers to the lower right corner of the parking position of the shared vehicle position; the third position C specifically refers to the upper left corner of the no-stop area; the fourth position D specifically refers to the lower right corner of the no-stop area.
  • the first position A can also refer to the upper right corner of the parking position of the shared vehicle; the second position B specifically refers to the lower left corner of the parking position of the shared vehicle; the third position C specifically refers to the no-parking area The upper right corner of the position; the fourth position D specifically refers to the lower left corner of the no-stop area.
  • the above-mentioned shared vehicle based on the parking area is at the first position A and the second position B at the diagonal position, and the coordinate information of the third position C and the fourth position D at the diagonal position in the no-parking area determine the overlapping area , which can effectively improve the accuracy of the acquired overlapping area.
  • the overlapping area between the parking position of the shared vehicle and the no-parking area is obtained according to formulas (1)-(3) area;
  • Math.min is the minimum value of two values
  • Math.max is the maximum value of two values
  • W is the width
  • L is the length
  • S is the area of the overlapping area.
  • Step S332 In response to the ratio of the area of the overlapping area to the area of the detection frame projected by the shared vehicle onto the parking area corresponding to the detection frame not less than the fourth threshold, determine that the shared vehicle is illegally parked.
  • the fourth threshold is not less than 20%, which can ensure that the shared vehicle will not stay in the no-parking area for a long time, and the problem of affecting the road and travel at the current parking position will not occur.
  • the fourth threshold may specifically be 50%; of course, it may also be 30%, 45%, or 60%. In other implementation manners, the fourth threshold may also be no less than 5%, 10%, 30% and so on.
  • Step S34 Generate scheduling information of the shared vehicle based on the illegal parking information of the shared vehicle in the parking area.
  • the scheduling information for scheduling the shared vehicles is generated.
  • the scheduling information may include area information of the current parking area, and a specific scheduling scheme; the scheduling scheme may be transferred from the current parking area to an idle parking area, or scheduled to an allowed parking area of the current parking area.
  • the intelligent scheduling method for shared vehicles obtains the image of the parking area of the shared vehicle, and then analyzes the image to identify the current parking information of the shared vehicle in the parking area; then based on the current parking information and the parking area
  • the preset parking information can generate the scheduling information of the shared vehicles in the parking area in real time, and output the scheduling information to the dispatching unit, so that the dispatching unit can conduct real-time scheduling of the shared vehicles in the parking area according to the scheduling information, which not only greatly improves the sharing
  • the scheduling efficiency of vehicles avoids the problem of centralized parking of shared vehicles or the occurrence of shared vehicles that cannot be found in some areas, effectively reduces the probability of traffic accidents caused by centralized parking of shared vehicles occupying sidewalks or lanes, and improves the utilization of shared vehicles At the same time, the abandoned shared vehicles can be found in time to facilitate the unified management of shared vehicles.
  • FIG. 6 is a structural diagram of an intelligent dispatching system for shared vehicles provided by an embodiment of the present disclosure.
  • An intelligent dispatching system 40 for shared vehicles is provided, and the intelligent dispatching system 40 for shared vehicles can be used to implement the intelligent dispatching method for shared vehicles provided in any of the above-mentioned embodiments.
  • the intelligent dispatching system 40 for shared vehicles includes a file acquisition module 41 , a file processing module 42 and an information generation module 43 .
  • the file obtaining module 41 is used for obtaining the image of the parking area of the shared vehicle.
  • the file acquisition module 41 can be a camera or a camera.
  • the parking area of the shared vehicle includes a parking area and/or a no-parking area; the image includes at least one of a video stream and a picture.
  • the file processing module 42 is connected with the file acquisition module 41, and is used to analyze the image and identify the current parking information of the shared vehicle in the parking area.
  • the file processing module 42 is specifically used to analyze the acquired video stream in real time based on the standard platform product Sense Unity/Sense Foundry, and identify the current parking information in the video stream.
  • the information generation module 43 is connected with the file processing module 42, and is used for generating scheduling information of shared vehicles in the parking area based on the current parking information and the preset parking information of the parking area.
  • the current parking information of the shared vehicles in the parking area includes the parking quantity of the shared vehicles in the parking area and/or the parking location information of the shared vehicles in the parking area;
  • the preset parking information in the parking area includes the parking information of the shared vehicles in the parking area.
  • the above solution makes the current parking information and preset parking information of the shared vehicles in the parking area include a variety of different information, so that when the shared vehicles in the current parking area have different conditions (such as congestion or illegal parking), it can be real-time.
  • the shared vehicles in the area are dispatched.
  • the information generation module 43 is further used to determine the congestion information of the shared vehicles in the parkable area based on the number of on-site parking of the shared vehicles in the parkable area and the number of parkable shared vehicles in the parkable area; The congestion information of the shared vehicles in the area is used to generate the scheduling information of the shared vehicles in the parkable area.
  • the scheduling information is generated through the congestion information of the current parking area, and the shared vehicles can be dispatched in time when the shared vehicles in the parking area are congested, so as to avoid affecting the traffic in the current parking area.
  • the information generation module 43 is further configured to respond to the congestion information of the shared vehicles in the parking area greater than the first threshold, then acquire the area information of other parking areas whose congestion information is less than the second threshold; The area information of the parking area generates the scheduling information of the shared vehicles in the current parking area.
  • the above scheme further acquires area information of other parkable areas whose congestion information is less than the second threshold when congestion occurs in the parkable area, and generates the current parkable area based on the area information of other parkable areas closest to the current parkable area
  • the scheduling information of shared vehicles can not only improve the utilization rate of shared vehicles, but also improve the scheduling efficiency.
  • the information generation module 43 is further used to determine the illegal parking information of the shared vehicle in the parking area based on the parking position information of the shared vehicle in the parking area and the position information of the no-parking area in the parking area;
  • the illegal parking information of shared vehicles generates the scheduling information of shared vehicles.
  • the above solution generates dispatching information based on the illegal parking information in the current parking area, and can dispatch the shared vehicles in time when the shared vehicles in the parking area are illegally parked, so as to avoid affecting the traffic in the current parking area.
  • the information generation module 43 is used to determine the overlapping area of the parking position of the shared vehicle in the parking area and the no-parking area based on the parking position information of the shared vehicle in the parking area and the position information of the no-parking area in the parking area; If the ratio of the area of the overlapping area to the area of the detection frame corresponding to the projected parking area of the shared vehicle is not less than the fourth threshold, it is determined that the shared vehicle is illegally parked.
  • the above solution determines the illegal parking information of the shared vehicle based on the size relationship between the area of the overlapping area and the fourth threshold, which can reduce the number of dispatches when the intersection of the shared vehicle and the no-parking area is small and will not affect the surrounding conditions. To save manpower and material resources, thereby reducing costs.
  • the information generation module 43 is used to obtain the first coordinate information of the first position A of the shared vehicle in the parking area and the second coordinate information of the second position B; and obtain the third coordinate of the third position C of the no-parking area Information and fourth coordinate information of the fourth position D; wherein, the first position A and the second position B are diagonally distributed, and the third position C and the fourth position D are diagonally distributed; in response to at least part of the parking area If the shared vehicle is located in the no-parking area, the overlapping area between the parking position of the shared vehicle in the parking area and the no-parking area is determined according to the first coordinate information, the second coordinate information, the third coordinate information, and the fourth coordinate information.
  • the coincidence is determined
  • the area of the area can effectively improve the accuracy of the acquired area of the overlapping area.
  • the fourth threshold is not less than 20%. This can ensure that the shared vehicle will not stay in the no-parking area for a long time, which will affect the road and travel at the current parking position.
  • FIG. 7 is a schematic structural diagram of an intelligent dispatching device for a shared vehicle provided in an embodiment of the present disclosure; in this embodiment, an intelligent dispatching device for a shared vehicle is provided, and the robot includes a memory 500 and a processor 501 .
  • program instructions are stored in the memory 500, and the processor 501 is connected to the memory 500 to call the program instructions and execute the intelligent scheduling method for shared vehicles involved in the above-mentioned embodiments according to the program instructions.
  • the processor 501 may also be referred to as a CPU (Central Processing Unit, central processing unit).
  • the processor 501 may be an integrated circuit chip and has signal processing capability.
  • the processor 501 can also be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components .
  • DSP digital signal processor
  • ASIC application-specific integrated circuit
  • FPGA field-programmable gate array
  • a general-purpose processor may be a microprocessor, or the processor may be any conventional processor, or the like.
  • the memory 500 can be a memory stick, a TF card, etc., and can store all the information in the intelligent dispatching device of the shared vehicle, including input raw data, computer programs, intermediate operation results and final operation results are all stored in the memory 500 . It deposits and retrieves information according to the location specified by the controller. With the memory 500, the intelligent dispatching equipment of the shared vehicle has a memory function to ensure normal operation.
  • the memory 500 in the intelligent dispatching device for shared vehicles can be divided into main memory (internal memory) and auxiliary memory (external memory) according to the purpose, and there are also classification methods for external memory and internal memory. External storage is usually magnetic media or optical discs, which can store information for a long time. Memory refers to the storage components on the mainboard, which are used to store data and programs currently being executed, but are only used to store programs and data temporarily, and the data will be lost when the power is turned off or cut off.
  • the intelligent dispatching device for shared vehicles also includes other devices, which are the same as other devices and functions in the intelligent dispatching device for shared vehicles in the prior art, and will not be repeated here.
  • FIG. 8 is a schematic structural diagram of a computer-readable storage medium provided by an embodiment of the present disclosure.
  • a computer-readable storage medium is provided, the computer-readable storage medium stores program instructions 600, and the program instructions 600 are invoked to execute the intelligent scheduling method for shared vehicles involved in the above-mentioned embodiments.
  • the program instruction 600 may be stored in the above-mentioned storage medium in the form of a software product, including several instructions to enable a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute this program. All or part of the steps of the method in each embodiment are disclosed.
  • the aforementioned storage device includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disc and other media that can store program codes. , or terminal devices such as computers, servers, mobile phones, and tablets.
  • An embodiment of the present disclosure also provides a computer program, including computer readable codes, and when the computer readable codes are run in an electronic device, a processor in the electronic device executes the above method.
  • the disclosed systems, devices, programs and methods may be implemented in other ways.
  • the device embodiments described above are only illustrative.
  • the division of units is only a logical function division. In actual implementation, there may be other division methods.
  • multiple units or components can be combined or integrated. to another system, or some features may be ignored, or not implemented.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of devices or units may be in electrical, mechanical or other forms.
  • each functional unit in each embodiment of the present disclosure may be integrated into one processing unit, each unit may exist separately physically, or two or more units may be integrated into one unit.
  • the above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Human Resources & Organizations (AREA)
  • Theoretical Computer Science (AREA)
  • Finance (AREA)
  • Tourism & Hospitality (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Accounting & Taxation (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Educational Administration (AREA)
  • Primary Health Care (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Traffic Control Systems (AREA)

Abstract

一种共享车辆的智能调度方法、系统、设备及存储介质及计算机程序。该共享车辆的智能调度方法包括：获取到共享车辆的停放区域的图像（S1）；停放区域包括可停放区域和/或禁停区域；对图像进行解析，识别出停放区域的共享车辆的当前停放信息（S2）；基于当前停放信息及停放区域的预设停放信息，生成停放区域的共享车辆的调度信息（S3）。该方法大大提高了共享车辆停放的调度效率，且避免了共享车辆集中停放或者部分区域找不到共享车辆的问题发生，提高了共享车辆的利用率。

Description

共享车辆的智能调度方法、系统、设备及存储介质
本公开要求在2021年12月29日提交中国专利局、申请号为202111642738.4、申请名称为“共享车辆的智能调度方法、系统、设备及存储介质”的中国专利申请的优先权，其全部内容通过引用结合在本公开中。
【技术领域】
本公开涉及共享车辆技术领域，尤其涉及一种共享车辆的智能调度方法、系统、设备、存储介质及计算机程序。
【背景技术】
共享车辆因其便利性被人们广泛使用，且随着共享车辆在人们日常生活中的普遍流行，共享车辆的种类也越来越多，比如，共享自行车、共享汽车、共享电动汽车等。
【发明内容】
本公开提供了一种共享车辆的智能调度方法、系统、设备、存储介质及计算机程序。
根据本公开的一个方面，提供一种共享车辆的智能调度方法。该方法包括：获取到共享车辆的停放区域的图像；停放区域包括可停放区域和/或禁停区域；对图像进行解析，识别出停放区域的共享车辆的当前停放信息；基于当前停放信息及停放区域的预设停放信息，生成停放区域的共享车辆的调度信息。
因此，通过获取停放区域的共享车辆的当前停放信息；基于当前停放信息及停放区域的预设停放信息生成停放区域的共享车辆的调度信息，并将调度信息输出至调度单位进行调度，能够根据停放区域的共享车辆的当前停放信息实时生成共享车辆的调度信息，并实时对当前停放区域的共享车辆进行调度，以避免出现部分区域共享车辆集中停放，而部分区域找不到共享车辆的问题发生，有效提高了共享车辆的利用率。
其中，停放区域的共享车辆的当前停放信息包括可停放区域的共享车辆的现场停放数量；停放区域的预设停放信息包括可停放区域的共享车辆的可停放数量。
因此，能够在当前可停放区域的共享车辆发生拥挤时实时对当前区域的共享车辆进行调度。
其中，基于当前停放信息及停放区域的预设停放信息，生成停放区域的共享车辆的调度信息的步骤包括：基于可停放区域的共享车辆的现场停放数量及可停放区域的共享车辆的可停放数量，确定可停放区域的共享车辆的拥堵信息；基于可停放区域的共享车辆的拥堵信息，生成可停放区域的共享车辆的调度信息。
因此，通过当前可停放区域的拥堵信息生成调度信息，能够在可停放区域的共享车辆出现拥挤时及时调度共享车辆，以避免对当前可停放区域的交通造成影响。
其中，基于可停放区域的共享车辆的现场停放数量及可停放区域的共享车辆的可停放数量，确定可停放区域的共享车辆的拥堵信息的步骤之后，还包括：响应于可停放区域的共享车辆的拥堵信息大于第一阈值，则获取拥堵信息小于第二阈值的其它可停放区域的区域信息；基于可停放区域的共享车辆的拥堵信息，生成可停放区域的共享车辆的调度信息的步骤具体包括：基于与当前可停放区域距离最近的可停放区域的区域信息，生成当前可停放区域的共享车辆的调度信息。
因此，通过在可停放区域发生拥堵时，进一步获取拥堵信息小于第二阈值的其它可停放区域的区域信息，并基于与当前可停放区域距离最近的其它可停放区域的区域信息生成当前可停放区域的共享车辆的调度信息，不仅能够提高共享车辆的利用率，且能够提高调度效率。
其中，基于可停放区域的共享车辆的现场停放数量及可停放区域的共享车辆的可停放数量，确定可停放区域的共享车辆的拥堵信息的步骤之后，包括：响应于可停放区域的共享车辆的拥堵信息大于第三阈值，生成并发送拥堵预警信号；其中，所述第三阈值大于所述第二阈值且小于所述第一阈值。
这样能够在当前可停放区域的共享车辆的停放量尚未造成拥堵之前即根据拥堵预警信号做出相应处理，避免拥堵现象发生，进而避免因拥堵导致的交通事故或其它意外情况的发生。
其中，停放区域的共享车辆的当前停放信息包括停放区域的共享车辆的停放位置信息；停放位置信息为共享车辆投影至停放区域所对应检测框的位置信息；停放区域的预设停放信息包括禁停区域的位置信息。
因此，通过使停放区域的共享车辆的当前停放信息和预设停放信息分别包括位置信息，能够在当前停放区域的共享车辆发生违停时实时对当前区域的共享车辆进行调度。
其中，基于当前停放信息及停放区域的预设停放信息，生成停放区域的共享车辆的调度信息的步骤还包括：基于停放区域的共享车辆的停放位置信息及停放区域的禁停区域的位置信息，确定停放区域的共享车辆的违停信息；基于停放区域的共享车辆的违停信息生成共享车辆的调度信息。
因此，基于当前停放区域的违停信息生成调度信息，能够在停放区域的共享车辆出现违停时及时调度共享车辆，以避免对当前停放区域的交通造成影响。
其中，基于停放区域的共享车辆的停放位置信息及停放区域的禁停区域的位置信息，确定停放区域的共享车辆的违停信息的步骤包括：基于停放区域的共享车辆的停放位置信息及停放区域的禁停区域的位置信息，确定停放区域的共享车辆的停放位置与禁停区域的重合区域面积；响应于重合区域面积与共享车辆投影至停放区域所对应检测框的面积的比值不小于第四阈值，则确定共享车辆违停。
因此，基于重合区域面积与第四阈值的大小关系确定共享车辆的违停信息，能够在共享车辆与禁停区域的交集较小，不会对周边情况造成影响的情况下，减少调度次数，以节省人力、物力，从而降低成本。
其中，基于停放区域的共享车辆的停放位置信息及停放区域的禁停区域的位置信息，确定停放区域的共享车辆的停放位置与禁停区域的重合区域面积的步骤具体包括：获取禁停区域的第三位置的第三坐标信息和第四位置的第四坐标信息；其中，第一位置和第二位置为共享车辆投影至停放区域所对应的检测框的顶点位置，第三位置和第四位置为禁停区域的顶点位置，且第一位置和第二位置呈对角分布，以及第三位置和第四位置呈对角分布；根据第一坐标信息、第二坐标信息、第三坐标信息以及第四坐标信息确定停放区域的共享车辆的停放位置与禁停区域的重合区域面积。
因此，基于停放区域的共享车辆处于对角位置处的第一位置和第二位置，以及禁停区域的处于对角位置处的第三位置和第四位置的坐标信息确定重合区域面积，能够有效提高获取的重合区域面积的精度。
其中，生成停放区域的共享车辆的调度信息的步骤包括：识别共享车辆的颜色、种类、厂家、数量中的至少一种以作为调度信息。
这样使后台工作人员能够根据共享车辆的颜色、种类、厂家、数量对共享车辆进行区别调度、管理，这样不仅能够提高调度效率，且有助于提高共享车辆的利用 率。
其中，在对图像进行解析之前，还包括：预先在图像中划定可停放区域并配置可停放区域的共享车辆的可停放数量；和/或预先在图像中划定禁停区域。
根据本公开的一个方面，提供一种共享车辆的智能调度系统。该系统包括：文件获取模块、文件处理模块以及信息生成模块；其中，文件获取模块用于获取到共享车辆的停放区域的图像；停放区域包括可停放区域和/或禁停区域；文件处理模块与文件获取模块连接，用于对图像进行解析，识别出停放区域的共享车辆的当前停放信息；信息生成模块与文件处理模块连接，用于基于当前停放信息及停放区域的预设停放信息，生成停放区域的共享车辆的调度信息。
根据本公开的一个方面，提供一种共享车辆的智能调度设备，包括：存储器和处理器，其中，存储器中存储有程序指令，处理器连接存储器以调取程序指令并根据程序指令执行如上述所涉及的共享车辆的智能调度方法。
根据本公开的一个方面，提供一种计算机可读存储介质，包括：存储有程序指令，程序指令能够被处理器执行以实现如上述所涉及的共享车辆的智能调度方法。
根据本公开的一个方面，提供了一种计算机程序，包括计算机可读代码，当所述计算机可读代码在电子设备中运行时，所述电子设备中的处理器执行上述方法。
本公开实施例提供的共享车辆的智能调度方法，通过获取到共享车辆的停放区域的图像，然后对图像进行解析，识别出停放区域的共享车辆的当前停放信息；之后基于当前停放信息及停放区域的预设停放信息能够实时生成停放区域的共享车辆的调度信息，以使调度单位能够根据该调度信息对停放区域的共享车辆进行实时调度，从而不仅大大提高了共享车辆的调度效率，且避免了共享车辆集中停放，或者部分区域找不到共享车辆的问题发生，有效降低了共享车辆集中停放占用人行道或车道导致交通事故发生的概率，并提高了共享车辆的利用率。
【附图说明】
此处的附图被并入说明书中并构成本说明书的一部分，这些附图示出了符合本公开的实施例，并与说明书一起用于说明本公开的技术方案。
图1是本公开一实施例提供的共享车辆的智能调度方法的流程图；
图2是本公开一实施例提供的图1中步骤S3的子流程图；
图3是本公开另一实施例提供的图1中步骤S3的子流程图；
图4是图3中步骤S33的子流程图；
图5是本公开一实施例提供的第一位置、第二位置、第三位置以及第四位置的方位示意图；
图6是本公开一实施例提供的共享车辆的智能调度系统的结构图；
图7为本公开一实施例提供的共享车辆的智能调度设备的结构示意图；
图8为本公开一实施例提供的计算机可读存储介质的结构示意图。
【具体实施方式】
下面将结合本公开实施例中的附图，对本公开实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅是本公开的一部分实施例，而不是全部的实施例。基于本公开中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本公开保护的范围。
本公开中的术语“第一”、“第二”、“第三”仅用于描述目的，而不能理解为指示或暗示相对重要性或者隐含指明所指示的技术特征的数量。由此，限定有“第一”、“第二”、“第三”的特征可以明示或者隐含地包括至少一个该特征。本公开的描述中，“多个”的含义是至少两个，例如两个，三个等，除非另有明确具体的限定。本公开实施例中所有方向性指示(诸如上、下、左、右、前、后……)仅用于解释在某一特定姿态(如附图所示)下各部件之间的相对位置关系、运动情况等，如果该特定姿态发生改变时，则该方向性指示也相应地随之改变。此外，术语“包括”和“具有”以及它们任何变形，意图在于覆盖不排他的包含。例如包含了一系列步骤或单元的过程、方法、系统、产品或设备没有限定于已列出的步骤或单元，而是可选地还包括没有列出的步骤或单元，或可选地还包括对于这些过程、方法、产品或设备固有的其它步骤或单元。
在本文中提及“实施例”意味着，结合实施例描述的特定特征、结构或特性可以包含在本公开的至少一个实施例中。在说明书中的各个位置出现该短语并不一定均是指相同的实施例，也不是与其它实施例互斥的独立的或备选的实施例。本领域技术人员显式地和隐式地理解的是，本文所描述的实施例可以与其它实施例相结合。
下面结合附图和实施例对本公开进行详细的说明。
随着越来越多的共享车辆进入城市，共享车辆集中泛滥，占用大量停车用地的问题屡见不鲜。目前，只有单一的共享车辆识别、共享车辆乱停放算法和技术，只能依靠大数据进行事后分析挖掘共享车辆停放拥挤区域，无法对共享车辆进行实时智能的调度。
在本公开实施例中，提供一种共享车辆的智能调度方法，该方法将已有视频解析算法与共享车辆停放区域的预设停放信息相结合，通过智能解析、智能分析，并与调度单位深度融合，能够对共享车辆进行实时调度，实现共享车辆的拥挤区域和共享车辆的空闲区域的实时调度，以避免共享车辆集中停放在地铁站、公交站等交通地段，影响行人、车辆的出行；而有些小区居民又找不到可用的共享车辆的问题，适用于城市管理。其中，该共享车辆可为共享自行车、共享汽车、共享电动汽车等。
请参阅图1，图1是本公开一实施例提供的共享车辆的智能调度方法的流程图；该方法具体包括：
步骤S1：获取到共享车辆的停放区域的图像。
其中，共享车辆的停放区域包括可停放区域和/或禁停区域；其中，可停放区域指该停放区域内允许停放共享车辆的区域。当然，该停放区域也可以包括周围的其它区域，比如车道、人行道等。
图像包括视频流和图片中的至少一种。一些应用场景中，图像包括视频流；以下实施例以此为例。另一些应用场景中，图像包括图片。还有一些应用场景中，图像包括视频流以及图片，以提高后续获取的停放区域的共享车辆的当前停放信息的准确度。
在一实施例中，步骤S1可通过文件获取模块，比如摄像头、相机等获取共享车辆的停放区域的图像。
步骤S2：对图像进行解析，识别出停放区域的共享车辆的当前停放信息。
在一实施例中，在对图像进行解析之前，还包括：预先在图像中划定可停放区域并配置可停放区域的共享车辆的可停放数量；和/或预先在图像中划定禁停区域，或者将可停放区域以外的区域划定为禁停区域；这样有利于后续对当前停放区域的共享车辆是否拥堵或者违停进行判定。
其中，具体可利用视频解析算法实时对获取的视频流进行解析，识别出视频流中的当前停放信息。
停放区域的共享车辆的当前停放信息可包括可停放区域的共享车辆的现场停放数量和/或停放区域的共享车辆的停放位置信息。其中，若存在共享车辆与禁停区域出现交叉的情况，可选择将这类共享车辆计入或者不计入当前可停放区域的共享车辆的现场停放数量中。停放区域的共享车辆的停放位置信息可为共享车辆投影至停放区域后所对应的检测框的位置的坐标信息。其中，该检测框为矩形框。可以理解的是，在停放区域的共享车辆的当前停放信息为停放区域的共享车辆的停放位置信息时，停放区域的共享车辆包括可停放区域的共享车辆、禁停区域的共享车辆以及与禁停区域和可停放区域均存在重叠的共享车辆。
当然，停放区域的共享车辆的当前停放信息还可包括区域名称、共享车辆的颜色、种类、品牌、单车公司等，以便于根据共享车辆的颜色、种类、品牌等对共享车辆进行区别调度、管理，这样不仅能够提高调度效率，且有助于提高共享车辆的利用率。其中，区域名称可为公交站、地铁口等；共享车辆的种类可包括共享自行车、共享电动车、共享汽车等。
步骤S3：基于当前停放信息及停放区域的预设停放信息，生成停放区域的共享车辆的调度信息。
其中，一个停放区域对应一个预设停放信息。停放区域的预设停放信息包括可停放区域的共享车辆的可停放数量和/或停放区域的禁停区域的位置信息。其中，可停放区域的共享车辆的可停放数量具体指可停放区域允许停放共享车辆的最大数量。其中，通过使停放区域的共享车辆的当前停放信息和预设停放信息分别包括多种不同的信息，能够在当前停放区域的共享车辆发生不同状况(比如拥挤或违停)时均能实时对当前区域的共享车辆进行调度。当然，停放区域的预设停放信息还可以包括共享车辆的预设颜色、种类、品牌、单车公司等。
在一应用场景中，停放区域的共享车辆的当前停放信息包括可停放区域的共享车辆的现场停放数量，停放区域的预设停放信息包括可停放区域的共享车辆的可停放数量。在该应用场景中，请参阅图2，图2是本公开一实施例提供的图1中步骤S3的子流程图；步骤S3具体包括：
步骤S31：基于可停放区域的共享车辆的现场停放数量及可停放区域的共享车辆的可停放数量，确定可停放区域的共享车辆的拥堵信息。
其中，基于可停放区域的共享车辆的现场停放数量及可停放区域的共享车辆的 可停放数量确定当前可停放区域的共享车辆的停放数量百分比。在一实施例中，响应于当前可停放区域的共享车辆的停放数量百分比大于第一阈值，则确定当前可停放区域的共享车辆处于拥堵状态。响应于当前可停放区域的共享车辆的停放数量百分比小于第二阈值，则确定当前可停放区域的共享车辆处于空闲状态。响应于当前可停放区域的共享车辆的停放数量百分比不大于第一阈值且不小于第二阈值，则确定当前可停放区域的共享车辆处于正常状态。其中，第一阈值大于第二阈值，第一阈值可为80％；第二阈值可为50％，在其他实施方式中，第一阈值也可以为75％，85％，90％等，第二阈值可以为30％、45％、60％等。
步骤S32：基于可停放区域的共享车辆的拥堵信息，生成可停放区域的共享车辆的调度信息。
其中，响应于当前可停放区域的共享车辆处于拥堵状态，则实时生成将共享车辆调离当前可停放区域的调度信息，以避免造成交通拥堵，导致交通事故的发生，同时可进一步将共享车辆调度至其它处于空闲状态的可停放区域，以提高共享车辆的利用率。可以理解的是，在当前可停放区域的共享车辆处于空闲状态或正常状态时，无需对当前可停放区域的共享车辆进行调度。具体的，可通过识别共享车辆的颜色、种类、厂家、数量中的至少一种以作为调度信息；以便于根据共享车辆的颜色、种类、厂家、数量等对共享车辆进行区别调度、管理，这样不仅能够提高调度效率，且有助于提高共享车辆的利用率。
进一步地，为了在防止共享车辆出现拥堵问题的同时，避免部分区域用户找不到共享车辆的问题发生，提高共享车辆的利用率；在一实施例中，步骤S31之后，还可进一步包括：响应于可停放区域的共享车辆的拥堵信息大于第一阈值，则获取拥堵信息小于第二阈值的其它可停放区域的区域信息。即，响应于可停放区域的共享车辆处于拥堵状态时，获取当前可停放区域的周边共享车辆的若干其它可停放区域中，可停放区域的共享车辆的停放数量百分比小于第二阈值的可停放区域的区域信息。即，获取若干可停放区域中处于空闲状态的可停放区域的区域信息。
其中，可停放区域的区域信息包括区域位置、负责人信息、街镇单位等。
在一实施例中，步骤S32具体包括：基于与当前可停放区域距离最近的其它可停放区域的区域信息生成当前可停放区域的共享车辆的调度信息。这样能够使调度单位根据调度信息将当前可停放区域的共享车辆调度至与当前可停放区域距离最近 的其它可停放区域；其中，相比于距离较远的其它可停放区域，能够大大缩短调度时间，提高调度速率；且能够根据获取的与当前可停放区域距离最近的其它可停放区域的区域信息及时通知相关负责人进行调度处理，以保证可停放区域的共享车辆被实时管理，进一步降低因拥堵造成的事故，并提高共享车辆的利用率。
进一步地，在一实施例中，在步骤S31之后，还包括响应于可停放区域的共享车辆的拥堵信息大于第三阈值，生成并发送拥堵预警信号。
其中，第三阈值大于第二阈值小于第一阈值；该第三阈值的具体数值可根据实际情况进行设定。通过在可停放区域的共享车辆的拥堵信息大于第三阈值，生成并发送拥堵预警信号，这样能够在当前可停放区域的共享车辆的停放量尚未造成拥堵，但即将造成拥堵之前，使工作人员能够根据拥堵预警信号做出相应的调度处理，尽可能地避免发生拥堵现象，导致交通事故或其它意外情况的发生。该拥堵预警信号可以是根据不同的拥堵信息发出的不同颜色的警报或者语言播报等提示。
在另一应用场景中，停放区域的共享车辆的当前停放信息包括停放区域的共享车辆的停放位置信息；停放区域的预设停放信息包括停放区域的禁停区域的位置信息。在该应用场景中，请参阅图3，图3是本公开另一实施例提供的图1中步骤S3的子流程图；步骤S3具体包括：
步骤S33：基于停放区域的共享车辆的停放位置信息及停放区域的禁停区域的位置信息，确定停放区域的共享车辆的违停信息。
在一实施例中，参见图4，图4是图3中步骤S33的子流程图；步骤S33具体包括：
步骤S331：基于停放区域的共享车辆的停放位置信息及停放区域的禁停区域的位置信息，确定停放区域的共享车辆的停放位置与禁停区域的重合区域面积。
其中，步骤S331具体包括：获取停放区域的共享车辆的第一位置A的第一坐标信息(x1，y1)和第二位置B的第二坐标信息(x2，y2)；以及获取禁停区域的第三位置C的第三坐标信息(x3，y3)和第四位置D的第四坐标信息(x4，y4)；其中，第一位置A和第二位置B为共享车辆投影至停放区域所对应的检测框的顶点位置；第三位置C和第四位置D为禁停区域的顶点位置。响应于停放区域的至少部分共享车辆位于禁停区域，即，停放区域的至少部分共享车辆与禁停区域存在交集，则根据第一坐标信息、第二坐标信息、第三坐标信息以及第四坐标信息确定停放区 域的共享车辆的停放位置与禁停区域的重合区域面积。其中，参见图5，图5是本公开一实施例提供的第一位置、第二位置、第三位置以及第四位置的方位示意图；第一位置A和第二位置B呈对角分布，以及第三位置C和第四位置D呈对角分布；在一实施例中，第一位置A具体指共享车辆的停放位置的左上角位置；第二位置B具体指共享车辆的停放位置的右下角位置；第三位置C具体指禁停区域的左上角位置；第四位置D具体指禁停区域的右下角位置。当然，在其它实施例中，第一位置A还可以指共享车辆的停放位置的右上角位置；第二位置B具体指共享车辆的停放位置的左下角位置；第三位置C具体指禁停区域的右上角位置；第四位置D具体指禁停区域的左下角位置。
上述基于停放区域的共享车辆处于对角位置处的第一位置A和第二位置B，以及禁停区域的处于对角位置处的第三位置C和第四位置D的坐标信息确定重合区域面积，能够有效提高获取的重合区域面积的精度。
在一实施例中，响应于x1≤x4，和/或x2≥x3、y1≤y4、y2≥y3，则根据公式(1)-(3)获取共享车辆的停放位置与禁停区域的重合区域面积；
W＝Math.min(x2，x4)-Math.max(x1，x3)；(1)
L＝Math.min(y2，y4)-Math.max(y1，y3)；(2)
S＝W*L；(3)
其中，Math.min是取两个数值的最小值；Math.max是取两个数值的最大值；W为宽度；L为长度；S为重合区域面积。
可以理解的是，若x1＞x4，且x2<x3、y1<y4、y2＞y3，则停放区域的共享车辆的停放位置与禁停区域无交集，停放区域的共享车辆没有违停。
步骤S332：响应于重合区域面积与共享车辆投影至停放区域所对应检测框的面积的比值不小于第四阈值，则确定共享车辆违停。
其中，基于重合区域面积与第四阈值的大小关系确定共享车辆的违停信息，能够在共享车辆与禁停区域的交集较小，不会对周边情况造成影响的情况下，减少调度次数，以节省人力、物力，从而降低成本。具体的，第四阈值不小于20％，这样能够保证共享车辆不会长时间处于禁停区域，对当前停放位置的道路、出行等造成影响的问题发生。在一实施例中，第四阈值具体可为50％；当然，也可以是30％、45％或60％等。在其它实施方式中，第四阈值还可以不小于5％、10％、30％等。
步骤S34：基于停放区域的共享车辆的违停信息生成共享车辆的调度信息。
具体的，响应于停放区域的共享车辆处于违停状态，则生成调度共享车辆的调度信息。该调度信息可包括当前停放区域的区域信息，以及具体的调度方案；该调度方案可为调离当前停放区域至处于空闲状态的可停放区域，或者调度至当前停放区域的允许停放区域。
本实施例提供的共享车辆的智能调度方法，通过获取到共享车辆的停放区域的图像，然后对图像进行解析，识别出停放区域的共享车辆的当前停放信息；之后基于当前停放信息及停放区域的预设停放信息能够实时生成停放区域的共享车辆的调度信息，并将调度信息输出至调度单位，以使调度单位能够根据该调度信息对停放区域的共享车辆进行实时调度，从而不仅大大提高了共享车辆的调度效率，且避免了共享车辆集中停放，或者部分区域找不到共享车辆的问题发生，有效降低了共享车辆集中停放占用人行道或车道导致交通事故发生的概率，并提高了共享车辆的利用率；同时，能够及时发现遗弃的共享车辆，以便于共享车辆的统一管理。
在本实施例中，参见图6，图6是本公开一实施例提供的共享车辆的智能调度系统的结构图。提供一种共享车辆的智能调度系统40，共享车辆的智能调度系统40可用于执行上述任一实施例所提供的共享车辆的智能调度方法。该共享车辆的智能调度系统40包括文件获取模块41、文件处理模块42和信息生成模块43。
其中，文件获取模块41用于获取到共享车辆的停放区域的图像。文件获取模块41可为摄像头或相机。其中，共享车辆的停放区域包括可停放区域和/或禁停区域；图像包括视频流和图片中的至少一种。
文件处理模块42与文件获取模块41连接，用于对图像进行解析，识别出停放区域的共享车辆的当前停放信息。
文件处理模块42具体用于基于标准平台产品Sense Unity/Sense Foundry，利用视频解析算法实时对获取的视频流进行解析，识别出视频流中的当前停放信息。
信息生成模块43与文件处理模块42连接，用于基于当前停放信息及停放区域的预设停放信息，生成停放区域的共享车辆的调度信息。
其中，停放区域的共享车辆的当前停放信息包括可停放区域的共享车辆的现场停放数量和/或停放区域的共享车辆的停放位置信息；停放区域的预设停放信息包括可停放区域的共享车辆的可停放数量和/或停放区域的禁停区域的位置信息。
上述方案通过使停放区域的共享车辆的当前停放信息和预设停放信息分别包括多种不同的信息，能够在当前停放区域的共享车辆发生不同状况(比如拥挤或违停)时均能实时对当前区域的共享车辆进行调度。
在一实施例中，信息生成模块43进一步用于基于可停放区域的共享车辆的现场停放数量及可停放区域的共享车辆的可停放数量，确定可停放区域的共享车辆的拥堵信息；基于可停放区域的共享车辆的拥堵信息，生成可停放区域的共享车辆的调度信息。
上述方案，通过当前可停放区域的拥堵信息生成调度信息，能够在可停放区域的共享车辆出现拥挤时及时调度共享车辆，以避免对当前可停放区域的交通造成影响。
信息生成模块43进一步用于响应于可停放区域的共享车辆的拥堵信息大于第一阈值，则获取拥堵信息小于第二阈值的其它可停放区域的区域信息；基于与当前可停放区域距离最近的其它可停放区域的区域信息，生成当前可停放区域的共享车辆的调度信息。
上述方案通过在可停放区域发生拥堵时，进一步获取拥堵信息小于第二阈值的其它可停放区域的区域信息，并基于与当前可停放区域距离最近的其它可停放区域的区域信息生成当前可停放区域的共享车辆的调度信息，不仅能够提高共享车辆的利用率，且能够提高调度效率。
在另一实施例中，信息生成模块43进一步用于基于停放区域的共享车辆的停放位置信息及停放区域的禁停区域的位置信息，确定停放区域的共享车辆的违停信息；基于停放区域的共享车辆的违停信息生成共享车辆的调度信息。
上述方案，基于当前停放区域的违停信息生成调度信息，能够在停放区域的共享车辆出现违停时及时调度共享车辆，以避免对当前停放区域的交通造成影响。
进一步地，信息生成模块43用于基于停放区域的共享车辆的停放位置信息及停放区域的禁停区域的位置信息，确定停放区域的共享车辆的停放位置与禁停区域的重合区域面积；响应于重合区域面积与共享车辆投影至停放区域所对应检测框的面积的比值不小于第四阈值，则确定共享车辆违停。
上述方案，基于重合区域面积与第四阈值的大小关系确定共享车辆的违停信息，能够在共享车辆与禁停区域的交集较小，不会对周边情况造成影响的情况下，减少 调度次数，以节省人力、物力，从而降低成本。
进一步地，信息生成模块43用于获取停放区域的共享车辆的第一位置A的第一坐标信息和第二位置B的第二坐标信息；以及获取禁停区域的第三位置C的第三坐标信息和第四位置D的第四坐标信息；其中，第一位置A和第二位置B呈对角分布，以及第三位置C和第四位置D呈对角分布；响应于停放区域的至少部分共享车辆位于禁停区域，则根据第一坐标信息、第二坐标信息、第三坐标信息以及第四坐标信息确定停放区域的共享车辆的停放位置与禁停区域的重合区域面积。
上述方案，基于停放区域的共享车辆处于对角位置处的第一位置A和第二位置B，以及禁停区域的处于对角位置处的第三位置C和第四位置D的坐标信息确定重合区域面积，能够有效提高获取的重合区域面积的精度。
其中，第四阈值不小于20％。这样能够保证共享车辆不会长时间处于禁停区域，对当前停放位置的道路、出行等造成影响的问题发生。
请参阅图7，图7为本公开一实施例提供的共享车辆的智能调度设备的结构示意图；在本实施例中，提供一种共享车辆的智能调度设备，该机器人包括存储器500和处理器501。
其中，存储器500中存储有程序指令，处理器501连接存储器500以调取程序指令并根据程序指令执行上述实施例所涉及的共享车辆的智能调度方法。
其中，处理器501还可以称为CPU(Central Processing Unit，中央处理单元)。处理器501可能是一种集成电路芯片，具有信号的处理能力。处理器501还可以是通用处理器、数字信号处理器(DSP)、专用集成电路(ASIC)、现场可编程门阵列(FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。
存储器500可以为内存条、TF卡等，可以存储共享车辆的智能调度设备中全部信息，包括输入的原始数据、计算机程序、中间运行结果和最终运行结果都保存在存储器500中。它根据控制器指定的位置存入和取出信息。有了存储器500，共享车辆的智能调度设备才有记忆功能，才能保证正常工作。共享车辆的智能调度设备中的存储器500按用途存储器可分为主存储器(内存)和辅助存储器(外存)，也有分为外部存储器和内部存储器的分类方法。外存通常是磁性介质或光盘等，能长期保存信息。内存指主板上的存储部件，用来存放当前正在执行的数据和程序，但仅用于暂 时存放程序和数据，关闭电源或断电，数据会丢失。
共享车辆的智能调度设备还包括其他的器件，其与现有技术中的共享车辆的智能调度设备中的其他器件及功能相同，在此不再赘述。
请参阅图8，图8为本公开一实施例提供的计算机可读存储介质的结构示意图。在本实施例中，提供一种计算机可读存储介质，该计算机可读存储介质存储有程序指令600，程序指令600被调取以执行上述实施例所涉及的共享车辆的智能调度方法。
其中，该程序指令600可以以软件产品的形式存储在上述存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)或处理器(processor)执行本公开各个实施方式方法的全部或部分步骤。而前述的存储装置包括：U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质，或者是计算机、服务器、手机、平板等终端设备。
本公开实施例还提供了一种计算机程序，包括计算机可读代码，当所述计算机可读代码在电子设备中运行时，所述电子设备中的处理器执行上述方法。
在本公开所提供的几个实施例中，应该理解到，所揭露的系统，装置、程序和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
另外，在本公开各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
以上所述仅为本公开的实施方式，并非因此限制本公开的专利范围，凡是利用本公开说明书及附图内容所作的等效结构或等效流程变换，或直接或间接运用在其他相关的技术领域，均同理包括在本公开的专利保护范围内。

Claims (20)

  1. 一种共享车辆的智能调度方法，包括：
    获取共享车辆的停放区域的图像；所述停放区域包括可停放区域和/或禁停区域；
    对所述图像进行解析，识别出所述停放区域的共享车辆的当前停放信息；
    基于所述当前停放信息及所述停放区域的预设停放信息，生成所述停放区域的共享车辆的调度信息。
  2. 根据权利要求1所述的方法，其中，所述停放区域的共享车辆的当前停放信息包括可停放区域的共享车辆的现场停放数量；
    所述停放区域的预设停放信息包括可停放区域的共享车辆的可停放数量。
  3. 根据权利要求2所述的方法，其中，所述基于所述当前停放信息及所述停放区域的预设停放信息，生成所述停放区域的共享车辆的调度信息的步骤包括：
    基于所述可停放区域的共享车辆的现场停放数量及所述可停放区域的共享车辆的可停放数量，确定所述可停放区域的共享车辆的拥堵信息；
    基于所述可停放区域的共享车辆的拥堵信息，生成所述可停放区域的共享车辆的调度信息。
  4. 根据权利要求3所述的方法，其中，所述基于所述可停放区域的共享车辆的现场停放数量及所述可停放区域的共享车辆的可停放数量，确定所述可停放区域的共享车辆的拥堵信息的步骤具体包括：
    响应于当前所述可停放区域的共享车辆的停放数量百分比大于第一阈值，则确定当前所述可停放区域的共享车辆处于拥堵状态；
    响应于当前所述可停放区域的共享车辆的停放数量百分比小于所述第二阈值，则确定当前所述可停放区域的共享车辆处于空闲状态；
    响应于当前所述可停放区域的共享车辆的停放数量百分比不大于所述第一阈值且不小于所述第二阈值，则确定当前所述可停放区域的共享车辆处于正常状态；其中，所述第一阈值大于所述第二阈值。
  5. 根据权利要求4所述的方法，其中，所述第一阈值为70％-90％；所述第二阈值为30％-60％。
  6. 根据权利要求3或4所述的方法，其中，所述基于所述可停放区域的共享车辆的现场停放数量及所述可停放区域的共享车辆的可停放数量，确定所述可停放区 域的共享车辆的拥堵信息的步骤之后，还包括：
    响应于所述可停放区域的共享车辆的拥堵信息大于第一阈值，则获取拥堵信息小于第二阈值的其它可停放区域的区域信息；
    所述基于所述可停放区域的共享车辆的拥堵信息，生成所述可停放区域的共享车辆的调度信息的步骤具体包括：
    基于与当前所述可停放区域距离最近的其它可停放区域的区域信息，生成当前所述可停放区域的共享车辆的调度信息。
  7. 根据权利要求6所述的方法，其中，所述基于所述可停放区域的共享车辆的现场停放数量及所述可停放区域的共享车辆的可停放数量，确定所述可停放区域的共享车辆的拥堵信息的步骤之后，包括：
    响应于所述可停放区域的共享车辆的拥堵信息大于第三阈值，生成并发送拥堵预警信号；其中，所述第三阈值大于所述第二阈值且小于所述第一阈值。
  8. 根据权利要求1所述的方法，其中，所述停放区域的共享车辆的当前停放信息包括所述停放区域的共享车辆的停放位置信息；其中，所述停放位置信息为所述共享车辆投影至所述停放区域所对应检测框的位置信息；
    所述停放区域的预设停放信息包括禁停区域的位置信息。
  9. 根据权利要求8所述的方法，其中，所述基于所述当前停放信息及所述停放区域的预设停放信息，生成所述停放区域的共享车辆的调度信息的步骤还包括：
    基于所述停放区域的共享车辆的停放位置信息及所述禁停区域的位置信息，确定所述停放区域的共享车辆的违停信息；
    基于所述停放区域的共享车辆的违停信息，生成所述共享车辆的调度信息。
  10. 根据权利要求9所述的方法，其中，所述基于所述停放区域的共享车辆的停放位置信息及所述停放区域的禁停区域的位置信息，确定所述停放区域的共享车辆的违停信息的步骤包括：
    基于所述停放区域的共享车辆的停放位置信息及所述禁停区域的位置信息，确定所述停放区域的共享车辆的停放位置与所述禁停区域的重合区域面积；
    响应于所述重合区域面积与所述共享车辆投影至所述停放区域所对应检测框的面积的比值不小于第四阈值，则确定所述共享车辆违停。
  11. 根据权利要求10所述的方法，其中，所述基于所述停放区域的共享车辆的 停放位置信息及所述停放区域的禁停区域的位置信息，确定所述停放区域的共享车辆的停放位置与所述禁停区域的重合区域面积，包括：
    获取所述停放区域的共享车辆的第一位置的第一坐标信息和第二位置的第二坐标信息；以及
    获取所述禁停区域的第三位置的第三坐标信息和第四位置的第四坐标信息；其中，所述第一位置和所述第二位置为所述共享车辆投影至所述停放区域所对应的检测框的顶点位置，所述第三位置和所述第四位置为所述禁停区域的顶点位置，且所述第一位置和所述第二位置呈对角分布，以及所述第三位置和所述第四位置呈对角分布；
    根据所述第一坐标信息、所述第二坐标信息、所述第三坐标信息以及所述第四坐标信息，确定所述停放区域的共享车辆的停放位置与所述禁停区域的重合区域面积。
  12. 根据权利要求10所述的方法，其中，所述第四阈值不小于20％。
  13. 根据权利要求1所述的方法，其中，所述生成所述停放区域的共享车辆的调度信息的步骤包括：
    识别所述共享车辆的颜色、种类、厂家、数量中的至少一种以作为所述调度信息。
  14. 根据权利要求1所述的方法，其中，在对所述图像进行解析之前，还包括：
    预先在所述图像中划定可停放区域并配置所述可停放区域的共享车辆的可停放数量；和/或预先在所述图像中划定所述禁停区域。
  15. 一种共享车辆的智能调度系统，包括：
    文件获取模块，用于获取到共享车辆的停放区域的图像；所述停放区域包括可停放区域和/或禁停区域；
    文件处理模块，与所述文件获取模块连接，用于对所述图像进行解析，识别出所述停放区域的共享车辆的当前停放信息；
    信息生成模块，与所述文件处理模块连接，用于基于所述当前停放信息及所述停放区域的预设停放信息，生成所述停放区域的共享车辆的调度信息。
  16. 根据权利要求15所述的共享车辆的智能调度系统，其中，所述停放区域的共享车辆的当前停放信息包括可停放区域的共享车辆的现场停放数量；所述停放区 域的预设停放信息包括可停放区域的共享车辆的可停放数量；
    所述信息生成模块进一步用于基于所述可停放区域的共享车辆的现场停放数量及所述可停放区域的共享车辆的可停放数量，确定所述可停放区域的共享车辆的拥堵信息；基于所述可停放区域的共享车辆的拥堵信息，生成所述可停放区域的共享车辆的调度信息。
  17. 根据权利要求15所述的共享车辆的智能调度系统，其中，所述停放区域的共享车辆的当前停放信息包括所述停放区域的共享车辆的停放位置信息；其中，所述停放位置信息为所述共享车辆投影至所述停放区域所对应检测框的位置信息；所述停放区域的预设停放信息包括禁停区域的位置信息；
    所述信息生成模块进一步用于基于所述停放区域的共享车辆的停放位置信息及所述禁停区域的位置信息，确定所述停放区域的共享车辆的违停信息；基于所述停放区域的共享车辆的违停信息，生成所述共享车辆的调度信息。
  18. 一种共享车辆的智能调度设备，包括：存储器和处理器，其中，所述存储器中存储有程序指令，所述处理器连接所述存储器以调取所述程序指令并根据所述程序指令执行如权利要求1至14中的任意一项所述的方法。
  19. 一种计算机可读存储介质，包括：存储有程序指令，所述程序指令能够被处理器执行以实现如权利要求1至14中的任意一项所述的方法。
  20. 一种计算机程序，包括：计算机可读代码，当所述计算机可读代码在电子设备中运行时，所述电子设备中的处理器执行用于实现权利要求1至14中的任意一项所述的方法。
PCT/CN2022/115286 2021-12-29 2022-08-26 共享车辆的智能调度方法、系统、设备及存储介质 Ceased WO2023124159A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111642738.4 2021-12-29
CN202111642738.4A CN114358563A (zh) 2021-12-29 2021-12-29 共享车辆的智能调度方法、系统、设备及存储介质

Publications (1)

Publication Number Publication Date
WO2023124159A1 true WO2023124159A1 (zh) 2023-07-06

Family

ID=81102469

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/115286 Ceased WO2023124159A1 (zh) 2021-12-29 2022-08-26 共享车辆的智能调度方法、系统、设备及存储介质

Country Status (2)

Country Link
CN (1) CN114358563A (zh)
WO (1) WO2023124159A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117079472A (zh) * 2023-08-11 2023-11-17 智慧互通科技股份有限公司 一种用于共享单车的违停识别方法
CN117912162A (zh) * 2024-01-22 2024-04-19 深圳市中智车联科技有限责任公司 一种共享单车的停放管理方法、系统、设备及存储介质
CN121236926A (zh) * 2025-12-01 2025-12-30 深圳聚瑞云控科技有限公司 一种电动两轮车违停检测方法、系统、设备及存储介质

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114358563A (zh) * 2021-12-29 2022-04-15 上海商汤信息科技有限公司 共享车辆的智能调度方法、系统、设备及存储介质
CN115346065B (zh) * 2022-07-05 2025-10-03 上海钧正网络科技有限公司 共享设备调度方法、装置、终端及存储介质
CN115641746A (zh) * 2022-09-29 2023-01-24 深圳市旗扬特种装备技术工程有限公司 一种共享单车空闲车位识别方法、停车引导方法及系统
CN115601953A (zh) * 2022-10-09 2023-01-13 上海汽车集团股份有限公司（Cn） 一种基于v2x的车辆调度方法、系统及云端服务器
CN115731688B (zh) * 2022-10-20 2025-04-15 汉海信息技术(上海)有限公司 一种停车围栏的生成方法、装置及服务器
CN115601090A (zh) * 2022-11-11 2023-01-13 浙江小族智能科技有限公司（Cn） 游乐车辆的调度方法、装置和电子设备
CN118038657B (zh) * 2023-12-12 2025-03-11 深圳市旗扬特种装备技术工程有限公司 一种共享电单车的违规停放检测方法、装置及存储介质
CN119380293A (zh) * 2024-12-25 2025-01-28 中科星图北岸科技(青岛)有限公司 一种违规停车检测方法、装置、设备以及存储介质

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106952468A (zh) * 2017-05-23 2017-07-14 周雷文 一种基于智慧灯杆的共享单车调度方法和系统、及智慧灯杆
CN106991807A (zh) * 2017-05-23 2017-07-28 周雷文 一种共享单车调度方法和系统
CN107203905A (zh) * 2017-05-19 2017-09-26 北京摩拜科技有限公司 共享车辆的调度方法、装置及服务器
CN109165879A (zh) * 2018-10-26 2019-01-08 浙江吉利汽车研究院有限公司 一种共享汽车自动调度方法及系统
CN109615925A (zh) * 2019-01-03 2019-04-12 上海钧正网络科技有限公司 基于视频监控的车辆停车控制方法、装置、系统及服务器
CN113066230A (zh) * 2021-03-17 2021-07-02 北京骑胜科技有限公司 共享车辆停车点调节方法、设备、存储介质及程序产品
CN113392799A (zh) * 2021-06-29 2021-09-14 中山大学 一种基于共享单车调配优化的目标检测方法
CN113610321A (zh) * 2021-08-23 2021-11-05 宁波小遛共享信息科技有限公司 一种停车点的共享车辆调度方法、装置及计算机设备
CN113781792A (zh) * 2021-09-06 2021-12-10 腾讯科技（深圳）有限公司 停放检测系统、方法及相关设备
CN114358563A (zh) * 2021-12-29 2022-04-15 上海商汤信息科技有限公司 共享车辆的智能调度方法、系统、设备及存储介质

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107203905A (zh) * 2017-05-19 2017-09-26 北京摩拜科技有限公司 共享车辆的调度方法、装置及服务器
CN106952468A (zh) * 2017-05-23 2017-07-14 周雷文 一种基于智慧灯杆的共享单车调度方法和系统、及智慧灯杆
CN106991807A (zh) * 2017-05-23 2017-07-28 周雷文 一种共享单车调度方法和系统
CN109165879A (zh) * 2018-10-26 2019-01-08 浙江吉利汽车研究院有限公司 一种共享汽车自动调度方法及系统
CN109615925A (zh) * 2019-01-03 2019-04-12 上海钧正网络科技有限公司 基于视频监控的车辆停车控制方法、装置、系统及服务器
CN113066230A (zh) * 2021-03-17 2021-07-02 北京骑胜科技有限公司 共享车辆停车点调节方法、设备、存储介质及程序产品
CN113392799A (zh) * 2021-06-29 2021-09-14 中山大学 一种基于共享单车调配优化的目标检测方法
CN113610321A (zh) * 2021-08-23 2021-11-05 宁波小遛共享信息科技有限公司 一种停车点的共享车辆调度方法、装置及计算机设备
CN113781792A (zh) * 2021-09-06 2021-12-10 腾讯科技（深圳）有限公司 停放检测系统、方法及相关设备
CN114358563A (zh) * 2021-12-29 2022-04-15 上海商汤信息科技有限公司 共享车辆的智能调度方法、系统、设备及存储介质

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117079472A (zh) * 2023-08-11 2023-11-17 智慧互通科技股份有限公司 一种用于共享单车的违停识别方法
CN117912162A (zh) * 2024-01-22 2024-04-19 深圳市中智车联科技有限责任公司 一种共享单车的停放管理方法、系统、设备及存储介质
CN121236926A (zh) * 2025-12-01 2025-12-30 深圳聚瑞云控科技有限公司 一种电动两轮车违停检测方法、系统、设备及存储介质

Also Published As

Publication number Publication date
CN114358563A (zh) 2022-04-15

Similar Documents

Publication Publication Date Title
CN114358563A (zh) 共享车辆的智能调度方法、系统、设备及存储介质
WO2024011926A1 (zh) 基于5g的安防监控系统、方法、电子设备及存储介质
CN116486472A (zh) 监控视频的群体行为识别方法以及系统
WO2022052412A1 (zh) 一种违法数据识别方法及装置、电子设备
CN111866163A (zh) 一种基于多维信息处理的变电作业安全管控系统及方法
JP2018537777A (ja) モノのインターネット情報システム
CN112866332A (zh) 基于云边融合实现突发事件识别预警的系统、方法、装置、处理器及其存储介质
CN211237117U (zh) 一种公交站台报警系统
CN103093638B (zh) 一种基于地理信息的智能交通服务系统
CN106682590A (zh) 一种监控业务的处理方法以及服务器
CN102523236B (zh) 一种动态连接建立方法和设备
US12187307B2 (en) Vehicle communication method and apparatus, computer-readable storage medium, and electronic device
CN103886773A (zh) 一种b/s环境下在gis地图上实时监测出租车的方法
CN116363865A (zh) 交通拥堵评估方法、装置、电子设备及存储介质
CN117435112B (zh) 数据处理方法、系统及装置、电子设备和存储介质
CN117058910A (zh) 一种公交车调度方法
CN118135813A (zh) 基于雷视融合的独立路段行人过街信号控制方法及系统
CN116663934A (zh) 一种融合监控数据的交通事件处理方法与系统
CN215186950U (zh) 一种基于人脸识别技术的行人闯红灯行为证据采集装置
CN112115792B (zh) 一种出入口信息统计系统、方法及计算机设备
CN115630814A (zh) 城市管理方法、装置、终端设备以及存储介质
CN116071698A (zh) 预警方法、装置、电子设备及存储介质
CN114666426A (zh) 数据解析方法、装置及存储介质
CN111901561A (zh) 监控系统中的视频数据处理方法、装置、系统及存储介质
CN115731688A (zh) 一种停车围栏的生成方法、装置及服务器

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22913441

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 22913441

Country of ref document: EP

Kind code of ref document: A1

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 21.08.2024)

122 Ep: pct application non-entry in european phase

Ref document number: 22913441

Country of ref document: EP

Kind code of ref document: A1