Driving control method of mobile equipment, computer equipment and storage medium

By obtaining the locked area of ​​the mobile device and the closest point of the planned path, determining the turn-back conditions and verifying the unlocking, the problem of inaccurate unlocking of the mobile device is solved and driving efficiency is improved.

CN119088002APending Publication Date: 2024-12-06ZHEJIANG HUARAY TECH CO LTD
View PDF 0 Cites 2 Cited by

Patent Information

Application Number
CN202411016761.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-26
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

Mobile devices are unlocked inaccurately during driving, which affects operating efficiency.

Method used

By obtaining the mobile device's locked area of ​​the path to be executed and the closest point of the planned path, it determines whether the path to be executed meets the foldback condition, and uses the current position to verify the closest point to accurately unlock the locked area.

Benefits of technology

Improve the accuracy of unlocking the locked area, reduce the crash problems caused by misunderstanding, and improve the driving and operation efficiency of mobile devices.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119088002A_ABST
    Figure CN119088002A_ABST
Patent Text Reader

Abstract

The invention discloses a driving control method of mobile equipment, computer equipment and a storage medium. The method comprises the following steps: acquiring a locking area of the mobile equipment in a to-be-executed path, and acquiring a nearest point of the mobile equipment in a planned path; judging whether the to-be-executed path meets a turn-back path condition or not; in response to the condition that the to-be-executed path meets the turn-back path condition, verifying the nearest point by using the current pose of the mobile equipment to obtain a verification result; and unlocking the locking area according to the verification result. According to the scheme, the unlocking accuracy of the locking area can be improved, and therefore the running efficiency of the mobile equipment is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of mobile equipment, and in particular to a driving control method of a mobile equipment, a computer device and a storage medium. Background Art

[0002] Mobile devices such as automatic guided devices have functions such as task execution, positioning and navigation control, path planning, autonomous obstacle avoidance and power management. Therefore, they can be widely used in manufacturing scenarios, logistics scenarios, etc.

[0003] At present, in order to ensure the safety and efficiency of mobile devices during driving, it is necessary to lock the locked area of ​​the mobile device's pending path, and unlock the locked area when the mobile device passes through the pending path to the next pending path. The current driving control of mobile devices has the problem of inaccurate unlocking, which easily affects the operating efficiency of the mobile device. Summary of the invention

[0004] The main technical problem solved by the present application is to provide a driving control method for a mobile device, a computer device and a storage medium, which can improve the accuracy of unlocking a locked area, thereby improving the operating efficiency of the mobile device.

[0005] In order to solve the above problems, the first aspect of the present application provides a driving control method for a mobile device, the method comprising: obtaining a locked area of ​​the mobile device on the path to be executed, and obtaining the nearest point of the mobile device on the planned path; judging whether the path to be executed satisfies the turnaround condition; in response to the path to be executed satisfying the turnaround condition, verifying the nearest point using the current posture of the mobile device to obtain a verification result; and unlocking the locked area according to the verification result.

[0006] In order to solve the above problem, the second aspect of the present application provides a computer device, which includes a memory and a processor coupled to each other, the memory stores program data, and the processor is used to execute the program data to implement any step in any of the above methods.

[0007] In order to solve the above problem, the third aspect of the present application provides a computer-readable storage medium, which stores program data that can be executed by a processor, and the program data is used to implement any step of any of the above methods.

[0008] The above scheme obtains the locked area of ​​the mobile device on the path to be executed, and obtains the nearest point of the mobile device on the planned path, determines whether the path to be executed satisfies the return road condition, and in response to the path to be executed satisfying the return road condition, verifies the nearest point using the current posture of the mobile device to obtain the verification result, and unlocks the locked area according to the verification result. Since the nearest point is verified using the current posture of the mobile device when the locked area is unlocked when the path to be executed satisfies the return road condition, the locked area can be unlocked and released more accurately and timely, so as to reduce the problems such as collisions caused by mislocking of the locked area when the mobile device needs to pass the same node multiple times, and can improve the accuracy of unlocking the locked area, thereby improving the operating efficiency of the mobile device.

[0009] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] In order to more clearly illustrate the technical solutions in this application, the following briefly introduces the drawings required in the description of the embodiments. Obviously, the drawings described below are only some embodiments of this application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. Among them:

[0011] Figure 1 It is a flow chart of an embodiment of a driving control method of a mobile device of the present application;

[0012] Figure 2 This is an exemplary schematic diagram of an embodiment of a locking area of ​​the present application;

[0013] Figure 3 A schematic diagram of an operation path of a mobile device according to an embodiment of the present application;

[0014] Figure 4 This application Figure 1 A schematic diagram of a flow chart of an embodiment of step S14;

[0015] Figure 5 It is a structural schematic diagram of an embodiment of a travel control device of a mobile device of the present application;

[0016] Figure 6 It is a structural schematic diagram of an embodiment of a computer device of the present application;

[0017] Figure 7 It is a structural diagram of an embodiment of a computer-readable storage medium of the present application. DETAILED DESCRIPTION

[0018] 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.

[0019] The terms "first" and "second" in this application are only used for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Thus, the features defined as "first" and "second" can explicitly or implicitly include at least one of the features. In the description of this application, the meaning of "multiple" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but optionally also includes steps or units that are not listed, or optionally also includes other steps or units inherent to these processes, methods, products or devices.

[0020] Reference to "embodiments" in this application means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present application. The appearance of the phrase in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0021] The term "and / or" in this article is only a description of the association relationship of associated objects, indicating that there may be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the objects associated before and after are in an "or" relationship. In addition, "many" in this article means two or more than two. In addition, the term "at least one" in this article means any combination of at least two of any one or more of a plurality of, for example, including at least one of A, B, and C, can mean including any one or more elements selected from the set consisting of A, B, and C.

[0022] The present application provides the following embodiments, and each embodiment is described in detail below.

