IP Library Granted Patent US 12,325,136
Granted Patent B2
US 12,325,136 · App. 17/990,037 · Granted Jun 10, 2025

Deterministic robot path planning method for obstacle avoidance

Inventors: Yuanfeng Mao (Mt Laurel, NJ); Guo-Qing Wei (Plainsboro, NJ); Firdous Saleheen (Lawrenceville, NJ); Li Fan (Belle Mead, NJ); Xiaolan Zeng (Princeton, NJ); Jianzhong Qian (Princeton Junction, NJ)
Assignee: EDDA TECHNOLOGY, INC.
B25J9/1666B25J9/163B25J9/1671G05B2219/40371G05B2219/40476
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,325,136
App. No.
17/990,037
Granted
Jun 10, 2025
Kind
B2
Abstract

The present teaching relates to a method and system for path planning. A target is tracked via one or more sensors. Information of a desired pose of an end-effector with respect to the target and a current pose of the end-effector is obtained. Also, a minimum distance permitted between an arm including the end-effector and each of at least one obstacle identified between the current pose of the end-effector and the target is obtained. A weighting factor previously learned is retrieved and a cost based on a cost function is computed in accordance with a weighted smallest distance between the arm including the end-effector and the at least one obstacle, wherein the smallest distance is weighted by the weighting factor. A trajectory is computed from the current pose to the desired pose by minimizing the cost function.

Claims (62)

1. A method, comprising:

obtaining, via at least one sensor, a current pose of a multi-joint robotic arm;

calculating, via at least one processor, a minimum distance permitted between the multi-joint robotic arm and at least one obstacle identified between the current pose and a target;

calculating, via the at least one processor, a weighting factor, the weighting factor defining a relationship between a joint angle cost of joints within the multi-joint robotic arm and an obstacle-distance cost,

wherein the weighting factor is iteratively learned over a predetermined number of iterations by minimizing a cost function over a plurality of iterations using, for each iteration, a random desired position of an end-effector of the multi-joint robotic arm;

computing, via the at least one processor, a trajectory from the current pose to the target by minimizing the cost function using the weighting factor; and

initiating, via the at least one processor, movement of the multi-joint robotic arm along the trajectory.

2. The method of claim 1 , further comprising:

during the movement of the multi-joint robotic arm, detecting that the target is in motion; and

recalculating, via the at least one processor, the trajectory from the current pose to a new goal position.

3. The method of claim 1 , wherein the obtaining of the current pose of the multi-joint robotic arm via the at least one sensor is performed by at least one of camera-based vision tracking, optical sensor-based tracking, and magnetic sensor-based tracking.

4. The method of claim 1 , further comprising:

calculating, via the at least one processor based upon the trajectory, an actual minimum distance of the multi-joint robotic arm with respect to the target;

computing, via the at least one processor, an error corresponding to a difference between the actual minimum distance and the minimum distance; and

updating, via the at least one processor, the weighting factor based upon the error.

5. The method of claim 1 , wherein the minimum distance permitted between the multi-joint robotic arm and the at least one obstacle is determined based on a type of the at least one obstacle.

6. The method of claim 5 , wherein the type comprises at least one of a surgeon, a body part of a patient, and a medical device.

7. The method of claim 1 , further comprising, for each iteration in the predetermined number of iterations:

selecting an initial value of the weighting factor; and

minimizing the cost function based on the initial value.

8. A system comprising:

at least one sensor;

a multi-joint robotic arm;

at least one processor; and

a non-transitory computer-readable storage medium having instructions stored which, when executed by the at least one processor, cause the at least one processor to perform operations comprising:

obtaining, from the at least one sensor, a current pose of the multi-joint robotic arm;

calculating a minimum distance permitted between the multi-joint robotic arm and at least one obstacle identified between the current pose and a target;

calculating a weighting factor, the weighting factor defining a relationship between a joint angle cost of joints within the multi-joint robotic arm and an obstacle-distance cost,

wherein the weighting factor is iteratively learned over a predetermined number of iterations by minimizing a cost function over a plurality of iterations using, for each iteration, a random desired position of an end-effector of the multi-joint robotic arm;

computing a trajectory from the current pose to the target by minimizing the cost function using the weighting factor; and

initiating movement of the multi-joint robotic arm along the trajectory.

9. The system of claim 8 , the non-transitory computer-readable storage medium having additional instructions stored which, when executed by the at least one processor, cause the at least one processor to perform operations comprising:

during the movement of the multi-joint robotic arm, detecting, via the at least one sensor, that the target is in motion; and

recalculating the trajectory from the current pose to a new goal position.

10. The system of claim 8 , wherein the obtaining of the current pose of the multi-joint robotic arm via the at least one sensor is performed by at least one of camera-based vision tracking, optical sensor-based tracking, and magnetic sensor-based tracking.

11. The system of claim 8 , the non-transitory computer-readable storage medium having additional instructions stored which, when executed by the at least one processor, cause the at least one processor to perform operations comprising:

calculating, based upon the trajectory, an actual minimum distance of the multi-joint robotic arm with respect to the target;

computing an error corresponding to a difference between the actual minimum distance and the minimum distance; and

updating the weighting factor based upon the error.

