Method and device for processing vehicle service resources in expressway service area and medium

Abstract

The invention discloses a processing method and device for vehicle service resources in a highway service area and a medium, and can be widely applied to the technical field of vehicle management. After all vehicle data in a service area are acquired, vehicles in the service area are classified according to the vehicle data to obtain second vehicle data including first type vehicle data, second type vehicle data and third type vehicle data; the first type of parking space data, the second type of parking space data, the third type of parking space data and the parking space data are obtained at the same time, and then all vehicle parking service resources in the service area are managed according to the second vehicle data and the parking space data, so that the phenomenon that vehicles are parked disorderly and occupy parking spaces can be reduced; and the reasonable utilization rate of parking space service resources in the expressway service area is effectively improved.

Description

Technical Field

[0001] The present application relates to the field of vehicle management technology, and in particular to a method, device and medium for processing vehicle service resources in a highway service area. Background Art

[0002] In the related technology, with the rapid development of the automobile market, the types of vehicles in service areas are becoming increasingly diverse, and the vehicle management process in service areas is becoming more and more complicated. At present, the vehicle management process in service areas is just a simple hierarchical and zoned induction parking for vehicles. This management method allows some key vehicle owners to park arbitrarily and occupy too many parking spaces or unreasonable parking areas. For example, the charging parking spaces for new energy electric vehicles are occupied by oil vehicles or non-charging vehicles, resulting in the inability of electric vehicles that need to be charged to use the charging function; for example, cars occupy the parking spaces for trucks, resulting in the inability of trucks to stop, which in turn leads to a low reasonable utilization rate of the parking space service resources in the service area.

[0003] In summary, the technical problems existing in the relevant technologies need to be improved. Summary of the invention

[0004] The main purpose of the embodiments of the present application is to propose a method, device and medium for processing vehicle service resources in a highway service area, which can effectively improve the reasonable utilization rate of parking service resources in a highway service area.

[0005] To achieve the above purpose, one aspect of an embodiment of the present application provides a method for processing vehicle service resources in a highway service area, the method comprising the following steps:

[0006] Acquire all vehicle data in the service area as first vehicle data;

[0007] Classifying vehicles in the service area according to the first vehicle data to obtain second vehicle data, where the second vehicle data includes first type vehicle data, second type vehicle data and third type vehicle data;

[0008] Acquire parking space data of a service area, wherein the parking space data includes first type parking space data, second type parking space data and third type parking space data;

[0009] All vehicle parking service resources in the service area are managed according to the second vehicle data and the parking space data.

[0010] In some embodiments, the acquiring of all vehicle data in the service area as first vehicle data includes:

[0011] Get the entrance vehicle information of the service area;

[0012] Extracting the first license plate number, entry record time and license plate color from the entry vehicle information;

[0013] Obtain the exit vehicle information of the service area;

[0014] Extracting the second license plate number from the export vehicle information;

[0015] Determining vehicles still staying in the service area according to the first license plate number and the second license plate number;

[0016] The license plate color and entry recording time corresponding to the vehicle still staying in the service area are used as the first vehicle data.

[0017] In some embodiments, classifying vehicles in the service area according to the first vehicle data to obtain second vehicle data includes:

[0018] Calculate the length of time the corresponding vehicle stays in the service area according to the entry record time in the first vehicle data;

[0019] Determine a vehicle of key concern according to the stay duration and the first duration threshold;

[0020] The key vehicles are classified according to the license plate colors in the first vehicle data to obtain the second vehicle data.

[0021] In some embodiments, managing all vehicle parking service resources in the service area according to the second vehicle data and the parking space data includes:

[0022] Obtaining the license plate number, charging reservation time and estimated charging duration of the first type of vehicle data;

[0023] Counting the number of vehicles waiting to be charged according to the license plate numbers of the first type of vehicle data;

[0024] Calculate the estimated waiting time for charging according to the number of vehicles waiting for charging, the estimated charging time and the number of charging piles;

[0025] Get the working status of each charging pile;

[0026] When the working state is in working state, obtaining the charging time of the vehicle in the parking space corresponding to the first type of parking space data;