[0023] It is understandable that the driving control method of the mobile device in the present application can be executed by a computer device, and the computer device can be any device with processing capabilities, such as a mobile phone, a computer, a server, etc., and the present application does not limit this. Exemplarily, when the execution subject is the above-mentioned computer device, the driving of the mobile device can be controlled by means of a device management system, such as sending a control instruction to the mobile device to control the driving of the mobile device. Exemplarily, when the computer device is a mobile device, the mobile device can autonomously control the driving of the mobile device. The present application does not limit this. In some possible implementations, the driving control method of the mobile device can be implemented by a processor calling program data stored in a memory.

[0024] See also Figure 1 , Figure 1 This is a flow chart of an embodiment of a driving control method for a mobile device of the present application. The method may include the following steps:

[0025] S11: Acquire the locked area of ​​the mobile device on the path to be executed, and acquire the nearest point of the mobile device on the planned path.

[0026] The mobile device may be an AGV (Automated Guided Vehicle), an AMR (Autonomous Mobile Robot), an intelligent robot, a vehicle, etc., but the present application is not limited thereto. The present application will be described below using the mobile device as an example.

[0027] Get the locked area of ​​the mobile device on the path to be executed. The path to be executed can contain multiple nodes. Some nodes on the path to be executed can be pre-occupied for the mobile device to avoid collisions with other mobile devices. The locked area contains multiple locked nodes and locked grids. The locked node indicates that the mobile device pre-occupies the node of the path to be executed. The use status of the locked node can be represented by pre-occupancy.

[0028] For example, see Figure 2 , the mobile device travels in the direction of the path to be executed, and the locked area may include the nodes occupied by the path to be executed, that is, the locked nodes, and the locked area also includes the locked grids between adjacent nodes. Multiple locked grids between adjacent nodes can be used as multiple locked grids corresponding to the subsequent nodes. For example, the multiple locked grids corresponding to the path between the first node and the second node are used as the multiple locked grids corresponding to the second node.

[0029] Get the closest point of the mobile device on the planned path. The closest point can be the node on the planned path that is closest to the mobile device. The planned path can contain the path to be executed. For example, the planned path can be a global running path, and the path to be executed is a local running path.

[0030] In some implementations, in the above step S11, information such as the planned path, the path to be executed, the locked area, etc. of the mobile device may be obtained. The specific method includes:

[0031] Before determining the path to be executed by the mobile device, obtain the planned path corresponding to the current task of the mobile device, and the planned path can be the optimal global path. Specifically, the current location of the mobile device can be used as the starting point and the task end point of the current task, and an optimal global operation path from the starting point to the end point can be planned for the mobile device according to the constraints, that is, the planned path is obtained. Among them. Constraints such as shortest running time, shortest driving route, minimum driving cost, etc. are not limited in this application.

[0032] For example, taking AGV as an example, based on the attributes (such as workbenches, shelf areas, operating areas, etc.), location and connectivity information of each node (also known as path points) in the map network, as well as the current operating tasks, equipment locations and operating paths of each AGV device in the equipment management system, a shortest path planning algorithm such as A* (direct search method) can be used to plan an optimal global operating path from the starting position to the end position for the AGV device. This path can be called an A* path, or a planned path.

[0033] According to the information such as the directions of each node and the connectivity information of the path points contained in the planned path, a global action path containing the AGV action information is generated.

[0034] See also Figure 3 For example, taking the mobile device as AGV, the starting position of the current task is from node 0 (0,0) to node 3 (2,1). The global action path is as follows: ① AGV moves forward from node 0 (0,0) to node 1 (0,1); ② turns left 90 degrees at node 1 (0,1); ③ moves from node 1 (0,1) along the Bezier curve to node 2 (2,2); ④ moves backward from node 2 (2,2) to node 3 (2,1).

[0035] Get the path to be executed of the mobile device. The path to be executed can be a local path or a segment path of the planned path. Exemplarily, taking AGV as an example, the "segment path" in the embodiment of the present application refers to the global running path from the starting point to the end point of the current task planned for the AGV, and according to the running paths of other AGVs, through a certain multi-vehicle scheduling strategy (avoiding collisions or deadlocks between AGVs and other AGVs), the length of the local running path without risks such as duplication and collision, which contains a certain number of path points, is calculated for the AGV. This local running path is the segment path.

[0036] In some implementations, the length of the path to be executed pre-issued by the mobile device may be determined according to a preset rule. For example, the length information of the path to be executed by the AGV may be determined according to a distance threshold, and the length information includes the longest and shortest lengths.

[0037] Exemplarily, the shortest length threshold of the AGV's path to be executed can be determined based on the minimum deceleration and parking function attribute of the AGV device itself. The longest length threshold of the AGV's path to be executed is determined based on the map size and the upper limit of the length of the local running path occupied by the AGV device specified by the operating efficiency requirements. Among the nodes on the path to be executed that are not less than the shortest length threshold and not more than the longest length threshold, the node closest to the shortest length threshold is selected as the node of the path to be executed that is preliminarily determined. Then adjust the length of the preliminarily determined path to be executed according to the attributes of each node. For example: if the action information of the preliminarily obtained path to be executed contains a rotation action point, it means that the mobile device needs to decelerate and stop at this rotation action point and then rotate in place, and the preliminarily determined path to be executed needs to be truncated forward to the rotation action point; if the attribute of the last node of the preliminarily obtained path to be executed is that parking and waiting are not allowed (such as anti-congestion at the intersection does not allow parking), then continue to append forward to the node where parking and waiting can be allowed.

[0038] In some implementations, the length of the path to be executed can be adjusted through a deadlock detection algorithm, and a segment path (i.e., the path to be executed) that is free of duplication or collision and can be safely driven is sent to the mobile device. Exemplarily, the "deadlock" in the embodiment of the present application refers to multiple AGV devices applying for areas that have been occupied (i.e., locked) by each other, forming a mutual blocking relationship. This state of mutual blocking is called a deadlock.

[0039] Then, the path to be executed can be used to determine the locking area of ​​the mobile device. The locking area includes a locking node and a locking grid area, such as including multiple locking nodes and multiple locking grid areas. The locking grid area can represent a non-node area, and each node can correspond to multiple locking grid areas.