12. The system of claim 8 , wherein the minimum distance permitted between the multi-joint robotic arm and the at least one obstacle is determined based on a type of the at least one obstacle.

13. The system of claim 12 , wherein the type comprises at least one of a surgeon, a body part of a patient, and a medical device.

14. The system of claim 8 , the non-transitory computer-readable storage medium having additional instructions stored which, when executed by the at least one processor, cause the at least one processor to perform operations comprising:

for each iteration in the predetermined number of iterations:

selecting an initial value of the weighting factor; and

minimizing the cost function based on the initial value.

15. A non-transitory computer-readable storage medium having instructions stored which, when executed by at least one processor, cause the at least one processor to perform operations comprising:

obtaining, from at least one sensor, a current pose of a multi-joint robotic arm;

calculating a minimum distance permitted between the multi-joint robotic arm and at least one obstacle identified between the current pose and a target;

calculating a weighting factor, the weighting factor defining a relationship between a joint angle cost of joints within the multi-joint robotic arm and an obstacle-distance cost,

wherein the weighting factor is iteratively learned over a predetermined number of iterations by minimizing a cost function over a plurality of iterations using, for each iteration, a random desired position of an end-effector of the multi-joint robotic arm;

computing a trajectory from the current pose to the target by minimizing the cost function using the weighting factor; and

initiating movement of the multi-joint robotic arm along the trajectory.

16. The non-transitory computer-readable storage medium of claim 15 , having additional instructions stored which, when executed by the at least one processor, cause the at least one processor to perform operations comprising:

during the movement of the multi-joint robotic arm, detecting, via the at least one sensor, that the target is in motion; and

recalculating the trajectory from the current pose to a new goal position.

17. The non-transitory computer-readable storage medium of claim 15 , wherein the obtaining of the current pose of the multi-joint robotic arm via the at least one sensor is performed by at least one of camera-based vision tracking, optical sensor-based tracking, and magnetic sensor-based tracking.

18. The non-transitory computer-readable storage medium of claim 15 , having additional instructions stored which, when executed by the at least one processor, cause the at least one processor to perform operations comprising:

calculating, based upon the trajectory, an actual minimum distance of the multi-joint robotic arm with respect to the target;

computing an error corresponding to a difference between the actual minimum distance and the minimum distance; and

updating the weighting factor based upon the error.

19. The non-transitory computer-readable storage medium of claim 15 , wherein the minimum distance permitted between the multi-joint robotic arm and the at least one obstacle is determined based on a type of the at least one obstacle.

20. The non-transitory computer-readable storage medium of claim 19 , wherein the type comprises at least one of a surgeon, a body part of a patient, and a medical device.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 18, 2022
From: MAO, YUANFENG; WEI, GUO-QING; SALEHEEN, FIRDOUS; FAN, LI; ZENG, XIAOLAN; QIAN, JIANZHONG
To: EDDA TECHNOLOGY, INC.
Reel/Frame 061824/0043 →
Continuity (2)
Continuation 16692246 · Nov 22, 2019
Related Publication 20230077638A1 · Mar 16, 2023
References Cited (21)
US 20080012589A1 · Wang · 2008 [cited by applicant]
US 20130032502A1 · Anderson et al. · 2013 [cited by applicant]
US 20140003968A1 · Gros-D'Aillon et al. · 2014 [cited by applicant]
US 20150088310A1 · Pinter et al. · 2015 [cited by applicant]
US 20160022187A1 · Pushpala et al. · 2016 [cited by applicant]
US 20200376663A1 · Voelz · 2020 [cited by examiner]
US 20210138656A1 · Gothoskar et al. · 2021 [cited by applicant]
CN 107953334A · 2018 [cited by applicant]
CN 108227738A · 2018 [cited by applicant]
CN 108705532A · 2018 [cited by applicant]
CN 106527151B · 2019 [cited by applicant]
CN 110465928A · 2019 [cited by applicant]
WO 2016119829A1 · 2016 [cited by applicant]
WO 2019115471A1 · 2019 [cited by applicant]
Supplementary European Search Report issued Jul. 13, 2023 in EP Application No. 19953077.5. [cited by applicant]
Jasour et al., “Obstacle Avoidance and Grasping Moving Objects in Non-Stationary Environments for Redundant Robot Manipulators Using NMPC”, Proceedings of ICEE 2009, May 12-14, 2009, pp. 308-313, vol. 7, Iran University… [cited by applicant]
First Office Action issued Feb. 3, 2024 in Chinese Patent Application No. 202011313901.8. [cited by applicant]
Lavalle et al., “Randomized Kinodynamic Planning,” The International Journal of Robotics Research, May 1, 2001, vol. 20, Issue 5, pp. 378-400. [cited by applicant]
Hart et al., “A formal basis for the heuristic determination of minimum cost paths,” IEEE transactions on Systems Science and Cybernetics, vol. SSC-4, No. 2, Jul. 1968. [cited by applicant]
International Search Report and Written Opinion mailed Feb. 4, 2020 in International Application PCT/US2019/062766. [cited by applicant]
Mainprice et al., “Goal Set Inverse Optimal Control and Iterative Re-planning for Predicting Human Reaching Motion in Shared Workspaces”, Jun. 7, 2016. [cited by applicant]
Cited By (1)
US 12,594,670