Method for planning/controlling robot motion
First Claim
1. In a computer having at least one processor and a memory, a method for planning motion of a robot within free space, restricted by obstacles, from an initial position to a goal position, said method comprising:
- proposing, for a movement within a sequence of movements, a plurality of proposed movements to be made by said robot;
modeling at least a portion of said robot and said obstacles that restrict the free space;
determining whether a collision will occur between said robot and any of said obstacles for a proposed movement being executed as said movement within said sequence of movements;
generating a plan including said sequence of movements, by choosing, for each movement in said sequence of movements, a proposed movement that will not result in a collision and that will bring said robot closer to the goal position; and
estimating a cost to be associated with each proposed movement, whereby said generating comprises generating a plan including said sequence of movements, by choosing, for each movement in the sequence of movements, a proposed movement that will not result in a collision, that will bring said robot closer to the goal position, and that has a lowest estimated cost.
0 Assignments
0 Petitions
Accused Products
Abstract
A computerized method/system is provided for planning motion of a robot within a free space confined by obstacles, from an initial position to a goal position. In executing the method/system, a plan is generated so that the robot can hold and maneuver a workpiece throughout a sequence of bending operations to be performed by a bending apparatus. A plurality of proposed movements to be made by the robot are proposed for an mth movement within a sequence of movements, and at least a portion of the robot and the obstacles that confine the free space are modeled. A determination is made as to whether a collision will occur between the robot and an obstacle for each proposed movement, and a plan is generated including the sequence of movements by choosing for each movement in the sequence of movements, a proposed movement that will not result in a collision and that will bring the robot closer to the goal position. In choosing proposed movements, an estimated cost associated with each proposed movement may be taken into account. The estimated cost may be based upon a euclidian distance to the goal position from the position of the robot after the particular proposed movement is made as the mth movement, and/or the estimated cost may be determined as a function of the robot travel time from an (m-1)th movement to the mth movement. Different methods are provided for performing fine motion planning and gross motion planning.
-
Citations
16 Claims
-
1. In a computer having at least one processor and a memory, a method for planning motion of a robot within free space, restricted by obstacles, from an initial position to a goal position, said method comprising:
-
proposing, for a movement within a sequence of movements, a plurality of proposed movements to be made by said robot; modeling at least a portion of said robot and said obstacles that restrict the free space; determining whether a collision will occur between said robot and any of said obstacles for a proposed movement being executed as said movement within said sequence of movements; generating a plan including said sequence of movements, by choosing, for each movement in said sequence of movements, a proposed movement that will not result in a collision and that will bring said robot closer to the goal position; and estimating a cost to be associated with each proposed movement, whereby said generating comprises generating a plan including said sequence of movements, by choosing, for each movement in the sequence of movements, a proposed movement that will not result in a collision, that will bring said robot closer to the goal position, and that has a lowest estimated cost. - View Dependent Claims (2, 3)
-
-
4. In a computer having at least one processor and a memory, a method for planning motion of a robot within free space, restricted by obstacles, from an initial position to a goal position, said method comprising:
-
proposing, for a movement within a sequence of movements, a plurality of proposed movements to be made by said robot; modeling at least a portion of said robot and said obstacles that restrict the free space; determining whether a collision will occur between said robot and any of said obstacles for a proposed movement being executed as said movement within said sequence of movements; generating a plan including said sequence of movements, by choosing, for each movement in said sequence of movements, a proposed movement that will not result in a collision and that will bring said robot closer to the goal position; and specifying, before proposing a plurality of proposed movements, a plurality of movements in configuration space for said movement in said sequence of movements, and identifying which ones of the specified plurality of movements are feasible by performing collision checking, said proposing comprising proposing movements from among the movements identified as feasible, and said specified plurality of movements for said movement in said sequence of movements comprising movements in a plurality of intelligent movement directions. - View Dependent Claims (5, 6, 7, 8)
-
-
9. A system for planning motion of a robot within a free space restricted by obstacles, from an initial position to a goal position, said system comprising:
-
a proposing module that proposes, for a movement within a sequence of movements, a plurality of proposed movements to be made by said robot; a modeling module that models at least a portion of said robot and said obstacles that restrict the free space; a determining module that determines whether a collision will occur between said robot and any of said obstacles for a proposed movement being executed as said movement within said sequence of movements; a generating module that generates a plan including said sequence of movements, by choosing, for each movement within said sequence of movements, a proposed movement that will not result in the collision that will bring said robot closer to the goal position; and an estimating module that estimates a cost to be associated with each proposed movement, whereby said generating module comprises means for generating a plan including said sequence of movements, by choosing, for each movement in said sequence of movements, a proposed movement that will not result in a collision, that will bring the robot closer to the goal position, and that has a lowest estimated cost. - View Dependent Claims (10, 11)
-
-
12. A system for planning motion of a robot within a free space restricted by obstacles, from an initial position to a goal position, said system comprising:
-
a proposing module that proposes for a movement within a sequence of movements, a plurality of proposed movements to be made by said robot; a modeling module that models at least a portion of said robot and said obstacles that restrict the free space; a determining module that determines whether a collision will occur between said robot and any of said obstacles for a proposed movement being executed as said movement within said sequence of movements; a generating module that generates a plan including said sequence of movements, by choosing, for each movement within said sequence of movements, a proposed movement that will not result in the collision that will bring said robot closer to the goal position; and a specifying module for specifying a plurality of movements in configuration space for said movement in said sequence of movements, said specifying module including identifying means for identifying which ones of the specified plurality of movements are feasible by performing collision checking, said proposing module comprising means for proposing movements from among the movements identified by said identifying means as feasible, and said specified plurality of movements for said movement in said sequence of movements comprising movements in a plurality of intelligent movement directions. - View Dependent Claims (13, 14, 15, 16)
-
Specification