[0040] In some embodiments, after determining the path to be executed of the mobile device, the locked set of the mobile device can be determined based on the action information of the path to be executed, device-related information, following distance, and other information. Device-related information includes device size, running deviation, and the like. Exemplarily, each locked node of the AGV on the path to be executed and the locked area between adjacent nodes can be determined based on the action information, device size, running deviation, following distance, and other information of the path to be executed of the AGV.

[0041] In some embodiments, in order to accurately control the position of a mobile device between nodes, interpolation can be performed between nodes according to a preset distance interval between nodes, thereby determining an interpolation lock area of ​​the mobile device at the interpolation point, wherein the preset distance interval is determined by the braking performance of the mobile device, and the preset distance interval can be greater than the minimum moving distance supported by the mobile device's capabilities, and the number of interpolations between nodes with different distances is different.

[0042] In some embodiments, the locked set area of ​​the mobile device in a stationary state or in a moving state may be determined. According to the type of the mobile device, the movement mode of the mobile device and / or the load of the mobile device on the path to be executed is determined. Based on the movement mode and the locked area of ​​the mobile device in a stationary state or in a moving state, the locked area and / or the load of the locked area are determined at each node preset on the path to be executed and the locked area between the nodes.

[0043] Exemplarily, the "locked area" of the embodiment of the present application refers to locking at least one circular or rectangular area on the map for the AGV device based on the nodes and action information contained in the segment path, combined with information such as the AGV device's own size, load size, operating deviation, and following distance. That is, it can represent the area covered by the AGV / AGV's load, including point lock grids (that is, locked nodes), interpolation lock grids (that is, locked grid areas), and real-time lock grids (that is, locked areas at the current position).

[0044] Exemplarily, a point lock grid refers to the area covered when the center position of an unloaded AGV or a loaded AGV device is located at a certain node. An interpolation lock grid refers to when the distance between two sequentially adjacent nodes specifies a distance threshold, in order to ensure that the AGV can accurately occupy and release part of the area between the two nodes when running between the two nodes, a certain number of areas are evenly inserted between the point lock grids of the two nodes, so that multiple evenly distributed interval areas are formed between the point lock grids of the two nodes. Such an area is an interpolation lock grid. A real-time lock grid refers to the area covered by the current position of the AGV during operation, such as a point lock grid or an interpolation lock grid.

[0045] In some embodiments, the interpolation spacing, size, etc. of each locking grid area of ​​the locking area can be set according to the specific application scenario. For example, the interpolation spacing of the interpolation lock grid can be a preset distance interval. The preset distance interval can be less than the length of the mobile device, or greater than or equal to the length of the mobile device. Exemplarily, the interpolation spacing of the interpolation lock grid can be less than the length of the mobile device. For example, the interpolation spacing of the interpolation lock grid is set to 0.1 meters, that is, interpolation is performed every 0.1 meters between adjacent nodes, so that the mobile device can lock a feasible interval of 0.1 meters, that is, an interpolation lock grid. Alternatively, after the mobile device travels 0.1 meters, this 0.1-meter interpolation lock grid can be unlocked and released more promptly according to the embodiments of the present application.

[0046] In some embodiments, the running segment paths of other AGVs can be obtained to determine whether the AGV's path to be executed overlaps with or collides with the running segment paths of other AGVs (such as whether the AGV has a safety risk of collision or deadlock with other AGVs). Specifically, it can be checked whether the locked area on the AGV's path to be executed overlaps with the locked area on the running segment paths of other AGVs. If so, it can be determined that the AGV's path to be executed overlaps with or collides with the running segment paths of other AGVs, etc., and the number of path points on the AGV's path to be executed can be reduced in turn, and the length of the path to be executed can be modified until it is determined that there is no safety risk in the path to be executed. Then, based on the newly obtained path to be executed, the above method is used to re-determine the various path points of the AGV on the new path to be executed and the locked area between the path points; if it is safe, the path to be executed is sent to the AGV.

[0047] It should be noted that other methods may also be used to determine whether the AGV's to-be-executed path overlaps with the running segment paths of other AGVs, and the embodiments of the present application do not limit this. The to-be-executed path may be the AGV in the initialization state, that is, before entering the running state, or it may be the next segment of the path to be run planned by the equipment management system when the AGV is running on the current segment path. The present application does not limit this.

[0048] Then, the path to be executed is sent to the mobile device, and the locked area can be pre-occupied, that is, each locked node on the path to be executed and the locked grid area between nodes. The locked nodes and the locked grid area between nodes in the locked area are in the locked state and can be pre-occupied exclusively. The locked area cannot be used by other mobile devices, so the mobile device can exclusively use the path to be executed to achieve safe operation of the mobile device.

[0049] The mobile device receives relevant information of the path to be executed so as to control the forward travel according to the path to be executed.

[0050] In some embodiments, the mobile device may obtain the nearest point of the mobile device on the planned path when the driving distance does not meet the node distance condition, that is, the driving distance may be less than or equal to the node distance threshold, and / or the driving distance does not reach the next node. Determine whether the path to be executed meets the return road condition. In response to the path to be executed meeting the return road condition, the nearest point is verified using the current posture of the mobile device to obtain a verification result. Unlock the locked area according to the verification result.

[0051] Among them, the node distance threshold can be less than or equal to the distance between adjacent nodes. The driving distance of the mobile device can be the distance traveled by the mobile device from the current node to the next node. A driving distance less than the node distance threshold can indicate that the distance traveled by the mobile device is short, so that when the mobile device travels a short distance, it can also unlock and release the locked area that has been passed. For the node distance threshold, the node distance threshold can be determined according to the specific application scenario or the nodes of the planned path. For example, the node distance threshold can be determined according to the distance between adjacent nodes. For example, the node distance threshold can be determined according to the driving conditions or size of the mobile device. This application does not limit the method for determining the node distance threshold.

[0052] In some embodiments, the mobile device triggers the execution of step S11 and subsequent steps of this embodiment with a distance cycle or a time cycle. For example, the driving distance of the mobile device reaches the distance length of the distance cycle, such as 0.1 meters, 0.2 meters, etc., and this application does not limit this; or, the driving time of the mobile device reaches the duration of the time cycle, such as 0.1 seconds, 0.5 seconds, 1 second, etc., and this application does not limit this; it can trigger the execution of step S11 and subsequent steps of this embodiment to unlock and release the locked area that has been passed. For example, the acquisition of the nearest point of the mobile device on the planned path of this embodiment can be performed according to the time cycle. The nearest point is used to determine whether the path to be executed meets the return road condition. In response to the path to be executed meeting the return road condition, the nearest point is verified using the current posture of the mobile device to obtain the verification result. The locked area is unlocked according to the verification result. This application does not limit this.