[0027] When the working state is in an idle state and there is a vehicle in the parking space corresponding to the first type of parking space data, the vehicle occupancy time is calculated according to the charging reservation time;

[0028] Sending a vehicle moving reminder message to the owner terminal of the corresponding vehicle according to the parking space occupancy time;

[0029] When the working state is in an idle state and there is no vehicle in the parking space corresponding to the first type of parking space data, a charging reminder message is sent to the owner terminal of the corresponding vehicle according to the charging reservation time, and the estimated waiting time for charging is updated.

[0030] In some embodiments, managing all vehicle parking service resources in the service area according to the second vehicle data and the parking space data includes:

[0031] Counting the number of real-time vehicles of the second type according to the second type of vehicle data;

[0032] Counting the total number of second-type parking spaces according to the second-type parking space data;

[0033] Obtain the total number of remaining third type parking spaces in the third type parking space data;

[0034] The parking process of the second type of vehicles or the second type of parking space data is managed according to the real-time number of the second type of vehicles, the total number of the second type of parking spaces or the total number of the remaining third type of parking spaces.

[0035] In some embodiments, managing the parking process of the second type of vehicles or the second type of parking space data according to the second type of real-time vehicle number, the total number of the second type of parking spaces, or the total number of the remaining third type of parking spaces includes:

[0036] When the number of the second type of real-time vehicles is less than the total number of the second type of parking spaces, the number of parked vehicles in the second type of parking spaces is obtained, and the parking process of the second type of vehicles or the second type of parking space data is managed according to a first difference between the number of the second type of real-time vehicles and the number of parked vehicles in the second type of parking spaces;

[0037] When the real-time number of vehicles of the second type is greater than or equal to the total number of parking spaces of the second type, the number of parked vehicles of the second type is obtained, and the parking process of the second type of vehicles or the second type of parking space data is managed based on a first difference between the real-time number of vehicles of the second type and the number of parked vehicles of the second type and the total number of remaining parking spaces of the third type.

[0038] In some embodiments, managing the parking process of the second type of vehicle or the second type of parking space data according to the first difference between the real-time number of the second type of vehicles and the number of the second type of parking spaces parked includes:

[0039] When the first difference is 0, the actual remaining parking spaces of the second type are obtained, and the second difference between the total number of parking spaces of the second type and the real-time number of vehicles of the second type is calculated; when the second difference is not equal to the actual remaining parking spaces of the second type, the vehicles that are occupied in the number of parked parking spaces of the second type are obtained, and a vehicle moving prompt message is sent to the corresponding owner terminal of the vehicle occupying the parking space;

[0040] When the first difference is not 0, the actual remaining parking spaces of the second type are obtained, and the second type of vehicles parked outside the second type of parking spaces are determined; and a vehicle moving prompt message is sent to the owner terminal of the second type of vehicles parked outside the second type of parking spaces.

[0041] In some embodiments, managing the parking process of the second type of vehicle or the second type of parking space data according to the first difference between the second type of real-time vehicle number and the second type of parked parking space number and the total number of remaining third type of parking spaces includes:

[0042] Obtaining a duration during which the total number of remaining third-type parking spaces is greater than a parking space threshold;

[0043] When the duration is greater than the second duration threshold, calculating the total number of parking spaces of the fourth type according to the total number of remaining parking spaces of the third type;

[0044] Calculating a third difference between the first difference and the total number of parking spaces of the fourth type;

[0045] The parking process of the second type of vehicle is managed according to the third difference.

[0046] To achieve the above objective, another aspect of the present application provides a computer device, including:

[0047] at least one processor;

[0048] at least one memory for storing at least one program;

[0049] When the at least one program is executed by the at least one processor, the at least one processor implements the above method.

[0050] To achieve the above objective, another aspect of an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program implements the above method when executed by a processor.

[0051] The embodiments of the present application include at least the following beneficial effects: The present application provides a method, device and medium for processing vehicle service resources in a highway service area. After acquiring all vehicle data in the service area, the scheme classifies the vehicles in the service area according to the vehicle data to obtain second vehicle data including first type vehicle data, second type vehicle data and third type vehicle data, and simultaneously acquires first type parking space data, second type parking space data and third type parking space data and parking space data, and then manages all vehicle parking service resources in the service area according to the second vehicle data and parking space data, thereby reducing the phenomenon of vehicles being parked randomly and occupying parking spaces, and effectively improving the reasonable utilization rate of parking space service resources in highway service areas. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] Figure 1 is a flow chart of a method for processing vehicle service resources in a highway service area provided in an embodiment of the present application;

