A collision-free trajectory planning method for multi-agents
A trajectory planning, multi-agent technology, applied in program control manipulators, data processing applications, forecasting, etc., to solve problems such as collisions
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0035] A multi-agent collision-free trajectory planning method 100, such as figure 1 shown, including:
[0036] Step 110, respectively establish a projection model on the moving plane of the agent for each agent and each obstacle, the model is a circular surface under a safe radius, and the safe radius makes the projection of the agent or obstacle on the surface inside the circle;
[0037] Step 120. Based on the external penalty function method, convert the no-collision constraint condition into a collision penalty item and incorporate it into the continuous monitoring objective function. The no-collision constraint condition includes that any two circles representing the agent do not intersect and any two respectively represent the agent Does not intersect with the circular face of the obstacle;
[0038] Step 130, aiming at minimizing the objective function, using optimal control theory and gradient descent method to obtain the collision-free trajectory of each agent.
[0...
Embodiment 2
[0067] A storage medium, in which instructions are stored, and when a computer reads the instructions, the computer is made to execute any one of the above multi-agent collision-free trajectory planning methods.
[0068] The relevant technical solutions are the same as those in Embodiment 1, and will not be repeated here.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


