Method and apparatus for collision-free motion planning of a manipulator
US-2020086486-A1 · Mar 19, 2020 · US
US12558787B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12558787-B2 |
| Application number | US-202519254134-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 30, 2025 |
| Priority date | Apr 11, 2023 |
| Publication date | Feb 24, 2026 |
| Grant date | Feb 24, 2026 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A robotic arm obstacle avoiding path planning method is provided. The method includes the following steps: step 1: simplifying the robotic arm model and obstacles, determining robotic arm joint points, and adopting virtual joint interpolation to interpolate connecting rods between adjacent joints; employing spherical bounding boxes at each joint point to envelop and replace the robotic arm model, enabling complete substitution for distance calculation when the robotic arm assumes any posture; step 2: adopting an eye-to-hand configuration to position the depth camera, acquiring in real time the point cloud information of the robotic arm and obstacles in the workspace, and using a robot real-time filtering package to filter out the point cloud information of the robotic arm itself.
Opening claim text (preview).
What is claimed is: 1 . A robotic arm obstacle avoiding path planning method, comprising the following steps: step 1: based on a robotic arm model and obstacles, determining robotic arm joint points, and adopting virtual joint interpolation to interpolate connecting rods between adjacent joints; and employing spherical bounding boxes at each joint point to envelop and replace the robotic arm model to facilitate distance calculation when a robotic arm assumes any posture; step 2: adopting an eye-to-hand configuration to position a depth camera, acquiring real-time point cloud information of the robotic arm and the obstacles in a workspace, using a robot real-time filtering package to filter out the real-time point cloud information of the robotic arm, and retaining only the real-time point cloud information of the obstacles; step 3: before moving the robotic arm, using a rapidly-exploring random tree connect (RRT-Connect) algorithm to perform path planning in a static environment where the robotic arm is located, and leveraging completeness of the RRT-Connect algorithm to obtain a feasible globally planned path; step 4: controlling the robotic arm to move along the feasible globally planned path, acquiring the real-time point cloud information of the obstacles in the workspace of the robotic arm, and calculating a distance between a point cloud of an obstacle and the robotic arm joint points in a coordinate system of the robotic arm to obtain a shortest distance; step 5: implementing obstacle avoiding through local path planning using an artificial potential field method, determining a distance and a position vector between a robotic arm end and a goal point in real time, and determining a magnitude of an attractive force exerted by the goal point on the robotic arm end based on the distance and the position vector between the robotic arm end and the goal point; wherein the goal point is a goal position where the robotic arm is controlled to reach; and a function formula for determining the distance and the position vector between the robotic arm end and the goal point in real time and determining the magnitude of the attractive force based on the distance and the position vector between the robotic arm end and the goal point is: F att = - ∇ ( U att ) = ξ ′ ρ ( q , q goal ) , wherein ρ (q, qgoal) is a Euclidean distance between the robotic arm end and the goal point; Uatt is an attractive potential field function, and U att = 1 2 ξ ′ ρ 2 ( q , q goal ) ; and ξ′ is a dynamic gain coefficient of the attractive force, expressed as ξ′=k*(e −ρ(q,q goal ) ), wherein the dynamic gain coefficient is inversely proportional to a distance between the robotic arm and the goal point, with a minimum gain coefficient at a starting point, thereby enabling adjustment of the magnitude of the attractive force to prevent an excessive attractive force that cause collisions between the robotic arm and the obstacles, and ensuring that the robotic arm obtains a safe and smooth path; determining the shortest distance between the robotic arm joint points and the point cloud of the obstacle in real time, wherein when the shortest distance is greater than a set safety distance, a repulsive force of the obstacles on the robotic arm is 0, and when the shortest distance is less than the set safety distance, a magnitude of the repulsive force is determined based on the robotic arm joint points and a nearest obstacle point, and a function formula of the magnitude of the repulsive force is: F repi = - ∇ ( U rep ) = { F rep 1 i + F rep 2 i , ρ i ( q , q obst ) ≤
Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of program data in numerical form (G05B19/418 takes precedence) · CPC title
Collision, planning for collision free path · CPC title
Model manipulator by spheres for collision avoidance · CPC title
Using potential fields · CPC title
Using rapidly exploring random trees algorithm RRT-algorithm · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.