[0053] Figure 2 It is an application flow chart of a method for processing vehicle service resources in a highway service area provided in an embodiment of the present application;

[0054] Figure 3 It is a schematic diagram of the hardware structure of the computer device provided in the embodiment of the present application. DETAILED DESCRIPTION

[0055] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application is further described in detail below in conjunction with the accompanying drawings and examples. It should be understood that the specific embodiments described herein are only used to explain the present application and are not intended to limit the present application. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the embodiments of the present application, they are only examples of devices and methods consistent with some aspects of the embodiments of the present application.

[0056] The embodiment of the present application provides a method, device and medium for processing vehicle service resources in a highway service area. After acquiring all vehicle data in the service area, the embodiment classifies the vehicles in the service area according to the vehicle data to obtain second vehicle data including first type vehicle data, second type vehicle data and third type vehicle data, and simultaneously acquires first type parking space data, second type parking space data and third type parking space data and parking space data, and then manages all vehicle parking service resources in the service area according to the second vehicle data and parking space data, thereby reducing the phenomenon of vehicles being parked randomly and occupying parking spaces, and effectively improving the reasonable utilization rate of parking space service resources in highway service areas.

[0057] The processing method of vehicle service resources in a highway service area provided in the embodiment of the present application relates to the field of vehicle management technology. The processing method of vehicle service resources in a highway service area provided in the embodiment of the present application can be applied to a terminal, can also be applied to a server, and can also be software running in a terminal or a server. In some embodiments, the terminal can be a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart speaker, a smart watch, and a vehicle-mounted terminal, etc., but is not limited to this; the server side can be configured as an independent physical server, or it can be configured as a server cluster or a distributed system composed of multiple physical servers, and can also be configured as a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms. The server can also be a node server in a blockchain network; the software can be an application that implements the processing method of vehicle service resources in a highway service area, etc., but is not limited to the above forms.

[0058] The present application can be used in many general or special computer system environments or configurations. For example: personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments including any of the above systems or devices, etc. The present application can be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present application can also be practiced in distributed computing environments, in which tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules can be located in local and remote computer storage media including storage devices.

[0059] Figure 1 is an optional flowchart of a method for processing vehicle service resources in a highway service area provided in an embodiment of the present application. Figure 1 The method may include but is not limited to steps S101 to S106.

[0060] Step S110, acquiring all vehicle data in the service area as first vehicle data;

[0061] Step S120: classify the vehicles in the service area according to the first vehicle data to obtain second vehicle data, wherein the second vehicle data includes first type vehicle data, second type vehicle data and third type vehicle data;

[0062] Step S130, obtaining parking space data of the service area, wherein the parking space data includes first type parking space data, second type parking space data and third type parking space data;

[0063] Step S140: managing parking service resources for all vehicles in the service area according to the second vehicle data and the parking space data.

[0064] In an embodiment of the present application, the entrance vehicle information and exit vehicle information of the service area can be obtained through the high-definition card port at the entrance of the service area and the ETC antenna vehicle passing record, and the first license plate number CarID1, entry record time CarTime and license plate color Carcolor in the entrance vehicle information are extracted, and the second license plate number CarID2 in the exit vehicle information is extracted. When the first license plate number CarID1 and the second license plate number CarID2 are the same, it is determined that the corresponding vehicle is still staying in the service area; when the first license plate number CarID1 and the second license plate number CarID2 are the same, it is determined that the corresponding vehicle has left the service area, and the license plate color and entry record time corresponding to the vehicle still staying in the service area are used as the first vehicle data.

[0065] It is understandable that if Figure 2 As shown, after confirming the vehicles still staying in the service area, the number of vehicles N(t) staying in the current service area is counted as follows:

[0066] N(t)=N(t-1)+Ql(t)-Qc(t);

