Lane planning method and device and electronic equipment
By obtaining and analyzing lane distance, vehicle information and congestion parameters, the optimal lane path for unmanned vehicles is determined, which solves the congestion problem caused by unreasonable lane planning and improves operating efficiency.
Patent Information
- Application Number
- CN202411009548.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-25
- Publication Date
- 2024-11-12
AI Technical Summary
In the prior art, when unmanned vehicles are transported, due to unreasonable lane planning, vehicles are congested, and the paths entering and leaving the yard are planned close to the inner lane of the yard, resulting in reduced operational efficiency.
By obtaining distance information and vehicle information of multiple optional lanes between the task location and the starting location of the target vehicle, combining the blocking parameters, the optimal planned lane is determined and sent to the target vehicle to drive according to the planned lane. Avoid congestion.
It improves the transportation operation efficiency of driverless vehicles, ensures that the vehicles perform tasks safely and quickly, and reduces lane congestion.
Smart Images

Figure CN118936501A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of unmanned driving technology, and in particular to a lane planning method, device and electronic equipment. Background Art
[0002] With the development of technology, container loading and unloading in many ports has been automated, with unmanned vehicles transporting containers. Figure 1 As shown in the figure, it mainly consists of three parts. The first is the quay crane area, which is the core area for completing container loading and unloading operations. The next is the yard area, which is the core area for completing container storage, loading and unloading and transportation. Finally, the lanes in and out of the yard and the main road area are the core areas for completing container transportation and traffic diversion.
[0003] In the prior art, the path distance is usually used as the evaluation criterion, which results in the path planning of entering and exiting the yard being planned to the inner lane close to the yard. When there are many vehicles operating at the same time, such as Figure 2 As shown in the figure, due to unreasonable lane planning, all vehicles will drive in the inner lane, which may easily cause congestion and reduce working efficiency. Summary of the invention
[0004] In view of this, the present application provides a lane planning method, device and electronic equipment to solve the problem in the prior art that unmanned vehicles are prone to congestion during transportation operations due to unreasonable lane planning, resulting in reduced overall operating efficiency.
[0005] To achieve the above objectives, this application provides the following technical solutions:
[0006] The first aspect of the present application discloses a lane planning method, comprising:
[0007] Get the mission location of the target vehicle;
[0008] Determine the distance information and vehicle information of multiple optional lanes between the mission location and the starting location where the target vehicle is located; wherein the distance information represents the distance of the optional lanes, and the vehicle information represents the number of vehicles located on the optional lanes;
[0009] Determining a planned lane corresponding to the target vehicle from among the plurality of optional lanes according to the distance information and the vehicle information;
[0010] The planned lane is sent to the target vehicle, so that the target vehicle drives toward the task location according to the planned lane.
[0011] Optionally, in the above method, obtaining the mission location of the target vehicle includes:
[0012] Receive the task information of the target vehicle; wherein the task information includes a task number, a task location and a container number;
[0013] The mission location of the target vehicle is obtained from the mission information.
[0014] Optionally, in the above method, the task location is located at a first yard, the starting location is located at a quay crane, and the first yard is any one of a plurality of yards;
[0015] The step of determining a planned lane corresponding to the target vehicle from among the plurality of optional lanes according to the distance information and the vehicle information includes:
[0016] Obtaining a plurality of congestion parameters corresponding to a plurality of storage yards; wherein the congestion parameter corresponding to each of the storage yards represents the vehicle congestion condition on the storage yard lane of the storage yard; and the congestion parameter corresponding to each of the storage yards is obtained according to the operation status and driving status of the vehicles on the storage yard lane of the storage yard;
[0017] A planned lane corresponding to the target vehicle is determined from a plurality of lanes entering the yard according to the distance information, the vehicle information and the congestion parameter.
[0018] Optionally, in the above method, determining a planned lane corresponding to the target vehicle from a plurality of lanes entering the yard according to the distance information, the vehicle information and the congestion parameter includes:
[0019] In the case where the congestion parameter of the first stacking yard is in a non-congestion state, determining whether the congestion parameters of other stacking yards are in a congestion state; wherein the other stacking yards refer to stacking yards other than the first stacking yard;
[0020] If the congestion parameter of at least one of the other storage yards is in a congestion state, and the storage yard in the congestion state is located inside the first storage yard, the lane weight of the first outer lane is calculated according to a preset outer lane weight formula and the distance information of the first outer lane among the multiple storage yard entry lanes, and the planned lane corresponding to the target vehicle is determined based on the lane weight of the first outer lane, where the first outer lane is a lane farther from the storage yard among the multiple parallel storage yard entry lanes; the lane weight is used to characterize the lane capacity, and the larger the lane weight of the lane, the worse the lane capacity;
[0021] If the congestion parameter of at least one of the other storage yards is in a congestion state, and the storage yard in the congestion state is located outside the first storage yard, the lane weight of the first inner lane is calculated according to a preset first inner lane weight formula, the distance information of the first inner lane among the multiple storage yard entry lanes, and the vehicle information, and the planned lane corresponding to the target vehicle is determined based on the lane weight of the first inner lane, where the first inner lane is a lane closer to the storage yard among the multiple parallel storage yard entry lanes;
[0022] If the congestion parameters of the other yards are all in a non-congested state, the lane weights of the lanes entering the yard are calculated according to a preset full-lane weight formula, the distance information and the vehicle information, and the planned lane corresponding to the target vehicle is determined among the multiple lanes entering the yard based on the lane weights of the lanes entering the yard.
[0023] Optionally, in the above method, determining a planned lane corresponding to the target vehicle from a plurality of lanes entering the yard according to the distance information, the vehicle information and the congestion parameter includes:
[0024] When the blocking parameter of the first stacking yard is in a blocking state, determining whether the first stacking yard is the outermost stacking yard;
[0025] If the first yard is the outermost yard, the lane weight of the first outer lane is calculated according to the outer lane weight formula and the distance information of the first outer lane among the multiple yard entry lanes, and the planned lane corresponding to the target vehicle is determined based on the lane weight of the first outer lane, and a first parking instruction is sent to the target vehicle; wherein the first parking instruction is used to instruct the target vehicle to park and wait when other vehicles enter the first inner lane, the first outer lane is a lane farther from the yard among the multiple parallel yard entry lanes, and the first inner lane is a lane closer to the yard among the multiple parallel yard entry lanes;
[0026] If the first yard is not the outermost yard, the lane weight of the first inner lane is calculated according to the first inner lane weight formula, the distance information of the first inner lane among the multiple yard entry lanes and the vehicle information, and the planned lane corresponding to the target vehicle is determined based on the lane weight of the first inner lane, and a second parking instruction is sent to the target vehicle; wherein the second parking instruction is used to instruct the target vehicle to park and wait when other vehicles enter the first outer lane.
[0027] Optionally, in the above method, the task location is located at the quay crane, the starting location is located at the first yard, and the first yard is any one of the multiple yards;
[0028] The step of determining a planned lane corresponding to the target vehicle from among the plurality of optional lanes according to the distance information and the vehicle information includes:
[0029] The lane weight of the second outer lane is calculated according to the outer lane weight formula and the distance information of the second outer lane among the multiple out-yard lanes; wherein the second outer lane is a lane farther from the yard among the multiple parallel out-yard lanes;
[0030] The lane weight of the second inner lane is calculated according to a preset second inner lane weight formula, the distance information of the second inner lane among the multiple out-yard lanes, and the vehicle information; wherein the second inner lane is a lane closer to the yard among the multiple parallel out-yard lanes;
[0031] The lane with the smallest lane weight among the outbound lanes is used as the planned lane corresponding to the target vehicle.
[0032] Optionally, in the above method, the task location is located at a first yard, the starting location is located at a second yard, and the first yard and the second yard are any one of a plurality of yards;
[0033] The method further comprises:
[0034] In the case where the first storage yard and the second storage yard are the same storage yard and the task location is located behind the starting location, determining whether the target distance between the task location and the starting location is greater than a preset distance threshold; wherein the distance threshold is used to represent the distance at which the vehicle needs to re-plan its path;
[0035] If the target distance is not greater than the distance threshold, sending a reversing instruction to the target vehicle to instruct the target vehicle to reverse to the task location;
[0036] The step of determining a planned lane corresponding to the target vehicle from among the plurality of optional lanes according to the distance information and the vehicle information includes:
[0037] If the target distance is greater than the distance threshold or the first yard and the second yard are different yards, a planned lane corresponding to the target vehicle is determined from the plurality of optional lanes according to the distance information and the vehicle information.
[0038] Optionally, in the above method, if the target distance is greater than the distance threshold or the first yard and the second yard are different yards, determining a planned lane corresponding to the target vehicle from a plurality of optional lanes according to the distance information and the vehicle information, includes:
[0039] Determine, according to the distance information and the vehicle information, a first planned lane corresponding to the target vehicle from a plurality of out-yard lanes, wherein the first planned lane is used for the target vehicle to drive from the second yard to the quay crane;
[0040] A second planned lane corresponding to the target vehicle is determined from a plurality of lanes entering the yard according to the distance information and the vehicle information, and the second planned lane is used for the target vehicle to drive from the quay crane to the first yard.
[0041] The second aspect of the present application further discloses a lane planning device, comprising:
[0042] An acquisition unit, used for acquiring a mission location of a target vehicle;
[0043] A first determination unit is used to determine distance information and vehicle information of a plurality of optional lanes between the mission location and the starting location where the target vehicle is located; wherein the distance information represents the distance of the optional lanes, and the vehicle information represents the number of vehicles located on the optional lanes;
[0044] A second determining unit, configured to determine a planned lane corresponding to the target vehicle from among the plurality of optional lanes according to the distance information and the vehicle information;
[0045] The sending unit sends the planned lane to the target vehicle, so that the target vehicle drives to the task location according to the planned lane.
[0046] Optionally, in the above device, the acquisition unit includes:
[0047] A receiving subunit, used to receive the mission information of the target vehicle; wherein the mission information includes a mission number, a mission location and a container number;
[0048] The first acquisition subunit is used to obtain the task location of the target vehicle from the task information.
[0049] Optionally, in the above device, the task location is located at a first yard, the starting location is located at a quay crane, and the first yard is any one of a plurality of yards; and the second determining unit includes:
[0050] The second acquisition subunit is used to obtain a plurality of congestion parameters corresponding to a plurality of storage yards; wherein the congestion parameter corresponding to each storage yard represents the vehicle congestion situation on the storage yard lane of the storage yard; the congestion parameter corresponding to each storage yard is obtained according to the operation status and driving status of the vehicles on the storage yard lane of the storage yard;
[0051] The first planning subunit is used to determine a planned lane corresponding to the target vehicle from a plurality of lanes entering the yard according to the distance information, the vehicle information and the congestion parameter.
[0052] Optionally, in the above device, the first planning subunit includes:
[0053] a determination subunit, configured to determine whether the congestion parameters of other yards are in a congestion state when the congestion parameter of the first yard is in a non-congestion state; wherein the other yards refer to yards other than the first yard;
[0054] A second planning subunit is used for, if the congestion parameter of at least one of the other storage yards is in a congestion state, and the storage yard in the congestion state is located inside the first storage yard, calculating the lane weight of the first outer lane according to a preset outer lane weight formula and the distance information of the first outer lane among the multiple storage yard entry lanes, and determining the planned lane corresponding to the target vehicle based on the lane weight of the first outer lane, wherein the first outer lane is a lane farther from the storage yard among the multiple parallel storage yard entry lanes; the lane weight is used to characterize the traffic capacity of the lane, and the larger the lane weight of the lane, the worse the traffic capacity of the lane;
[0055] A third planning subunit is used for, if the congestion parameter of at least one of the other storage yards is in a congestion state, and the storage yard in the congestion state is located outside the first storage yard, calculating the lane weight of the first inner lane according to a preset first inner lane weight formula, the distance information of the first inner lane among the plurality of storage yard entry lanes, and the vehicle information, and determining the planned lane corresponding to the target vehicle based on the lane weight of the first inner lane, wherein the first inner lane is a lane that is closer to the storage yard among the plurality of parallel storage yard entry lanes;
[0056] The fourth planning subunit is used to calculate the lane weight of each of the entry lanes according to a preset full-lane weight formula, the distance information and the vehicle information if the congestion parameters of the other yards are all in a non-congested state, and determine the planned lane corresponding to the target vehicle among the multiple entry lanes based on the lane weights of each of the entry lanes.
[0057] Optionally, in the above device, the first planning subunit includes:
[0058] A second determining subunit is used to determine whether the first yard is the outermost yard when the blocking parameter of the first yard is in a blocking state;
[0059] A fifth planning subunit is used for, if the first yard is the outermost yard, calculating the lane weight of the first outer lane according to the outer lane weight formula and the distance information of the first outer lane among the multiple yard entry lanes, and determining the planned lane corresponding to the target vehicle based on the lane weight of the first outer lane, and sending a first parking instruction to the target vehicle; wherein the first parking instruction is used to instruct the target vehicle to park and wait when other vehicles enter the first inner lane, the first outer lane is a lane farther from the yard among the multiple parallel yard entry lanes, and the first inner lane is a lane closer to the yard among the multiple parallel yard entry lanes;
[0060] a sixth planning subunit, for calculating the lane weight of the first inner lane according to the first inner lane weight formula, the distance information of the first inner lane among the plurality of lanes entering the yard and the vehicle information if the first yard is not the outermost yard, and determining the planned lane corresponding to the target vehicle based on the lane weight of the first inner lane, and sending a second parking instruction to the target vehicle; wherein the second parking instruction is used to instruct the target vehicle to park and wait when other vehicles enter the first outer lane.
[0061] Optionally, in the above-mentioned device, the task location is located at a quay crane, the starting location is located at a first yard, and the first yard is any one of a plurality of yards; the second determination unit includes:
[0062] A third determining subunit is configured to calculate a lane weight of the second outer lane according to the outer lane weight formula and the distance information of the second outer lane among the multiple out-yard lanes; wherein the second outer lane is a lane farther from the yard among the multiple parallel out-yard lanes;
[0063] a fourth determination subunit, configured to calculate a lane weight of the second inner lane according to a preset second inner lane weight formula, the distance information of the second inner lane among the plurality of out-yard lanes, and the vehicle information; wherein the second inner lane is a lane that is closer to the yard among the plurality of parallel out-yard lanes;
[0064] The fifth determining subunit is configured to use the lane with the smallest lane weight among the out-of-yard lanes as the planned lane corresponding to the target vehicle.
[0065] Optionally, in the above device, the task location is located at a first yard, the starting location is located at a second yard, and the first yard and the second yard are any one of a plurality of yards; the above device further comprises:
[0066] a third determination unit, configured to determine whether a target distance between the task location and the starting location is greater than a preset distance threshold when the first storage yard and the second storage yard are the same storage yard and the task location is located behind the starting location; wherein the distance threshold is used to represent a distance for which the vehicle needs to re-plan its path;
[0067] A second sending unit is used to send a reversing instruction to the target vehicle if the target distance is not greater than the distance threshold, so as to instruct the target vehicle to reverse to the task location;
[0068] The second determining unit includes:
[0069] A fourth determining unit is used to determine a planned lane corresponding to the target vehicle from the plurality of optional lanes according to the distance information and the vehicle information if the target distance is greater than the distance threshold or the first yard and the second yard are different yards.
[0070] Optionally, in the above device, the fourth determining unit includes:
[0071] a seventh planning subunit, configured to determine, according to the distance information and the vehicle information, a first planned lane corresponding to the target vehicle from a plurality of out-yard lanes, wherein the first planned lane is used for the target vehicle to drive from the second yard to the quay crane;
[0072] The eighth planning subunit is used to determine a second planned lane corresponding to the target vehicle from multiple lanes entering the yard according to the distance information and the vehicle information, and the second planned lane is used for the target vehicle to drive from the quay crane to the first yard.
[0073] The third aspect of the present application discloses an electronic device, comprising:
[0074] one or more processors;
[0075] a storage device having one or more programs stored thereon;
[0076] When the one or more programs are executed by the one or more processors, the one or more processors implement the method as described in any one of the first aspects of the present application.
[0077] It can be seen from the above technical solution that in a lane planning method provided by the present application, the task location of the target vehicle is first obtained. Then the distance information and vehicle information of multiple optional lanes between the task location and the starting location where the target vehicle is located are determined; wherein the distance information represents the distance of the optional lane, and the vehicle information represents the number of vehicles located on the optional lane. Then, based on the distance information and the vehicle information, the planned lane corresponding to the target vehicle is determined among the multiple optional lanes. Finally, the planned lane is sent to the target vehicle, so that the target vehicle drives to the task location according to the planned lane. It can be seen that the present application can consider the current position of other vehicles on the basis of the distance, and combine the environment in which the vehicle is located at this time to judge the traffic conditions and congestion conditions of each lane, so as to plan the optimal lane path for the vehicle, so that the vehicle can perform tasks safely and quickly, and improve the overall work efficiency. BRIEF DESCRIPTION OF THE DRAWINGS
[0078] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying any creative work.
[0079] Figure 1 A container terminal layout diagram disclosed as background technology;
[0080] Figure 2 A schematic diagram of the driving path of an unmanned vehicle for the shortest path planning in the background technology;
[0081] Figure 3 A flow chart of a lane planning method disclosed in an embodiment of the present application;
[0082] Figure 4 A flowchart of an implementation method of determining a planned lane corresponding to a target vehicle among multiple lanes entering a storage yard according to distance information, vehicle information and congestion parameters disclosed in another embodiment of the present application;
[0083] Figure 5 A schematic diagram of planning a driving path for an unmanned vehicle in a situation where a target yard is not congested and other yards are congested, disclosed in another embodiment of the present application;
[0084] Figure 6 A schematic diagram of planning a driving path for an unmanned vehicle when both a target yard and other yards are congested, disclosed in another embodiment of the present application;
[0085] Figure 7A flowchart of an implementation method of determining a planned lane corresponding to a target vehicle among multiple lanes entering a storage yard according to distance information, vehicle information and congestion parameters disclosed in another embodiment of the present application;
[0086] Figure 8 A schematic diagram of planning a driving path for an unmanned vehicle when the target yard is congested and is the outermost operating yard, disclosed in another embodiment of the present application;
[0087] Fig. 9 A schematic diagram of planning a driving path for an unmanned vehicle in a case where the target yard is congested and is not the outermost operation yard, disclosed in another embodiment of the present application;
[0088] Fig.10 This is a flowchart of an implementation of step S303 disclosed in another embodiment of the present application;
[0089] Fig.11 A schematic diagram of a planned driving path from a storage yard to a quay crane for an unmanned vehicle disclosed in another embodiment of the present application;
[0090] Fig.12 A schematic diagram of a driving route for planning an unmanned vehicle from one storage yard to another storage yard (the same storage yard) disclosed in another embodiment of the present application;
[0091] Fig.13 A schematic diagram of a driving route for planning an unmanned vehicle from one storage yard to another storage yard (different storage yards) disclosed in another embodiment of the present application;
[0092] Fig.14 A schematic diagram of a route for planning an unmanned vehicle from one storage yard to another storage yard (the same storage yard) disclosed in another embodiment of the present application;
[0093] Fig.15 A schematic diagram of a lane planning device disclosed in another embodiment of the present application;
[0094] Fig.16 A schematic diagram of an electronic device disclosed in another embodiment of the present application. DETAILED DESCRIPTION
[0095] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0096] In this application, the terms "comprises", "comprising" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device comprising a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprising a ..." does not exclude the presence of other identical elements in the process, method, article or device comprising the element.
[0097] Furthermore, in this document, relational terms such as first and second, etc. are used only to distinguish one entity or operation from another entity or operation, but do not necessarily require or imply any such actual relationship or order between these entities or operations.
[0098] As can be seen from the background technology, in the prior art, the path distance is usually used as the evaluation criterion, which leads to the path planning in and out of the yard being planned to the inner lane close to the yard. When there are many vehicles operating at the same time, such as Figure 2 As shown in the figure, due to unreasonable lane planning, all vehicles will drive in the inner lane, which may easily cause congestion and reduce working efficiency.
[0099] In view of this, the present application provides a lane planning method, device and electronic equipment to solve the problem in the prior art that unmanned vehicles are prone to congestion during transportation operations due to unreasonable lane planning, resulting in reduced overall operating efficiency.
[0100] The present application embodiment provides a method for lane planning, such as Figure 3 As shown, specifically including:
[0101] S301, obtaining the mission location of the target vehicle.
[0102] It should be noted that when tasks such as container transportation, loading and unloading are required, the Fleet Management System (FMS, as the cloud brain of the driverless fleet, including real-time monitoring, vehicle scheduling, traffic management, and data service modules) first obtains the task location of the target vehicle, where the target vehicle is the vehicle that needs to perform the current task, and the task location is the target location to which the container needs to be transported.
[0103] Optionally, in another embodiment of the present application, an implementation of step S301 may include:
[0104] Receive mission information of the target vehicle; wherein the mission information includes a mission number, a mission location and a container number.
[0105] The mission location of the target vehicle is obtained from the mission information.
[0106] It should be noted that the fleet management system receives the task information from the existing port business system Terminal Operation System (TOS), wherein the task information includes the task number, task location and container number, and then obtains the task location of the target vehicle from the task information.
[0107] S302, determining distance information and vehicle information of multiple optional lanes between the mission location and the starting location where the target vehicle is located; wherein the distance information represents the distance of the optional lanes, and the vehicle information represents the number of vehicles located on the optional lanes.
[0108] It should be noted that since there are multiple passable lanes between the mission location and the starting location where the target vehicle is located, the path distance and the number of vehicles between the mission location corresponding to each lane and the starting location where the target vehicle is located are determined separately. Among them, the vehicle signal (Json format) of each unmanned vehicle is obtained from the Redis database (used to store the vehicle's current status (whether it is online), current position coordinates, speed, path, vehicle vin number and other vehicle condition information). If the vehicle signal is not empty, it means that the vehicle is online. For online vehicles, the coordinates and speed of the current moment are read from the vehicle signal, and the lane where the vehicle is located is located according to the coordinates, so that the number of vehicles on each lane can be obtained.
[0109] S303: Determine a planned lane corresponding to the target vehicle from among multiple optional lanes based on the distance information and the vehicle information.
[0110] It should be noted that after determining the path distance and the number of vehicles between the task location corresponding to each lane and the starting location where the target vehicle is located, the planned lane corresponding to the target vehicle is determined from multiple optional lanes based on the distance information and vehicle information, and the lane with the shortest path is selected as the planned lane corresponding to the target vehicle while avoiding vehicle congestion.
[0111] Optionally, in another embodiment of the present application, when the task location is located at the first yard, the starting location is located at the quay crane, and the first yard is any one of multiple yards, an implementation of step S203 includes:
[0112] A plurality of congestion parameters corresponding to a plurality of storage yards are obtained; wherein the congestion parameter corresponding to each storage yard represents the vehicle congestion situation on the storage yard lane of the storage yard; and the congestion parameter corresponding to each of the storage yards is obtained according to the operating status and driving status of the vehicles on the storage yard lane of the storage yard.
[0113] According to the distance information, vehicle information and congestion parameters, the planned lane corresponding to the target vehicle is determined among multiple lanes entering the yard.
[0114] It should be noted that when the task location is at the first yard, the starting location is at the quay crane, and the first yard is any one of multiple yards, it is necessary to perform multi-lane dynamic path planning from the quay crane to the yard, and the vehicle goes from the quay crane to the yard to unload the container. First, multiple congestion parameters corresponding to multiple yards are obtained. Figure 1 For example, the congestion parameters corresponding to the three yards are obtained respectively; wherein, the congestion parameters corresponding to each yard characterize the vehicle congestion on the yard lane of the yard. The congestion parameters include 0, 1, and 2. 0 represents that there are no vehicles operating in the yard, 1 represents that there are vehicles operating but the yard is congested, and there is a vehicle closest to the yard exit with a speed of 0 and the distance from the yard starting point is less than the distance threshold of the yard congestion, 2 represents that there are vehicles operating in the yard but the yard is not congested, and there is a vehicle closest to the yard exit with a speed of 0 and the distance from the yard starting point is greater than the distance threshold of the yard congestion. The distance threshold can be set according to the actual situation to determine whether the yard is congested. In this embodiment, according to the traffic management of the port, an exit zone is set within the range of 40 meters of the starting length of the yard lane. There can be at most 1 unmanned vehicle within this 40-meter range. If there is an unmanned vehicle with a speed of 0 in the area, it can be determined that the yard is congested, so the distance threshold can be set to 40 meters.
[0115] It should also be noted that after obtaining multiple congestion parameters corresponding to multiple yards, the planned lane corresponding to the target vehicle is determined from multiple lanes entering the yard based on distance information, vehicle information and congestion parameters, and the planned lane with no vehicle congestion and the shortest path is selected.
[0116] Optionally, in another embodiment of the present application, the above steps determine a planned lane corresponding to the target vehicle among multiple lanes entering the yard according to the distance information, vehicle information and congestion parameters, such as Figure 4 As shown, specifically including:
[0117] S401. When the blocking parameter of the first stockyard is in a non-blocking state, determine whether the blocking parameters of other stockyards are in a blocking state; wherein the other stockyards refer to stockyards other than the first stockyard.
[0118] It should be noted that when the congestion parameter of the first yard corresponding to the task location is in a non-congested state (the congestion parameter is 0 or 2), it is determined whether the congestion parameters of other yards except the first yard are in a congested state (the congestion parameter is 1).
[0119] S402. If the congestion parameter of at least one other storage yard is in a congestion state, and the storage yard in the congestion state is located inside the first storage yard, the lane weight of the first outer lane is calculated according to a preset outer lane weight formula and distance information of the first outer lane among multiple storage yard entry lanes, and the planned lane corresponding to the target vehicle is determined based on the lane weight of the first outer lane. The first outer lane is a lane farther from the storage yard among multiple parallel storage yard entry lanes. The lane weight is used to characterize the lane's traffic capacity. The larger the lane weight of the lane, the worse the lane's traffic capacity.
[0120] It should be noted that if Figure 5 As shown in the figure, when the vehicle goes to the first yard corresponding to the task location to unload the container and other yards are blocked, and the yard in the blocked state is located inside the first yard, for example, the first yard is yard I03, and the yard in the blocked state is yard I02, then the inner lane leading to yard I02 is congested. If the inner lane continues to be planned, congestion will also occur. Therefore, according to the distance information of the first outer lane among the multiple lanes entering the yard, the formula is used:
[0121] Outer lane weight = lane distance weight
[0122] The lane weight of the first outer lane can be calculated based on the preset outer lane weight formula and the distance information of the first outer lane among multiple lanes entering the yard, and the lane with the smallest total lane weight is planned for the target vehicle based on the lane weight of the first outer lane. As the planned lane corresponding to the target vehicle, the first outer lane is the lane farther from the yard among the multiple parallel lanes entering the yard. The lane weight is used to characterize the lane capacity. The larger the lane weight of the lane, the worse the lane capacity. The lane distance weight is the lane length calculated based on the lane starting point coordinates and the lane end point coordinates. The longer the length, the greater the lane distance weight.
[0123] S403. If the congestion parameter of at least one other yard is in a congestion state, and the yard in the congestion state is located outside the first yard, the lane weight of the first inner lane is calculated according to a preset first inner lane weight formula, distance information of the first inner lane among the multiple yard entry lanes, and vehicle information, and the planned lane corresponding to the target vehicle is determined based on the lane weight of the first inner lane, where the first inner lane is a lane that is closer to the yard among the multiple parallel yard entry lanes.
[0124] It should be noted that if the congestion parameter of at least one other yard is in a congested state, and the yard in the congested state is located outside the first yard, for example, the first yard is yard I02, and the yard in the congested state is yard I03, then the outer lane leading to yard I03 is congested. If the outer lane continues to be planned, congestion will also occur. In order not to affect the operation of the outer yard, the vehicle is planned to drive in the inner lane of the yard. Then, according to the distance information and vehicle information of the first inner lane among the multiple lanes entering the yard, the formula is used:
[0125] First inner lane weight = lane distance weight + 2 * lane traffic weight
[0126] The lane weight of the first inner lane can be calculated based on the preset first inner lane weight formula, the distance information of the first inner lane in the multiple lanes entering the yard, and the vehicle information, and the lane with the smallest total lane weight is planned for the target vehicle based on the lane weight of the first inner lane as the planned lane corresponding to the target vehicle. The first inner lane is the lane closer to the yard among the multiple parallel lanes entering the yard. Among them, the lane traffic weight represents the road traffic capacity. The more vehicles there are on the lane, the greater the lane traffic weight is, and the worse the lane traffic capacity is. For example, the initial lane traffic weight is set to 0. When a vehicle is about to pass through the lane, the lane traffic weight of the lane is increased by 2. If the unmanned vehicle is currently on the lane, the lane traffic weight of the lane is set to increase by 10.
[0127] S404: If the congestion parameters of other yards are all in a non-congested state, the lane weights of each lane entering the yard are calculated according to a preset full-lane weight formula, distance information, and vehicle information, and the planned lane corresponding to the target vehicle is determined among the multiple lanes entering the yard based on the lane weights of each lane entering the yard.
[0128] It should be noted that if Figure 6 As shown in the figure, if the congestion parameters of other yards are all in a non-congested state, there are vehicles on the inner lane. The lanes where these vehicles are located are located. Based on the distance information and vehicle information, the formula is used:
[0129] Full lane weight = lane distance weight + lane traffic weight
[0130] The lane weight of each lane is calculated according to the preset full lane weight formula, distance information and vehicle information, and the lane with the smallest full lane weight is planned for the target vehicle among multiple lanes entering the yard as the planned lane corresponding to the target vehicle.
[0131] Optionally, in another embodiment of the present application, the above steps determine a planned lane corresponding to the target vehicle among multiple lanes entering the yard according to the distance information, vehicle information and congestion parameters, such as Figure 7 As shown, specifically including:
[0132] S701. When a blocking parameter of a first stacking yard is in a blocking state, determine whether the first stacking yard is an outermost stacking yard.
[0133] S702. If the first yard is the outermost yard, calculate the lane weight of the first outer lane according to the outer lane weight formula and the distance information of the first outer lane among the multiple yard entry lanes, determine the planned lane corresponding to the target vehicle based on the lane weight of the first outer lane, and send a first parking instruction to the target vehicle; wherein the first parking instruction is used to instruct the target vehicle to park and wait when other vehicles enter the first inner lane, the first outer lane is a lane farther from the yard among the multiple parallel yard entry lanes, and the first inner lane is a lane closer to the yard among the multiple parallel yard entry lanes.
[0134] It should be noted that if the first yard is the outermost yard (the yard farthest from the quay crane among all the yards currently in operation), Figure 8 As shown, in order not to affect the operation of the inner yard, the vehicle is planned to drive in the outer lane of the yard. Therefore, according to the distance information of the first outer lane among the multiple lanes entering the yard, the formula is used:
[0135] Outer lane weight = lane distance weight
[0136] The planned lane corresponding to the target vehicle is determined, and the first parking instruction is sent to the target vehicle. The vehicle is parked and waiting in the outer lane of the yard. Because the target yard is already congested, even if it enters the yard lane, the driving speed will be slow. It is better to give priority to vehicles from other yards so as not to affect other vehicles entering the yard through the inner lane of the yard. Among them, the first parking instruction is used to instruct the target vehicle to park and wait when other vehicles enter the first inner lane. The first outer lane is the lane farther from the yard among the multiple parallel lanes entering the yard, and the first inner lane is the lane closer to the yard among the multiple parallel lanes entering the yard.
[0137] S703: If the first storage yard is not the outermost storage yard, a lane weight of the first inner lane is calculated according to a first inner lane weight formula, distance information of the first inner lane among the plurality of lanes entering the storage yard, and vehicle information, and a planned lane corresponding to the target vehicle is determined based on the lane weight of the first inner lane, and a second parking instruction is sent to the target vehicle; wherein the second parking instruction is used to instruct the target vehicle to park and wait when other vehicles enter the first outer lane.
[0138] It should be noted that if the first yard is not the outermost yard, such as Fig. 9 As shown, in order not to affect the operations of other outer yards, the vehicle is planned to drive in the inner lane of the yard. Therefore, according to the distance information and vehicle information of the first inner lane among the multiple lanes entering the yard, the formula is used:
[0139] First inner lane weight = lane distance weight + 2 * lane traffic weight
[0140] The planned lane corresponding to the target vehicle is determined, and a second parking instruction is sent to the target vehicle, so that the vehicle parks and waits in the inner lane of the yard, without affecting other vehicles entering the yard through the outer lane of the yard. The second parking instruction is used to instruct the target vehicle to park and wait when other vehicles enter the first outer lane.
[0141] Optionally, in another embodiment of the present application, when the task location is located at the quay crane, the starting location is located at the first yard, and the first yard is any one of the multiple yards, an implementation method of step S303 is as follows: Fig.10 As shown, including:
[0142] S1001. Calculate a lane weight of a second outer lane according to an outer lane weight formula and distance information of the second outer lane among multiple out-yard lanes; wherein the second outer lane is a lane farther from the yard among the multiple parallel out-yard lanes.
[0143] It should be noted that if Fig.11 As shown in the figure, when a vehicle goes to the quay crane for loading, the position and lane of the vehicle on each lane at the current moment will be located. Then, according to the distance information of the second outer lane among multiple outbound lanes, the formula is used:
[0144] Outer lane weight = Outer lane distance weight
[0145] The lane weight of the second outer lane is determined; wherein the second outer lane is a lane farther from the yard among the multiple parallel out-yard lanes.
[0146] S1002. Calculate a lane weight of the second inner lane according to a preset second inner lane weight formula, distance information of the second inner lane among multiple out-yard lanes, and vehicle information; wherein the second inner lane is a lane that is closer to the yard among the multiple parallel out-yard lanes.
[0147] It should be noted that, according to the distance information and vehicle information of the second inner lane among the multiple outbound lanes, the formula is used:
[0148] Second inner lane weight = inner lane distance weight + 3 * lane traffic weight
[0149] The lane weight of the second inner lane is determined; wherein the second inner lane is a lane closer to the yard among the multiple parallel out-yard lanes.
[0150] S1003: The lane with the smallest lane weight among the lanes out of the yard is used as the planned lane corresponding to the target vehicle.
[0151] It should be noted that, according to the lane weights of the lanes out of the yard, the lane with the smallest lane weight is selected as the planned lane corresponding to the target vehicle.
[0152] Optionally, in another embodiment of the present application, when the task location is located at the first yard, the starting location is located at the second yard, and the first yard and the second yard are any one of a plurality of yards, the lane planning method may further include:
[0153] When the first storage yard and the second storage yard are the same storage yard and the task location is located behind the starting location, determine whether the target distance between the task location and the starting location is greater than a preset distance threshold; wherein the distance threshold is used to characterize the distance at which the vehicle needs to re-plan its path.
[0154] If the target distance is not greater than the distance threshold, a reversing instruction is sent to the target vehicle to instruct the target vehicle to reverse to the task location.
[0155] According to the distance information and vehicle information, the planned lane corresponding to the target vehicle is determined from multiple optional lanes, including:
[0156] If the target distance is greater than the distance threshold or the first yard and the second yard are different yards, a planned lane corresponding to the target vehicle is determined from a plurality of optional lanes according to the distance information and the vehicle information.
[0157] It should be noted that the FMS receives the task update instruction from the TOS and assigns new tasks to the vehicles that are currently performing the task. For example, when unloading containers, the unloading location of the container to be unloaded is changed to another yard for unloading or the unloading location of the current yard is changed. In the case where the first yard and the second yard are the same yard and the task location is located behind the starting location, such as Fig.12 As shown, it is determined whether the target distance between the task location and the starting location is greater than a preset distance threshold; wherein the distance threshold is used to represent the distance at which the vehicle needs to re-plan its path, and the distance threshold can be set according to actual conditions, such as 1 meter. If the target distance is not greater than the distance threshold, a reverse instruction is sent to the target vehicle, instructing the target vehicle to reverse to the task location. If the target distance is greater than the distance threshold (such as Fig.12 ), or the first yard and the second yard are different yards (such as Fig.13If the vehicle is not in the same lane as the one shown in the figure, a new route planning is required. The vehicle needs to enter the main road through the outbound lane and then re-enter the yard through the inbound lane.
[0158] Optionally, in another embodiment of the present application, if the target distance in the above step is greater than the distance threshold or the first yard and the second yard are different yards, an implementation method of determining a planned lane corresponding to the target vehicle from a plurality of optional lanes according to the distance information and the vehicle information may include:
[0159] According to the distance information and the vehicle information, a first planned lane corresponding to the target vehicle is determined from the multiple out-yard lanes, where the first planned lane is used for the target vehicle to drive from the second yard to the quay crane;
[0160] According to the distance information and the vehicle information, a second planned lane corresponding to the target vehicle is determined among the multiple lanes entering the yard, and the second planned lane is used for the target vehicle to drive from the quay crane to the first yard.
[0161] It should be noted that if the target distance is greater than the distance threshold or the first yard and the second yard are different yards, new path planning is required. First, based on the distance information and vehicle information, a first planned lane from the second yard to the quay crane is determined among multiple outbound lanes. Then, based on the distance information and vehicle information, a second planned lane from the quay crane to the first yard is determined among multiple inbound lanes.
[0162] Take the case where the first and second storage yards are the same storage yard and the target distance is greater than the distance threshold as an example. Fig.14 As shown, at this time, the vehicle positions on the yard passage can be located, and the obstacle vehicles 1 and 2 are on lanes 33-1 and 34-1, and a pass list of the lanes out of the yard [33-1, 34-1] is maintained. At the same time, according to the path planning method from the quay crane to the yard, the vehicle positions on the yard passage can be located, and the obstacle vehicles 3 and 4 are on lanes 44-1 and 47-1, and a pass list of the lanes into the yard [44-1, 47-1] is maintained. At the same time, according to the positions of the working vehicles in the yard, the yard vehicle distance list [55, 120, 15] is calculated, wherein the yard vehicle distance list refers to: the distance from the current position of the unmanned vehicle closest to the starting point of the yard and stationary to the starting point of the yard, and the three values are respectively, the working vehicle 1, the target vehicle, and the working vehicle 2. According to the distance list of yard operation vehicles, the congestion parameters of each yard are judged to be [2, 2, 1]. At this time, the starting point and end point of the target vehicle are at the I02 yard. There are two obstacle vehicles on the inner side of the road out of the yard, and there are two obstacle vehicles on the inner side of the road into the yard. The target yard is not congested. According to the traffic list of vehicles entering and leaving the yard, the traffic weight of the corresponding lane on the inner side of the road in and out of the yard is increased during path planning, resulting in the lane weight of the inner lane of the road being greater than the lane weight of the outer lane of the road. Therefore, a driving path of the outer lane of the road is planned for the target vehicle.
[0163] S304: Send the planned lane to the target vehicle, so that the target vehicle drives to the task location according to the planned lane.
[0164] It should be noted that after the planned lane is determined, the planned lane will be sent to the target vehicle, so that the target vehicle can travel to the task location according to the planned lane, avoiding vehicle congestion and improving overall operation efficiency.
[0165] In a lane planning method provided in an embodiment of the present application, the task location of the target vehicle is first obtained. Then, the distance information and vehicle information of multiple optional lanes between the task location and the starting location where the target vehicle is located are determined; wherein the distance information represents the distance of the optional lane, and the vehicle information represents the number of vehicles located on the optional lane. Then, based on the distance information and the vehicle information, the planned lane corresponding to the target vehicle is determined among the multiple optional lanes. Finally, the planned lane is sent to the target vehicle, so that the target vehicle drives to the task location according to the planned lane. It can be seen that the present application can consider the current position of other vehicles on the basis of the distance, and combine the environment in which the vehicle is located at this time to judge the traffic conditions and congestion conditions of each lane, so as to plan the optimal lane path for the vehicle, so that the vehicle can perform tasks safely and quickly, and improve the overall work efficiency.
[0166] Another embodiment of the present application also provides a lane planning device, such as Fig.15 As shown, specifically including:
[0167] The acquisition unit 1501 is used to obtain the mission location of the target vehicle.
[0168] The first determination unit 1502 is used to determine the distance information and vehicle information of multiple optional lanes between the mission location and the starting location where the target vehicle is located; wherein the distance information represents the distance of the optional lanes, and the vehicle information represents the number of vehicles located on the optional lanes.
[0169] The second determining unit 1503 is used to determine a planned lane corresponding to the target vehicle from a plurality of optional lanes according to the distance information and the vehicle information.
[0170] The first sending unit 1504 sends the planned lane to the target vehicle, so that the target vehicle drives to the task location according to the planned lane.
[0171] In this embodiment, the specific execution process of the acquisition unit 1501, the first determination unit 1502, the second determination unit 1503, and the first sending unit 1504 can be referred to the corresponding Figure 3 The content of the method embodiment will not be repeated here.
[0172] In a lane planning device provided by an embodiment of the present application, first, an acquisition unit 1501 obtains the task location of the target vehicle. Then the first determination unit 1502 determines the distance information and vehicle information of multiple optional lanes between the task location and the starting location where the target vehicle is located; wherein the distance information represents the distance of the optional lane, and the vehicle information represents the number of vehicles located on the optional lane. Then the second determination unit 1503 determines the planned lane corresponding to the target vehicle among the multiple optional lanes based on the distance information and the vehicle information. Finally, the first sending unit 1504 sends the planned lane to the target vehicle, so that the target vehicle drives to the task location according to the planned lane. It can be seen from this that the present application can consider the current position of other vehicles on the basis of the distance, and combine the environment in which the vehicle is located at this time to judge the traffic conditions and congestion conditions of each lane, so as to plan the optimal lane path for the vehicle, so that the vehicle can perform tasks safely and quickly, and improve the overall work efficiency.
[0173] Optionally, in another embodiment of the present application, an implementation of the acquisition unit 1501 includes:
[0174] The receiving subunit is used to receive the mission information of the target vehicle; wherein the mission information includes the mission number, mission location and container number.
[0175] The first acquisition subunit is used to obtain the task location of the target vehicle from the task information.
[0176] In this embodiment, the specific execution process of the receiving subunit and the first obtaining subunit can refer to the above-mentioned corresponding method embodiment content, which will not be repeated here.
[0177] Optionally, in another embodiment of the present application, in the above-mentioned device, the task location is located at the first yard, the starting location is located at the quay crane, and the first yard is any one of the multiple yards; an implementation manner of the second determination unit 1503 includes:
[0178] The second acquisition subunit is used to obtain multiple congestion parameters corresponding to multiple yards; wherein the congestion parameter corresponding to each yard represents the vehicle congestion situation on the yard lane of the yard; the congestion parameter corresponding to each of the yards is obtained according to the operating status and driving status of the vehicles on the yard lane of the yard.
[0179] The first planning subunit is used to determine a planned lane corresponding to the target vehicle among multiple lanes entering the yard according to the distance information, the vehicle information and the congestion parameter.
[0180] In this embodiment, the specific execution process of the second acquisition subunit and the first planning subunit can refer to the above corresponding method embodiment content, which will not be repeated here.
[0181] Optionally, in another embodiment of the present application, an implementation of the first planning subunit includes:
[0182] The determination subunit is used to determine whether the congestion parameters of other yards are in a congestion state when the congestion parameters of the first yard are in a non-congestion state; wherein the other yards refer to yards other than the first yard.
[0183] The second planning subunit is used for calculating the lane weight of the first outer lane according to a preset outer lane weight formula and distance information of the first outer lane among multiple lanes entering the yard if the congestion parameter of at least one other yard is in a congestion state and the yard in the congestion state is located inside the first yard, and determining the planned lane corresponding to the target vehicle based on the lane weight of the first outer lane, the first outer lane being a lane farther from the yard among multiple parallel lanes entering the yard; the lane weight is used to characterize the lane's traffic capacity, and the larger the lane weight of the lane, the worse the lane's traffic capacity.
[0184] The third planning subunit is used for calculating the lane weight of the first inner lane according to a preset first inner lane weight formula, distance information of the first inner lane among the multiple yard entry lanes and vehicle information if the congestion parameter of at least one other yard is in a congestion state and the yard in the congestion state is located outside the first yard, and determining the planned lane corresponding to the target vehicle based on the lane weight of the first inner lane, wherein the first inner lane is a lane closer to the yard among the multiple parallel yard entry lanes.
[0185] The fourth planning subunit is used to calculate the lane weight of each of the entry lanes according to a preset full-lane weight formula, the distance information and the vehicle information if the congestion parameters of other yards are all in a non-congested state, and determine the planned lane corresponding to the target vehicle among the multiple entry lanes based on the lane weights of each of the entry lanes.
[0186] In this embodiment, the specific execution process of the determination subunit, the second planning subunit, the third planning subunit, and the fourth planning subunit can be found in the corresponding Figure 4 The content of the method embodiment will not be repeated here.
[0187] Optionally, in another embodiment of the present application, an implementation of the first planning subunit includes:
[0188] The second determining subunit is used to determine whether the first stacking yard is the outermost stacking yard when the blocking parameter of the first stacking yard is in a blocking state.
[0189] The fifth planning subunit is used for, if the first yard is the outermost yard, calculating the lane weight of the first outer lane according to the outer lane weight formula and the distance information of the first outer lane among the multiple yard entry lanes, and determining the planned lane corresponding to the target vehicle based on the lane weight of the first outer lane, and sending a first parking instruction to the target vehicle; wherein the first parking instruction is used to instruct the target vehicle to park and wait when other vehicles enter the first inner lane, the first outer lane is a lane farther from the yard among the multiple parallel yard entry lanes, and the first inner lane is a lane closer to the yard among the multiple parallel yard entry lanes.
[0190] The sixth planning subunit is used to calculate the lane weight of the first inner lane according to the first inner lane weight formula, the distance information of the first inner lane among the multiple lanes entering the yard and the vehicle information if the first yard is not the outermost yard, and determine the planned lane corresponding to the target vehicle based on the lane weight of the first inner lane, and send a second parking instruction to the target vehicle; wherein the second parking instruction is used to instruct the target vehicle to park and wait when other vehicles enter the first outer lane.
[0191] In this embodiment, the specific execution process of the second determination subunit, the fifth planning subunit, and the sixth planning subunit can be referred to in the corresponding Figure 7 The content of the method embodiment will not be repeated here.
[0192] Optionally, in another embodiment of the present application, the starting location of the above-mentioned device is located at a first yard, and the first yard is any one of a plurality of yards; an implementation manner of the second determination unit 1503 includes:
[0193] The third determination subunit is used to calculate the lane weight of the second outer lane according to the outer lane weight formula and the distance information of the second outer lane among the multiple out-yard lanes; wherein the second outer lane is a lane farther from the yard among the multiple parallel out-yard lanes.
[0194] The fourth determination subunit is used to calculate the lane weight of the second inner lane according to a preset second inner lane weight formula, distance information of the second inner lane in multiple out-yard lanes, and vehicle information; wherein the second inner lane is a lane closer to the yard among the multiple parallel out-yard lanes.
[0195] The fifth determining subunit is used to select the lane with the smallest lane weight among the lanes out of the storage yard as the planned lane corresponding to the target vehicle.
[0196] In this embodiment, the specific execution process of the third determining subunit, the fourth determining subunit, and the fifth determining subunit can be referred to in the corresponding Fig.10 The content of the method embodiment will not be repeated here.
[0197] Optionally, in another embodiment of the present application, the above-mentioned device, the task location is located at the first yard, the starting location is located at the second yard, and the first yard and the second yard are any one of the multiple yards; the above-mentioned device also includes:
[0198] A third determination unit is used to determine whether the target distance between the task location and the starting location is greater than a preset distance threshold when the first storage yard and the second storage yard are the same storage yard and the task location is located behind the starting location; wherein the distance threshold is used to represent the distance at which the vehicle needs to re-plan its path;
[0199] A second sending unit is used to send a reversing instruction to the target vehicle if the target distance is not greater than the distance threshold, so as to instruct the target vehicle to reverse to the task location;
[0200] The second determining unit includes:
[0201] The fourth determining unit is used to determine a planned lane corresponding to the target vehicle from a plurality of optional lanes according to the distance information and the vehicle information if the target distance is greater than the distance threshold or the first yard and the second yard are different yards.
[0202] In this embodiment, the specific execution process of the third determination subunit, the fourth determination subunit, and the fifth determination subunit can refer to the corresponding method embodiment content above, which will not be repeated here.
[0203] Optionally, in another embodiment of the present application, an implementation of the fourth determining unit includes:
[0204] The seventh planning subunit is used to determine a first planned lane corresponding to the target vehicle from multiple lanes out of the yard according to the distance information and the vehicle information, and the first planned lane is used for the target vehicle to drive from the second yard to the quay crane.
[0205] The eighth planning subunit is used to determine a second planned lane corresponding to the target vehicle from the multiple lanes entering the yard according to the distance information and the vehicle information, and the second planned lane is used for the target vehicle to drive from the quay crane to the first yard.
[0206] In this embodiment, the specific execution process of the seventh determination subunit and the eighth planning subunit can refer to the corresponding method embodiment content above, which will not be repeated here.
[0207] Another embodiment of the application also provides an electronic device, such as Fig.16 As shown, specifically including:
[0208] One or more processors 1601.
[0209] The storage device 1602 stores one or more programs.
[0210] When one or more programs are executed by one or more processors 1601 , the one or more processors 1601 implement any one of the methods in the above embodiments.
[0211] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can refer to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system or system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can refer to the partial description of the method embodiment. The system and system embodiments described above are merely schematic, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without creative work.
[0212] Professionals may further appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in the above description according to function. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.
[0213] The above description of the disclosed embodiments enables those skilled in the art to implement or use the present invention. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present application will not be limited to the embodiments shown herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.
Claims
1. A lane planning method, It is characterized in that include: Get the mission location of the target vehicle; Determine the distance information and vehicle information of multiple optional lanes between the mission location and the starting location where the target vehicle is located; wherein the distance information represents the distance of the optional lanes, and the vehicle information represents the number of vehicles located on the optional lanes; Determining a planned lane corresponding to the target vehicle from among the plurality of optional lanes according to the distance information and the vehicle information; The planned lane is sent to the target vehicle, so that the target vehicle drives toward the task location according to the planned lane.
2. The method according to claim 1, It is characterized in that The task location of obtaining the target vehicle includes: Receive the task information of the target vehicle; wherein the task information includes a task number, a task location and a container number; The mission location of the target vehicle is obtained from the mission information.
3. The method according to claim 1, It is characterized in that The task location is located at a first yard, the starting location is located at a quay crane, and the first yard is any one of a plurality of yards; The step of determining a planned lane corresponding to the target vehicle from among the plurality of optional lanes according to the distance information and the vehicle information includes: Obtaining a plurality of congestion parameters corresponding to a plurality of storage yards; wherein the congestion parameter corresponding to each of the storage yards represents the vehicle congestion condition on the storage yard lane of the storage yard; and the congestion parameter corresponding to each of the storage yards is obtained according to the operating state and driving state of the vehicles on the storage yard lane of the storage yard; A planned lane corresponding to the target vehicle is determined from a plurality of lanes entering the yard according to the distance information, the vehicle information and the congestion parameter.
4. The method according to claim 3, It is characterized in that Determining a planned lane corresponding to the target vehicle from a plurality of lanes entering the yard according to the distance information, the vehicle information and the congestion parameter includes: In the case where the congestion parameter of the first yard is in a non-congestion state, determining whether the congestion parameters of other yards are in a congestion state; wherein the other yards refer to yards other than the first yard; If the congestion parameter of at least one of the other storage yards is in a congestion state, and the storage yard in the congestion state is located inside the first storage yard, the lane weight of the first outer lane is calculated according to a preset outer lane weight formula and the distance information of the first outer lane among the multiple storage yard entry lanes, and the planned lane corresponding to the target vehicle is determined based on the lane weight of the first outer lane, where the first outer lane is a lane farther from the storage yard among the multiple parallel storage yard entry lanes; the lane weight is used to characterize the lane capacity, and the larger the lane weight of the lane, the worse the lane capacity; If the congestion parameter of at least one of the other storage yards is in a congestion state, and the storage yard in the congestion state is located outside the first storage yard, the lane weight of the first inner lane is calculated according to a preset first inner lane weight formula, the distance information of the first inner lane among the multiple storage yard entry lanes, and the vehicle information, and the planned lane corresponding to the target vehicle is determined based on the lane weight of the first inner lane, where the first inner lane is a lane closer to the storage yard among the multiple parallel storage yard entry lanes; If the congestion parameters of the other yards are all in a non-congested state, the lane weights of the lanes entering the yard are calculated according to a preset full-lane weight formula, the distance information and the vehicle information, and the planned lane corresponding to the target vehicle is determined among the multiple lanes entering the yard based on the lane weights of the lanes entering the yard.
5. The method according to claim 3, It is characterized in that Determining a planned lane corresponding to the target vehicle from a plurality of lanes entering the yard according to the distance information, the vehicle information and the congestion parameter includes: When the blocking parameter of the first stacking yard is in a blocking state, determining whether the first stacking yard is the outermost stacking yard; If the first yard is the outermost yard, the lane weight of the first outer lane is calculated according to the outer lane weight formula and the distance information of the first outer lane among the multiple yard entry lanes, and the planned lane corresponding to the target vehicle is determined based on the lane weight of the first outer lane, and a first parking instruction is sent to the target vehicle; wherein the first parking instruction is used to instruct the target vehicle to park and wait when other vehicles enter the first inner lane, the first outer lane is a lane farther from the yard among the multiple parallel yard entry lanes, and the first inner lane is a lane closer to the yard among the multiple parallel yard entry lanes; If the first yard is not the outermost yard, the lane weight of the first inner lane is calculated according to the first inner lane weight formula, the distance information of the first inner lane among the multiple yard entry lanes and the vehicle information, and the planned lane corresponding to the target vehicle is determined based on the lane weight of the first inner lane, and a second parking instruction is sent to the target vehicle; wherein the second parking instruction is used to instruct the target vehicle to park and wait when other vehicles enter the first outer lane.
6. The method according to claim 1, It is characterized in that The task location is located at the quay crane, and the starting location is located at the first yard, which is any one of the multiple yards; The step of determining a planned lane corresponding to the target vehicle from among the plurality of optional lanes according to the distance information and the vehicle information includes: The lane weight of the second outer lane is calculated according to the outer lane weight formula and the distance information of the second outer lane among the multiple out-yard lanes; wherein the second outer lane is a lane farther from the yard among the multiple parallel out-yard lanes; The lane weight of the second inner lane is calculated according to a preset second inner lane weight formula, the distance information of the second inner lane among the multiple out-yard lanes, and the vehicle information; wherein the second inner lane is a lane closer to the yard among the multiple parallel out-yard lanes; The lane with the smallest lane weight among the outbound lanes is used as the planned lane corresponding to the target vehicle.
7. The method according to claim 1, It is characterized in that The task location is located at a first yard, the starting location is located at a second yard, and the first yard and the second yard are any one of a plurality of yards; The method further comprises: In the case where the first storage yard and the second storage yard are the same storage yard and the task location is located behind the starting location, determining whether the target distance between the task location and the starting location is greater than a preset distance threshold; wherein the distance threshold is used to represent the distance at which the vehicle needs to re-plan its path; If the target distance is not greater than the distance threshold, sending a reversing instruction to the target vehicle to instruct the target vehicle to reverse to the task location; The step of determining a planned lane corresponding to the target vehicle from among the plurality of optional lanes according to the distance information and the vehicle information includes: If the target distance is greater than the distance threshold or the first yard and the second yard are different yards, a planned lane corresponding to the target vehicle is determined from the plurality of optional lanes according to the distance information and the vehicle information.
8. The method according to claim 7, It is characterized in that If the target distance is greater than the distance threshold or the first yard and the second yard are different yards, determining a planned lane corresponding to the target vehicle from a plurality of optional lanes according to the distance information and the vehicle information, includes: Determine, according to the distance information and the vehicle information, a first planned lane corresponding to the target vehicle from a plurality of out-yard lanes, wherein the first planned lane is used for the target vehicle to drive from the second yard to the quay crane; A second planned lane corresponding to the target vehicle is determined from a plurality of lanes entering the yard according to the distance information and the vehicle information, and the second planned lane is used for the target vehicle to drive from the quay crane to the first yard.
9. A lane planning device, It is characterized in that include: An acquisition unit, used for acquiring a mission location of a target vehicle; A first determination unit is used to determine distance information and vehicle information of a plurality of optional lanes between the mission location and the starting location where the target vehicle is located; wherein the distance information represents the distance of the optional lanes, and the vehicle information represents the number of vehicles located on the optional lanes; A second determining unit, configured to determine a planned lane corresponding to the target vehicle from among the plurality of optional lanes according to the distance information and the vehicle information; The sending unit sends the planned lane to the target vehicle, so that the target vehicle drives to the task location according to the planned lane.
10. An electronic device, It is characterized in that include: one or more processors; a storage device having one or more programs stored thereon; When the one or more programs are executed by the one or more processors, the one or more processors are enabled to implement the method according to any one of claims 1 to 8.
Citation Information
Cited By
Vehicle dynamic management and control method, system and device and storage medium
CN120726820A