[0053] According to the current position of the mobile device (such as the real-time current position) and the planned path (i.e., the global running path), the node closest to the current mobile device among the nodes of the planned path is obtained as the nearest point, which is recorded as nearestNode. That is, the nearest point can represent the node closest to the mobile device. The nearest point may be a node that the mobile device has passed or a node that it has not passed.

[0054] In some implementations, the target node may be initialized. For example, the target node to be released among the multiple locked nodes in the initialized locked region may be recorded as lockClearIdx=0, where lockClearIdx=0 may indicate that the index of the initialized target node is 0.

[0055] S12: Determine whether the path to be executed satisfies the return path condition.

[0056] In the case of a return road, it is easy to cause a collision of the mobile device. In order to avoid the collision of the mobile device on the return road and reduce the accuracy of locking and unlocking the node on the return road, the present application determines whether the path to be executed by the mobile device meets the return road conditions. If the return road conditions are met, it means that the path to be executed is a return road.

[0057] For example, the return road includes a return route, a round trip route, etc. For example, on the return road, a mobile device enters a node in a certain direction and then turns back in the opposite direction or at an acute angle to continue to the next node. For example, the return road can be used to facilitate the mobile device to turn around or change the driving direction in the relative direction. For example, a mobile device can pass through a return point multiple times on the return road, etc., and this application does not limit the return road.

[0058] In some implementations, the nearest point can be used to determine whether the path to be executed meets the return path condition. The return path condition includes at least one of the following: the number of the nearest points on the planned path is greater than a preset number, and the planned path includes the path to be executed; there is a historical path point after the nearest point, and the historical path point is a preset node reported by the mobile device on the historical planned path.

[0059] In some implementations, the number of closest points on the planned path can be used to determine whether the path to be executed meets the return path condition. For example, if the number of closest points on the A* path is greater than or equal to 2, it means that the planned path of the mobile device is planned to pass through the same node (such as the closest point) twice or more, that is, the path to be executed may be a return path, and the closest point may be a return point, and it is determined that the path to be executed meets the return path condition.

[0060] In some embodiments, it is possible to determine whether the path to be executed meets the turnaround condition through the preset nodes reported by the mobile device in the historical planned path. If there is a historical path point after the nearest point, it is determined that the path to be executed meets the turnaround condition. Among them, the historical path point is the preset node reported by the mobile device in the historical planned path. The preset node may include nodes reported by scanning, sending data, etc. This application does not limit the reporting method. In some application scenarios, the nearest point may also be a historical path point. If the nearest point is a historical path point and there is a historical path point after the nearest point, it is determined that the path to be executed meets the turnaround condition. Exemplarily, if there is still a node reported by the mobile device in the historical planned path after the nearest point, it can be determined that the path to be executed meets the turnaround condition.

[0061] Exemplary. Multiple route planning may be performed for the current task. For example, multiple planned paths may be obtained due to reasons such as re-planning the route, or the path planning for the previous historical task may be similar to the time of the current path planning, so a historical planned path may be obtained. The current planned path of the re-planned path may have the same nodes as the historical planned path, and may form a turnaround in the current planned path. Therefore, by using the preset nodes reported by the mobile device on the historical planned path to determine whether the path to be executed meets the turnaround condition, problems such as collisions when passing through the same node multiple times can be avoided.

[0062] It is understandable that the present application may also determine whether the path to be executed satisfies the return path condition in other ways, and the present application does not impose any limitation on this.

[0063] Optionally, when it is determined in step S12 that the path to be executed satisfies the return path condition, the following step S13 may be executed.

[0064] Optionally, when it is determined in step S12 that the path to be executed does not satisfy the return path condition, the step of determining whether the mobile device has passed the nearest point and subsequent steps are executed. For example, it can be determined whether the mobile device has passed the nearest point based on the current position of the mobile device. If it is determined that the nearest point has been passed, the nearest point is determined to be the target node in response to the mobile device having passed the nearest point. If it is determined that the nearest point has not been passed, the preceding node of the nearest point is determined to be the target node in response to the mobile device not having passed the nearest point. The target node in the locked area and the locked area corresponding to the previous locked node are unlocked.

[0065] S13: In response to the path to be executed satisfying the return path condition, the nearest point is verified using the current posture of the mobile device to obtain a verification result.

[0066] In response to the path to be executed satisfying the return path condition, that is, the path to be executed is a return path, the nearest point can be verified using the current posture of the mobile device, such as verifying whether the nearest point is a node in the path to be executed, and / or verifying whether the current posture of the mobile device satisfies the nearest point posture condition, etc. After the verification, a verification result is obtained, and the verification result is a verification pass or a verification fail.

[0067] In some implementations, each node of the path to be executed is traversed to determine whether each node is the nearest point. If the node in the path to be executed is determined to be the nearest point, the verification result is determined to be a pass, or the following steps are performed to verify whether the current posture of the mobile device meets the nearest point posture condition. If it is determined that the node in the path to be executed is not the nearest point, and there is no node that has not been traversed or checked, that is, the nearest point is not on the path to be executed, there is no need to modify the locked node lockClearIdx that needs to be unlocked in the locked area.

[0068] In some embodiments, in response to a node in the path to be executed being the nearest point, it is possible to check whether the current posture of the mobile device meets the nearest point posture condition. The current posture includes the current position and the current angle. The nearest point posture condition includes whether the current posture of the mobile device meets the distance requirement and the angle requirement to reach the nearest point. For example, it is possible to check whether the current position of the mobile device meets the distance requirement to reach the nearest point, and to check whether the current angle of the mobile device meets the angle requirement to reach the nearest point. If the distance requirement and the angle requirement are met, it is determined that the current posture of the mobile device meets the nearest point posture condition.