[0067] Among them, N(t) represents the number of vehicles at the current time, N(t-1) represents the number of vehicles in the service area at the previous moment, t is the current time, Ql(t) is the number of vehicles entering the service area, and Qc(t) is the number of vehicles leaving the service area.

[0068] In the embodiment of the present application, after determining the number of vehicles staying in the service area, it is also necessary to classify the vehicles staying in the server to obtain the second vehicle data. Specifically, the classification process includes but is not limited to the following steps:

[0069] Calculate the length of time the corresponding vehicle stays in the service area according to the entry record time in the first vehicle data;

[0070] Determine the vehicles of key concern based on the residence time and the first time threshold;

[0071] The vehicle of interest is classified according to the license plate color in the first vehicle data to obtain the second vehicle data.

[0072] It is understandable that the length of time a vehicle stays in a service area can be calculated using the following formula:

[0073] T m=t-CarTime_1;

[0074] In the formula, T m Indicates the length of time the vehicle stays in the service area, t indicates the current time, and CarTime_l indicates the time of entering the service area.

[0075] In this embodiment, the dwell time T m and the first duration threshold T Z For comparison, when the stay time is T m Greater than the first duration threshold T Z , and the corresponding vehicle is regarded as a key focus vehicle. Then the key focus vehicles are classified according to the license plate color. Specifically, the first type of vehicle data includes new energy vehicle data, the second type of vehicle data includes key vehicle data, and the third type of vehicle data includes fuel car data. Among them, key vehicles include but are not limited to large trucks, buses, trailers, etc.

[0076] In an embodiment of the present application, after completing the classification of all vehicles in the service area, the parking process of different types of vehicles can be managed separately. Specifically, the embodiment of the present application mainly manages charging pile parking spaces and key vehicle parking spaces. It can be understood that the parking space status of the embodiment of the present application and the type and license plate number of the corresponding vehicle in the parking space can be obtained through image recognition. In the process of charging pile parking space management, a data processing center, a vehicle charging reservation module, a charging pile status identification module and a parking space status identification module can be pre-set in the charging pile management system. The data processing center can receive data from the vehicle charging reservation module, the charging pile status identification module and the parking space status identification module.

[0077] It can be understood that when managing the charging pile parking space, the process of managing all vehicle parking service resources in the service area according to the second vehicle data and the parking space data in the embodiment of the present application includes but is not limited to the following steps:

[0078] Obtaining the license plate number, charging reservation time and estimated charging duration of the first type of vehicle data;

[0079] Counting the number of vehicles waiting to be charged according to the license plate numbers of the first type of vehicle data;

[0080] Calculate the estimated waiting time for charging based on the number of vehicles waiting for charging, the estimated charging time and the number of charging piles;

[0081] Get the working status of each charging pile;

[0082] When the working state is in working state, obtaining the charging time of the vehicle in the parking space corresponding to the first type of parking space data;

[0083] When the working state is in an idle state and there is a vehicle in the parking space corresponding to the first type of parking space data, the vehicle occupancy time is calculated according to the charging reservation time;

[0084] Send a reminder message to the owner of the corresponding vehicle based on the parking space occupancy time;

[0085] When the working state is idle and there is no vehicle in the parking space corresponding to the first type of parking space data, a charging reminder message is sent to the owner terminal of the corresponding vehicle according to the charging reservation time, and the estimated waiting time for charging is updated.

[0086] It is understandable that, assuming that new energy vehicles that need to be charged enter the service area, they will make a charging reservation through the vehicle reservation module and wait for charging notification. The data processing center can obtain the vehicle data that needs to be charged through the charging reservation module, including the vehicle license plate number CarID, charging reservation time t1, and expected charging time T y The number of vehicles waiting for charging M is counted according to the license plate number uploaded for charging reservation, and the waiting time T is calculated by the following formula: w , to assist vehicles in planning travel arrangements in advance:

[0087]

[0088] in, is the estimated charging time of the mth vehicle, M is the total number of vehicles waiting to be charged, N is the number of charging piles, The estimated charging time for the vehicle at the current charging station. The duration of vehicle charging at the current charging station.

