IP Library Granted Patent US 12,440,983
Granted Patent B1
US 12,440,983 · App. 18/429,763 · Granted Oct 14, 2025

Learning-embedded motion planning

Inventors: Yongxiang Fan (Palo Alto, CA); Te Tang (Fremont, CA); Yiyang Zhou (Hayward, CA)
Assignee: Anyware Robotics Inc.
B25J9/1664B25J9/161B25J9/162B25J9/163B25J9/1671B25J19/023
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,440,983
App. No.
18/429,763
Granted
Oct 14, 2025
Kind
B1
Abstract

Method of sequential handling of a plurality of freight units by an end effector of a robotic system comprises training a neural network operable to bias a plurality of samples of a configuration space of the end effector. Deployment of the trained neural network involves sensing an arrangement of freight units in a scene based on an image of the scene from a sensor. A freight unit is chosen based on the at least one trained neural network. A starting pose of the robotic end effector as a means to pick the chosen freight unit is chosen; and a goal pose of the robotic end effector is chosen as a means to place the chosen freight unit. A motion of the robotic end effector is planned from the starting pose to the goal pose based on a biased plurality of samples. Then motion on the end effector is controlled based on the planning.

Claims (42)

1. A method of sequential handling of a plurality of freight units by an end effector of a robotic system, the method comprising:

training, by a programmed computer system, at least one neural network operable to bias a plurality of samples of a configuration space of the end effector; and

after training of the at least one neural network, deploying the neural network, wherein deploying the at least one neural network comprises:

sensing, by a computer system of the robotic system, an arrangement of freight units in a scene based on an image of the scene from a sensor;

choosing, by the computer system of the robotic system, a freight unit based on the at least one trained neural network;

choosing, by the computer system of the robotic system, a starting pose of the robotic end effector as a means to pick the chosen freight unit;

choosing, by the computer system of the robotic system, a goal pose of the robotic end effector as a means to place the chosen freight unit;

planning, by the computer system of the robotic system, a motion of the robotic end effector from the starting pose to the goal pose based on a biased plurality of samples; and

controlling, by the computer system of the robotic system, the motion on the end effector based on the planning.

2. The method of claim 1 , wherein the end effector comprises a robotic arm and the robotic system further comprises a mobile base.

3. The method of claim 1 , wherein the sensor of the robotic system comprises a camera.

4. The method of claim 1 , wherein the neural network comprises a feed-forward neural network.

5. The method of claim 1 , wherein the neural network comprises a 3D convolutional neural network.

6. The method of claim 1 , wherein the training of the neural network comprises:

simulating a random arrangement of freight units;

choosing a random freight unit to handle;

generating a plurality of samples of a configuration space of the robotic end effector;

measuring a stability of the random arrangement of freight units; and assigning a bias to each of the plurality of samples of a configuration space of the robotic end effector to minimize a cycle time of a path through the samples.

7. The method of claim 6 , further comprising assigning, by the programmed computer system, a bias to each of the plurality of samples of a configuration space of the end effector to maximize a smoothness of a path through the samples.

8. The method of claim 6 , wherein the path is selected from a random tree of the samples.

9. A system of sequential handling of a plurality of freight units by an end effector of a robotic system, the system comprising:

a first computer system for training a neural network operable to bias a plurality of samples of a configuration space of the end effector; and

the robotic system comprising a sensor, a robot computer system, and the end effector, wherein:

the sensor is for capturing an image of freight units in a scene; and

the robot computer system is configured to:

sense an arrangement of the freight units in the scene based on the image;

choose a freight unit based on the trained neural network;

choose a starting pose of the robotic end effector as a means to pick the chosen freight unit;

choose a goal pose of the robotic end effector as a means to place the chosen freight unit;

plan a motion of the end effector from the starting pose to the goal pose; and

control the motion on the robotic end effector based on the planning.

10. The system of claim 9 , wherein the end effector comprises a robotic arm.

11. The system of claim 9 , wherein the sensor of the robotic system comprises a camera.