[0069] In some embodiments, the current position and current angle of the mobile device can be judged based on the action path to determine whether they meet the distance requirement and angle requirement for reaching the nearest point. For example, the global action path includes the action information of the mobile device at each node and the index value of each node, and the action information includes angle information and distance information, such as the AGV moving forward 1 meter from node 0 (0,0) to node 1 (0,1). In this way, it can be determined based on the action path whether the current position of the mobile device meets the distance requirement for reaching the nearest point and whether the current angle meets the angle requirement for reaching the nearest point. For example, the nearest point is the previous node or the next node of the current position of the mobile device. Exemplarily, the distance requirement is such as the distance between the current position of the mobile device and the nearest point is less than a set distance threshold, and the set distance can be determined based on the action information. Exemplarily, the angle requirement is such as the difference between the current angle of the mobile device and the angle information of reaching the nearest point in the action information is less than a set angle threshold.

[0070] In response to satisfying the closest point posture condition, the verification result is determined to be verification passed. In this way, the idx value of the nearest node that the mobile device approaches in the action path, that is, the index value, can be accurately obtained.

[0071] The above method, by judging whether the path to be executed by the mobile device meets the return road condition, only judges the subsequent execution path. If the mobile device is planned to be a return road from the starting point to the end point, after the mobile device has passed the return point, it can be regarded as a return road to judge whether the path locking area is released, thereby improving the efficiency of releasing the locking area.

[0072] S14: Unlock the locked area according to the verification result.

[0073] The locked area can be unlocked according to the above verification result, such as unlocking the locked area that has been passed, so that the locked area can be released in time.

[0074] In some embodiments, in response to not meeting the closest point posture condition, it is determined that the verification result is a verification failure, and the above step S13 is continued to be executed to determine whether the next node of the path traversal to be executed is the closest point, whether the current posture of the mobile device meets the closest point posture condition of the next node as the closest point, and subsequent steps.

[0075] In some embodiments, in response to the verification result being a verification pass, it is determined whether the mobile device has passed the nearest point. For example, the current position of the mobile device can be used to determine whether the mobile device has passed the nearest point. Based on whether the nearest point has been passed, a locked node that needs to be unlocked is determined, and the locked node that needs to be unlocked and the locked area corresponding to the previous node are unlocked.

[0076] The above method, by judging whether the current position of the mobile device has passed the nearest point, serves as the basis for whether the mobile device can unlock and release the locked area. It can accurately identify the nodes that the mobile device has passed in real time, unlock and release the locked area in time, and improve the release efficiency of the locked area.

[0077] In some embodiments, see Figure 4 , step S14 of the above embodiment can be further expanded. To determine whether the mobile device has passed the nearest point, this embodiment may include the following steps:

[0078] S141: Determine the driving direction information of the mobile device using the current position of the mobile device.

[0079] The current position of the mobile device can be used to determine the driving direction information of the mobile device, or the current position of the mobile device and the position of the nearest point can be used to determine the driving direction information of the mobile device. The driving direction information can indicate the relative position relationship between the mobile device and the nearest point and / or the difference in running direction of the path to be executed with the nearest point, etc.

[0080] In some embodiments, the driving direction information includes: driving direction and / or relative position, the driving direction indicates the direction difference of the moving direction of the mobile device relative to the preset edge of the path to be executed, and the relative position indicates the relative position of the nearest point relative to the mobile device. The preset edge may be an edge formed by the starting position and the end position of the path to be executed.

[0081] In some embodiments, when the driving direction information includes the driving direction, the following steps may be performed:

[0082] Get the starting position of the mobile device on the preset edge of the path to be executed. Specifically, the starting position includes the starting position and the end position. The starting position (startpoint_x, startpoint_y) and the end position (endpoint_x, endpoint_y) of the preset edge can be obtained through the idx value of the nearest node in the action path, the angle from the nearest point to the mobile device nearestNodeIdx_angle and the pose of the previous node.

[0083] The angle value of the preset side is determined by using the starting position. Specifically, the radian value of the preset side can be obtained by using the starting position, and the radian value is converted into an angle to obtain the angle value of the preset side.

[0084] Exemplarily, the radian value of the preset edge is obtained by the starting point position (startpoint_x, startpoint_y) and the end point position (endpoint_x, endpoint_y) of the preset edge, as follows:

[0085] radian=atan2((endpoint_y-startpoint_y),(endpoint_x-startpoint_x)).

[0086] Among them, radian represents the radian value of the preset edge, and atan2 is a radian function used to calculate the azimuth. For example, atan2(y,x) returns the arc tangent of y / x expressed in radians.

[0087] Then, the radian value is converted to an angle to obtain the angle value of the preset side, as follows:

[0088] angle=radian*((double)180 / PI)*a.

[0089] Wherein, angle represents the angle value of the preset side, radian represents the radian value of the preset side, PI represents the circumference of a circle, and a represents the adjustment multiple, such as a multiple of 10, and an exemplary a=1000. It can be used to improve the calculation accuracy. Double is a data type used to represent double-precision floating point numbers.

[0090] The first difference between the angle of the preset edge and the angle from the nearest point to the mobile device is used. The first difference diffAngle is as follows:

[0091] diffAngle=angle-nearestNodeIdx_angle.

[0092] Then, the driving direction may be determined according to the first difference diffAngle.

[0093] In some embodiments, a numerical range check may be performed on the first difference. It is determined whether the first difference meets a first preset numerical range, and the first preset numerical range is included in the interval between the first numerical value and the second numerical value. The first numerical value is 0, and the second numerical value may be the product of 360 and the adjustment multiple a. Exemplarily, the first preset numerical range is [0, 360000].

[0094] In response to the first difference not meeting the first preset numerical range, for example, the first difference diffAngle is less than 0 or greater than 360000, the first difference is numerically adjusted so that the adjusted first difference meets the first preset numerical range. Among them, adjusting the first difference may include increasing the second numerical value or decreasing the second numerical value multiple times until the adjusted first difference meets the first preset numerical range. Exemplarily, the second numerical value 360000 may be added to or subtracted from the first difference diffAngle multiple times until the value of the first difference diffAngle is within the interval of the first preset numerical range [0,360000]. Thus, the driving direction is determined using the adjusted first difference that meets the first preset numerical range.