[0089] Then, the working status of each charging pile is obtained. If it is in working state, it is marked as 1; if it is in idle state, it is marked as 0. At the same time, the parking space status at the charging pile is judged. If the parking space is occupied, the license plate number of the corresponding vehicle is extracted; if the parking space is not occupied, the parking space is marked as 0.

[0090] It can be understood that when the working state of the charging pile is in the charging state, the charging vehicle in the corresponding parking space is identified, and the charging time T of the vehicle is obtained. c , calculate the estimated remaining charging time T of the vehicle y -T c , and generate a prompt message that there is no parking space available.

[0091] When the working state of the charging pile is in idle state, identify the license plate number of the vehicle in the corresponding parking space. If the license plate number is the same as the last charged vehicle, it is determined that the vehicle has completed charging but still occupies the parking space. The parking space occupancy time T of the vehicle is calculated by the following formula o, and sends a vehicle moving reminder message to the corresponding vehicle owner terminal:

[0092]

[0093] in, is the time when the charging pile stops working, and t is the current time.

[0094] When the working state of the charging pile is in idle state, identify the license plate number of the vehicle in the corresponding parking space. If the license plate number is different from the last charging vehicle, it is determined that the vehicle is not charging but still occupies the parking space. At this time, parking space scheduling is required. The parking space occupancy time T of the vehicle is calculated by the following formula o , and sends a vehicle moving reminder message to the corresponding vehicle owner terminal:

[0095]

[0096] in, is the time when the vehicle enters the parking space, and t is the current time.

[0097] Specifically, when the parking space occupancy time exceeds the threshold T oz When the parking space is occupied, the car owner can be guided to leave as soon as possible by increasing the fee and re-evaluating the status of the parking space.

[0098] When the working state is idle and there is no vehicle in the parking space corresponding to the first type of parking space data, a charging reminder message is sent to the owner terminal of the corresponding vehicle according to the charging reservation time, and the estimated waiting time for charging is updated.

[0099] It can be understood that when managing the parking spaces for key vehicles, the process of managing the parking service resources for all vehicles in the service area according to the second vehicle data and the parking space data in the embodiment of the present application includes but is not limited to the following steps:

[0100] Counting the number of real-time vehicles of the second type according to the second type vehicle data, and counting the total number of parking spaces of the second type according to the second type parking space data;

[0101] Obtain the total number of remaining third type parking spaces in the third type parking space data;

[0102] The parking process of the second type of vehicles or the second type of parking space data is managed according to the real-time number of second type vehicles, the total number of second type parking spaces or the total number of remaining third type parking spaces.

[0103] Specifically, the key vehicle parking space management objects are mainly trucks and buses (yellow-plate vehicles). This embodiment identifies whether a vehicle is a key vehicle based on the color of the license plate, and then selects the key vehicle based on the number of key vehicles N. h Number of parking spaces for large vehicles N dComparison is used to manage the parking process of key vehicles.

[0104] It can be understood that when the number of second type real-time vehicles N h Less than the total number of second type parking spaces N d , we know that the current parking area for large vehicles is sufficient, so we get the number of parking spaces of the second type. And according to the first difference between the real-time number of the second type of vehicles and the number of the second type of parking spaces parked Managing the parking process of the second type of vehicle or the second type of parking space data;

[0105] When the number of real-time vehicles of the second type N h Greater than or equal to the total number of second type parking spaces N d , we know that the current parking area for large vehicles is not very sufficient, so we get the number of parking spaces of the second type. The parking process of the second type of vehicles or the second type of parking space data is managed according to the first difference between the real-time number of the second type of vehicles and the number of the second type of parking spaces parked and the total number of the remaining third type of parking spaces.

[0106] Specifically, when there are sufficient parking spaces for large vehicles, the parking resources for key vehicles are managed through the following steps:

[0107] When the first difference If it is 0, it means that all the key vehicles are parked in the large vehicle parking area, and the actual remaining parking spaces of the second type are obtained. Calculate the second difference N between the total number of second type parking spaces and the second type real-time number of vehicles d -N h ; If the second difference is equal to the actual remaining parking spaces of the second type If the second difference is not equal to the actual remaining parking spaces of the second type, it indicates that the parking area for large vehicles is in compliance with the parking regulations. This means that other vehicles have occupied large vehicle parking spaces or that large vehicles have been parked irregularly and occupied multiple parking spaces. The number of vehicles parked in the second type of parking spaces that are occupied by the vehicles is obtained, and a vehicle moving reminder message is sent to the corresponding vehicle owner terminal of the vehicle occupying the parking space, so as to promptly notify the vehicle owner to adjust the vehicle position;