12. The system of claim 9 , wherein the neural network comprises a feed-forward neural network.

13. The system of claim 9 , wherein the neural network comprises a 3D convolutional neural network.

14. The system of claim 9 , wherein the first computer system is for training the neural network by:

simulating a random arrangement of freight units;

choosing a random freight unit to handle;

generating a plurality of samples of a configuration space of the robotic end effector; and

measuring a stability of the random arrangement of freight units; and assigning a bias to each of the plurality of samples of a configuration space of the robotic end effector to minimize a cycle time of a path through the samples.

15. The system of claim 14 , wherein the first computer system is further configured to assign a bias to each of the plurality of samples of a configuration space of the end effector to maximize a smoothness of a path through the samples.

16. The system of claim 14 , wherein the path is selected from a random tree of the samples.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 16, 2024
From: FAN, YONGXIANG; TANG, TE; ZHOU, YIYANG
To: ANYWARE ROBOTICS INC.
Reel/Frame 066482/0496 →
Continuity (1)
Provisional Application 62430042 · Dec 4, 2022
References Cited (81)
US 7801644B2 · Bruemmer · 2010 [cited by examiner]
US 8244402B2 · Wells · 2012 [cited by examiner]
US 8272278B2 · Loeb · 2012 [cited by examiner]
US 8410441B2 · Stratmann · 2013 [cited by examiner]
US 8447863B1 · Francis, Jr. · 2013 [cited by examiner]
US 8452451B1 · Francis, Jr. · 2013 [cited by examiner]
US 8639644B1 · Hickman · 2014 [cited by examiner]
US 8941726B2 · Marks · 2015 [cited by examiner]
US 9095978B2 · Shi · 2015 [cited by examiner]
US 9616568B1 · Russell · 2017 [cited by examiner]
US 9875427B2 · Medasani · 2018 [cited by examiner]
US 9914213B2 · Vijayanarasimhan · 2018 [cited by examiner]
US 10207402B2 · Levine · 2019 [cited by examiner]
US 10354139B1 · Li · 2019 [cited by examiner]
US 10507583B2 · Wang · 2019 [cited by examiner]
US 10682774B2 · Bingham · 2020 [cited by examiner]
US 10792809B2 · Bingham · 2020 [cited by examiner]
US 10853646B1 · Li · 2020 [cited by examiner]
US 10926952B1 · Shi · 2021 [cited by examiner]
US 11195024B1 · Fan · 2021 [cited by examiner]
US 11240441B2 · Naruse · 2022 [cited by examiner]
US 11338435B2 · Ishikawa · 2022 [cited by examiner]
US 11625422B2 · Sizemore · 2023 [cited by examiner]
US 11651497B2 · Cherian · 2023 [cited by examiner]
US 11787059B2 · Toris · 2023 [cited by examiner]
US 11813758B2 · Chavez · 2023 [cited by examiner]
US 11833661B2 · Xu · 2023 [cited by examiner]
US 11911919B2 · Moreira Rodrigues · 2024 [cited by examiner]
US 11919161B2 · Fan · 2024 [cited by examiner]
US 11986955B2 · Agarwal · 2024 [cited by examiner]
US 12030191B2 · Shao · 2024 [cited by examiner]
US 12039742B2 · Lin · 2024 [cited by examiner]
US 12240713B2 · Moreno · 2025 [cited by examiner]
US 12358147B2 · Homberg · 2025 [cited by examiner]
US 20080133058A1 · Ohno · 2008 [cited by examiner]
US 20110071675A1 · Wells · 2011 [cited by examiner]
US 20110141251A1 · Marks · 2011 [cited by examiner]
US 20130006423A1 · Ito · 2013 [cited by examiner]
US 20130166061A1 · Yamamoto · 2013 [cited by examiner]
US 20130184860A1 · Ota · 2013 [cited by examiner]
US 20140163731A1 · Shi · 2014 [cited by examiner]
US 20140277742A1 · Wells · 2014 [cited by examiner]
US 20150002391A1 · Chen · 2015 [cited by examiner]
US 20150003678A1 · Watanabe · 2015 [cited by examiner]
US 20150273688A1 · Harada · 2015 [cited by examiner]
US 20190287063A1 · Skaaksrud · 2019 [cited by examiner]
US 20190291277A1 · Oleynik · 2019 [cited by examiner]
US 20200225673A1 · Ebrahimi Afrouzi · 2020 [cited by examiner]
US 20200316782A1 · Chavez · 2020 [cited by examiner]
US 20200376678A1 · Yano · 2020 [cited by examiner]
US 20210031368A1 · Drumwright · 2021 [cited by examiner]
US 20210053407A1 · Smith · 2021 [cited by examiner]
US 20210089040A1 · Ebrahimi Afrouzi · 2021 [cited by examiner]
US 20210129971A1 · Brown, Jr. · 2021 [cited by examiner]
US 20220134546A1 · Xu · 2022 [cited by examiner]
US 20220288783A1 · Sundermeyer · 2022 [cited by examiner]
US 20220291666A1 · Cella · 2022 [cited by examiner]
US 20220297958A1 · Moreno · 2022 [cited by examiner]
US 20230080545A1 · Cella · 2023 [cited by examiner]
US 20230098602A1 · Cella · 2023 [cited by examiner]
US 20230102048A1 · Cella · 2023 [cited by examiner]
US 20230124599A1 · Fan · 2023 [cited by examiner]
US 20230176557A1 · Cella · 2023 [cited by examiner]
US 20230222454A1 · Cella · 2023 [cited by examiner]
US 20230234233A1 · Goyal · 2023 [cited by examiner]
US 20240066711A1 · D'Amelio · 2024 [cited by examiner]
US 20240091951A1 · Chavan Dafle · 2024 [cited by examiner]
US 20240149460A1 · Matl · 2024 [cited by examiner]
US 20240157561A1 · D'Amelio · 2024 [cited by examiner]
US 20240157566A1 · Yu · 2024 [cited by examiner]
US 20240308082A1 · Konar · 2024 [cited by examiner]
Elbanhawi, “Sampling-Based Robot Motion Planning: A Review”, IEEE, Feb. 4, 2014, vol. 2, pp. 56-77. [cited by applicant]
Ichnowski et al., “GOMP: Grasp-Optimized Motion Planning for Bin Picking”, 2020 IEEE International Conference on Robotics and Automation (ICRA), 2020, pp. 5270-5277. [cited by applicant]
Ichnowski et al., “Deep learning can accelerate grasp-optimized motion planning”, Science Robotics, Nov. 18, 2020, vol. 5, pp. 1-12. [cited by applicant]
Ichter et al., “Learning Sampling Distributions for Robot Motion Planning”, 2018 IEEE International Conference on Robotics and Automation (ICRA), 2018, pp. 70870-7094. [cited by applicant]
Ichter et al., “Robot Motion Planning in Learned Latent Spaces”, IEEE Robotics and Automation Letters, Jul. 2019, vol. 4, No. 3, pp. 2407-2414. [cited by applicant]
Thakar et al., “Manipulator Motion Planning for Part Pickup and Transport Operations From a Moving Base”, IEEE Transactions on Automation Science and Engineering, Jan. 2022, vol. 19, No. 1, pp. 191-206. [cited by applicant]
Thakar et al., “Towards Time-Optimal Trajectory Planning for Pick-and-Transport Operation with a Mobile Manipulator”, 2018 IEEE 14th International Conference on Automation Science and Engineering (CASE), 2018, pp. 981-9… [cited by applicant]
Xiao et al., “Motion Planning and Control for Mobile Robot Navigation Using Machine Learning: a Survey”, Feb. 26, 2022, pp. 1-32. [cited by applicant]
Zhou et al., “A review ofmotion planning algorithms for intelligent robots”, Journal of Intelligent Manufacturing, 2022, vol. 33, pp. 387-424. [cited by applicant]
Zimmermann et al., “A multi-level optimization framework for simultaneous grasping and motion planning”, pp. 1-7. [cited by applicant]