[0095] In some embodiments, it is determined whether the first difference or the adjusted first difference is within a direction interval range, and in response to the first difference or the adjusted first difference being within the direction interval range, the driving direction is determined to be the first driving direction. For example, the direction interval range may be [0, 90*a)∪(270*a, 360*a]. Exemplarily, the direction interval range may be expressed as [0, 90000)∪(270000, 360000]. If the first difference diffAngle is in the direction interval range [0, 90000)∪(270000, 360000], the driving direction is determined to be the first driving direction, and the driving direction is the first driving direction as goAhead=true. Otherwise, the driving direction is determined to be the second driving direction, and the driving direction is the second driving direction as goAhead=false. The first driving direction indicates that the moving direction of the mobile device is the same as the direction of the preset edge of the path to be executed, that is, it can be indicated that the driving direction of the mobile device is the same as the direction of the preset edge, and the mobile device is moving forward. The second driving direction indicates that the moving direction of the mobile device is different from the direction of the preset edge of the path to be executed, that is, it can be indicated that the driving direction of the mobile device is opposite to the direction of the preset edge, and the mobile device is moving backward.

[0096] In some embodiments, when the driving direction information includes a relative position, the following steps may be performed:

[0097] The azimuth angle angleP2C between the current position of the mobile device (vehiclePosition_x, vehiclePosition_y) and the endpoint position (endpoint_x, endpoint_y) of the preset edge can be obtained as follows:

[0098] angleP2C=atan2(endpoint_y-vehiclePosition_y, endpoint_x-vehiclePosition_x) / PI*180.

[0099] Among them, atan2 is a radian function used to calculate the azimuth, such as atan2(y,x), which returns the arc tangent of y / x expressed in radians.

[0100] In some implementations, the azimuth angle angleP2C may be checked. Specifically, it is determined whether the azimuth angle angleP2C conforms to a second preset value range. For example, the second preset value range is greater than or equal to 0.

[0101] In response to the azimuth angle not meeting the second preset numerical range, the azimuth angle is numerically adjusted to obtain an adjusted azimuth angle. The azimuth angle is numerically adjusted by adding a third numerical value at least once. Exemplarily, if the azimuth angle angleP2C is less than 0, 360 is added to the azimuth angleP2C to obtain an adjusted azimuth angle, so that the adjusted azimuth angle meets the second preset numerical range.

[0102] In some implementations, a second difference Δangle between the azimuth angle or the adjusted azimuth angle and the current angle of the mobile device is used as follows:

[0103] Δangle=abs(angleP2C-vehiclePosition_angle).

[0104] Where abs represents the absolute value function, which is used to find the absolute value of data. vehiclePosition_angle represents the current angle of the mobile device.

[0105] Then, the relative position is determined based on the second difference.

[0106] Determine whether the second difference is within the position interval. In response to the second difference being within the position interval, determine that the relative position is the first orientation. For example, the position interval may be [0,90)∪(270,360]. If the second difference Δangle is within the position interval [0,90)∪(270,360], then the relative position may be determined to be the first orientation, and the relative position being the first orientation is recorded as nearestNodeinVehAhead=true. Otherwise, determine that the relative position is the second orientation, and the relative position being the second orientation is recorded as nearestNodeinVehAhead=false. The first relative position indicates that the nearest point is at the first orientation of the mobile device, such as indicating that the nearest point is at the front direction of the mobile device. The second relative position indicates that the nearest point is at the second orientation of the mobile device, such as indicating that the nearest point is at the rear direction of the mobile device.

[0107] S142: Determine whether the driving direction information satisfies the running posture condition.

[0108] In some embodiments, the running posture condition includes any one of the following: the driving direction is the first driving direction and the relative position is the second relative position; the driving direction is the second driving direction and the relative position is the first relative position. The first driving direction indicates that the moving direction of the mobile device is the same as the direction of the preset side of the path to be executed, and the second driving direction indicates that the moving direction of the mobile device is different from the direction of the preset side of the path to be executed; the first relative position indicates that the closest point is at a first orientation of the mobile device, such as the front direction of the vehicle. The second relative position indicates that the closest point is at a second orientation of the mobile device, such as the rear direction of the vehicle.

[0109] In some embodiments, if the driving direction is the first driving direction goAhead=true and the relative position is the second relative position nearestNodeinVehAhead=false, or if the driving direction is the second driving direction goAhead=false and the relative position is the first relative position nearestNodeinVehAhead=true, it is determined that the driving direction information meets the running posture condition, which means that the mobile device has passed the nearest point, otherwise, it is determined that the driving direction information does not meet the running posture condition, which means that the mobile device has not passed the nearest point.

[0110] S143: In response to the driving direction not satisfying the running posture condition, determining that the mobile device has not passed the nearest point.

[0111] In response to the driving direction not satisfying the operating posture condition, it can be determined that the mobile device has not passed the closest point.

[0112] In some implementations, in response to the travel direction satisfying the operating posture condition, it is determined that the mobile device has passed the closest point.

[0113] In some embodiments, for the above step S14, after determining whether the mobile device has not passed the nearest point, the following steps may also be performed:

[0114] Optionally, in response to the mobile device not passing the nearest point, the preceding node of the nearest point is determined to be the target node. The preceding node can be represented as a node before the nearest point, such as a preset number of nodes. Exemplarily, if the nearest point index is idx, the target node is the previous node idx-1. The locked node (i.e., the target node) lockClearIdx that needs to be unlocked in the locked area is updated to idx-1 of the nearest point.

[0115] Optionally, in response to the mobile device having passed the nearest point, the nearest point is determined to be the target node, and the lockClearIdx of the locked node (ie, the target node) in the locked area that needs to be unlocked is updated to the idx of the nearest point.

[0116] For example, when a mobile device travels from a first node to a second node, if the travel distance does not meet the node distance condition, it means that the mobile device has not reached the second node. The nearest point is obtained, which may be the first node or the second node, and it is determined whether the mobile device has passed the nearest point to determine its target node, that is, the locked node that needs to be unlocked. If the nearest point is passed, the nearest point can be used as the target node. If the nearest point is not passed, the node before the nearest point can be used as the target node.

