Path planning method, electronic equipment and storage device
By obtaining and updating the initial path of the target unit, the problems of low efficiency and frequent conflicts in the existing technology are solved, and an efficient path planning method is realized.
Patent Information
- Application Number
- CN202410972976.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-18
- Publication Date
- 2024-12-03
AI Technical Summary
When existing path planning methods detect interference between robots or trolleys, they only add constraints to single interference, which easily leads to conflicts in other locations and is less efficient.
By obtaining the initial paths of multiple target units, judging interference information, obtaining reference decision plans and matching reference constraints for different target units, and updating the initial path of target units to avoid conflicts and improve path planning efficiency.
The initial path adjustment of the target unit is achieved quickly and accurately determined, which improves the efficiency of path planning and avoids new conflicts.
Smart Images

Figure CN119065365A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of path planning, and in particular to a path planning method, electronic equipment and storage device. Background Art
[0002] With the continuous development of intelligence, intelligent robots and automatic carts have been widely used in multiple links and various application places such as automated production, logistics warehousing, and dangerous operations. When multiple robots or carts work at the same time, reasonable scheduling methods and path planning methods can effectively improve work efficiency and thus reduce operating costs.
[0003] In order to plan a collision-free path, existing methods only add a constraint to the single interference after detecting the interference between different robots or cars to replan the path of the robot or car. This method does not consider the scene where the conflict occurs. Although the current conflict can be avoided based on a single constraint, it is easy to cause new conflicts at other locations. In view of this, how to propose a path planning method to improve planning efficiency has become an urgent problem to be solved. Summary of the invention
[0004] The main technical problem solved by the present application is to provide a path planning method, an electronic device and a storage device, which can improve the efficiency of path planning.
[0005] In order to solve the above technical problems, a technical solution adopted in the present application is: to provide a path planning method, including: obtaining initial paths corresponding to multiple target units respectively, and based on the initial paths, obtaining interference information between different target units; wherein the interference information includes interference positions between different target units; obtaining multiple reference decision plans corresponding to different target units respectively, and based on the reference decision plans and the interference positions, obtaining reference constraints matching the reference decision plans; wherein each reference decision plan is used to determine an adjustment method for the initial path corresponding to the target unit; based on the reference decision plan and its corresponding reference constraint, obtaining a target adjustment path; wherein the target adjustment path is used to update the initial path of the corresponding target unit.
[0006] To solve the above technical problems, another technical solution adopted in the present application is: to provide an electronic device, comprising a memory and a processor coupled to each other, wherein program instructions are stored in the processor, and the processor is used to execute the program instructions to implement the path planning method mentioned in the above technical solution.
[0007] In order to solve the above technical problem, another technical solution adopted in the present application is: providing a storage device storing program instructions that can be executed by a processor, wherein the program instructions are used to implement the path planning method mentioned in the above technical solution.
[0008] The beneficial effects of the present application are as follows: Different from the prior art, the path planning method proposed in the present application determines multiple reference decision schemes corresponding to different target units in the scene, so as to simultaneously obtain candidate adjustment paths for the corresponding target units under different reference decision schemes. By comparing multiple candidate adjustment paths, the target adjustment path for adjusting the initial path of a certain target unit is quickly and accurately determined. In addition, corresponding reference constraints are set for each reference decision scheme to improve the efficiency of path planning. BRIEF DESCRIPTION OF THE DRAWINGS
[0009] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. Among them:
[0010] Figure 1 It is a flowchart of an implementation method of the path planning method of the present application;
[0011] Figure 2 is a flowchart of an implementation method corresponding to step S102;
[0012] Figure 3 is a flowchart of an implementation method of obtaining the first constraint condition in step S202;
[0013] Figure 4 is a flowchart of an implementation method of obtaining the second constraint condition in step S202;
[0014] Figure 5 is a schematic diagram of an implementation method corresponding to step S402;
[0015] Figure 6 is a flowchart of step S103 corresponding to another implementation manner;
[0016] Figure 7 It is a structural schematic diagram of an implementation method of the path planning system of the present application;
[0017] Figure 8 It is a structural schematic diagram of an embodiment of the electronic device of the present application;
[0018] Fig. 9 It is a structural diagram of an implementation method of a storage device of the present application. DETAILED DESCRIPTION
[0019] 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, and different embodiments can be adaptively combined. 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.
[0020] See also Figure 1 , Figure 1 : is a flow chart of an implementation method of a path planning method of the present application, the method comprising:
[0021] S101: Acquire initial paths corresponding to a plurality of target units respectively, and acquire interference information between different target units based on the initial paths; wherein the interference information includes interference positions between different target units.
[0022] In one implementation, environmental information of scenes where multiple target units are located is obtained.
[0023] Specifically, the environment information of the scene where the multiple target units are located is obtained, and the environment information includes road information and obstacle information in the scene. The target units may be robots or automatic cars.
[0024] Furthermore, based on the initial paths respectively corresponding to the target units, it is determined whether interference occurs between different target units. If so, interference information is obtained based on the environment information and the initial paths.
[0025] Specifically, in response to the scene containing multiple target units, two target units are randomly selected from the multiple target units in the scene, and the initial path pre-planned by each target unit is obtained. It is determined whether the initial paths corresponding to the two target units intersect at the same time. If so, it is determined that the two target units interfere with each other, and the interference information corresponding to the two target units is obtained. The interference information at least includes the interference positions of the two target units in the environmental information, and the interference time.
[0026] S102: Obtain multiple reference decision plans corresponding to different target units, and based on the reference decision plans and interference positions, obtain reference constraint conditions matching the reference decision plans; wherein each reference decision plan is used to determine an adjustment method for an initial path of a corresponding target unit.
[0027] In one embodiment, for any two target units in a scene, multiple reference decision plans corresponding to each target unit are obtained, and each reference decision plan is used to determine an adjustment method for an initial path of the corresponding target unit.
[0028] In one implementation scenario, the above adjustment method includes waiting or path adjustment. When the reference decision plan corresponding to the target unit is waiting, it is necessary to determine the waiting position of the target unit and adjust the initial path of the target unit according to the waiting position; when the reference decision plan corresponding to the target unit is path adjustment, it is necessary to determine the initial path of the target unit for replanning.
[0029] It should be noted that, in this embodiment, for different target units, when the reference decision plan corresponding to any target unit is waiting or path adjustment, the initial path corresponding to another target unit remains unchanged.
[0030] Furthermore, for each target unit, corresponding reference constraints are obtained according to the reference decision-making scheme.
[0031] Specifically, in response to each target unit corresponding to a different reference decision plan, a reference constraint condition matching the reference decision plan is determined at least based on the reference decision plan and the interference position.
[0032] S103: Based on the reference decision scheme and its corresponding reference constraint conditions, a target adjustment path is obtained; wherein the target adjustment path is used to update the initial path of the corresponding target unit.
[0033] In one embodiment, the initial path of the target unit is adjusted according to the reference decision plan and reference constraint conditions corresponding to the target unit to obtain the corresponding candidate adjustment path. That is, for each candidate decision plan of each target unit, a candidate adjustment path can be obtained according to the corresponding reference constraint conditions. Thus, according to the multiple candidate adjustment paths corresponding to each target unit, a unique target adjustment path is determined, so as to use the target adjustment path to adjust the initial path of the corresponding target unit, and keep the initial path of another target unit unchanged.
[0034] The path planning method proposed in the present application determines multiple reference decision schemes corresponding to different target units in the scene, so as to simultaneously obtain candidate adjustment paths of corresponding target units under different reference decision schemes. By comparing multiple candidate adjustment paths, the target adjustment path for adjusting the initial path of a certain target unit is quickly and accurately determined. In addition, corresponding reference constraints are set for each reference decision scheme to improve the efficiency of path planning.
[0035] In one embodiment, see Figure 2 , Figure 2 is a flowchart of an implementation method corresponding to step S102. In response to the adjustment mode being to wait for any target unit, the specific implementation process of step S102 includes:
[0036] S201: When any target unit is the first unit and the target unit different from the first unit is the second unit, obtain a reference decision plan corresponding to the first unit; wherein the initial paths corresponding to the first unit and the second unit respectively include overlapping shared channels, and the shared channel corresponds to a starting position and an end position, the first unit enters the shared channel through the starting position, and the second unit enters the shared channel through the end position.
[0037] In one embodiment, the first unit and the second unit are determined from different target units in the scene, wherein the first unit may be any one of the different target units.
[0038] In addition, the initial path corresponding to the first unit and the initial path corresponding to the second unit include an overlapping shared channel, and the end of the shared channel close to the first unit is used as the starting position, and the first unit enters the shared channel through the starting position; and the end of the shared channel close to the second unit is used as the end position, and the second unit enters the shared channel through the end position. Moreover, for any position in the above-mentioned shared channel, the moving direction of the first unit at the position is opposite to the moving direction of the second unit at the position.
[0039] Further, a reference decision plan corresponding to the first unit is obtained. In this embodiment, the reference decision plan corresponding to the first unit is used to determine whether the first unit executes the waiting instruction.
[0040] S202: Based on the reference decision plan, interference position, starting position and end position of the first unit, a first constraint condition and a second constraint condition corresponding to the first unit are obtained, wherein the first constraint condition is used to constrain the movement process of the first unit, and the second constraint condition is used to determine the waiting position corresponding to the first unit.
[0041] In one embodiment, based on a reference decision plan, an interference position, a starting position and an end position of a shared channel, a first constraint condition for constraining the movement process of the first unit and a second constraint condition for constraining the waiting position corresponding to the first unit are obtained.
[0042] S203: Use the first constraint condition and the second constraint condition as reference constraint conditions.
[0043] In one embodiment, in response to the reference decision condition corresponding to the first unit being that the first unit is waiting, the first constraint condition and the second constraint condition obtained above are used as corresponding reference constraints, so that under the joint constraints of the first constraint condition and the second constraint condition, the waiting position and the candidate adjustment path corresponding to the first unit are determined. After the first unit moves to the waiting position according to the candidate adjustment path, it waits at the waiting position to avoid conflict between the first unit and the second unit, thereby improving the accuracy of conflict avoidance.
[0044] Optionally, in other implementations, when determining that the reference decision condition corresponding to the first unit is the first unit waiting, only the first constraint condition or the second constraint condition may be used as a reference constraint condition to improve processing efficiency.
[0045] See also Figure 3 , Figure 3 2 is a flow chart of an implementation method of obtaining the first constraint condition in step S202. Specifically, the process of obtaining the first constraint condition includes:
[0046] S301: Based on initial paths corresponding to the first unit and the second unit, obtain the interference moment of the first unit and the second unit, and determine a first sub-condition based on the interference moment, wherein the first sub-condition is used to prevent the first unit from moving to the interference position or shared channel at the interference moment.
[0047] In one embodiment, in response to the initial paths of the first unit and the second unit being predetermined, the interference moment when the first unit and the second unit meet at the interference position is predicted according to the current positions, initial paths and moving speeds of the first unit and the second unit.
[0048] Further, according to the interference time and the interference position, a first sub-condition for constraining the movement process of the first unit is determined, and the first sub-condition is used to prevent the first unit from moving to the interference position at the interference time.
[0049] Alternatively, when the interference position is in the shared channel, in order to prevent the first unit and the second unit from being in the shared channel at the same time, the first sub-condition is determined so that the first sub-condition is used to prevent the first unit from moving into the shared channel at the interference time.
[0050] The above scheme, by determining the first sub-condition, avoids the first unit and the second unit from moving to the interference position at the same time or being in the shared channel at the same time, thereby improving the safety of the first unit and the second unit during operation.
[0051] In a specific application scenario, when preventing the first unit from moving to the interference position at the interference moment, add a corresponding point constraint (a i, v, action, t), as the first sub-condition, this point constraint represents the first unit a i At the interference time t, the movement instruction action cannot be executed to the interference position v. Alternatively, when preventing the first unit from moving into the shared channel at the interference time, add the corresponding edge constraint (a i , v1, v2, action, t), as the first sub-condition, this edge constraint represents the first unit a i From time t-1 to interference time t, it cannot move to between position v1 and position v2, where positions v1 and v2 represent the endpoints of the shared channel respectively.
[0052] S302: Obtain the first moment when the second unit arrives at the starting position, and determine the second sub-condition based on the first moment. The second sub-condition corresponds to a target time period, which is determined based on the first moment, and the second sub-condition is used to prevent the first unit from moving to the starting position within the target time period.
[0053] In one embodiment, in response to the determination of the starting position of the shared channel, the first moment when the second unit arrives at the starting position is predicted based on the current position of the second unit, the corresponding initial path and the moving speed, and the target time period is determined based on the first moment.
[0054] In one implementation scenario, in response to the first time when the second unit arrives at the starting position being t1, the target time period is determined to be [t0, t1], where t0 represents the current time.
[0055] Furthermore, based on the target time period determined above, a second sub-condition is determined to prevent the first unit from moving to the starting position within the target time period, so as to avoid the first unit being located at the starting position of the shared channel during the operation of the second unit, thereby blocking the second unit from exiting the shared channel.
[0056] In another embodiment, the specific process of determining the target time period may also be: while determining the first moment t1 when the second unit arrives at the starting position, determine the second moment t2 when the first unit arrives at the starting position. Based on the first moment t1 and the second moment t2, determine the target time period [t2+1, t1]. Wherein, t2+1 represents the next moment of the second moment t2, and the specific determination process of the second moment t2 can refer to the above embodiment, which will not be repeated here. In addition, it should be noted that in this embodiment, the second moment t2 when the first unit arrives at the starting position is used to determine the start time of the target time period, so that under the joint constraints of the above second sub-condition and the first sub-condition determined in step S301, interference between the first unit and the second unit is avoided.
[0057] S303: Use the first sub-condition and the second sub-condition as the first constraint condition.
[0058] In one embodiment, the first sub-condition and the second sub-condition are used as the first constraint condition, so that the movement process of the first unit is constrained under the cooperation of the first sub-condition and the second sub-condition.
[0059] The above scheme uses the determined first sub-condition and the second sub-condition as the first constraint condition to avoid the limited single constraint effect of the first sub-condition or the second sub-condition, thereby avoiding the subsequent new conflict between the first unit and the second unit.
[0060] In other implementations, only the first sub-condition or the second sub-condition may be used as the first constraint condition.
[0061] See also Figure 4 , Figure 4 It is a flowchart of an implementation method of obtaining the second constraint condition in step S202.
[0062] S401: taking all the intermediate positions, the starting position and the ending position in the shared channel as reference positions, and determining a third sub-condition based on the reference positions, wherein the third sub-condition is used to prevent the waiting position from being located at the reference position.
[0063] In one embodiment, the middle position, starting position or end position in the shared channel is used as a reference position, and based on the reference position, a third sub-condition is added to the reference decision plan corresponding to the first unit to avoid the waiting position of the first unit being at the reference position.
[0064] S402: In response to the initial path of the second unit including an adjacent position adjacent to the starting position or the ending position, determine a fourth sub-condition based on the adjacent position; wherein the fourth sub-condition is used to prevent the waiting position from being located at the adjacent position.
[0065] In one embodiment, a position in the initial path of the second unit that is adjacent to the starting position or the ending position is taken as an adjacent position. Based on the adjacent position, a fourth sub-condition for preventing the waiting position from being located at the adjacent position is determined.
[0066] The above solution determines the fourth sub-condition so that under the constraint of the fourth sub-condition, the second unit avoids interference with the first unit when entering or leaving the shared channel when moving along the corresponding initial path.
[0067] In a specific application scenario, please refer to Figure 5 , Figure 5It is a schematic diagram of an implementation method corresponding to step S402. The first unit is located at position S1, and it needs to move to position g1; the second unit is located at position S2, and it needs to move to position g2. Positions e1 and e2 are the starting position and the end position of the shared channel, respectively, and the initial path of the first unit is to pass through position S1, position g2, position e1 and position e2 in sequence until reaching position g1, and the initial path of the second unit is to pass through position S2, position g1, position e2 and e1 in sequence until reaching position g2, that is, the initial path of the second unit contains an adjacent position g2 adjacent to the starting position e1 of the shared channel. If the waiting position of the first unit is located at the adjacent position g2, interference is formed when the second unit moves according to the corresponding initial path. Therefore, the fourth sub-condition is determined so that under the constraint of the fourth sub-condition, the second unit avoids interference with the first unit when leaving the shared channel when moving according to the corresponding initial path.
[0068] S403: The third sub-condition and the fourth sub-condition are used as the second constraint condition.
[0069] In one embodiment, the third sub-condition and the fourth sub-condition are used as the first constraint condition, so that the specific position of the waiting position of the first unit is constrained under the cooperation of the third sub-condition and the fourth sub-condition.
[0070] In other implementations, only the third sub-condition or the fourth sub-condition may be used as the second constraint condition.
[0071] In another embodiment, in response to the adjustment mode being the initial path adjustment of any target unit, the specific implementation process of step S102 may include: obtaining a reference constraint condition corresponding to the target unit based on the reference decision scheme and the interference position of the target unit. The reference constraint condition of the target unit is used to prevent the corresponding target unit from being located at the interference position.
[0072] Specifically, in response to the reference decision condition corresponding to any target unit in this embodiment being the adjustment of the initial path of any target unit, any one of the different target units in the scene is taken as the first unit, and another target unit is taken as the second unit, and according to the reference decision scheme corresponding to the first unit, a reference constraint condition is determined to prevent the first unit from being located at an interference position at any time. Thus, the initial path of the first unit is subsequently replanned under the constraint of the reference constraint condition.
[0073] In a specific application scenario, when the scenario includes a target unit A and a target unit B, the target unit A can be used as the first unit to determine the reference constraint corresponding to the first unit A using the above solution, so that the initial path of the first unit A can be adjusted later. Alternatively, the target unit B can be used as the first unit to determine the reference constraint corresponding to the first unit B using the above solution.
[0074] See also Figure 6 , Figure 6 is a flow chart of another implementation method corresponding to step S103. Specifically, the implementation process of step S103 includes:
[0075] S501: Based on the reference decision scheme of the target unit and the corresponding reference constraint conditions, a plurality of candidate adjustment paths corresponding to different target units are obtained.
[0076] In one implementation, the path of the target unit is planned according to the determined reference decision plan and the corresponding reference constraint conditions of the target unit to obtain a plurality of candidate adjustment paths corresponding to the target unit.
[0077] In an implementation scenario, for two different target units, each of which has two reference decision schemes, namely, waiting and initial path adjustment, the candidate adjustment paths corresponding to the target unit and each reference decision scheme are obtained under the corresponding reference constraint conditions. The process of planning the candidate adjustment paths of the corresponding target units using the determined reference constraint conditions can refer to the existing path planning method, which will not be elaborated in detail here.
[0078] S502: Acquire a target adjustment path based on all candidate adjustment paths.
[0079] In one embodiment, for different target units, cost values corresponding to each candidate adjustment path are obtained. Based on the cost values, a target adjustment path is determined from the candidate adjustment paths corresponding to the different target units. The cost values are determined based on at least the distances of the corresponding candidate adjustment paths.
[0080] Specifically, the distances corresponding to different candidate adjustment paths corresponding to each target unit are calculated, and the candidate adjustment path with the smallest distance is used as the target adjustment path corresponding to the target unit.
[0081] In a specific application scenario, when the first reference decision plan corresponding to target unit A is that target unit A waits, the distance of the candidate adjustment path of target unit A is determined to be x1; when the second reference decision plan corresponding to target unit A is that the initial path of target unit A is adjusted, the distance of the candidate adjustment path of target unit A is determined to be x2; when the first reference decision plan corresponding to target unit B is that target unit B waits, the distance of the candidate adjustment path of target unit B is determined to be y1; when the second reference decision plan corresponding to target unit B is that the initial path of target unit B is adjusted, the distance of the candidate adjustment path of target unit B is determined to be y2. The minimum distance among the distance x1, the distance x2, the distance y1, and the distance y2 is obtained, and the candidate adjustment path corresponding to the minimum distance is used as the target adjustment path, so that the corresponding initial path is adjusted later. For example, when the minimum distance is x1, the corresponding candidate adjustment path is used as the target adjustment path for the subsequent adjustment of the initial path of target unit A.
[0082] In another embodiment, the cost value corresponding to each candidate adjustment path may also be obtained based on the distance corresponding to the candidate adjustment path, the posture information and movement time of the target unit when moving along the candidate adjustment path, etc. The posture information during movement may be determined based on the energy consumption of the corresponding target unit.
[0083] In another embodiment, in response to obtaining a candidate adjustment path corresponding to any target unit, a first generation value of the candidate adjustment path corresponding to the target unit and a second generation value of an initial path corresponding to another target unit are obtained, and a total cost value is determined according to the sum of the first generation value and the second generation value. According to the total cost value, a target adjustment path is determined from all candidate adjustment paths.
[0084] Specifically, the candidate adjustment path corresponding to the minimum total cost value is used as the target adjustment path so that the corresponding initial path is subsequently adjusted.
[0085] In another embodiment, in response to determining the target adjustment path through the above corresponding embodiments, the target adjustment path is updated to the initial path corresponding to the target unit, and the process returns to the step of obtaining the initial paths corresponding to the plurality of target units.
[0086] Specifically, the determined target adjustment path is used to replace the initial path of the corresponding target unit, so that the corresponding target unit moves according to the replaced initial path, while the initial path of the other target unit remains unchanged. In this way, only one of the different target units needs to be adjusted in the path, thereby improving the efficiency of path planning.
[0087] Further, return to Figure 1Step S101 is performed, and subsequent steps are performed in sequence to determine whether new interference will occur in the subsequent movement of different target units. If so, the interference is eliminated by the method mentioned in the above corresponding embodiment.
[0088] In addition, it should be noted that when the number of target units in the scene is greater than two, the method mentioned in any of the above implementations is executed on any two target units until there is no interference between all target units.
[0089] In another embodiment, the reference decision scheme in step S102 may also be to adjust the initial path of each target unit at the same time. That is, the multiple reference decision schemes corresponding to each target unit include making the target unit wait at the waiting position, adjusting the initial path of the target unit alone, and adjusting the initial paths of two target units at the same time.
[0090] It should be noted that when the reference decision plan is to adjust the initial path of each target unit at the same time, the corresponding reference constraint condition can be a constraint method in an existing path planning method, or can also be a constraint method or a combination of multiple constraint methods mentioned in any of the above embodiments. In addition, when the reference decision plan is to adjust the initial path of each target unit at the same time, the candidate adjustment path obtained according to the corresponding reference constraint condition includes the paths corresponding to the two target units respectively.
[0091] See also Figure 7 , Figure 7 1 is a schematic diagram of a structure of an embodiment of a path planning system of the present application. Specifically, the path planning system includes an acquisition module 10, a decision module 20 and a processing module 30 coupled to each other. Specifically:
[0092] The acquisition module 10 is used to acquire initial paths corresponding to a plurality of target units respectively, and based on the initial paths, acquire interference information between different target units; wherein the interference information includes interference positions between different target units.
[0093] The decision module 20 is used to obtain multiple reference decision plans corresponding to different target units, and based on the reference decision plans and interference positions, obtain reference constraints matching the reference decision plans; wherein each reference decision plan is used to determine an adjustment method for an initial path of a corresponding target unit.
[0094] The processing module 30 is used to obtain a target adjustment path based on a reference decision scheme and its corresponding reference constraint conditions; wherein the target adjustment path is used to update an initial path of a corresponding target unit.
[0095] See also Figure 8 , Figure 8: It is a structural diagram of an embodiment of an electronic device of the present application. The electronic device includes: a memory 40 and a processor 50 coupled to each other. The memory 40 stores program instructions, and the processor 50 is used to execute the program instructions to implement the method mentioned in any of the above embodiments. Specifically, the electronic device includes but is not limited to: a desktop computer, a laptop computer, a tablet computer, a server, etc., which are not limited here. In addition, the processor 50 can also be called a CPU (Center Processing Unit). The processor 50 may be an integrated circuit chip with signal processing capabilities. The processor 50 can also be a general-purpose processor, a digital signal processor (Digital Signal Processor, DSP), an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field-programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. In addition, the processor 50 can be implemented by an integrated circuit chip.
[0096] See also Fig. 9 , Fig. 9 It is a schematic diagram of the structure of an embodiment of a storage device of the present application. The storage device 60 stores program instructions 70 that can be executed by a processor. When the program instructions 70 are executed by the processor, the method mentioned in any of the above embodiments is implemented.
[0097] In the several embodiments provided in the present application, it should be understood that the disclosed methods and devices can be implemented in other ways. For example, the device implementation described above is only schematic. For example, the division of modules or units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, and the indirect coupling or communication connection of devices or units can be electrical, mechanical or other forms.
[0098] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.
[0099] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0100] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, server, or network device, etc.) or a processor (processor) to perform all or part of the steps of each implementation method of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program code.
[0101] The above description is only an implementation method of the present application, and does not limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly used in other related technical fields, are also included in the patent protection scope of the present application.
Claims
1. A path planning method, characterized in that: include: Acquire initial paths corresponding to a plurality of target units respectively, and acquire interference information between different target units based on the initial paths; wherein the interference information includes interference positions between different target units; Acquire multiple reference decision plans corresponding to different target units respectively, and acquire reference constraint conditions matching the reference decision plans based on the reference decision plans and the interference positions; wherein each reference decision plan is used to determine an adjustment method for an initial path corresponding to the target unit; Based on the reference decision scheme and its corresponding reference constraint condition, a target adjustment path is obtained; wherein the target adjustment path is used to update the initial path of the corresponding target unit.
2. The method according to claim 1, characterized in that In response to the adjustment mode being waiting for any of the target units, the obtaining of a plurality of reference decision schemes corresponding to different target units, and obtaining reference constraint conditions matching the reference decision schemes based on the reference decision schemes and the interference positions, include: When any of the target units is a first unit and the target unit different from the first unit is a second unit, a reference decision plan corresponding to the first unit is obtained; wherein the initial paths corresponding to the first unit and the second unit respectively include overlapping shared channels, the shared channels correspond to a starting position and an end position, the first unit enters the shared channel through the starting position, and the second unit enters the shared channel through the end position; Based on the reference decision plan of the first unit, the interference position, the starting position and the end position, a first constraint condition and a second constraint condition corresponding to the first unit are obtained; wherein the first constraint condition is used to constrain the movement process of the first unit, and the second constraint condition is used to determine the waiting position corresponding to the first unit; The first constraint condition and the second constraint condition are used as reference constraints.
3. The method according to claim 2, characterized in that Based on the reference decision plan of the first unit, the interference position, the starting position, and the end position, obtaining a first constraint condition corresponding to the first unit includes: Based on the initial paths respectively corresponding to the first unit and the second unit, the interference moment of the first unit and the second unit is obtained, and based on the interference moment, a first sub-condition is determined; wherein the first sub-condition is used to prevent the first unit from moving to the interference position or the shared channel at the interference moment; Obtaining a first moment when the second unit arrives at the starting position, and determining a second sub-condition based on the first moment; wherein the second sub-condition corresponds to a target time period, the target time period is determined based on the first moment, and the second sub-condition is used to prevent the first unit from moving to the starting position within the target time period; The first sub-condition and the second sub-condition are used as the first constraint condition.
4. The method according to claim 2, characterized in that: Based on the reference decision plan of the first unit, the interference position, the starting position and the end position, obtaining a second constraint condition corresponding to the first unit includes: Taking all the intermediate positions in the shared channel, the starting position and the end position as reference positions, and determining a third sub-condition based on the reference positions; wherein the third sub-condition is used to prevent the waiting position from being located at the reference position; In response to the initial path of the second unit including an adjacent position adjacent to the starting position or the ending position, a fourth sub-condition is determined based on the adjacent position; wherein the fourth sub-condition is used to prevent the waiting position from being located at the adjacent position; The third sub-condition and the fourth sub-condition are used as the second constraint condition.
5. The method according to claim 1, characterized in that In response to the adjustment mode being an initial path adjustment of any of the target units, the obtaining of a plurality of reference decision schemes corresponding to different target units, and obtaining reference constraint conditions matching the reference decision schemes based on the reference decision schemes and the interference positions, include: Based on the reference decision plan of the target unit and the interference position, a reference constraint condition corresponding to the target unit is obtained; wherein the reference constraint condition of the target unit is used to prevent the corresponding target unit from being located at the interference position.
6. The method according to claim 1, characterized in that The obtaining of a target adjustment path based on the reference decision scheme and its corresponding reference constraint condition includes: Based on the reference decision scheme of the target unit and the corresponding reference constraint conditions, a plurality of candidate adjustment paths corresponding to different target units are obtained; Based on all the candidate adjustment paths, the target adjustment path is obtained.
7. The method according to claim 6, characterized in that The acquiring the target adjustment path based on all the candidate adjustment paths includes: For different target units, obtaining cost values corresponding to each candidate adjustment path respectively; wherein the cost values are determined based at least on the distance corresponding to the candidate adjustment path; Based on the cost value, determining the target adjustment path from the candidate adjustment paths respectively corresponding to different target units; After obtaining the target adjustment path based on the reference decision solution and the corresponding reference constraint condition, the method includes: The target adjustment path is updated to the corresponding initial path of the target unit, and the process returns to the step of obtaining initial paths corresponding to a plurality of target units.
8. The method according to claim 1, characterized in that The obtaining interference information between different target units based on the initial path includes: Obtaining environmental information of scenes where the target units are located; Based on the initial paths respectively corresponding to the target units, determining whether interference occurs between different target units; If yes, obtain the interference information based on the environment information and the initial path.
9. An electronic device, characterized in that: It comprises a memory and a processor coupled to each other, wherein the processor stores program instructions, and the processor is used to execute the program instructions to implement the path planning method according to any one of claims 1-8.
10. A storage device, characterized in that: Program instructions that can be executed by a processor are stored, and the program instructions are used to implement the path planning method described in any one of claims 1-8.
