Method, device and medium for processing vehicle service resources in highway service areas
By classifying and managing vehicle and parking space data within highway service areas, the problem of wasted parking resources has been solved, the rational use of parking resources and the standardization of vehicle parking have been achieved, and the utilization rate of parking spaces in service areas has been improved.
Patent Information
- Application Number
- CN202411530797.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-10-30
- Publication Date
- 2025-10-28
- Estimated Expiration
- 2044-10-30
AI Technical Summary
In the existing technology, the vehicle management methods in highway service areas result in a low utilization rate of parking space service resources, with some key vehicles and non-key vehicles parking haphazardly, leading to a waste of charging spaces and parking space resources.
By acquiring vehicle and parking space data within the service area, we classify and manage them, including first-type vehicle data (such as new energy vehicles), second-type vehicle data (such as key vehicles), and third-type vehicle data (such as fuel-powered cars). We then allocate and manage parking spaces reasonably based on the parking space data and send vehicle relocation reminders to optimize the utilization of parking resources.
This has effectively improved the rational utilization rate of parking space resources in highway service areas, reduced the phenomenon of random parking, and increased the utilization efficiency of charging spaces and key vehicle parking areas.
Smart Images

Figure CN119694139B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of vehicle management technology, and in particular to a method, apparatus and medium for processing vehicle service resources in highway service areas. Background Technology
[0002] In related technologies, with the rapid development of the automotive 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 complex. Currently, the vehicle management process in service areas only involves simple classification and zoning to guide parking. This management method leads to some key vehicle owners parking arbitrarily, occupying too many parking spaces or parking in unreasonable areas. For example, charging spaces for new energy electric vehicles are occupied by gasoline vehicles or vehicles that do not charge, preventing electric vehicles that need to charge from using the charging function; or cars occupying truck parking spaces, preventing trucks from parking and departing, thus resulting in a low rate of rational utilization of parking service resources in service areas.
[0003] In summary, the technical problems existing in the relevant technologies need to be improved. Summary of the Invention
[0004] The main objective of this application is to provide a method, apparatus, and medium for processing vehicle service resources in highway service areas, which can effectively improve the rational utilization rate of parking space service resources in highway service areas.
[0005] To achieve the above objectives, one aspect of this application proposes a method for processing vehicle service resources in highway service areas, the method comprising the following steps:
[0006] Obtain all vehicle data within the service area as the first vehicle data;
[0007] Based on the first vehicle data, the vehicles in the service area are classified to obtain the second vehicle data, which includes first type vehicle data, second type vehicle data and third type vehicle data.
[0008] Obtain parking space data for the service area, including first type of parking space data, second type of parking space data, and third type of parking space data;
[0009] The parking service resources for all vehicles in the service area are managed based on the second vehicle data and the parking space data.
[0010] In some embodiments, obtaining all vehicle data within the service area as the first vehicle data includes:
[0011] Obtain vehicle information at the service area entrance;
[0012] Extract the first license plate number, entry record time, and license plate color from the entry vehicle information;
[0013] Obtain information on vehicles exiting the service area;
[0014] Extract the second license plate number from the exported vehicle information;
[0015] The vehicles still parked in the service area were determined based on the first license plate number and the second license plate number;
[0016] The license plate color and entry record time of the vehicles still staying in the service area are used as the first vehicle data.
[0017] In some embodiments, classifying vehicles in the service area based on the first vehicle data to obtain second vehicle data includes:
[0018] Calculate the duration of the corresponding vehicle's stay in the service area based on the entry record time in the first vehicle data;
[0019] Vehicles of particular interest are determined based on the dwell time and the first duration threshold.
[0020] The vehicles of interest are classified according to the license plate color in the first vehicle data to obtain the second vehicle data.
[0021] In some embodiments, managing all vehicle parking service resources within the service area based on the second vehicle data and the parking space data includes:
[0022] Obtain the license plate number, charging reservation time, and estimated charging duration of the first type of vehicle data;
[0023] The number of vehicles waiting to charge is counted based on the license plate numbers of the first type of vehicle data.
[0024] The estimated charging time is calculated based on the number of vehicles waiting to charge, the estimated charging time, and the number of charging piles.
[0025] Obtain the working status of each charging station;
[0026] When the working state is in working state, obtain 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 idle 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] A vehicle relocation reminder message is sent to the owner's terminal of the corresponding vehicle based on the duration of parking space occupancy;
[0029] 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.
[0030] In some embodiments, managing all vehicle parking service resources within the service area based on the second vehicle data and the parking space data includes:
[0031] The number of real-time vehicles of the second type is calculated based on the data of the second type of vehicles.
[0032] The total number of parking spaces of the second type is calculated based on the data of the second type of parking spaces.
[0033] Retrieve the total number of remaining third-type parking spaces from the third-type parking space data;
[0034] The parking process of the second type of vehicles or the data of the second type of parking spaces are managed based on 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 based on 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 remaining third type of parking spaces includes:
[0036] When the real-time number of vehicles of the second type is less than the total number of parking spaces of the second type, the number of parking spaces of the second type that have been parked is obtained, and the parking process of the second type of vehicles or the parking space data is managed according to the first difference between the real-time number of vehicles of the second type and the number of parking spaces of the second type.
[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 parking spaces of the second type that have been parked is obtained, and the parking process of the second type of vehicles or the data of the second type of parking spaces is managed according to the first difference between the real-time number of vehicles of the second type and the number of parking spaces of the second type and the total number of remaining third type parking spaces.
[0038] In some embodiments, managing the parking process of the second type of vehicles or the second type of parking space data based on a first difference between the real-time number of the second type of vehicles and the number of parking spaces of the second type includes:
[0039] When the first difference is 0, obtain the actual remaining parking spaces of the second type, and calculate 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; when the second difference is not equal to the actual remaining parking spaces of the second type, obtain the vehicles that occupy the parking spaces from the number of parking spaces already parked in the second type, and send a vehicle relocation prompt message to the terminal of the vehicle owner corresponding to the vehicle occupying the parking space.
[0040] When the first difference is not 0, obtain the actual remaining parking spaces of the second type, determine the second type of vehicle parked outside the second type of parking space, and send a vehicle relocation prompt message to the owner terminal of the second type of vehicle parked outside the second type of parking space.
[0041] In some embodiments, managing the parking process of the second type of vehicles or the second type of parking space data based on a first difference between the real-time number of the second type of vehicles and the number of second type of parking spaces already parked, and the total number of remaining third type of parking spaces, includes:
[0042] Obtain the duration for which the total number of remaining third-type parking spaces exceeds the parking space threshold;
[0043] When the duration exceeds the second duration threshold, the total number of fourth type parking spaces is calculated based on the remaining total number of third type parking spaces.
[0044] Calculate the third difference between the first difference and the total number of the fourth type of parking spaces;
[0045] The parking process for the second type of vehicles is managed based on the third difference.
[0046] To achieve the above objectives, another aspect of this application provides a computer device, comprising:
[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 performs the method described above.
[0050] To achieve the above-mentioned purpose, 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-mentioned method when executed by a processor.
[0051] The embodiments of this application include at least the following beneficial effects: This application provides a method, apparatus, and medium for processing vehicle service resources in highway service areas. This solution obtains all vehicle data in the service area, 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 obtains first type parking space data, second type parking space data, third type parking space data, and parking space data. Then, it 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 randomly parking and occupying parking spaces, and effectively improving the rational utilization rate of parking space service resources in highway service areas. Attached Figure Description
[0052] Figure 1 This is a flowchart of a method for processing vehicle service resources in highway service areas provided in an embodiment of this application;
[0053] Figure 2 This is an application flowchart of the method for processing vehicle service resources in highway service areas provided in the embodiments of this application;
[0054] Figure 3 This is a schematic diagram of the hardware structure of the computer device provided in the embodiments of this application. Detailed Implementation
[0055] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of this application and are not intended to limit it. In the following description, when referring to the accompanying 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 those of this application; they are merely examples of apparatuses and methods consistent with some aspects of the embodiments of this application.
[0056] This application provides a method, apparatus, and medium for processing vehicle service resources in highway service areas. This embodiment acquires all vehicle data within the service area, then classifies the vehicles into third-type vehicle data, including first-type, second-type, and third-type vehicle data. Simultaneously, it acquires third-type and first-type parking space data, along with other parking space data. Based on the second-type and third-type data, it manages all parking service resources within the service area, thereby reducing the occurrence of haphazard parking and effectively improving the rational utilization rate of parking service resources in highway service areas.
[0057] The method for processing vehicle service resources in highway service areas provided in this application relates to the field of vehicle management technology. This method can be applied to a terminal, a server, or software running on either a terminal or a server. In some embodiments, the terminal can be a smartphone, tablet, laptop, desktop computer, smart speaker, smartwatch, or in-vehicle terminal, but is not limited to these. The server can be configured as an independent physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, 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 implementing the method for processing vehicle service resources in highway service areas, but is not limited to the above forms.
[0058] This application can be used in a wide variety of general-purpose or special-purpose computer system environments or configurations. Examples include: 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, and distributed computing environments including any of the above systems or devices. This 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. This application can also be practiced in distributed computing environments where tasks are performed by remote processing devices connected via a communication network. In distributed computing environments, program modules can reside in local and remote computer storage media, including storage devices.
[0059] Figure 1 This is an optional flowchart of a method for processing vehicle service resources in highway service areas provided in an embodiment of this application. Figure 1 The method may include, but is not limited to, steps S101 to S106.
[0060] Step S110: Obtain all vehicle data within the service area as the first vehicle data;
[0061] Step S120: Classify the vehicles in the service area according to the first vehicle data to obtain the second vehicle data, wherein the second vehicle data includes the first type of vehicle data, the second type of vehicle data and the third type of vehicle data;
[0062] Step S130: Obtain parking space data for 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: Manage all vehicle parking service resources in the service area based on the second vehicle data and parking space data.
[0064] In this embodiment, the vehicle information at the entrance and exit of the service area can be obtained through the high-definition checkpoint and ETC antenna vehicle passage records at the service area entrance. The first license plate number CarID1, the entry record time CarTime, and the license plate color Carcolor are extracted from the entrance vehicle information, and the second license plate number CarID2 is extracted from the exit vehicle information. 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 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. The license plate color and entry record time of the vehicle still in the service area are used as the first vehicle data.
[0065] It is understandable that, such as Figure 2 As shown, after confirming the number of vehicles still in the service area, the number of vehicles N(t) currently in the service area is counted as follows:
[0066] N(t) = N(t-1) + Ql(t) - Qc(t);
[0067] Where 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 time, 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 this embodiment of the application, after determining the number of vehicles staying in the service area, it is also necessary to classify the vehicles staying on the server to obtain second vehicle data. Specifically, the classification process includes, but is not limited to, the following steps:
[0069] The duration of the corresponding vehicle's stay in the service area is calculated based on the entry record time in the first vehicle data.
[0070] Vehicles requiring special attention are identified based on dwell time and the first duration threshold.
[0071] Based on the license plate color in the first vehicle data, the vehicles of interest are classified to obtain the second vehicle data.
[0072] Understandably, the duration of a vehicle's stay at a service area can be calculated using the following formula:
[0073] T m= t - CarTime_l;
[0074] In the formula, T m This indicates the duration of the vehicle's stay in the service area, where t represents the current time and CarTime_l represents the time the vehicle entered the service area.
[0075] This embodiment will specify the dwell time T. m and the first duration threshold T Z Comparison, when the dwell time T m Greater than the first duration threshold T Z The corresponding vehicles are designated as key monitoring vehicles. These key monitoring vehicles are then categorized based on license plate color. Specifically, the first category includes data on new energy vehicles, the second category includes data on key monitoring vehicles, and the third category includes data on gasoline-powered passenger cars. Key monitoring vehicles include, but are not limited to, large trucks, buses, and trailers.
[0076] In this embodiment, after classifying all vehicles within the service area, the parking and departure processes of different types of vehicles can be managed separately. Specifically, this embodiment mainly manages charging pile parking spaces and key vehicle parking spaces. It is understood that the parking space status, the type of vehicle corresponding to the parking space, and the license plate number can all be obtained through image recognition. During the charging pile parking space management process, the charging pile management system can pre-set a data processing center, a vehicle charging reservation module, a charging pile status recognition module, and a parking space status recognition module. The data processing center can receive data from the vehicle charging reservation module, the charging pile status recognition module, and the parking space status recognition module.
[0077] It is understood that when managing charging station parking spaces, the process of managing all vehicle parking service resources within the service area based on the second vehicle data and parking space data in this embodiment includes, but is not limited to, the following steps:
[0078] Obtain the license plate number, charging appointment time, and estimated charging duration for the first type of vehicle;
[0079] The number of vehicles waiting to charge is counted based on the license plate numbers of vehicles in the first type of vehicle data.
[0080] The estimated charging time is calculated based on the number of vehicles waiting to charge, the estimated charging time, and the number of charging stations.
[0081] Obtain the working status of each charging station;
[0082] When the working status is "working", obtain the charging time of the vehicle in the corresponding first type of parking space data;
[0083] When the working status is idle and there is a vehicle in the parking space corresponding to the first type of parking space data, the vehicle occupancy time is calculated based on the charging reservation time.
[0084] A vehicle relocation reminder message is sent to the owner's terminal based on the duration of parking space occupancy.
[0085] When the working status 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's terminal of the corresponding vehicle according to the charging reservation time, and the estimated waiting time for charging is updated.
[0086] Understandably, it's assumed that new energy vehicles needing charging will make a charging reservation through the vehicle reservation module upon entering the service area and wait for charging notification. The data processing center can obtain vehicle data requiring charging through the charging reservation module, including the vehicle's license plate number (CarID), charging reservation time (t1), and estimated charging duration (T). y The number of vehicles (M) waiting for charging is counted based on the license plate numbers of the vehicles that have uploaded charging reservations, and the waiting time (T) is calculated using the following formula. w To help vehicles plan their trips in advance:
[0087]
[0088] in, The estimated charging time for the m-th vehicle, where M is the total number of vehicles waiting to charge, and N is the number of charging stations. The estimated charging time for vehicles at the current charging station. The charging time of the vehicle at the current charging station.
[0089] Then, the working status of each charging pile is obtained. If it is in working status, it is marked as 1; if it is in idle status, it is marked as 0. At the same time, the parking space status at the charging pile is determined. 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] Understandably, when the charging station is in charging mode, it identifies the vehicle charging in the corresponding parking space and obtains the vehicle's charging duration T. c Calculate the estimated remaining charging time T for the vehicle. y -T c It will also generate a message indicating that no parking spaces are available at the moment.
[0091] When the charging station is in an idle state, the license plate number of the vehicle in the corresponding parking space is identified. If the license plate number is the same as the previous vehicle charging, it is determined that the vehicle has completed charging but is still occupying the parking space. The parking space occupancy time T is calculated using the following formula. oAnd send a vehicle relocation notification to the owner's terminal of the corresponding vehicle:
[0092]
[0093] in, This represents the time during which the charging station has stopped operating, where t represents the current time.
[0094] When the charging station is in an idle state, the license plate number of the vehicle in the corresponding parking space is identified. If the license plate number is different from the previous vehicle charging, it is determined that the vehicle is not charging but is still occupying the parking space. At this time, parking space relocation is required. The parking space occupancy time T is calculated using the following formula. o And send a vehicle relocation notification to the owner's terminal of the corresponding vehicle:
[0095]
[0096] in, The time it takes for a vehicle to enter a parking space is represented by t, where t represents the current time.
[0097] Specifically, when the parking space occupancy time exceeds the threshold T oz In such cases, measures such as increasing fees can be used to guide car owners to leave as soon as possible, allowing for a reassessment of the parking space's availability.
[0098] When the working status 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's terminal of the corresponding vehicle according to the charging reservation time, and the estimated waiting time for charging is updated.
[0099] It is understood that when managing parking spaces for key vehicles, the process of managing all vehicle parking service resources within the service area based on the second vehicle data and parking space data in this embodiment includes, but is not limited to, the following steps:
[0100] The real-time number of vehicles of the second type is calculated based on the data of the second type of vehicles, and the total number of parking spaces of the second type is calculated based on the data of the second type of parking spaces.
[0101] Retrieve the total number of remaining third-type parking spaces from the third-type parking space data;
[0102] The parking process of Type II vehicles or the data of Type II parking spaces are managed based on the real-time number of Type II vehicles, the total number of Type II parking spaces, or the total number of remaining Type III parking spaces.
[0103] Specifically, the key vehicle parking space management targets are mainly trucks and buses (yellow-plate vehicles). In this embodiment, after identifying whether a vehicle is a key vehicle based on the license plate color, the number of key vehicles N is then used to determine the key vehicle status. h The number of parking spaces N in the large vehicle parking area dThe parking process of key vehicles is managed by comparison.
[0104] It is understandable 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 can see that there are currently enough parking spaces for large vehicles. Therefore, we need to obtain the number of second-type parking spaces that are already occupied. And based on the first difference between the real-time number of vehicles of the second type and the number of parking spaces of the second type. Manage the parking process of second-type vehicles or the data of second-type parking spaces;
[0105] When the number of real-time vehicles of the second type is N h Greater than or equal to the total number N of the second type of parking spaces d It can be seen that there are not enough parking spaces for large vehicles. Therefore, we need to obtain the number of parking spaces already occupied by the second type of vehicle. The parking process of the second type of vehicles or the data of the second type of parking spaces are managed based on the first difference between the real-time number of the second type of vehicles and the number of the second type of parking spaces already parked, as well as 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 A value of 0 indicates that all key vehicles are parked in the large vehicle parking area, thus obtaining the second type of actual remaining parking spaces. Calculate the second difference N between the total number of type II parking spaces and the real-time number of type II vehicles. d -N h If the second difference is different from the actual remaining parking spaces of the second type... If the second difference is equal to the actual number of remaining parking spaces in the second type of parking area, it indicates that the parking is in compliance with regulations. This indicates that other vehicles are occupying the large vehicle parking space or that a large vehicle is improperly parked and occupies multiple parking spaces. The system retrieves the number of vehicles occupying the parking spaces from the number of vehicles already parked in the second type of parking spaces and sends a vehicle relocation prompt to the terminal of the corresponding vehicle owner to promptly notify the owner to adjust the vehicle's position.
[0108] When the first difference is not 0, it indicates that not all key vehicles are parked in the large vehicle parking area. Key vehicles were parked outside the large vehicle parking area. The actual remaining parking spaces for the second type were obtained, and the second type of vehicles parked outside the second type of parking spaces were identified. if illustrate If a key vehicle is parked in the car parking area, a message will be sent to the vehicle owner's terminal to remind them to move the vehicle; if illustrate For key vehicles parked in non-parking areas, a vehicle relocation notification is sent to the vehicle owner's terminal to promptly notify them to move their vehicle. For vehicles parked in large vehicle parking areas, the actual number of available parking spaces in the large vehicle parking area is obtained. Calculate the theoretical remaining parking spaces if Explain the parking regulations for large vehicles in designated parking areas. This indicates that other (non-priority vehicles) are occupying the large vehicle parking space, or that a large vehicle is improperly parked and occupies multiple parking spaces. The vehicle owner should be notified promptly to adjust the vehicle's position.
[0109] Specifically, when there are sufficient parking spaces for large vehicles (i.e., N) h >N d When obtaining the number of key vehicles parked in the current large vehicle parking area, [the system will] retrieve the number of such vehicles currently parked. calculate when This indicates that the utilization rate of the large vehicle parking area is 100%, and key vehicles are parked in accordance with regulations within the large vehicle parking area. This indicates that other (non-priority vehicles) are occupying the large vehicle parking space, or that a large vehicle is improperly parked and occupies multiple parking spaces. The vehicle owner should be notified promptly to adjust the vehicle's position.
[0110] When there is Several key vehicles were not parked in the designated large vehicle parking area. Further assessment of the car parking area is needed to determine if it can accommodate more key vehicles. Specifically, the number of cars N that need to be parked is estimated using the following formula. car :
[0111]
[0112] in, This represents the number of parking spaces currently occupied at the charging station.
[0113] Get the number of parking spaces N in the car parking area x Calculate the remaining number of parking spaces in the car parking area. (i.e., the total number of remaining third-type parking spaces):
[0114]
[0115] Check if the number of available parking spaces for cars is greater than 2 (parking space threshold). If it is less than 2, it is considered impossible to park in a parking space. Service is provided to key vehicles (those not parked in the large vehicle parking area).
[0116] Otherwise, if the number of vacant parking spaces for cars exceeds two for a continuous period of time, a second duration threshold T is set. sz When the duration is greater than Tsz Then The number of car parking spaces has been adjusted to One temporary large vehicle parking space (i.e., the total number of Type IV parking spaces), and the remaining vehicles The third difference indicates a vehicle that is unavailable for service. For unavailable vehicles, a service failure message is sent to the owner's terminal to remind the owner to leave the service area.
[0117] In summary, the embodiments of this application can provide vehicle relocation reminders for vehicles occupying charging spaces, prompting car owners to move their vehicles within a specified timeframe. This can improve the utilization rate of charging spaces in service areas and reduce waiting time for car owners. At the same time, it can also provide standardized parking management services for key vehicles, avoiding the phenomenon of occupying multiple parking spaces or non-large vehicle parking areas, and adjusting the parking spaces in the small vehicle parking area according to the parking situation to meet the parking needs of key vehicles, effectively improving the rational utilization rate of parking spaces in service areas.
[0118] This application also provides a computer device, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the above-mentioned method for processing vehicle service resources in highway service areas. This computer device can be any smart terminal, including tablet computers, in-vehicle computers, etc.
[0119] It is understood that the content of the above method embodiments is applicable to the embodiments of this computer device. The specific functions implemented by the embodiments of this computer device 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] Please see Figure 3 , Figure 3 The hardware structure of a computer device according to another embodiment is illustrated. The computer device includes:
[0121] The processor 310 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, 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 this application.
[0122] The memory 320 can be implemented as a read-only memory (ROM), static storage device, dynamic storage device, or random access memory (RAM). The memory 320 can store the operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 320 and is called and executed by the processor 310 to execute the highway service area vehicle service resource processing method of the embodiments of this application.
[0123] Input / output interface 330 is used to realize information input and output;
[0124] The communication interface 340 is used to enable communication and interaction between this device and other devices. Communication can be achieved through wired means (such as USB, network cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).
[0125] Bus 350 transmits information between various components of the device (e.g., processor 310, memory 320, input / output interface 330, and communication interface 340);
[0126] The processor 310, memory 320, input / output interface 330 and communication interface 340 are connected to each other within the device via bus 350.
[0127] This application also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described method for processing vehicle service resources in highway service areas.
[0128] It can be understood that the contents of the above method embodiments are all applicable to the present storage medium embodiment, the functions specifically implemented by the present storage medium embodiment 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] Memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer-executable programs. Furthermore, memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, memory may optionally include memory remotely located relative to the processor, and these remote memories can be connected to the processor via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
[0130] The embodiments described in this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided by the embodiments of this application. As those skilled in the art will know, with the evolution of technology and the emergence of new application scenarios, the technical solutions provided by the embodiments of this application are also applicable to similar technical problems.
[0131] Those skilled in the art will understand that the technical solutions shown in the figures do not constitute a limitation on the embodiments of this application, and may include more or fewer steps than shown, or combine certain steps, or different steps.
[0132] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs.
[0133] Those skilled in the art will understand that all or some of the steps in the methods disclosed above, as well as the functional modules / units in the systems and devices, can be implemented as software, firmware, hardware, or suitable combinations thereof.
[0134] The terms “first,” “second,” “third,” “fourth,” etc. (if present) in the specification and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms “comprising” and “having,” and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.
[0135] It should be understood that in this application, "at least one (item)" means one or more, and "more than" means two or more. "And / or" is used to describe the relationship between related objects, indicating that three relationships can exist. For example, "A and / or B" can represent three cases: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple.
[0136] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of the units described above is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.
[0137] The units described above as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0138] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.
[0139] If the integrated unit is implemented as 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 this application, in essence, 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. This computer software product is stored in a storage medium and includes multiple instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing programs, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.
[0140] The preferred embodiments of the present application have been described above with reference to the accompanying drawings, but this does not limit the scope of the claims of the present application. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and substance of the embodiments of the present application shall be within the scope of the claims of the present application.
Claims
1. A method for processing vehicle service resources in highway service areas, characterized in that, The method includes the following steps: Obtain all vehicle data within the service area as the first vehicle data; Based on the first vehicle data, the vehicles in the service area are classified to obtain the second vehicle data, which includes first type vehicle data, second type vehicle data and third type vehicle data. Obtain parking space data for the service area, including first type of parking space data, second type of parking space data, and third type of parking space data; The parking service resources for all vehicles in the service area are managed based on the second vehicle data and the parking space data. The management of all vehicle parking service resources within the service area based on the second vehicle data and the parking space data includes: Obtain the license plate number, charging reservation time, and estimated charging duration of the first type of vehicle data; The number of vehicles waiting to charge is counted based on the license plate numbers of the first type of vehicle data. The estimated charging time is calculated based on the number of vehicles waiting to charge, the estimated charging time, and the number of charging piles. Obtain the working status of each charging station; When the working state is in working state, obtain the charging time of the vehicle in the parking space corresponding to the first type of parking space data; When the working state is idle 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. A vehicle relocation prompt message is sent to the owner's terminal of the corresponding vehicle based on the duration of vehicle occupancy. 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. The number of real-time vehicles of the second type is calculated based on the data of the second type of vehicles. The total number of parking spaces of the second type is calculated based on the data of the second type of parking spaces. Retrieve the total number of remaining third-type parking spaces from the third-type parking space data; The parking process of the second type of vehicles or the data of the second type of parking spaces are managed based on 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. The management of the parking process of the second type of vehicles or the second type of parking space data based on the real-time number of the second type of vehicles, the total number of the second type of parking spaces, or the remaining total number of the third type of parking spaces includes: When the real-time number of vehicles of the second type is less than the total number of parking spaces of the second type, the number of parking spaces of the second type that have been parked is obtained, and the parking process of the second type of vehicles or the parking space data is managed according to the first difference between the real-time number of vehicles of the second type and the number of parking spaces of the second type. 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 parking spaces of the second type that have been parked is obtained, and the parking process of the second type of vehicles or the data of the second type of parking spaces is managed according to the first difference between the real-time number of vehicles of the second type and the number of parking spaces of the second type and the total number of remaining third type parking spaces. The management of the parking process of the second type of vehicles or the data of the second type of parking spaces based on the first difference between the real-time number of the second type of vehicles and the number of the second type of parking spaces already parked, and the total number of the remaining third type of parking spaces, includes: Obtain the duration for which the total number of remaining third-type parking spaces exceeds the parking space threshold; When the duration exceeds the second duration threshold, the total number of fourth type parking spaces is calculated based on the remaining total number of third type parking spaces. Calculate the third difference between the first difference and the total number of the fourth type of parking spaces; The parking process for the second type of vehicles is managed based on the third difference.
2. The method according to claim 1, characterized in that, The step of obtaining all vehicle data within the service area as the first vehicle data includes: Obtain vehicle information at the service area entrance; Extract the first license plate number, entry record time, and license plate color from the entry vehicle information; Obtain information on vehicles exiting the service area; Extract the second license plate number from the exported vehicle information; The vehicles still parked in the service area were determined based on the first license plate number and the second license plate number; The license plate color and entry record time of the vehicles still staying in the service area are used as the first vehicle data.
3. The method according to claim 2, characterized in that, The step of classifying vehicles in the service area based on the first vehicle data to obtain second vehicle data includes: Calculate the duration of the corresponding vehicle's stay in the service area based on the entry record time in the first vehicle data; Vehicles of particular interest are determined based on the dwell time and the first duration threshold. The vehicles of interest are classified according to the license plate color in the first vehicle data to obtain the second vehicle data.
4. The method according to claim 1, characterized in that, The management of the parking process of the second type of vehicles or the data of the second type of parking spaces based on the first difference between the real-time number of the second type of vehicles and the number of parking spaces of the second type includes: When the first difference is 0, obtain the actual remaining parking spaces of the second type, and calculate 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; when the second difference is not equal to the actual remaining parking spaces of the second type, obtain the vehicles that occupy the parking spaces from the number of parking spaces already parked in the second type, and send a vehicle relocation prompt message to the terminal of the vehicle owner corresponding to the vehicle occupying the parking space. When the first difference is not 0, obtain the actual remaining parking spaces of the second type, determine the second type of vehicle parked outside the second type of parking space, and send a vehicle relocation prompt message to the owner terminal of the second type of vehicle parked outside the second type of parking space.
5. 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 as described in any one of claims 1 to 4.
6. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by a processor, it implements the method of any one of claims 1 to 4.
Citation Information
Patent Citations
Highway service area grading intelligent parking guiding method, system, equipment and medium
CN114582159A
Intelligent service area vehicle guidance system and method based on big data analysis
CN118038669A
Charging management method and device for occupying public resources, equipment and storage medium
CN118134473A