[0117] In some implementations, the target node indicates the last index of the locked node that needs to be unlocked, that is, the last locked node that needs to be unlocked.

[0118] Then, the target node in the locked area and the locked area (including the locked node and the locked area) corresponding to the locked node before the target node can be unlocked. After the locked area is unlocked and released, other mobile devices can use the unlocked and released locked area.

[0119] The above method can more accurately determine the nodes that the mobile device has passed, and promptly unlock the locked areas corresponding to the passed nodes and previous nodes.

[0120] In some embodiments, after the above step S14, it is determined whether the mobile device has reached the task end point of the current task. If it has reached the task end point, the current process is terminated. If it has not reached the task end point, it is determined whether it is necessary to send the next section of the path to be executed during the driving process of the mobile device. If so, the next section of the path to be executed is sent to the mobile device, the locked area corresponding to the next section of the path to be executed is obtained, the locked area is occupied, and the above step S11 and subsequent steps are continued. If it is not necessary to send the next section of the path to be executed, the mobile device is controlled to continue to move forward, and the above step S11 and subsequent steps are continued.

[0121] The above scheme obtains the locked area of ​​the mobile device on the path to be executed, and obtains the nearest point of the mobile device on the planned path, determines whether the path to be executed satisfies the return road condition, and in response to the path to be executed satisfying the return road condition, verifies the nearest point using the current posture of the mobile device to obtain the verification result, and unlocks the locked area according to the verification result. Since the nearest point is verified using the current posture of the mobile device when the locked area is unlocked when the path to be executed satisfies the return road condition, the locked area can be unlocked and released more accurately and timely, so as to reduce the problems such as collisions caused by mislocking of the locked area when the mobile device needs to pass the same node multiple times, and can improve the accuracy of unlocking the locked area, thereby improving the operating efficiency of the mobile device.

[0122] In some embodiments, after the above step S14, the locked grid area that has been passed after the target node of the locked area can be unlocked. The following steps can also be performed:

[0123] In response to the travel distance of the mobile device not satisfying the node distance condition, that is, the mobile device has not reached the next node, such as the subsequent node of the target node. The subsequent node of the target node is determined to be a non-passed node, and the subsequent node is a node after the target node. Exemplarily, the subsequent node lockClearIdx+1 of the target node lockClearIdx is a non-passed node.

[0124] Obtain a locked area of ​​the mobile device in a node that has not been passed, wherein the locked area includes multiple locked grid areas corresponding to the nodes that have not been passed. Determine a target grid area of ​​the mobile device, wherein the target grid area is a locked grid area that the mobile device has passed. In response to the locked grid area that the mobile device has passed, determine the locked grid area as the target grid area. Alternatively, in response to the locked grid area that the mobile device has not passed, determine the previous locked grid area of ​​the locked grid area as the target grid area. Unlock the target grid area of ​​the locked area.

[0125] The above scheme can more accurately determine the nodes that the mobile device has passed, and timely unlock the locked areas corresponding to the passed nodes and previous nodes, which can improve the operating efficiency of the mobile device. In addition, on this basis, further unlocking and clearing the locked grid areas that have passed without passing the nodes can timely and accurately release the lock of the areas that the mobile device has passed, thereby making full use of limited map resources, improving the timeliness of other mobile devices such as the following vehicles, and effectively improving the operating efficiency of the mobile device.

[0126] It is understandable that in the above method of the specific implementation mode, the writing order of each step does not mean a strict execution order and does not constitute any limitation on the implementation process. The specific execution order of each step should be determined by its function and possible internal logic.

[0127] For the above-mentioned embodiment, the present application also provides a driving control device for a mobile device, which is used to implement the above-mentioned driving control method for a mobile device.

[0128] See also Figure 5 , Figure 5 1 is a schematic diagram of the structure of an embodiment of a driving control device of a mobile device of the present application. The driving control device 20 of the mobile device comprises an acquisition module 21, a return module 22, a verification module 23 and an unlocking module 24.

[0129] The acquisition module 21 is used to acquire the locked area of ​​the mobile device on the path to be executed, and to acquire the nearest point of the mobile device on the planned path.

[0130] The return module 22 is used to determine whether the path to be executed meets the return path condition.

[0131] The verification module 23 is used to verify the nearest point using the current position and posture of the mobile device in response to the path to be executed satisfying the return path condition to obtain a verification result.

[0132] The unlocking module 24 is used to unlock the locked nodes in the locked area according to the verification result.

[0133] It should be noted that the driving control device of the mobile device provided in the above embodiment and the driving control method of the mobile device provided in the above embodiment belong to the same concept, wherein the specific manner in which each module and unit performs the operation has been described in detail in the method embodiment, and will not be repeated here. In actual application, the driving control device of the mobile device provided in the above embodiment can distribute the above functions to different functional modules as needed, that is, divide the internal structure of the device into different functional modules to complete all or part of the functions described above, and this is not limited here.

[0134] For the above embodiment, the present application provides a computer device, see Figure 6 , Figure 6 1 is a schematic diagram of the structure of an embodiment of a computer device of the present application. The computer device 30 includes a memory 31 and a processor 32, wherein the memory 31 and the processor 32 are coupled to each other, the memory 31 stores program data, and the processor 32 is used to execute the program data to implement the steps of any embodiment of the driving control method of the mobile device described above.

[0135] In this embodiment, the processor 32 may also be referred to as a CPU (Central Processing Unit). The processor 32 may be an integrated circuit chip having signal processing capabilities. The processor 32 may also be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gates or transistor logic devices, or discrete hardware components. A general-purpose processor may be a microprocessor or the processor 32 may also be any conventional processor, etc.

[0136] The method of the above embodiment can be implemented in the form of a computer program, so the present application proposes a computer readable storage medium, see Figure 7 , Figure 7The computer-readable storage medium 40 stores program data 41 that can be run by a processor, and the program data 41 can be executed by the processor to implement the steps of any embodiment of the above-mentioned driving control method for a mobile device.