[0108] When the first difference is not 0, it is determined that not all key vehicles are parked in the large vehicle parking area. The second type of key vehicles are parked outside the large vehicle parking area, the actual remaining parking spaces of the second type are obtained, and the second type of vehicles parked outside the second type of parking spaces are determined. if illustrate If a key vehicle is parked in the small car parking area, a vehicle moving reminder message will be sent to the vehicle owner's terminal to promptly notify the owner to adjust the vehicle position; if illustrate If a key vehicle is parked in a non-parking area, a vehicle moving reminder message is sent to the vehicle owner's terminal to promptly notify the owner to adjust the vehicle position. For vehicles parked in the large vehicle parking area, the actual remaining parking spaces in the large vehicle parking area are obtained. Calculate theoretical remaining parking spaces if Explain the parking regulations for large vehicle parking areas. This means that other vehicles (non-key vehicles) are occupying large parking spaces or that large vehicles are parked improperly and occupy multiple parking spaces. The owners should be notified in a timely manner to adjust the position of their vehicles.

[0109] Specifically, when there are sufficient parking spaces for large vehicles (i.e., N h >N d ), obtain the number of key vehicles parked in the current large vehicle parking area calculate when This means that the utilization rate of the large vehicle parking area is 100%, and the parking of key vehicles in the large vehicle parking area is in compliance with regulations. This means that other vehicles (non-key vehicles) are occupying large parking spaces or that large vehicles are parked improperly and occupy multiple parking spaces. The owners should be notified in a timely manner to adjust the position of their vehicles.

[0110] When there is If there are no key vehicles parked in the large vehicle parking area, it is necessary to further determine the parking situation in the small vehicle parking area to determine whether more key vehicles can be accommodated. Specifically, the number of small vehicles that need to be parked is estimated by the following formula: car :

[0111]

[0112] in, is the number of parking spaces currently occupied at the charging station.

[0113] Get the number of parking spaces N in the parking area x , calculate the number of remaining parking spaces in the car parking area (i.e. the total number of remaining third type parking spaces):

[0114]

[0115] Determine whether the number of available parking spaces is greater than 2 (parking space threshold). If it is less than 2, it is considered that it cannot be used. Services are provided for key vehicles (not parked in the large vehicle parking area).

[0116] Otherwise, if the number of idle parking spaces is greater than 2 for a continuous period, set the second time threshold T sz , when the duration is longer than Tsz , then The parking spaces for small cars are adjusted to temporary large vehicle parking spaces (i.e. the total number of Type 4 parking spaces), and the remaining vehicles (The third difference) is considered as a vehicle that cannot be served. For a vehicle that cannot be served, a service-unavailable prompt message is sent to the vehicle owner's terminal to remind the vehicle owner to leave the service area.

[0117] In summary, the embodiments of the present application can provide reminders for vehicles occupying charging parking spaces to move their vehicles, so as to remind vehicle owners to move their vehicles according to the time limit, thereby improving the utilization rate of charging parking spaces in service areas and reducing the waiting time of vehicle owners; at the same time, it can also provide parking standard management services for key vehicles to avoid the phenomenon of occupying multiple parking spaces or non-large vehicle parking areas, and adjust the parking spaces in the small car parking area according to the parking situation to meet the parking needs of key vehicles, effectively improving the reasonable utilization rate of parking spaces in service areas.

[0118] The embodiment of the present application also provides a computer device, the computer device includes a memory and a processor, the memory stores a computer program, and the processor implements the above-mentioned method for processing vehicle service resources in a highway service area when executing the computer program. The computer device can be any intelligent terminal including a tablet computer, a vehicle-mounted computer, etc.

[0119] It can be understood that the contents of the above method embodiments are all applicable to the computer device embodiments, the functions specifically implemented by the computer device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0120] See also Figure 3 , Figure 3 The hardware structure of a computer device according to another embodiment is shown, and the computer device includes:

[0121] The processor 310 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present application;

[0122] The memory 320 can be implemented in the form of a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 320 can store an operating system and other application programs. When the technical solution provided in the embodiment of this specification is implemented by software or firmware, the relevant program code is stored in the memory 320, and the processor 310 calls and executes the method for processing vehicle service resources in a highway service area of ​​the embodiment of this application;

[0123] Input / output interface 330, used to implement information input and output;

[0124] Communication interface 340, used to realize communication interaction between the device and other devices, which can be realized through wired mode (such as USB, network cable, etc.) or wireless mode (such as mobile network, WIFI, Bluetooth, etc.);

[0125] bus 350 , which transmits information between the various components of the device (e.g., processor 310 , memory 320 , input / output interface 330 , and communication interface 340 );

[0126] The processor 310 , the memory 320 , the input / output interface 330 and the communication interface 340 are connected to each other in communication within the device via the bus 350 .

[0127] An embodiment of the present application also provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, it implements the above-mentioned method for processing vehicle service resources in the highway service area.

[0128] It can be understood that the contents of the above method embodiments are all applicable to the present storage medium embodiments, the functions specifically implemented by the present storage medium embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0129] The memory, as a non-transient computer-readable storage medium, can be used to store non-transient software programs and non-transient computer executable programs. In addition, the memory may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory may optionally include a memory remotely disposed relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0130] The embodiments described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Those skilled in the art will appreciate that with the evolution of technology and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.

[0131] Those skilled in the art will appreciate that the technical solutions shown in the figures do not constitute a limitation on the embodiments of the present application, and may include more or fewer steps than shown in the figures, or a combination of certain steps, or different steps.

[0132] The device embodiments described above are merely illustrative, and the units described as separate components may or may not be physically separated, that is, they may be located in one place or distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0133] Those skilled in the art will appreciate that all or some of the steps in the methods disclosed above, and the functional modules / units in the systems and devices may be implemented as software, firmware, hardware, or a suitable combination thereof.

[0134] The terms "first", "second", "third", "fourth", etc. (if any) in the specification of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0135] It should be understood that in the present application, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the objects associated before and after are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0136] In the several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the above units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0137] The units described above as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0138] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0139] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including multiple instructions to enable a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of various embodiments of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory, referred to as ROM), random access memory (Random Access Memory, referred to as RAM), disk or optical disk and other media that can store programs.

[0140] The preferred embodiments of the present invention are described above with reference to the accompanying drawings, but the scope of the rights of the present invention is not limited thereto. Any modification, equivalent substitution and improvement made by a person skilled in the art without departing from the scope and essence of the present invention should be within the scope of the rights of the present invention.

Claims

1. A method for processing vehicle service resources in a highway service area, characterized in that: The method comprises the following steps: Acquire all vehicle data in the service area as first vehicle data; Classifying vehicles in the service area according to the first vehicle data to obtain second vehicle data, where the second vehicle data includes first type vehicle data, second type vehicle data and third type vehicle data; Acquire parking space data of a service area, wherein the parking space data includes first type parking space data, second type parking space data and third type parking space data; All vehicle parking service resources in the service area are managed according to the second vehicle data and the parking space data.

2. The method according to claim 1, characterized in that: The acquiring of all vehicle data in the service area as first vehicle data includes: Get the entrance vehicle information of the service area; Extracting the first license plate number, entry record time and license plate color from the entry vehicle information; Obtain the exit vehicle information of the service area; Extracting the second license plate number from the export vehicle information; Determining vehicles still staying in the service area according to the first license plate number and the second license plate number; The license plate color and entry recording time corresponding to the vehicle still staying in the service area are used as the first vehicle data.

3. The method according to claim 2, characterized in that The classifying the vehicles in the service area according to the first vehicle data to obtain second vehicle data includes: Calculate the length of time the corresponding vehicle stays in the service area according to the entry record time in the first vehicle data; Determine a vehicle of key concern according to the stay duration and the first duration threshold; The key vehicles are classified according to the license plate colors in the first vehicle data to obtain the second vehicle data.

