A new energy charging pile parking scheduling system and method thereof

Abstract

The application discloses a new energy charging pile parking scheduling system and method, and relates to the technical field of new energy charging pile scheduling.The system comprises a parking lot database module, a data updating module, a parking space charging pile locking module, a parking space recommendation optimization module, a client and a scheduling module, and is used for matching the charging pile and the parking space in the appropriate parking lot by collecting the information of the vehicle and combining the demand of the user, so that the charging pile can meet the demand of the user to the maximum extent in the simple searching process.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of new energy charging pile scheduling, in particular to a new energy charging pile parking scheduling system and method. BACKGROUND

[0002] When the new energy vehicle needs to be charged during driving, the user needs to manually find the surrounding parking lot and check whether there is an idle charging pile inside to select a suitable parking lot for charging. The above process of finding a charging pile is not only cumbersome but also cannot find a suitable parking lot in time. SUMMARY

[0003] The present application provides a new energy charging pile parking scheduling system and method, which allocates charging piles and parking spaces in suitable parking lots by collecting vehicle information and combining user needs, so that the found charging pile can meet the user's needs to the greatest extent.

[0004] The present application provides a new energy charging pile parking scheduling system, which comprises a parking lot database module, a data updating module, a parking space and charging pile locking module, a parking space recommendation optimization module, a client and a scheduling module.

[0005] The parking lot database module stores data of all parking lots.

[0006] The parking lot data updating module is used to monitor all parking lots and update the data stored in the parking lot database module when the data changes.

[0007] The client is used to collect the real-time position and real-time remaining power of the user's vehicle, and is also used to send a charging demand.

[0008] The scheduling module is used to receive the charging demand sent by the client, obtain the real-time position and real-time remaining power of the user's vehicle, recommend several parking lots for the user to select, and allocate parking spaces and charging piles for the user's vehicle after the user selects a parking lot.

[0009] The parking space and charging pile locking module is used to lock the allocated charging pile and parking space, and is also used to identify the user. If the identification result is a matching user, the locking state is released, and if the identification result is a non-matching user, the locking state is maintained.

[0010] The parking space recommendation optimization module is used to record the time used by the user to park each time when the selection is simple, and does not optimize the recommended parking space when the parking time is less than a threshold value, and optimizes the recommended parking space when the parking time is greater than the threshold value.

[0011] In a second aspect, a new energy charging pile parking scheduling method comprises the following steps:

[0012] A user initiates a charging demand.

[0013] Real-time positions and real-time residual capacities of vehicles are acquired, and a number of parking lots are recommended for the user to select according to the charging demand, the real-time positions and the real-time residual capacities of the vehicles.

[0014] Charging piles and parking spaces in the parking lot are allocated according to the selection of the user.

[0015] Further, the charging demand initiated by the user comprises a parking difficulty demand and a charging waiting demand.

[0016] Further, the parking difficulty comprises two kinds of simple and normal, when the user selects the normal difficulty, the charging piles and the parking spaces in the parking lot are allocated only according to the charging waiting demand and the real-time residual capacity of the vehicle, and when the user selects the simple difficulty, the charging piles and the parking spaces in the parking lot are allocated according to the distribution of vehicles in the parking lot on the basis of the charging waiting demand and the real-time residual capacity of the vehicle.

[0017] Further, the charging waiting demand comprises two kinds of waitable and unwaitable, when the unwaitable is selected, the parking lot without idle charging piles is excluded, and when the waitable is selected, all the parking lots are traversed in order according to the distance from the user vehicle to the surrounding parking lots.

[0018] Further, the waiting time of the waitable has a plurality of options, and all the parking lots are traversed in order according to the distance from the user vehicle to the surrounding parking lots according to the selected waiting time of the user.

[0019] Further, after the user selects the parking lot and the charging piles and the parking spaces are allocated, the parking lot is locked, and the parking space is skipped in the subsequent allocation of the charging piles and the parking spaces by other vehicles.

[0020] Further, the specific process of allocating the charging piles and the parking spaces comprises:

[0021] All idle parking spaces and charging piles in the parking lot are detected.

[0022] Parking spaces and charging piles for the user are screened.

[0023] The screened parking spaces and charging piles are locked, and users other than the user allocated in the parking spaces and the charging piles are prohibited from parking and using the charging piles.