[0137] The computer-readable storage medium 40 of this embodiment can be a medium that can store program data 41, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, or it can also be a server that stores the program data 41. The server can send the stored program data 41 to other devices for execution, or it can also execute the stored program data 41 by itself.

[0138] In some embodiments, the functions or modules included in the device provided in the above embodiments of the present application can be used to execute the method described in the above method embodiments. The specific implementation can refer to the description of the above method embodiments. For the sake of brevity, it will not be repeated here.

[0139] The above description of various embodiments tends to emphasize the differences between the various embodiments. The same or similar aspects can be referenced to each other, and for the sake of brevity, they will not be repeated herein.

[0140] 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. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, 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.

[0141] 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.

[0142] 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.

[0143] 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, which is 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, which is stored in a storage medium and includes several instructions for a computer device (which can be a computer, server, or network device, etc.) or a processor to perform all or part of the steps of each implementation method of the present application.

[0144] Obviously, those skilled in the art should understand that the above modules or steps of the present application can be implemented by a general computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, and optionally, they can be implemented by a program code executable by a computing device, so that they can be stored in a computer-readable storage medium and executed by a computing device, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. In this way, the present application is not limited to any specific combination of hardware and software.

[0145] The above description is only an embodiment 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 applied in other related technical fields, are also included in the patent protection scope of the present application.

Claims

1. A driving control method for a mobile device, It is characterized in that include: Acquire a locked area of ​​a mobile device on a path to be executed, and acquire the nearest point of the mobile device on the planned path; Determining whether the path to be executed satisfies a return path condition; In response to the to-be-executed path satisfying the return path condition, verifying the closest point using the current position and posture of the mobile device to obtain a verification result; The locked area is unlocked according to the verification result.

2. The method according to claim 1, It is characterized in that The return path condition includes at least one of the following: The number of the closest points on the planned path is greater than a preset number, and the planned path includes the path to be executed; There is a historical path point after the nearest point, and the historical path point is a preset node reported by the mobile device in the historical planned path.

3. The method according to claim 1, It is characterized in that The verifying the closest point using the current position and posture of the mobile device to obtain a verification result includes: In response to the node in the to-be-executed path being the closest point, checking whether the current posture of the mobile device satisfies a closest point posture condition; In response to satisfying the closest point attitude condition, determining that the verification result is a verification pass; The closest point posture condition includes that the current posture of the mobile device meets the distance requirement and angle requirement to reach the closest point.

4. The method according to claim 1, It is characterized in that The unlocking of the locked area according to the verification result includes: In response to the verification result being a verification pass, determining whether the mobile device has passed the closest point; In response to the mobile device not passing through the closest point, determining the preceding node of the closest point as the target node; or, in response to the mobile device having passed through the closest point, determining the closest point as the target node; Unlock the target node in the locked area and the locked area corresponding to the previous locked node.

5. The method according to claim 4, It is characterized in that The determining whether the mobile device has passed the nearest point includes: Determine the driving direction information of the mobile device by using the current position and posture of the mobile device; Determining whether the driving direction information satisfies a running posture condition; In response to the driving direction not satisfying the running posture condition, it is determined that the mobile device has not passed the nearest point.

6. The method according to claim 5, It is characterized in that The driving direction information includes: driving direction and / or relative position, wherein the driving direction indicates the direction difference of the moving direction of the mobile device relative to the preset edge of the path to be executed, and the relative position indicates the relative position of the nearest point relative to the mobile device; and / or, The operating posture condition includes any of the following: The driving direction is a first driving direction, and the relative position is a second relative position; The driving direction is the second driving direction, and the relative position is the first relative position; Among them, the first driving direction indicates that the moving direction of the mobile device is the same as the direction of the preset edge of the path to be executed, and the second driving direction indicates that the moving direction of the mobile device is different from the direction of the preset edge of the path to be executed; the first relative position indicates that the nearest point is at a first position of the mobile device, and the second relative position indicates that the nearest point is at a second position of the mobile device.

7. The method according to claim 5, It is characterized in that The driving direction information includes a driving direction; and determining the driving direction information of the mobile device by using the current position of the mobile device includes: Obtaining a starting position of the mobile device at a preset edge of the path to be executed; Using the starting position, determining the angle value of the preset side; Obtaining the driving direction using a first difference between the angle value of the preset edge and the angle from the closest point to the mobile device; And / or, the driving direction information includes a relative position; and determining the driving direction information of the mobile device by using the current position of the mobile device includes: Obtaining the azimuth angle between the current position of the mobile device and the end position of the preset edge; The relative position is obtained by using a second difference between the azimuth angle and the current angle of the mobile device.

8. The method according to claim 7, It is characterized in that After using the first difference between the angle value of the preset side and the first angle value, the method further includes: in response to the first difference not conforming to the first preset numerical range, numerically adjusting the first difference so that the adjusted first difference conforms to the first preset numerical range; The obtaining the driving direction by using a first difference between the angle value of the preset edge and the angle from the nearest point to the mobile device includes: in response to the adjusted first difference being within a direction interval, determining the driving direction to be a first driving direction; And / or, after obtaining the azimuth angle between the current position of the mobile device and the end position of the preset edge, the method further includes: in response to the azimuth angle not conforming to a second preset numerical range, numerically adjusting the azimuth angle to obtain an adjusted azimuth angle; The method of obtaining the relative position by utilizing the second difference between the azimuth angle and the current angle of the mobile device includes: in response to the second difference between the adjusted azimuth angle and the current angle of the mobile device being within a position interval, determining that the relative position is a first azimuth.

9. A computer device, It is characterized in that The invention comprises a memory and a processor coupled to each other, wherein the memory stores program data, and the processor is used to execute the program data to implement the steps of the method according to any one of claims 1 to 8.

10. A computer-readable storage medium, It is characterized in that Program data that can be executed by a processor are stored, and the program data is used to implement the steps of the method according to any one of claims 1 to 8.

Citation Information

Cited By

  • Path planning method, electronic equipment and storage medium

    CN120084351A

  • Path optimization method, electronic equipment and storage medium

    CN121067870A