Parking method and device, electronic equipment and storage medium
By determining and locking the target parking space in the automatic parking lot, the problem of inefficiency caused by vehicle interaction game is solved, and more efficient parking operations and resource utilization are achieved.
Patent Information
- Application Number
- CN202411171837.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-23
- Publication Date
- 2024-11-19
AI Technical Summary
In automatic parking lots, interactive games of vehicles on the road lead to inefficient parking, making it difficult to effectively avoid parking conflicts between vehicles.
By determining the unlocked parking spaces in the vehicle buffer zone, locking the target parking space, and issuing parking instructions to the vehicle, ensuring that the vehicle accurately parks into the target parking space and avoiding conflicts with other vehicles.
It improves parking efficiency, reduces parking conflicts between vehicles, and optimizes the utilization rate of parking lot resources.
Smart Images

Figure CN118977702A_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the field of intelligent driving technology, in particular to the field of autonomous parking. The present disclosure specifically relates to a parking method, device, electronic device and storage medium. Background Art
[0002] Some automatic parking systems generally include a sensor system and a dispatching system. The sensor system is installed in each parking space in the parking lot. The dispatching system is used to dispatch vehicles to park in and out. However, when parking, there are multiple vehicles interacting on the road in the parking lot, which will affect the parking efficiency of the parking lot. Summary of the invention
[0003] The present disclosure provides a parking method, device, electronic device and storage medium.
[0004] According to one aspect of the present disclosure, there is provided a parking method, comprising:
[0005] In the case where the first vehicle is parked in the target vehicle buffer zone, determining a target parking space group in at least one parking space group in an unlocked state corresponding to the target vehicle buffer zone;
[0006] Determining a target parking space among the free parking spaces based on the sorting information of the free parking spaces in the target parking space group;
[0007] Changing the target parking space group from being in an unlocked state to being in a locked state;
[0008] generating a first parking instruction based on the target parking space;
[0009] The first parking instruction is sent to the first vehicle, wherein the first parking instruction is used to instruct the first vehicle to park in the target parking space.
[0010] According to another aspect of the present disclosure, there is provided a parking method, comprising:
[0011] In response to a first parking instruction from a parking scheduling platform, based on a target parking space in the first parking instruction, controlling the first vehicle to travel so that the first vehicle parks in the target parking space;
[0012] The first parking instruction is an instruction generated when the scheduling platform executes any parking method in the embodiments of the present disclosure.
[0013] According to another aspect of the present disclosure, a parking device is provided, comprising:
[0014] a group determination module, configured to determine a target parking space group from at least one parking space group in an unlocked state corresponding to the target vehicle buffer zone when a first vehicle is parked in the target vehicle buffer zone;
[0015] a parking space determination module, configured to determine a target parking space among the free parking spaces based on the sorting information of the free parking spaces in the target parking space group;
[0016] A first group locking module, configured to change the target parking space group from an unlocked state to a locked state;
[0017] The first parking instruction module is configured to generate a first parking instruction based on the target parking space, and send the first parking instruction to the first vehicle, wherein the first parking instruction is used to instruct the first vehicle to park in the target parking space.
[0018] According to another aspect of the present disclosure, a parking device is provided, for:
[0019] In response to a first parking instruction from a parking scheduling platform, based on a target parking space in the first parking instruction, controlling the first vehicle to travel so that the first vehicle parks in the target parking space;
[0020] The first parking instruction is an instruction generated when the scheduling platform executes any parking method in the embodiments of the present disclosure.
[0021] According to another aspect of the present disclosure, there is provided an electronic device, comprising:
[0022] at least one central processing unit; and
[0023] A memory in communication with the at least one central processing unit; wherein,
[0024] The memory stores instructions that can be executed by the at least one central processing unit, and the instructions are executed by the at least one central processing unit so that the at least one central processing unit can execute any parking method in the embodiments of the present disclosure.
[0025] According to another aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to enable the computer to execute any parking method in the embodiments of the present disclosure.
[0026] According to another aspect of the present disclosure, a computer program product is provided, including a computer program. When the computer program is executed by a processor, the computer program implements any parking method according to the embodiments of the present disclosure.
[0027] According to the technology disclosed in the present invention, when a first vehicle enters a vehicle buffer zone, a target parking space group is determined from a plurality of unlocked parking space groups corresponding to the zone, and then a target parking space is determined in the group, and at the same time, the group is locked, and a parking instruction is issued to the vehicle. In this way, when the vehicle responds to the parking instruction and enters the target parking space, the parking space in the group can be prevented from being parked by other vehicles, thereby avoiding parking conflicts between the first vehicle and other vehicles.
[0028] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS
[0029] The accompanying drawings are used to better understand the present solution and do not constitute a limitation of the present disclosure.
[0030] Figure 1 is a flow chart of a parking method according to an embodiment of the present disclosure;
[0031] Figure 2 is a schematic diagram of a parking lot according to an embodiment of the present disclosure;
[0032] Figure 3 is a flow chart of a parking method according to another embodiment of the present disclosure;
[0033] Figure 4 is a flow chart of a parking method according to another embodiment of the present disclosure;
[0034] Figure 5 is a structural block diagram of a parking scheduling system according to an embodiment of the present disclosure;
[0035] Figure 6 is a structural block diagram of a parking device according to an embodiment of the present disclosure;
[0036] Figure 7 is a structural block diagram of a parking device according to another embodiment of the present disclosure;
[0037] Figure 8 is a structural block diagram of a parking device according to another embodiment of the present disclosure;
[0038] Fig. 9 is a structural block diagram of a parking device according to another embodiment of the present disclosure;
[0039] Fig.10 is a block diagram of an electronic device according to an embodiment of the present disclosure. DETAILED DESCRIPTION
[0040] The following is a description of exemplary embodiments of the present disclosure in conjunction with the accompanying drawings, including various details of the embodiments of the present disclosure to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope of the present disclosure. Similarly, for the sake of clarity and conciseness, the description of well-known functions and structures is omitted in the following description.
[0041] In order to facilitate understanding of the parking method provided by the embodiment of the present disclosure, the related technologies of the embodiment of the present disclosure are explained below. The following related technologies can be arbitrarily combined with the technical solutions of the embodiment of the present disclosure as optional solutions, and they all belong to the protection scope of the embodiment of the present disclosure.
[0042] Figure 1 : is a flowchart of a parking method according to an embodiment of the present disclosure. The method can be applied to an electronic device. The electronic device is, for example, a terminal, a server, or other processing device, wherein the terminal can be a user equipment (UE) such as a desktop computer, a mobile device, a PDA (Personal Digital Assistant), a handheld device, a computing device, a vehicle-mounted device, a wearable device, etc. In some implementations, the electronic device can implement the parking method according to an embodiment of the present disclosure by calling a computer-readable instruction stored in a memory by a central processor.
[0043] like Figure 1 As shown, the method may include the following steps:
[0044] S110, when the first vehicle is parked in the target vehicle buffer zone, determining a target parking space group in at least one parking space group in an unlocked state corresponding to the target vehicle buffer zone;
[0045] S120, determining a target parking space among the free parking spaces based on the sorting information of the free parking spaces in the target parking space group;
[0046] S130, changing the target parking space group from being in an unlocked state to being in a locked state;
[0047] S140, generating a first parking instruction based on the target parking space;
[0048] S150: Send a first parking instruction to the first vehicle, wherein the first parking instruction is used to instruct the first vehicle to park in a target parking space.
[0049] It can be understood that the first vehicle is any vehicle that is ready to enter the parking lot.
[0050] Exemplarily, the above method can be applied to a parking scheduling platform of a parking lot. The parking scheduling platform records relevant information of each parking space in the parking lot, such as whether it is free, location information, group to which it belongs, etc.
[0051] Exemplarily, a parking lot may include one or more vehicle buffer zones, each buffer zone corresponds to one or more parking space groups, and each group includes one or more parking spaces.
[0052] like Figure 2 As shown, it shows a schematic diagram of a parking lot. The parking lot includes a buffer zone and parking space groups A to D. Each group includes two rows of parking spaces.
[0053] It can be understood that the target vehicle buffer zone includes a plurality of parking space groups, some of which are in a locked state and others are in an unlocked state.
[0054] Exemplarily, based on the distance between the first vehicle and each unlocked parking space grouping, a target parking space grouping is determined in the unlocked parking space grouping corresponding to the buffer zone. For example, the parking space grouping closest to the first vehicle is selected. It is understandable that the parking space grouping includes at least one free parking space.
[0055] Exemplarily, based on the data of free parking spaces included in each unlocked parking space group corresponding to the buffer zone, the target parking space group is determined in the unlocked parking space group corresponding to the buffer zone. For example, the more free parking spaces there are, the higher the possibility of selecting the group as the target parking space group.
[0056] It can be understood that when a certain parking space group is in a locked state, it means that a vehicle is ready to or is parking in an idle parking space in the parking space group. When a certain parking space group is in an unlocked state, it means that no vehicle is ready to or is parking in an idle parking space in the parking space group.
[0057] For example, an idle parking space is randomly selected from the target parking space group as the target parking space, or an idle parking space that meets the sequence requirement is selected from the target parking space group according to the sequence of the idle parking spaces.
[0058] Exemplarily, when a target parking space is selected, the locking state of the group to which the parking space belongs may be changed from an unlocked state to a locked state.
[0059] Exemplarily, after being locked for a certain period of time, the group is changed from a locked state to an unlocked state, thereby releasing the group to the scheduling platform to continue parking space scheduling, thereby improving resource utilization.
[0060] It can be understood that the first parking instruction includes the location information of the target parking space.
[0061] It is understandable that if the scheduling platform has an order requirement, corresponding order information can be generated and sent to the first vehicle together with the first parking instruction. The order information can include the parking fee standard of the target parking space, the allowable parking time, etc.
[0062] According to the above embodiment, when the first vehicle enters the vehicle buffer zone, a target parking space group is determined from the multiple unlocked parking space groups corresponding to the zone, and then a target parking space is determined in the group, and at the same time, the group is locked and a parking instruction is issued to the vehicle. In this way, when the vehicle responds to the parking instruction and enters the target parking space, the parking space in the group can be prevented from being parked by other vehicles, thereby avoiding parking conflicts between the first vehicle and other vehicles.
[0063] In one implementation, the method may further include: when the first vehicle is parked in the target parking space, restoring the target parking space group from a locked state to an unlocked state.
[0064] Exemplarily, when the first vehicle approaches the target parking space and the distance between the first vehicle and the target parking space is less than a preset distance, such as 3 meters, 5 meters, or 10 meters, it can be considered that the first vehicle is parked in the target parking space.
[0065] According to this example, after the first vehicle parks in the target parking space, if the target parking space group is still not unlocked, the target parking space group needs to be restored from a locked state to an unlocked state, so that the group can be released to the scheduling platform to continue parking space scheduling and improve resource utilization.
[0066] In one embodiment, the method may further include: starting a first timing when a first parking instruction is sent to the first vehicle; and restoring the target parking space group from a locked state to an unlocked state when the first timing time is greater than a first preset time.
[0067] Exemplarily, the first timing may be started from zero, or the first timing may be started from a specified time.
[0068] Exemplarily, the first preset time may be 30 seconds, 40 seconds, or 1 minute, etc.
[0069] According to this example, when the first vehicle is scheduled for parking, the calculation begins. After a certain time, the target parking space group is restored from a locked state to an unlocked state. Thus, the group can be released to the scheduling platform to continue parking space scheduling, thereby improving resource utilization.
[0070] In one embodiment, the method may further include: in response to a parking request from a first vehicle in a target parking space, detecting whether the target parking space group is in an unlocked state; if the target parking space group is in an unlocked state, changing the target parking space group from an unlocked state to a locked state; and sending a first parking instruction to the first vehicle, wherein the first parking instruction is used to instruct the first vehicle to park out of the target parking space.
[0071] It can be understood that after the first vehicle is parked in the target parking space, if the driver wants to park the first vehicle out of the parking space, the first vehicle can be controlled to send a parking request to the scheduling platform.
[0072] For example, if the target parking space group is in a locked state, the first exit instruction is not sent to the first vehicle. Alternatively, after waiting for 30 seconds or one minute, the target parking space group is detected again to see if it is in an unlocked state, and only when it is detected that the target parking space group is in an unlocked state, the target parking space group is locked and the first exit instruction is sent to the first vehicle.
[0073] According to the above embodiment, when the dispatching platform receives the parking exit request of the first vehicle, it checks whether the group to which the parking space where the first vehicle is parked belongs, that is, the above target parking space group, is in an unlocked state. If yes, the target parking space group is changed from being in an unlocked state to being in a locked state, and a first parking exit instruction is sent to the first vehicle at the same time. In this way, it is possible to avoid the conflict between the parking entry or exit of the vehicle and other vehicles when the vehicle is parked.
[0074] In one embodiment, the method may further include: starting a second timing when a first parking exit instruction is sent to the first vehicle; and changing the target parking space group from a locked state to an unlocked state when the second timing time is greater than a second preset time.
[0075] Exemplarily, the first timing may be started from zero, or the first timing may be started from a specified time.
[0076] Exemplarily, the second preset time may be 1 minute or 2 minutes, etc.
[0077] According to the above implementation, after sending the first parking exit instruction to the first vehicle, if it is expected that the vehicle has parked out of the parking space within a certain period of time in the future, the group to which it belongs can be changed from a locked state to an unlocked state, thereby releasing the group for other vehicles to park in or out, thereby improving the resource utilization of the parking lot.
[0078] In one implementation, determining the target parking space from among the free parking spaces based on the sorting information of the free parking spaces in the target parking space group includes one of the following:
[0079] When the parking spaces in the target parking space group are sorted in ascending order according to the distance from the parking lot entrance from far to near, the vacant parking space with the smallest sorting is selected from the target parking space group as the target parking space;
[0080] When the parking spaces in the target parking space group are sorted in descending order according to the distance from the parking lot entrance, the vacant parking space with the largest sorting is selected from the target parking space group as the target parking space.
[0081] According to the above example, parking spaces can be allocated to each vehicle in sequence from the inner side to the outer side of the parking lot. In this way, when multiple vehicles are parked, no parking conflicts will occur between the vehicles during the driving process.
[0082] In one embodiment, the method may further include: in response to a parking request from the first vehicle, determining a target vehicle buffer zone in each vehicle buffer zone in the parking lot based on the number of vehicles waiting to be parked in each vehicle buffer zone in the parking lot; generating a second parking instruction based on the target vehicle buffer zone; and sending the second parking instruction to the first vehicle, wherein the second parking instruction is used to instruct the first vehicle to park in the target vehicle buffer zone.
[0083] It will be appreciated that a parking lot includes a plurality of vehicle buffer zones.
[0084] It can be understood that when the vehicle is about to enter the parking lot from the parking lot entrance, the first vehicle may send a parking request to the dispatching platform. Alternatively, when the dispatching platform detects that the first vehicle enters the parking lot entrance, the dispatching platform determines a target vehicle buffer zone in each vehicle buffer zone based on the number of vehicles waiting to park in each vehicle buffer zone in the parking lot; based on the target vehicle buffer zone, the dispatching platform sends a second parking instruction to the first vehicle.
[0085] It can be understood that the smaller the number of vehicles waiting to park in the vehicle buffer zone is, the higher the possibility that the zone serves as the target vehicle buffer zone is.
[0086] Exemplarily, the target vehicle buffer zone may be determined in combination with the free degrees of parking spaces corresponding to each vehicle buffer zone. For example, if a certain buffer zone has many groups and each group has many free parking spaces, the buffer zone is used as the target buffer zone.
[0087] According to the above implementation, the number of vehicles waiting to park in each vehicle buffer zone in the parking lot can reflect the parking queue situation in each vehicle buffer zone. By using this situation, the target vehicle buffer zone can be determined to increase the parking speed of vehicles and avoid vehicles waiting too long.
[0088] Figure 3 is a flowchart of a parking method according to another embodiment of the present disclosure.
[0089] like Figure 3 As shown, the parking method includes the following processes:
[0090] When a vehicle is parked, it is first dispatched to the vehicle buffer by the return order. The dispatch platform calculates the best parking space for each vehicle in turn and dispatches the parking lot dispatch order according to the queue situation in the buffer where the main vehicle is located. The method to find the best parking space is to group the parking spaces in different areas of the parking lot, and number the parking spaces in each group from the inside to the outside of the parking lot. When calculating the parking spaces, traverse and lock the groups in turn. If the locking of the group fails, no dispatch order is issued. If the locking of the group succeeds, query the idle parking space with the smallest number in the group. If an idle parking space is found, dispatch the vehicle to dispatch the vehicle to park in the parking space and lock it for 30 seconds. Otherwise, unlock the current group, lock the next group, and continue the aforementioned search process.
[0091] When a vehicle is parked out, it will first check whether the group where the parking space is located is locked. If it is not locked, a dispatch order or passenger order will be sent to the vehicle to make the vehicle leave the parking space. At the same time, the group where the current parking space is located will be locked for 2 minutes to avoid route conflicts with other dispatched vehicles during the parking process.
[0092] The disclosed embodiment also provides a parking method, which can be applied to a first vehicle, and specifically comprises: in response to a first parking instruction from a parking scheduling platform, based on a target parking space in the first parking instruction, controlling the first vehicle to drive so that the first vehicle parks in the target parking space;
[0093] The first parking instruction is an instruction generated when the scheduling platform executes any parking method of the embodiments of the present disclosure.
[0094] Figure 4 is a flowchart of a parking method according to another embodiment of the present disclosure.
[0095] like Figure 4As shown, the parking method may include:
[0096] S410, in response to a first parking instruction from a parking scheduling platform, determining a plurality of planned end points based on location information of a target parking space in the first parking instruction;
[0097] S420, determining a planning starting point based on the position information of the first vehicle;
[0098] S430, based on the traffic information of each road in the parking lot, respectively plan paths between the planned starting point and each planned end point to obtain multiple planned paths;
[0099] S440, determining a target path based on the multiple planned paths;
[0100] S450: Based on the target path, control the first vehicle to travel so as to park in the target parking space.
[0101] It can be understood that the parking method of this example can be applied to vehicles, such as the first vehicle mentioned above.
[0102] It can be understood that the first docking instruction is generated by the scheduling platform according to the above embodiment, which will not be described in detail here.
[0103] It can be understood that the first parking instruction includes the location information of the target parking space. The first parking instruction may also include the group where the target parking space is located.
[0104] Exemplarily, the location information of the target parking space may include coordinate information, size information, and orientation information of each side of the target parking space.
[0105] It is understandable that the planned end point where the vehicle can enter the target parking space is determined based on the location information of the target parking space, such as the coordinates and orientation of the four vertices. For example, the planned end point can be any point among the four vertices, or the center point of the parking space, etc.
[0106] It can be understood that there may be one path or multiple paths between a planning starting point and a planning end point.
[0107] It can be understood that the road condition information may include whether the road is interrupted, the degree of traffic congestion on the road, etc.
[0108] Exemplarily, a path with the shortest length is selected from multiple planned paths as the target path.
[0109] Exemplarily, a path with the shortest estimated driving time for the vehicle is selected from multiple planned paths as the target path.
[0110] In this example, the parking path is planned by the vehicle instead of the scheduling platform, which can improve the efficiency of path planning. The vehicle does not need to wait for the platform to plan the path, but only needs the platform to schedule the parking space, which is conducive to improving the parking efficiency of the parking lot. In addition, the use of multiple end points to plan the path can improve the parking success rate.
[0111] In one embodiment, controlling the driving of the first vehicle based on the target path includes: determining a target reversing point among multiple reversing points in a parking lot based on the target path; planning a non-reversing trajectory and a reversing trajectory based on the target path and the target reversing point, wherein the starting point and the end point of the non-reversing trajectory are respectively the starting point of the target path and the starting point of the reversing trajectory, and the end point of the reversing trajectory is the end point of the target path; controlling the forward driving of the first vehicle based on the non-reversing trajectory; and controlling the reverse driving of the first vehicle based on the reversing trajectory when the first vehicle reaches the end point of the non-reversing trajectory.
[0112] It is understandable that this example uses the reverse mode to park into the parking space. When the vehicle is parked out of the parking space, the forward mode can be used to park out.
[0113] It is understandable that there are multiple reversing spots preset in the parking lot.
[0114] It can be understood that if there is a suitable reversing point near the end point of the target path, the reversing point is used as the target reversing point.
[0115] Exemplarily, the reversing starting point is determined from the target path and the reversing point, and then a reversing trajectory is planned from the reversing starting point to the end point of the target path, and a non-reversing trajectory is planned from the starting point of the target path to the reversing starting point.
[0116] It can be understood that when the first vehicle drives to the starting point of the reversing trajectory, the first vehicle is controlled to reverse based on the reversing trajectory.
[0117] According to the above embodiment, a reverse-in and straight-out parking method is adopted to plan the driving trajectory so as to avoid excessive difficulty in parking the vehicle.
[0118] In actual applications, when collecting maps in parking lots, staff will mark several available reversing points on the map according to the actual conditions of the site. Then, when planning the route, they will plan a relatively smoothest driving trajectory based on the optional reversing points.
[0119] Path planning is a process of dynamically planning a path. Finding a reversing point on a dynamic path planning line will make the driving trajectory of the vehicle more chaotic and uncertain when parking, increasing the risk of multi-vehicle game;
[0120] In addition, path planning is generally applicable to finding the shortest path, and it is very likely that no suitable reversing point can be found on the shortest path;
[0121] If a path planning algorithm for calculating the reversing point is introduced separately, it will not only increase the development cost and algorithm complexity, but it will also be difficult to ensure that the calculated path can effectively avoid multi-vehicle game.
[0122] Figure 5 Schematic diagram of a parking scheduling system according to an embodiment of the present disclosure.
[0123] like Figure 5 As shown, the parking scheduling system includes a cloud 510 and one or more vehicle terminals 520 (vehicles).
[0124] When the vehicle 520 is ready to park in the parking lot 530 , the vehicle 520 may send a parking request to the cloud 510 .
[0125] When the cloud 510 receives the parking request of the vehicle 520, the cloud 510 sends the corresponding second parking instruction to the vehicle 520 to schedule the vehicle 520 to park in the parking buffer, and then triggers the parking scheduling of the vehicle 520 according to the sorting order of the vehicles 520 in the parking buffer. The parking scheduling is: the cloud 510 locks a parking space group according to the parking scheduling algorithm and allocates a suitable target parking space for the vehicle 520. Then, the corresponding first parking instruction is sent to the vehicle 520 to return the target parking space to the vehicle end, and after a period of time, the cloud 510 unlocks the parking space group.
[0126] When vehicle 520 receives the second parking instruction, vehicle 520 controls itself to enter the parking buffer area.
[0127] When vehicle 520 receives the first parking instruction, vehicle 520 plans a corresponding driving trajectory according to the current position of vehicle 520 and the target parking space in the first parking instruction, and then controls vehicle 520 to drive according to the driving trajectory so that vehicle 520 drives into the target parking space.
[0128] When the vehicle 520 has been parked in the parking lot and is ready to park out of its parking space, the vehicle 520 may send a parking request to the cloud 510 .
[0129] When the cloud 510 receives the parking exit request of the vehicle 520, the cloud 510 determines whether the parking space group where the vehicle 520 is located is locked. If it is not locked, the cloud 510 locks the parking space group and issues a parking exit instruction to the vehicle 520 to schedule the vehicle 520 to drive out of the parking lot from the parking space where it is located. After locking the parking space group for a period of time, the cloud 510 unlocks the parking space group.
[0130] When the vehicle 520 receives the parking exit instruction, the vehicle 520 controls itself to exit the parking lot 530 from the parking space where it is located.
[0131] Figure 6 It is a structural block diagram of a parking device according to an embodiment of the present disclosure.
[0132] like Figure 6 As shown, the parking device may include:
[0133] A group determination module 610 is used to determine a target parking space group in at least one parking space group in an unlocked state corresponding to the target vehicle buffer zone when a first vehicle is parked in the target vehicle buffer zone;
[0134] A parking space determination module 620, configured to determine a target parking space from among the free parking spaces based on the sorting information of the free parking spaces in the target parking space group;
[0135] A first group locking module 630, configured to change the target parking space group from an unlocked state to a locked state;
[0136] The first parking instruction module 640 is configured to generate a first parking instruction based on the target parking space, and send the first parking instruction to the first vehicle, wherein the first parking instruction is used to instruct the first vehicle to park in the target parking space.
[0137] Figure 7 It is a structural block diagram of a parking device according to another embodiment of the present disclosure.
[0138] like Figure 6 and Figure 7 As shown, Figure 7 The group determination module 710, the parking space determination module 720, the first group locking module 730 and the first parking indication module 740 are respectively connected to Figure 6 The structures and functions of the group determination module 610, the parking space determination module 620, the first group locking module 630 and the first parking indication module 640 are the same and will not be described in detail herein.
[0139] In one embodiment, Figure 7 As shown, the above device also includes:
[0140] The first group unlocking module 750 is configured to restore the target parking space group from a locked state to an unlocked state when the first vehicle is parked in the target parking space.
[0141] In one embodiment, Figure 7 As shown, the above device also includes:
[0142] A first timing module 761, configured to start a first timing when a first parking instruction is sent to the first vehicle;
[0143] The second group unlocking module 762 is configured to restore the target parking space group from a locked state to an unlocked state when the first timed time is greater than a first preset time.
[0144] In one embodiment, Figure 7 As shown, the above device also includes:
[0145] a state detection module 771, configured to detect whether the target parking space group is in an unlocked state in response to a parking request from the first vehicle in the target parking space;
[0146] A second group locking module 772, configured to change the target parking space group from being in an unlocked state to being in a locked state when the target parking space group is in an unlocked state; and
[0147] The parking exit instruction module 773 is used to send a first parking exit instruction to the first vehicle, wherein the first parking exit instruction is used to instruct the first vehicle to park out of the target parking space.
[0148] In one embodiment, Figure 7 As shown, the above device also includes:
[0149] A second timing module 781, configured to start a second timing when a first parking instruction is sent to the first vehicle;
[0150] The second group unlocking module 782 is configured to change the target parking space group from a locked state to an unlocked state when the second timed time is greater than a second preset time.
[0151] In one embodiment, the parking space determination module 720 includes one of the following:
[0152] A first determining unit 721 is configured to select a vacant parking space with the smallest ranking from the target parking space group as the target parking space when the parking spaces in the target parking space group are sorted in ascending order according to the distance from the parking lot entrance from far to near;
[0153] The second determining unit 722 is configured to select a vacant parking space with the largest ranking from the target parking space group as the target parking space when the parking spaces in the target parking space group are sorted in descending order according to the distances from the parking lot entrance.
[0154] In one embodiment, Figure 7 As shown, the above device also includes:
[0155] a buffer zone determination module 791 for determining the target vehicle buffer zone in each vehicle buffer zone in response to the parking request from the first vehicle based on the number of vehicles waiting to park in each vehicle buffer zone in the parking lot;
[0156] The second parking instruction module 792 is configured to send a second parking instruction to the first vehicle based on the target vehicle buffer zone, wherein the second parking instruction is used to instruct the first vehicle to park in the target vehicle buffer zone.
[0157] The embodiment of the present disclosure further provides a parking device, which is applied to a first vehicle and is specifically used to: in response to a first parking instruction from a parking scheduling platform, control the first vehicle to travel based on a target parking space in the first parking instruction, so that the first vehicle is parked in the target parking space;
[0158] The first parking instruction is an instruction generated when the scheduling platform executes any parking method of the embodiments of the present disclosure.
[0159] Figure 8 It is a structural block diagram of a parking device according to another embodiment of the present disclosure.
[0160] like Figure 8 As shown, the parking device comprises:
[0161] The end point determination module 810 is used to determine a plurality of planned end points based on the position information of the target parking space in the first parking instruction in response to the first parking instruction from the parking scheduling platform;
[0162] A starting point determination module 820, configured to determine a planned starting point based on the position information of the first vehicle;
[0163] A path planning module 830 is used to plan paths between the planned starting point and each of the planned end points based on the traffic information of each road in the parking lot, so as to obtain multiple planned paths;
[0164] A path screening module 840 is used to determine a target path based on the multiple planned paths;
[0165] The vehicle control module 850 is used to control the first vehicle to travel based on the target path so as to park in the target parking space.
[0166] Fig. 9 It is a structural block diagram of a parking device according to another embodiment of the present disclosure.
[0167] like Figure 8 and Fig. 9 As shown, Fig. 9The end point determination module 910, the starting point determination module 920, the path planning module 930, the path screening module 940 and the vehicle control module 950 are respectively Figure 8 The structures and functions of the end point determination module 810, the starting point determination module 820, the path planning module 830, the path screening module 840 and the vehicle control module 850 are the same and will not be described in detail here.
[0168] In one embodiment, the vehicle control module 950 in the above device includes:
[0169] A backing point determination unit 951, configured to determine a target backing point from among a plurality of backing points in the parking lot based on the target path;
[0170] A trajectory planning unit 952, configured to plan a non-reversing trajectory and a reversing trajectory based on the target path and the target reversing point, wherein the starting point and the end point of the non-reversing trajectory are respectively the starting point of the target path and the starting point of the reversing trajectory, and the end point of the reversing trajectory is the end point of the target path;
[0171] A forward driving unit 953, configured to control the first vehicle to drive forward based on the non-reversing trajectory;
[0172] The reverse driving unit 954 is used to control the first vehicle to reverse drive based on the reverse trajectory when the first vehicle drives to the end point of the non-reverse trajectory.
[0173] For the description of specific functions and examples of each module and submodule of the device in the embodiment of the present disclosure, reference can be made to the relevant description of the corresponding steps in the above method embodiment, which will not be repeated here.
[0174] In the technical solution disclosed herein, the acquisition, storage and application of user personal information involved are in compliance with the provisions of relevant laws and regulations and do not violate public order and good morals.
[0175] According to an embodiment of the present disclosure, the present disclosure further provides an electronic device, a readable storage medium and a computer program product. The electronic device may be a server, and the server may also include any power supply control device in the embodiment of the present disclosure.
[0176] Fig.10A schematic block diagram of an example electronic device 1000 that can be used to implement an embodiment of the present disclosure is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital assistants, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.
[0177] like Fig.10 As shown, the electronic device 1000 includes a computing unit 1001, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 1002 or a computer program loaded from a storage unit 1008 into a random access memory (RAM) 1003. In the RAM 1003, various programs and data required for the operation of the electronic device 1000 can also be stored. The computing unit 1001, the ROM 1002, and the RAM 1003 are connected to each other via a bus 1004. An input / output (I / O) interface 1005 is also connected to the bus 1004.
[0178] Multiple components in the electronic device 1000 are connected to the I / O interface 1005, including: an input unit 1006, such as a keyboard, a mouse, etc.; an output unit 1006, such as various types of displays, speakers, etc.; a storage unit 1008, such as a disk, an optical disk, etc.; and a communication unit 1009, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 1009 allows the electronic device 1000 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.
[0179] The computing unit 1001 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 1001 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 1001 performs the various methods and processes described above, such as a parking method. For example, in some embodiments, a parking method may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 1008. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 1000 via the ROM 1002 and / or the communication unit 1009. When the computer program is loaded into the RAM 1003 and executed by the computing unit 1001, one or more steps in the parking method described above may be performed. Alternatively, in other embodiments, the computing unit 1001 may be configured to execute a parking method in any other appropriate manner (eg, by means of firmware).
[0180] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.
[0181] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.
[0182] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0183] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).
[0184] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.
[0185] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship with each other. The server may be a cloud server, a server of a distributed system, or a server combined with a blockchain.
[0186] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this disclosure can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.
[0187] The above specific implementations do not constitute a limitation on the protection scope of the present disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the principles of the present disclosure shall be included in the protection scope of the present disclosure.
Claims
1. A parking method, comprising: In the case where the first vehicle is parked in the target vehicle buffer zone, determining a target parking space group in at least one parking space group in an unlocked state corresponding to the target vehicle buffer zone; Determining a target parking space among the free parking spaces based on the sorting information of the free parking spaces in the target parking space group; Changing the target parking space group from being in an unlocked state to being in a locked state; generating a first parking instruction based on the target parking space; The first parking instruction is sent to the first vehicle, wherein the first parking instruction is used to instruct the first vehicle to park in the target parking space.
2. The method according to claim 1, further comprising: When the first vehicle is parked in the target parking space, the target parking space group is restored from being in a locked state to being in an unlocked state.
3. The method according to claim 1, further comprising: When a first parking instruction is sent to the first vehicle, starting a first timer; When the first timed time is greater than a first preset time, the target parking space group is restored from a locked state to an unlocked state.
4. The method according to any one of claims 1 to 3, further comprising: In response to a parking request from the first vehicle in the target parking space, detecting whether the target parking space group is in an unlocked state; When the target parking space group is in an unlocked state, changing the target parking space group from an unlocked state to a locked state; as well as A first parking exit instruction is sent to the first vehicle, wherein the first parking exit instruction is used to instruct the first vehicle to park out of the target parking space.
5. The method according to claim 4, further comprising: When a first parking instruction is sent to the first vehicle, a second timer is started; When the second timed time is greater than a second preset time, the target parking space group is changed from being in a locked state to being in an unlocked state.
6. The method according to any one of claims 1 to 5, wherein: The determining of the target parking space from among the free parking spaces based on the sorting information of the free parking spaces in the target parking space group comprises one of the following: When the parking spaces in the target parking space group are sorted in ascending order according to the distance from the parking lot entrance from far to near, selecting the vacant parking space with the smallest sorting from the target parking space group as the target parking space; When the parking spaces in the target parking space group are sorted in descending order according to the distance from the parking lot entrance, the vacant parking space with the largest ranking is selected from the target parking space group as the target parking space.
7. The method according to any one of claims 1 to 6, further comprising: In response to a parking request from the first vehicle, determining the target vehicle buffer zone in each vehicle buffer zone in the parking lot based on the number of vehicles waiting to park in the respective vehicle buffer zones; generating a second parking instruction based on the target vehicle buffer zone; The second parking instruction is sent to the first vehicle, wherein the second parking instruction is used to instruct the first vehicle to park in the target vehicle buffer area.
8. A parking method, comprising: In response to a first parking instruction from a parking scheduling platform, based on a target parking space in the first parking instruction, controlling the first vehicle to travel so that the first vehicle parks in the target parking space; The first docking instruction is an instruction generated during the process in which the scheduling platform executes the method according to any one of claims 1 to 7.
9. The method according to claim 8, wherein: The controlling the first vehicle to travel based on the target parking space in the first parking instruction includes: determining a plurality of planned end points based on the position information of the target parking space in the first parking instruction; Determining a planning starting point based on the position information of the first vehicle; Based on the traffic information of each road in the parking lot, path planning is performed between the planned starting point and each planned end point to obtain multiple planned paths; Determining a target path based on the multiple planned paths; Based on the target path, the first vehicle is controlled to travel so as to park in the target parking space.
10. The method according to claim 9, wherein: The controlling the first vehicle to travel based on the target path includes: determining a target backing point among a plurality of backing points in the parking lot based on the target path; Based on the target path and the target reversing point, a non-reversing trajectory and a reversing trajectory are planned, wherein the starting point and the end point of the non-reversing trajectory are respectively the starting point of the target path and the starting point of the reversing trajectory, and the end point of the reversing trajectory is the end point of the target path; Based on the non-reversing trajectory, controlling the first vehicle to travel forward; When the first vehicle reaches an end point of the non-reversing trajectory, the first vehicle is controlled to reverse based on the reversing trajectory.
11. A parking device, comprising: a group determination module, configured to determine a target parking space group from at least one parking space group in an unlocked state corresponding to the target vehicle buffer zone when a first vehicle is parked in the target vehicle buffer zone; a parking space determination module, configured to determine a target parking space among the free parking spaces based on the sorting information of the free parking spaces in the target parking space group; A first group locking module, configured to change the target parking space group from an unlocked state to a locked state; The first parking instruction module is configured to generate a first parking instruction based on the target parking space, and send the first parking instruction to the first vehicle, wherein the first parking instruction is used to instruct the first vehicle to park in the target parking space.
12. The apparatus according to claim 11, further comprising: The first group unlocking module is used to restore the target parking space group from a locked state to an unlocked state when the first vehicle is parked in the target parking space.
13. The apparatus according to claim 11, further comprising: A first timing module, configured to start a first timing when a first parking instruction is sent to the first vehicle; The second group unlocking module is used to restore the target parking space group from a locked state to an unlocked state when the first timed time is greater than a first preset time.
14. The device according to any one of claims 11 to 13, further comprising: a state detection module, configured to detect whether the target parking space group is in an unlocked state in response to a parking request from the first vehicle in the target parking space; a second group locking module, configured to change the target parking space group from being in an unlocked state to being in a locked state when the target parking space group is in an unlocked state; as well as The parking exit instruction module is used to send a first parking exit instruction to the first vehicle, wherein the first parking exit instruction is used to instruct the first vehicle to park out of the target parking space.
15. The apparatus according to claim 14, further comprising: A second timing module, configured to start a second timing when a first parking instruction is sent to the first vehicle; The second group unlocking module is used to change the target parking space group from a locked state to an unlocked state when the second timed time is greater than a second preset time.
16. The device according to any one of claims 11 to 15, wherein: The parking space determination module includes one of the following: A first determining unit is configured to select a vacant parking space with the smallest ranking from the target parking space group as the target parking space when the parking spaces in the target parking space group are sorted in ascending order according to the distance from the parking lot entrance from far to near; The second determining unit is configured to select a vacant parking space with the largest ranking from the target parking space group as the target parking space when the parking spaces in the target parking space group are sorted in descending order according to the distances from the parking lot entrance.
17. The apparatus according to any one of claims 11 to 16, further comprising: a buffer zone determination module, configured to determine the target vehicle buffer zone in each vehicle buffer zone in the parking lot in response to the parking request from the first vehicle and based on the number of vehicles waiting to park in each vehicle buffer zone in the parking lot; The second parking instruction module is used to generate a second parking instruction based on the target vehicle buffer zone, and send the second parking instruction to the first vehicle, wherein the second parking instruction is used to instruct the first vehicle to park in the target vehicle buffer zone.
18. A parking device, used for: In response to a first parking instruction from a parking scheduling platform, based on a target parking space in the first parking instruction, controlling the first vehicle to travel so that the first vehicle parks in the target parking space; in, The first docking instruction is an instruction generated when the scheduling platform executes the method according to any one of claims 1 to 7.
19. The apparatus according to claim 18, comprising: an end point determination module, configured to respond to a first parking instruction from a parking scheduling platform and determine a plurality of planned end points based on position information of a target parking space in the first parking instruction; A starting point determination module, used to determine a planned starting point based on the position information of the first vehicle; A path planning module, for planning paths between the planned starting point and each of the planned end points based on the traffic information of each road in the parking lot, to obtain a plurality of planned paths; A path screening module, used for determining a target path based on the multiple planned paths; The vehicle control module is used to control the first vehicle to travel based on the target path so as to park in the target parking space.
20. The device according to claim 19, wherein The vehicle control module comprises: a backing point determination unit, configured to determine a target backing point among a plurality of backing points in the parking lot based on the target path; a trajectory planning unit, configured to plan a non-reversing trajectory and a reversing trajectory based on the target path and the target reversing point, wherein a starting point and an end point of the non-reversing trajectory are respectively a starting point of the target path and a starting point of the reversing trajectory, and an end point of the reversing trajectory is an end point of the target path; a forward driving unit, configured to control the first vehicle to travel forward based on the non-reversing trajectory; The reverse driving unit is used to control the first vehicle to reverse drive based on the reverse trajectory when the first vehicle drives to an end point of the non-reverse trajectory.
21. An electronic device, comprising: at least one central processing unit; as well as A memory in communication with the at least one central processing unit; wherein, The memory stores instructions that can be executed by the at least one central processor, and the instructions are executed by the at least one central processor to enable the at least one central processor to perform the method according to any one of claims 1 to 10.
22. A non-transitory computer-readable storage medium storing computer instructions, wherein: The computer instructions are used to cause the computer to execute the method according to any one of claims 1-10.
23. A computer program product comprising a computer program, which, when executed by a processor, implements the method according to any one of claims 1 to 10.