[0024] The above technical solution provided by the embodiment of the application has at least the following beneficial effects: the charging piles and the parking spaces in the appropriate parking lot are allocated by collecting the information of the vehicle and combining the demand of the user, so that the charging piles found can meet the demand of the user to the greatest extent, and the finding process is simple.

[0025] Other features and advantages of the present application will be set forth in the description that follows, and in part will be apparent from the description, or can be learned by practice of the application. The purposes and other advantages of the present application will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.

[0026] The technical solutions of the present application are described in further detail below with the help of the accompanying drawings and examples. BRIEF DESCRIPTION OF DRAWINGS

[0027] The accompanying drawings are included to provide a further understanding of the present application and are incorporated in and constitute a part of the specification, illustrate embodiments of the present application and, together with the description, serve to explain the present application. In the drawings:

[0028] Fig. 1 A flowchart of a new energy charging pile parking scheduling method disclosed by an embodiment of the present application is shown in the figure.

[0029] Fig. 2 A structure diagram of a new energy charging pile parking scheduling system disclosed by an embodiment of the present application is shown in the figure.

[0030] Fig. 3 A first example diagram of user initiated charging demand disclosed by embodiment 1 of the present application is shown in the figure.

[0031] Fig. 4 A second example diagram of user initiated charging demand disclosed by embodiment 1 of the present application is shown in the figure.

[0032] Fig. 5 A distribution diagram of new energy vehicles in a parking lot disclosed by an embodiment of the present application is shown in the figure.

[0033] Reference signs:

[0034] 1, parking lot database module; 2, data update module; 3, parking space charging pile locking module; 4, parking space recommendation optimization module; 5, client; 6, scheduling module. DETAILED DESCRIPTION

[0035] Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure can be implemented in various forms and should not be limited by the embodiments described herein. Rather, these embodiments are provided so that the present disclosure can be more thoroughly understood and the scope of the present disclosure can be accurately conveyed to those skilled in the art.

[0036] Embodiment one

[0037] As Figs. 1-3As shown in FIGS. 5, the embodiment of the present application provides a new energy charging pile parking scheduling method, comprising the following steps:

[0038] S1, a user initiates a charging demand;

[0039] In an embodiment, the user can initiate the charging demand through a mobile phone or a vehicle machine, and complete the operation of initiating the charging demand by touching a virtual button on a screen;

[0040] In the above embodiment, the options of the virtual button on the screen include a first-level option "charging" button, a second-level sub-option "parking difficulty demand" button, a third-level sub-option "charging waiting demand" button, and a fourth-level sub-option "complete" button. After the user touches the "complete" button, the charging demand is sent out;

[0041] It should be noted that the "charging waiting demand" button includes "waitable" and "unwaitable" options. When the "waitable" option is selected, it further includes "5 minutes", "10 minutes", "15 minutes", and "20 minutes" options. When the "unwaitable" option is selected, it directly jumps to the fourth-level sub-option "complete" button;

[0042] The "parking difficulty demand" button includes "simple" and "normal". One of them is selected to jump to the "charging waiting demand" button.

[0043] In another embodiment, the user can initiate the charging demand by inputting a voice instruction. When the user needs to charge, the operation of initiating the charging demand is completed by outputting the voice instruction;

[0044] In the above embodiment, after the voice instruction "I need to charge" is sent out, a virtual button appears on the screen of the mobile phone or the vehicle machine. The options of the virtual button include a first-level option "charging" button, a second-level sub-option "parking difficulty demand" button, a third-level sub-option "charging waiting demand" button, and a fourth-level sub-option "complete" button. After the user touches the "complete" button, the charging demand is sent out;

[0045] It should be noted that the "charging waiting demand" button includes "waitable" and "unwaitable" options. When the "waitable" option is selected, it further includes "5 minutes", "10 minutes", "15 minutes", and "20 minutes" options. When the "unwaitable" option is selected, it directly jumps to the fourth-level sub-option "complete" button;

[0046] The "parking difficulty demand" button includes "simple" and "normal". One of them is selected to jump to the "charging waiting demand" button.

[0047] S2, the real-time position and the real-time remaining power of the vehicle are obtained, and a plurality of parking lots are recommended for the user to select according to the charging demand, the real-time position, and the real-time remaining power of the vehicle;

[0048] In the first embodiment, the parking difficulty requirement is that the user selects normal difficulty, the charging waiting requirement is that the user selects non-waiting, first, the parking lots without idle charging piles are excluded, then all the parking lot data are traversed according to the distance from the user's vehicle to the surrounding parking lots, the traversed parking lots are arranged in descending order of the degree of compliance, and the first five are recommended to the user for selection.