4. The method according to claim 1, characterized in that: The managing of all vehicle parking service resources in the service area according to the second vehicle data and the parking space data includes: Obtaining the license plate number, charging reservation time and estimated charging duration of the first type of vehicle data; Counting the number of vehicles waiting to be charged according to the license plate numbers of the first type of vehicle data; Calculate the estimated waiting time for charging according to the number of vehicles waiting for charging, the estimated charging time and the number of charging piles; Get the working status of each charging pile; When the working state is in working state, obtaining the charging time of the vehicle in the parking space corresponding to the first type of parking space data; When the working state is in an idle state and there is a vehicle in the parking space corresponding to the first type of parking space data, the vehicle occupancy time is calculated according to the charging reservation time; Sending a vehicle moving reminder message to the owner terminal of the corresponding vehicle according to the parking space occupancy time; When the working state is in an idle state and there is no vehicle in the parking space corresponding to the first type of parking space data, a charging reminder message is sent to the owner terminal of the corresponding vehicle according to the charging reservation time, and the estimated waiting time for charging is updated.

5. The method according to claim 1, characterized in that The managing of all vehicle parking service resources in the service area according to the second vehicle data and the parking space data includes: Counting the number of real-time vehicles of the second type according to the second type of vehicle data; Counting the total number of second-type parking spaces according to the second-type parking space data; Obtain the total number of remaining third type parking spaces in the third type parking space data; The parking process of the second type of vehicles or the second type of parking space data is managed according to the real-time number of the second type of vehicles, the total number of the second type of parking spaces or the total number of the remaining third type of parking spaces.

6. The method according to claim 5, characterized in that The managing the parking process of the second type of vehicles or the second type of parking space data according to the real-time number of the second type of vehicles, the total number of the second type of parking spaces or the total number of the remaining third type of parking spaces includes: When the number of the second type of real-time vehicles is less than the total number of the second type of parking spaces, the number of parked vehicles in the second type of parking spaces is obtained, and the parking process of the second type of vehicles or the second type of parking space data is managed according to a first difference between the number of the second type of real-time vehicles and the number of parked vehicles in the second type of parking spaces; When the real-time number of vehicles of the second type is greater than or equal to the total number of parking spaces of the second type, the number of parked vehicles of the second type is obtained, and the parking process of the second type of vehicles or the second type of parking space data is managed based on a first difference between the real-time number of vehicles of the second type and the number of parked vehicles of the second type and the total number of remaining parking spaces of the third type.

7. The method according to claim 6, characterized in that The managing the parking process of the second type of vehicles or the second type of parking space data according to the first difference between the real-time number of the second type of vehicles and the number of the second type of parking spaces parked comprises: When the first difference is 0, the actual remaining parking spaces of the second type are obtained, and the second difference between the total number of parking spaces of the second type and the real-time number of vehicles of the second type is calculated; when the second difference is not equal to the actual remaining parking spaces of the second type, the vehicles that are occupied in the number of parked parking spaces of the second type are obtained, and a vehicle moving prompt message is sent to the corresponding owner terminal of the vehicle occupying the parking space; When the first difference is not 0, the actual remaining parking spaces of the second type are obtained, and the second type of vehicles parked outside the second type of parking spaces are determined; and a vehicle moving prompt message is sent to the owner terminal of the second type of vehicles parked outside the second type of parking spaces.

8. The method according to claim 6, characterized in that The managing the parking process of the second type of vehicles or the second type of parking space data according to the first difference between the number of the second type of real-time vehicles and the number of the second type of parking spaces parked and the total number of the remaining third type of parking spaces comprises: Obtaining a duration during which the total number of remaining third-type parking spaces is greater than a parking space threshold; When the duration is greater than the second duration threshold, calculating the total number of parking spaces of the fourth type according to the total number of remaining parking spaces of the third type; Calculating a third difference between the first difference and the total number of parking spaces of the fourth type; The parking process of the second type of vehicle is managed according to the third difference.

9. A computer device, characterized in that: include: at least one processor; at least one memory for storing at least one program; When the at least one program is executed by the at least one processor, the at least one processor implements the method according to any one of claims 1 to 8.

10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.

Images