[0049] In the second embodiment, the parking difficulty requirement is that the user selects normal difficulty, the charging waiting requirement is that the user selects waiting, all the parking lot data are traversed according to the distance from the user's vehicle to the surrounding parking lots, the traversed parking lots are arranged in descending order of the degree of compliance, and the first five are recommended to the user for selection.

[0050] In the third embodiment, the parking difficulty requirement is that the user selects simple difficulty, the charging waiting requirement is that the user selects waiting, all the parking lot data are traversed according to the distance from the user's vehicle to the surrounding parking lots, the traversed parking lots are arranged in descending order of the degree of compliance, and the first five are recommended to the user for selection.

[0051] In the fourth embodiment, the parking difficulty requirement is that the user selects simple difficulty, the charging waiting requirement is that the user selects non-waiting, first, the parking lots without idle charging piles are excluded, then all the parking lot data are traversed according to the distance from the user's vehicle to the surrounding parking lots, the traversed parking lots are arranged in descending order of the degree of compliance, and the first five are recommended to the user for selection.

[0052] It should be noted that in the third and fourth embodiments, when analyzing the parking difficulty, the distribution of vehicles in the parking lot is first analyzed, the parking lot in which two or more adjacent parking spaces are in an idle state is marked as low difficulty, then the first five are recommended to the user for selection from the marked low difficulty parking lot in descending order of the degree of compliance.

[0053] S3, according to the user's selection, allocating charging piles and parking spaces in the parking lot.

[0054] The specific process of allocating charging piles and parking spaces includes:

[0055] Detecting all idle parking spaces and charging piles in the parking lot;

[0056] Screening parking spaces and charging piles for user use;

[0057] Locking the screened parking spaces and charging piles, and prohibiting users who are not allocated here from parking and using charging piles.

[0058] It should be noted that the lock is automatically locked, and whether the current vehicle is the vehicle allocated to the parking space and the charging pile is determined by judging the license plate number. After the current charging pile and parking space are locked, the automatic lock is raised to block other vehicles from entering, and the charging pile is locked, so that other vehicles cannot successfully connect for charging. When it is identified that the license plate of the current vehicle is the vehicle allocated to the parking space and the charging pile, the automatic lock is lowered, and the charging pile is unlocked.

[0059] Embodiment two

[0060] The embodiment of the application also discloses a new energy charging pile parking scheduling system, which comprises a parking lot database module 1, a data updating module 2, a parking space and charging pile locking module 3, a parking space recommendation optimization module 4, a client 5 and a scheduling module 6. Figs. 1-5

[0061] The parking lot database module 1 stores data of all parking lots;

[0062] The parking lot data updating module 2 is used for monitoring all parking lots, and updating the data stored in the parking lot database module 1 when there is data change;

[0063] The client 5 is used for collecting the real-time position and real-time residual power of a user's vehicle and is also used for sending a charging demand;

[0064] The scheduling module 6 is used for receiving the charging demand sent by the client 5 and is also used for acquiring the real-time position and real-time residual power of the user's vehicle, recommending a plurality of parking lots for the user to select, and allocating a parking space and a charging pile for the user's vehicle after the user selects a parking lot;

[0065] The parking space and charging pile locking module 3 is used for locking the allocated charging pile and parking space and is also used for identifying the user. If the identification result is a matched user, the locking state is released, and if the identification result is a non-matched user, the locking state is maintained;

[0066] The parking space recommendation optimization module 4 is used for recording the parking time of a user each time the user selects a simple parking difficulty. When the parking time is less than a threshold value, the recommended parking space is not optimized, and when the parking time is greater than the threshold value, the recommended parking space is optimized;

[0067] For example, if there is an idle parking space beside the recommended parking space and the user's parking time is greater than the threshold value, the next time the parking space is allocated, a parking space with idle parking spaces on both sides is allocated. When the user's subsequent parking time is less than the threshold value for three times in succession, the parking space allocation method returns to the initial state.

[0068] ​It should be understood that the particular order in which the steps of processes presented in the disclosure have been presented can be rearranged. Furthermore, various aspects of the disclosure can be used alone or in various combinations. In the appended claims, means-plus-function or step-plus-function clauses can have their application interpreted merely as open-ended limits of a particular combination of steps that are done on the apparatus, as specified in 35 U.S.C. § 112(f). However, the steps of the claims are not to be interpreted as requiring their performance in the order recited.

[0069] In the detailed description above, various features are grouped together in single embodiments for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting a necessity to more features than are expressly identified in each claim. Rather, inventive functionality can be more effectively disclosed by grouping features in a single claim. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate preferred embodiment.

[0070] Those skilled in the art will further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed herein can be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans can implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

[0071] The steps of a method or algorithm described in connection with the embodiments disclosed herein can be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module can reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium can be integral to the processor. The processor and the storage medium can reside in an ASIC. The ASIC can reside in a user terminal. In the alternative, the processor and the storage medium can reside as discrete components in a user terminal.

[0072] For a software implementation, the techniques described herein can be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. The software codes can be stored in memory units and executed by processors. The memory unit can be implemented within the processor or external to the processor, in which case it can be communicatively coupled to the processor via various means as is known in the art.

[0073] The above description includes examples of one or more embodiments. Of course, not all possible combinations of components or methods described above can be claimed as embodiments. One of ordinary skill in the art can recognize that modifications and variations of the described embodiments can be practiced that are still within the scope of the present application. Therefore, the described embodiments are intended to cover all such modifications and variations as are within the scope of the following claims. Further, the description herein is intended to enable practitioners of the art to practice the application as claimed. Also, the use of any term "means" or "machine" or "apparatus" or "device" or "component" or "step" or "element" or "step" or "member" or "block" or "module" or "circuit" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor" or "processor"

Claims

1. A new energy charging pile parking dispatching system, characterized in that: The parking lot database module (1), the data updating module (2), the parking space and charging pile locking module (3), the parking space recommendation optimization module (4), the client (5) and the scheduling module (6) are included. The parking lot database module (1) stores the data of all parking lots. The parking lot data updating module (2) is used for monitoring all parking lots, and updating the data stored in the parking lot database module (1) when the data changes. The client (5) is used for collecting the real-time position and the real-time remaining power of the user's vehicle, and is also used for issuing a charging demand. The charging demand initiated by the user includes a parking difficulty demand and a charging waiting demand. The parking difficulty includes two kinds of simple and normal, when the user selects the normal difficulty, only the charging waiting demand and the real-time remaining power of the vehicle are used to allocate the charging pile and the parking space in the parking lot, when the user selects the simple difficulty, the distribution of the vehicles in the parking lot is also used to allocate the charging pile and the parking space in the parking lot on the basis of the charging waiting demand and the real-time remaining power of the vehicle. The charging waiting demand includes two kinds of waitable and unwaitable, when the unwaitable is selected, the parking lot without idle charging pile is excluded, when the waitable is selected, all parking lots are traversed in order according to the distance from the user's vehicle to the surrounding parking lots. The scheduling module (6) is used for receiving the charging demand issued by the client (5), and is also used for acquiring the real-time position and the real-time remaining power of the user's vehicle, and recommending a plurality of parking lots for the user to select, and allocating the parking space and the charging pile of the user's vehicle after the user selects the parking lot. The parking space and charging pile locking module (3) is used for locking the allocated charging pile and parking space, and is also used for identifying the user, and releasing the locking state if the identification result is the matching user, and keeping the locking state if the identification result is the non-matching user. The specific process of allocating the charging pile and the parking space includes: Detecting all idle parking spaces and charging piles in the parking lot; Screening the parking spaces and charging piles for the user to use; Locking the screened parking spaces and charging piles, and prohibiting the non-allocated user from parking and using the charging pile; The parking space recommendation optimization module (4) is used for recording the parking time of the user selecting the simple parking difficulty each time, and optimizing the recommended parking space when the parking time is greater than the threshold value. A new energy charging pile parking scheduling method using a new energy charging pile parking scheduling system includes the following steps: The user initiates a charging demand; Acquiring the real-time position and the real-time remaining power of the vehicle, and recommending a plurality of parking lots for the user to select according to the charging demand, the real-time position and the real-time remaining power of the vehicle; Allocating the charging pile and the parking space in the parking lot according to the user's selection; The waitable time has a plurality of options, and all parking lots are traversed in order according to the distance from the user's vehicle to the surrounding parking lots according to the selected waitable time of the user; After the user selects the parking lot and allocates the charging pile and the parking space, the parking space is locked, and other vehicles are skipped in the subsequent allocation of the charging pile and the parking space.

Images