Motion planning device, motion planning method, and program
By treating the movable areas of robots and conveyed objects as the same and using soft constraints, the system efficiently calculates collision-avoidant motion plans for robots, addressing the computational challenges of multiple object collision avoidance.
Patent Information
- Application Number
- JP2023508264
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2021-03-24
- Publication Date
- 2024-11-13
- Estimated Expiration
- 2041-03-24
AI Technical Summary
Existing motion planning systems for robots face exponential calculation increases when considering collision avoidance for multiple objects, making practical implementation difficult due to the rise in binary variables and constraints related to collision avoidance.
The system reduces the number of binary variables and constraints by treating the movable areas of the robot and conveyed object as the same during conveyance, and introduces soft constraints on movement paths to minimize collision avoidance calculations.
This approach allows for efficient calculation of pick-and-place motion plans that consider collision avoidance, reducing computational time and complexity.
Smart Images

Figure 0007582448000047 
Figure 0007582448000048 
Figure 0007582448000049
Abstract
Description
[Technical field]
[0001] The present disclosure relates to a motion planning device, a motion planning method, and a storage medium that calculate a motion plan for a robot. [Background technology]
[0002] There are factories and warehouses where robots are used to automate the pick-and-place of objects such as products and parts (hereinafter referred to as transported objects). Pick-and-place is a series of actions that involves picking up an object from a designated location, transporting it, and placing it in another designated location.
[0003] The system disclosed in Non-Patent Document 1 calculates a motion plan in which each of the two arms of a dual-arm robot simultaneously performs pick-and-place on multiple transport objects. More specifically, the system disclosed in Non-Patent Document 1 has an optimization model in which the dynamics of the robot and the transport object, and the logic for determining whether pick-and-place has been completed for each transport object are formulated as a mixed integer linear programming problem, and a solution obtained by performing a solution-finding calculation on the optimization model is output as a motion plan.
[0004] The system disclosed in Non-Patent Document 2 calculates a route plan for a mobile robot such as an Unmanned Aerial Vehicle (UAV) to move to a destination while avoiding obstacles. More specifically, the system disclosed in Non-Patent Document 2 has an optimization model formulated as a mixed integer linear programming problem, including a constraint condition for selecting, as a movement route, a route in which the mobile robot will not collide with an obstacle from a group of areas around the obstacle, and outputs a solution obtained by performing a solution-finding calculation on the optimization model as a route plan. [Prior art documents] [Non-patent literature]
[0005] [Non-Patent Document 1] M. Katayama, et al, “Fast LTL-Based Flexible Planning for Dual-Arm Manipulation”, IEEE / RS International Conference on Intelligent Robots and Systems, pp.6605-6612, 2020. [Non-Patent Document 2] M. Arantes, et al, “Collision-Free Encoding for Chance-Constrained Nonconvex Path Planning”, IEEE Transactions on Robotics, vol.35,No.2, April, 2019. Summary of the Invention [Problem to be solved by the invention]
[0006] If a pick-and-place motion plan that takes collision avoidance into consideration is calculated based on Non-Patent Document 1 and Non-Patent Document 2, the amount of calculations increases explosively as the number of transported objects increases, making it difficult to put into practical use.
[0007] One object of the present invention is to provide a motion planning device, a motion planning method, and a storage medium that can preferably calculate a pick-and-place motion plan that takes collision avoidance into consideration, in order to solve the above-mentioned problem. [Means for solving the problem]
[0008] One aspect of the motion planning device is a condition setting means for setting a first condition that a robot that performs pick-and-place for one or more transported objects and the transported objects are located within a movable area that is an area where the robot will not collide with a collision-avoidable object, and a second condition that, when the robot is gripping and transporting the transported object, the movable area of the robot around the collision-avoidable object coincides with the movable area of the transported object around the collision-avoidable object being transported; a motion planning means for calculating a motion plan for the robot based on the first condition and the second condition; death the first condition includes a third condition that the transported object is located within the movable area around the collision-avoided object; When the motion planning means calculates the motion plan, if the object to be conveyed is not being conveyed by the robot, the motion planning means skips evaluation of the third condition. It is a motion planning device.
[0009] One aspect of the motion planning method includes: The computer a first condition is set such that the robot that performs pick-and-place for one or more transported objects and the transported objects are located within a movable area that is an area where the robot will not collide with a collision-avoidable object, and a second condition is set such that when the robot grasps and transports the transported object, the movable area of the robot around the collision-avoidable object coincides with the movable area of the transported object around the collision-avoidable object being transported; A motion plan for the robot is calculated based on the first condition and the second condition. death , the first condition includes a third condition that the transported object is located within the movable area around the collision-avoided object; When calculating the motion plan, if the object is not being transported by the robot, the evaluation of the third condition is skipped. The present invention relates to a motion planning method.
[0010] One aspect of the program is a first condition is set such that the robot that performs pick-and-place for one or more transported objects and the transported objects are located within a movable area that is an area where the robot will not collide with a collision-avoidable object, and a second condition is set such that when the robot grasps and transports the transported object, the movable area of the robot around the collision-avoidable object coincides with the movable area of the transported object around the collision-avoidable object being transported; A motion plan for the robot is calculated based on the first condition and the second condition. death, the first condition includes a third condition that the transported object is located within the movable area around the collision-avoided object; When calculating the motion plan, if the object is not being transported by the robot, the evaluation of the third condition is skipped. It is a program that causes a computer to execute the process. Effect of the Invention
[0011] It is possible to suitably calculate a pick-and-place operation plan that takes collision avoidance into consideration. [Brief description of the drawings]
[0012] [Figure 1] 1 is a schematic block diagram showing a first configuration example of a robot control system and a motion planning device according to a first embodiment. [Diagram 2] FIG. 4 is a schematic block diagram showing a second configuration example of the robot control system and the motion planning device according to the first embodiment. [Diagram 3] FIG. 4 is a schematic block diagram showing a third configuration example of the robot control system and the motion planning device according to the first embodiment. [Figure 4] 2 illustrates an example of a hardware configuration of the motion planning device according to the first embodiment. [Diagram 5] 1 is an example of a hardware configuration of a robot control system according to a first embodiment. [Figure 6] 1A is an xy plan view showing a movable area around an obstacle, FIG. 1B is a first example of a movable area, and FIG. 1C is a second example of a movable area. FIG. 1B is a diagram showing a movable area around a collision-avoided object according to a first embodiment. [Figure 7] (A) A first diagram showing the change in the movable area when the end effector moves around an obstacle, (B) A second diagram showing the change in the movable area when the end effector moves around an obstacle, and (C) A third diagram showing the change in the movable area when the end effector moves around an obstacle. [Figure 8] 1A and 1B are xz plan views of the vicinity of an obstacle when the end effector is transporting an object, respectively; [Figure 9] 4 is a flowchart showing an example of a processing step of an operation plan according to the first embodiment. [Figure 10]13A is an xz plan view showing an example of a movable area subject to soft path constraints according to the second embodiment, and FIG. 13B is an xy plan view showing an example of a movable area subject to soft path constraints according to the second embodiment. [Figure 11] 13 is a flowchart showing an example of a processing step of an operation plan according to the second embodiment. [Figure 12] FIG. 13 shows a schematic configuration diagram of a motion planning device according to a third embodiment. [Figure 13] 13 is a flowchart showing an example of a processing step of an operation plan according to the third embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0013] <Description of assignment> The inventors of the present application have discovered a problem that if a pick-and-place motion plan that takes collision avoidance into consideration is calculated based on Non-Patent Document 1 and Non-Patent Document 2, the amount of calculations increases explosively as the number of transported objects increases, making it impossible to put the plan into practical use.
[0014] More specifically, this problem is that the number of binary variables and constraint conditions by the big-M method, which make it difficult to calculate the motion plan by solving a mixed integer linear programming problem, increases with the number of transported objects. In a general mixed integer linear programming problem, the binary variables are decision variables used to model judgments and logic. In a general mixed integer linear programming problem, the big-M method is a constraint formulation technique used when converting continuous values into binary values. In particular, the binary variables and the big-M method are used to associate the position coordinates (continuous values) of a moving object with a judgment (binary value) of whether or not the moving object is in a region where it will not collide with an obstacle in order to avoid collision with an obstacle. In other words, the binary variables and constraint conditions by the big-M method are indispensable in avoiding collision with an obstacle, and the binary variables and constraint conditions by the big-M method are necessary for avoiding collisions of a transported object with an obstacle.
[0015] More specifically, this problem is that since an object not held by a robot needs to be handled so as not to collide with not only obstacles and the end effector but also other objects, as the number of objects increases, the number of binary variables related to collision avoidance and the number of constraints using the big-M method increase exponentially. As a result, the inventors have found the problem that "as the number of objects increases, an explosion in calculation time occurs in solving the motion plan."
[0016] The inventor has found such a problem and derived a means for solving the problem. The inventor has found that by making the movable area of the end effector that transports the transported object the same as that of the transported object when the transported object is transported by the end effector, the number of binary variables related to collision avoidance can be reduced, and as a result, calculation of a pick-and-place motion plan that takes into account collision avoidance with high time efficiency can be realized. Here, "high time efficiency" means that a motion plan is calculated in a shorter time for the same quality. Furthermore, the inventor has found that by adding a soft constraint on the movement path of the transported object by utilizing the characteristics of the movement path in the pick-and-place, the number of constraint conditions by the big-M method related to collision avoidance can be substantially reduced, and as a result, calculation of a pick-and-place motion plan that takes into account collision avoidance with high time efficiency can be realized.
[0017] Hereinafter, an embodiment of a motion planning device, a motion planning method, and a storage medium will be described with reference to the drawings. Note that the following embodiments do not limit the scope of the invention. Also, not all of the combinations of features described in the embodiments are necessarily essential to the solution of the invention.
[0018] First Embodiment An example of a configuration of a robot control system 1 including a motion planning device 10 of the first embodiment will be described in detail with reference to Fig. 1. Fig. 1 is a schematic block diagram showing a first configuration example of the robot control system 1 in the first embodiment.
[0019] The robot control system 1 broadly includes a motion planning device 10, a control device 20, a setting storage device 30, a measuring device 40, and a robot 50. The motion planning device 10 includes a motion planning unit 100. The control device 20 includes a control unit 200. The setting storage device 30 includes a setting storage unit 300.
[0020] The motion planning device 10 is communicatively connected to the control device 20, the setting storage device 30, and the measuring device 40 via communication lines. Furthermore, the control device 20 is communicatively connected to the setting storage device 30, the measuring device 40, and the robot 50 via communication lines. Examples of the communication lines include a dedicated line, the Internet, a VPN (Virtual Private Network), a LAN (Local Area Network), a USB (Universal Serial Bus), Wi-Fi (registered trademark), and Bluetooth (registered trademark). Note that the communication lines may be configured in any form, regardless of the form of the communication lines, such as the occupied form of the communication lines and the physical form of the communication lines, such as a wired line or a wireless line.
[0021] The motion planning device 10 calculates motion planning information for realizing a desired pick and place. More specifically, the motion planning unit 100 reads the plan setting information from the setting storage unit 300, reads the measurement information from the measurement device 40, and calculates the motion planning information using these read information. The motion planning unit 100 transmits the calculated motion planning information to the control unit 200. The motion planning information is composed of trajectory information indicating where the representative point of the robot 50 is located at what time, and operation information indicating which operation the robot 50 performs at what time. Here, the operation of the robot 50 is specifically a pick operation or a place operation of a transported object, and is not only a simple moving operation but also an operation of the robot 50 including the control of the end effector. The calculation method of the motion planning information, the trajectory information, the operation information, the plan setting information, and the measurement information will be described in detail later. The motion planning device 10 is realized by a computer such as a personal computer or a workstation.
[0022] The control device 20 calculates control command information for controlling the robot 50 to realize the operation plan calculated by the operation plan unit 100, and transmits the calculated control command information to the robot 50. More specifically, the control unit 200 reads the control setting information from the setting storage unit 300, reads the measurement information from the measurement device 40, reads the robot state information from the robot 50, and reads the operation plan information from the operation plan unit 100. The control unit 200 then calculates the control command information for the robot 50 using the read information, and transmits the calculated control command information to the robot 50. When calculating the control command information, the control unit 200 converts the trajectory information and the operation information so as to correspond to the output of each driving unit of the robot 50, and at the same time performs upsampling conversion by temporally interpolating the information so as to have a higher time resolution than the operation plan information. The robot state information includes, for example, the state (position, angle, etc.) of each driving unit of the robot and the progress state of the control sequence for each driving unit of the robot. The control setting information includes, for example, information indicating the upper limit and lower limit of the output of each driving unit of the robot. The control device 20 is realized by a computer such as a personal computer or a workstation.
[0023] The setting storage unit 300 of the setting storage device 30 stores plan setting information and control setting information. The plan setting information and the control setting information may be information generated by a user inputting through a user interface. The user interface is a computer such as a personal computer, a workstation, a tablet, or a smartphone, or an input device such as a keyboard, a mouse, a touch panel display, or a voice input device. However, the user interface is not limited to these examples. The setting storage device 30 is realized by a computer such as a personal computer or a workstation.
[0024] The measuring device 40 senses and estimates the position and orientation of the transported object, and outputs the sensing and estimation results as measurement information. The measuring device 40 is, for example, a sensing device such as a stereo camera, a pattern projection camera, or a LIDAR (Laser Imaging Detection and Ranging), or a sensing system in which these sensing devices are integrated with a post-processing device that estimates the position and orientation of the target object. However, the measuring device 40 is not limited to these examples, and may be configured to include various external sensors.
[0025] The robot 50 is a robot that can grip a transport object and move it to a predetermined destination by being driven according to control command information, and is, for example, an articulated robot, a dual-arm robot, a SCARA robot, a parallel robot, etc. The tip of the robot 50 is provided with an end effector that is a device for gripping the transport object, and the end effector is, for example, a two-jaw gripper, a three-jaw gripper, a vacuum suction hand, a magnetic suction hand, a general-purpose hand, etc. The robot 50 and the end effector are not limited to these examples and may have various configurations.
[0026] The robot control system 1 is not limited to the configuration shown in FIG. 1, and various modifications may be made. FIG. 2 is a schematic block diagram of a robot control system 1a according to a second configuration example of the first embodiment. In the second configuration example shown in FIG. 2, the motion planning device 10a has a control unit 200, and transmits control command information directly to the robot 50. FIG. 3 is a schematic block diagram of a robot control system 1b according to a third configuration example of the first embodiment. In the third configuration example shown in FIG. 3, the motion planning device 10b has a control unit 200 and a setting storage unit 300, transmits control command information directly to the robot 50, and stores plan setting information and control setting information.
[0027] 4 shows an example of a hardware configuration of the motion planning device 10. The motion planning device 10 includes, as hardware, a processor 11, a memory 12, and an interface 13. The processor 11, the memory 12, and the interface 13 are connected via a data bus 19.
[0028] The processor 11 functions as a controller (arithmetic device) that controls the entire motion planning apparatus 10 by executing a program stored in the memory 12. The processor 11 is, for example, a processor such as a CPU (Central Processing Unit), a GPU (Graphics Processing Unit), or a TPU (Tensor Processing Unit). The processor 11 may be composed of a plurality of processors. The processor 11 is an example of a computer. The processor 11 functions, for example, as a motion planning unit 100 in the motion planning apparatus 10 shown in FIG. 1, or as the motion planning unit 100 and a control unit 200 in the motion planning apparatuses 10a and 10b shown in FIG. 2 or FIG. 3.
[0029] The memory 12 is composed of various volatile and non-volatile memories such as a RAM (Random Access Memory), a ROM (Read Only Memory), and a flash memory. The memory 12 also stores a program for executing the processes executed by the motion planning device 10. Note that a part of the information stored in the memory 12 may be stored in one or more external storage devices capable of communicating with the motion planning device 10, or in a storage medium detachable from the motion planning device 10. The memory 12 functions as, for example, a setting storage unit 300 in the motion planning device 10b shown in FIG. 3.
[0030] The interface 13 is an interface for electrically connecting the motion planning apparatus 10 to other devices (the control device 20, the setting storage device 30, the measuring device 40, and the robot 50). These interfaces may be wireless interfaces such as network adapters for wirelessly transmitting and receiving data to and from other devices, or may be hardware interfaces for connecting to other devices via cables or the like. The motion planning apparatus 10a shown in FIG. 2 and the motion planning apparatus 10b shown in FIG. 3 also have the hardware configuration shown in FIG. 4.
[0031] FIG. 5 is an example of a hardware configuration of the robot control system 1. An articulated robot 51 is attached to a workbench 71. A two-jaw gripper 501 is attached to the tip of the articulated robot 51 as an end effector. A position and orientation estimation camera system 41 is attached to a support 74 on the side of the workbench. The position and orientation estimation camera system 41 measures and estimates the position and orientation of a conveyed object 61 placed on the workbench 71. The conveyed object 61 is picked and placed by the articulated robot 51 from a state in which it is placed on the workbench 71 to a state in which it is placed on a shelf 72 or a shelf 81 of a shelf composed of a shelf 72, a shelf 81, and a shelf column 73 installed beside the workbench 71. The virtual obstacle 82 is an obstacle without a physical entity, and is set as an area into which the end effector 501 must not enter. Here, the virtual obstacle 82 is provided to prevent the articulated robot 51 from contacting itself. Although the motion planning device 10, the control device 20, and the setting storage device 30 are not shown in Fig. 5, they are installed to the side of, inside, or at a remote location from the workbench 71. A world coordinate system 91 represents the axial directions of the world coordinates of the robot control system 1 in Fig. 5. Here, as an example, the x-axis and y-axis are provided along the horizontal direction, and the z-axis is provided along the height direction.
[0032] Next, the calculation (generation) methods of the plan setting information, the operation plan information, and the measurement information used by the operation planning unit 100 will be described with continued reference to Fig. 5. First, the calculation method of the operation plan information will be described, and then the calculation methods of the plan setting information and the measurement information will be described in that order.
[0033] The motion planning unit 100 calculates motion plan information using an optimization model in which a series of pick-and-place operations are formulated as a mixed integer linear programming problem. More specifically, the motion planning unit 100 performs a series of processes, in which after generating an optimization model, the motion planning unit 100 performs a solution calculation for the optimization model using an optimization solver to calculate a solution of the optimization model, and finally performs post-processing on the obtained solution to convert it into motion plan information.
[0034] The optimization solver may be any that can solve a mixed integer linear programming problem, such as, but not limited to, a branch and bound method using continuous relaxation and linear programming, or a branch and bound method combined with a cutting plane method, a local search method, metaheuristics, etc.
[0035] The optimization model has an objective function that minimizes the number of time steps in which pick-and-place is completed for all target transport objects, while minimizing the distance traveled by the end effector during the time steps. The objective function is not limited to this example, and may be any function that results in desirable pick-and-place. For example, the objective function may be an objective function that minimizes only one of the number of time steps or the distance traveled by the end effector.
[0036] The optimization model also has a constraint that models the dynamics of the movements of the end effector and the transported object as a hybrid system, where the constraint model indicates that the transported object moves together with the end effector when held and transported by the end effector, and that the transported object remains in the same position without moving when not held by the end effector.
[0037] Furthermore, the optimization model has constraint conditions that model collision avoidance between the end effector and an obstacle, between the transported object and an obstacle, between the end effector and the transported object, and between the transported object and another transported object. These constraint conditions are conditions that must be satisfied by a collision-avoiding object such as an end effector and a collision-avoidable object such as an obstacle (an object with which the collision-avoiding object should avoid collision), and model conditions under which the collision-avoiding object moves in a movable area around the collision-avoidable object defined in advance without colliding with the collision-avoidable object.
[0038] In addition, the optimization model has additional constraints that are necessary as an auxiliary to the formulation of the objective function and constraints described above.
[0039] A more detailed example of the optimization model described above will be shown. In this optimization model, for an articulated robot, only the end effector is modeled. In addition, the user can set the movable area of the end effector 501 so that the number of objects defined as obstacles to be avoided is minimized. For example, in the hardware configuration of FIG. 5, the work table 71, the shelf 72, the shelf column 73, the support column 74, and the position and orientation estimation camera system 41 are set so as not to be located inside the movable area of the end effector 501, so that the obstacles to be avoided can be limited to the shelf 81 and the virtual obstacle 82. In addition, the end effector, the transported object, the obstacle, the movable area of the end effector, and the movable area around the object to be avoided are modeled as an axis-aligned bounding box (AABB). The positions of the end effector, the transported object, and the obstacle are the centers of gravity of the corresponding rectangular parallelepipeds. The end effector approaches the transported object from above and grasps it, and in the transporting state, the bottom surface of the end effector comes into contact with the top surface of the transported object.
[0040] In addition, this example optimization model uses the constants, coefficients, variables, symbols, and notations shown in (a) to (k) below. For binary variables, the states corresponding to the values 0 and 1 are written in parentheses. In the following, when these symbols are used in the text, the subscripted indexes will be omitted as appropriate for the sake of simplicity.
[0041] (a) Auxiliary variable: Index number
[0042]
number
[0043] (b) Constants and coefficients: Number
[0044]
number
[0045] (c) Constants and coefficients: initial values and target values
[0046]
number
[0047] (d) Constants and coefficients: upper and lower limits
[0048]
number
[0049] (e) Constants and coefficients: shape
[0050]
number
[0051]
number
[0052] (g) Constants and coefficients: Other
[0053]
number
[0054] (h) Decision variable: Binary value
[0055]
number
[0056] (i) Decision variable: Continuous value
[0057]
number
[0058]
number
[0059]
number
[0060] (j) Symbol
[0061]
number
[0062] (k) Notation
[0063]
number
[0064] The formulation of the constraints that are equivalent in the mixed integer linear programming problem for each symbol is expressed by the following equations (1) to (3).
[0065]
number
[0066] The possible values of the auxiliary variables representing the index numbers are expressed by the formulas (4) to (8).
[0067]
number
[0068] The constraints on the upper and lower limit ranges of each continuous variable are expressed by equations (9) to (18). Equation (9) represents the movable region of the end effector.
[0069]
number
[0070]
number
[0071] The constraint conditions regarding the initial values of the position and velocity of the end effector and the position of the transported object are expressed by equations (19) to (21).
[0072]
number
[0073] The constraint that "two or more transported objects must not be in a gripping state at the same time" is expressed by equation (22).
[0074]
number
[0075] The constraint condition that "the gripping start state of the transported object by the end effector coincides with the transition from the non-transporting state to the transporting state" is expressed by formula (23). The gripping start state is a series of motion states in which the end effector picks the transported object from the approach point and returns to the approach point after the picking operation.
[0076]
number
[0077] The constraint condition that "the end effector's gripping end state of the transported object coincides with the transition from the transporting state to the non-transporting state" is expressed by equation (24). The gripping end state is a series of motion states in which the end effector performs a placing operation on the transported object from the approach point and returns to the approach point after the placing operation.
[0078]
number
[0079] The constraint condition that "the conveying state of the conveyed object by the end effector is a grasping state excluding the grasping start state" is expressed by equation (25). In other words, the grasping state is the grasping start state or the conveying state.
[0080]
number
[0081] The constraint condition that "the initial values of the grip start state, grip end state, and transport state of the transported object are each 0" is expressed by equation (26).
[0082]
number
[0083] The constraint that "the position of the end effector is updated by the position and velocity of the end effector in the previous time step" is expressed by equation (27).
[0084]
number
[0085] The constraint that "the position of the conveyed object in the non-grasped state coincides with the position of the conveyed object in the previous time step" is expressed by equations (28) and (29).
[0086]
number
[0087] The constraint condition that "the position of the transported object in the transport state coincides with a position a certain distance away from the position of the end effector" is expressed by equations (30) and (31).
[0088]
number
[0089] The constraint condition that "the positions of the conveyed object in the gripping start state and the gripping end state coincide with a position a certain distance away" is expressed by equations (32) and (33).
[0090]
number
[0091] Here, the position at a certain distance is the approach position before the end effector picks up the transported object when the gripping start state is reached, and is the return position after the end effector places the transported object when the gripping end state is reached. off is the distance between the end effector and the transported object in the gripping start state and the gripping end state, and is determined by equation (55) described later.
[0092] The constraint that "the state in which the transported object reaches the target position is when the position of the transported object coincides with its target value" is expressed by equations (34) and (35). Hereinafter, "target position" refers to the target value of the position (i.e., the coordinates of the target position).
[0093]
number
[0094] The constraint condition that "the conveyed object can reach the target position only when it is not gripped" is expressed by equation (36).
[0095]
number
[0096] The constraint condition that "the completion state of the pick-and-place is a state in which all transported objects have reached their target positions over all time steps from the present to the future" is expressed by equation (37).
[0097]
number
[0098] The constraint condition "finally reach the pick-and-place completion state" is expressed by equation (38).
[0099]
number
[0100] Next, before describing the constraints on the movable area, the movable area will be described with reference to FIGS. 6(A) to 6(C) and FIGS. 7(A) to 7(C).
[0101] FIG. 6(A) is an xy plan view showing a movable area around an obstacle 80. FIG. 6(A) clearly shows virtual planes 800 along each face of the obstacle 80 modeled as a rectangular parallelepiped. The movable area is modeled as an axis-parallel rectangular parallelepiped (AABB). FIG. 6(B) shows a first example of the movable area 810, and FIG. 6(C) is an xy plan view showing a second example of the movable area 810. In FIG. 6(B) and FIG. 6(C), the movable area 810 is hatched. As shown in FIG. 6(B) and FIG. 6(C), the movable area 810 is an area divided by the virtual planes 800, and specifically, corresponds to a half space outside the virtual planes 800. In the case of a three-dimensional space, the movable area around the collision-avoided object (here, the obstacle 80) is an area of six half spaces corresponding to the six virtual planes 800. In reality, the movable area 810 is a finite area expressed as a product set with the movable area of a collision avoidance object (end effector or transport object).
[0102] 7(A) to 7(C) are examples of xy plan views showing the switching of movable areas when the end effector 500 moves around an obstacle. As shown in FIG. 7(A), the end effector 500 is located inside one movable area 810. In FIG. 7(A), when the end effector 500 moves inside this movable area 810 in the direction of the arrow 83A, the end effector 500 is located inside two movable areas 810, and reaches the state shown in FIG. 7(B). After that, in the state of FIG. 7(B), when the end effector 500 moves inside the newly positioned movable area 810 in the direction of the arrow 83B, the end effector 500 is located inside two movable areas 810 different from before the movement. After that, the end effector 500 reaches the state shown in FIG. 7(C). Then, the end effector 500 further moves in the direction of the arrow 83C.
[0103] In this way, the collision avoidance object (end effector 500 in the example of Figs. 7(A) to 7(C)) can move while avoiding collision with the collision avoided object (obstacle 50 in the example of Figs. 7(A) to 7(C)) by switching the movable area. However, the collision avoidance object needs to be located in at least one or more movable areas in two consecutive time steps before and after the switching of the movable area.
[0104] Next, the constraint condition regarding the movable area will be explained. The constraint condition that "the end effector is located in the movable area around the obstacle" is expressed by equations (39) and (40).
[0105]
number
[0106] The constraint condition that "the end effector is located within a movable area around the transported object" is expressed by equations (41) and (42).
[0107]
number
[0108] The constraint condition that "the object to be conveyed is located in the movable area around the obstacle" is expressed by equations (43) and (44).
[0109]
number
[0110]
number
[0111] The constraint condition that "a conveyed object is located in a movable area around another conveyed object" is expressed by equations (45) and (46).
[0112]
number
[0113]
number
[0114] The constraint condition that "the end effector is located inside one or more movable regions around at least one obstacle in two consecutive time steps" is expressed by equation (47).
number
[0115] The constraint condition that "the end effector is located at least within one or more movable regions around the transported object in two consecutive time steps" is expressed by equation (48).
[0116]
number
[0117] In this embodiment, when the object is in the transporting state, the movable area of the object is set to be the same as that of the end effector transporting the object. dlv,obs , φ dlv,dlv is made a continuous variable instead of a binary variable, and an operation plan is calculated so as to satisfy the constraint condition that "the conveyed object is located within a movable area around the collision-avoidable object." The constraint condition that "the conveyed object is located within a movable area around the collision-avoidable object" is an example of the third condition in the present disclosure.
[0118] We will provide a supplementary explanation of the effect of making the movable area of the conveyed object and the end effector conveying it the same when the conveyed object is in a conveying state. As a comparative example, a constraint condition similar to equations (47) and (48) (also called the "constraint condition for the comparative example") may be added to the movable area around the conveyed object and obstacles, and to the movable area around the movable area of a conveyed object and another conveyed object, and collision avoidance therebetween may be modeled. Meanwhile, in this case, the decision variable φ dlv,obs , φ dlv,dlv Since is a binary variable, the binary variable φ dlv,obs , φ dlv,dlv In contrast, in the present embodiment, when the object is in the transport state, the movable area of the transport object and the end effector transporting the object are made the same, thereby reducing the number of decision variables φ dlv,obs , φ dlv,dlv is made a continuous variable instead of a binary variable. This makes the binary variable φ dlv,obs , φ dlv,dlv The number of decision variables φ can be set to 0. dlv,obs , φ dlv,dlv The reason why we can make is that the binary variable φ can be made continuous by the constraints (49) and (50) described later. ee,obs , φ ee,dlv The binary value of the decision variable φ dlv,obs , φ dlv,dlv This is because the light can be selectively propagated to the
[0119] 8(A) and 8(B), the fact that the movable area of the conveyed object and the end effector conveying it are the same when the conveyed object is in the conveying state will be described in more detail. Fig. 8(A) is an xz plane view of the periphery of an obstacle 80 in a state in which the end effector 500 is conveying the conveyed object 60, and Fig. 8(B) is an xz plane view of the periphery of the obstacle 80 in a state in which the end effector 501 is not conveying the conveyed object 60.
[0120] As shown in Fig. 8(A), a movable area 810 of the transported object 60 around the obstacle 80 is the same as a movable area 810 of the end effector 500 around the obstacle 80 only when the transported object 60 is in the transport state. On the other hand, as shown in Fig. 8(B), when the transported object 60 is not in the transport state, it is not necessary to consider the determination of the movable area around the obstacle 80. This is because a collision can occur with the transported object 60 only when in the transport state, and the transported object 60 is in a position where it will not collide with other collision-avoided objects before picking and after placing.
[0121] Considering the above, the motion planning unit 100 adds constraint conditions expressed by the formulas (49) and (50) described below as a condition corresponding to "the movable area 810 around the obstacle 80 of the transported object 60 is the same as the movable area 810 around the obstacle 80 of the end effector 500 only when in the transport state". On the other hand, the motion planning unit 100 does not require the constraint conditions according to the comparative example (i.e., the constraint condition that the transported object is located inside the movable area around the collision-avoided object) corresponding to the formulas (47) and (48) in order to reflect the condition that "when the transported object 60 is not in the transport state, it is not necessary to consider the determination of the movable area around the obstacle 80". In other words, when calculating the motion plan, the motion planning unit 100 skips the evaluation of the constraint condition that the transported object is located inside the movable area around the collision-avoided object when the transported object is not transported by the robot (here, the end effector). In this embodiment, the motion planning unit 100 can calculate a motion plan so as to satisfy the constraint that "the transported object is located inside a movable area around the collision-avoiding object."
[0122] The constraint in the optimization model will be explained again. The constraint that "the movable area around the obstacle of the transported object coincides with the movable area around the obstacle of the end effector in the transport state" is expressed by equation (49).
[0123]
number
[0124] The constraint condition that "the movable area of the conveyed object around the other conveyed object coincides with the movable area of the end effector around the other conveyed object in the conveying state" is expressed by equation (50).
[0125]
number
[0126] The constraint that "the conveyed object cannot be positioned in the movable area around the conveyed object itself" is expressed by equation (51).
[0127]
number
[0128] The constraints for converting the end effector velocity to its absolute value are expressed by equations (52) and (53). More precisely, v ee The absolute value of (|v ee |) is minimized by υ ee This is realized by minimizing the above equation and combining the constraints expressed by equations (52) and (53).
[0129]
number
[0130] Distance b between the end effector and the transported object during the grasping operation on , b off The values of can be determined by equations (54) and (55), respectively.
[0131]
number
[0132] The objective function is expressed as shown in equation (56).
[0133]
number
[0134] The above is an example of the definition of the optimization model. The motion planning unit 100 generates the above optimization model and performs a solution calculation for the optimization model to obtain a solution X for a vector X having all the decision variables as elements. * (For example, the optimal solution) is obtained. In the following, we will refer to solution X * Regarding the decision variables that are the elements of * The above is an example of a method for calculating the operation plan information by the operation planning unit 100.
[0135] Next, the motion planning information will be described. The motion planning unit 100 calculates a solution X * Extract motion planning information from solution X * Of these, p ee* is the orbit information, and θpck* , θ plc* , θ cry* These are extracted as operation information, and are combined and output as motion plan information. pck* " is 1, it corresponds to the end effector starting the gripping operation and picking up the transported object at that time step. plc* " is 1, which corresponds to the end effector finishing the gripping operation and placing the transported object at the time step. cry* " being 1 corresponds to the end effector moving while gripping the transported object in that time step, i.e., transporting the object.
[0136] Next, the plan setting information will be described. The setting storage unit 300 stores the plan setting information. Specifically, the plan setting information includes the number of transported objects N dlv andp dlv,init These constants and coefficients may be divided into those set by the user and those automatically calculated by the setting storage unit 300. For example, the number of dimensions N dim or ee,init For constants and coefficients that have obvious default values (3 and 0, respectively), the user may skip setting them. on and distance b off may be calculated by equation (54) and equation (55), respectively, and the setting storage unit 300 may be able to calculate appropriate values for constants and coefficients other than these, such as M and ε, using other constants and coefficients.
[0137] The measurement information will be described in more detail. The motion planning unit 100 acquires measurement information that combines position information and orientation information of the transported object output by the measurement device 40. The motion planning unit 100 identifies the number of transported objects from the acquired measurement information and calculates the number of dimensions N dim While determining the relationship between the measurement information and the index numbers m and k, the motion planning unit 100 also determines the position information p dlv,initFurthermore, the motion planning unit 100 uses the posture information from the acquired measurement information to read in the setting storage unit 300 as s dlv You may update the value of
[0138] The motion planning unit 100 executes calculations in the procedure shown in Fig. 9. Fig. 9 is a flowchart showing an example of the processing steps of the motion planning unit 100.
[0139] The motion planning unit 100 reads the plan setting information from the setting storage unit 300 (step S101). As a result, the motion planning unit 100 stores the plan setting information, for example, each of the constants and coefficients (N) explained in "(b) Constants and coefficients: number", "(c) Constants and coefficients: initial value and target value", "(d) Constants and coefficients: upper limit and lower limit", "(e) Constants and coefficients: shape", "(f) Constants and coefficients: distance", and "(g) Constants and coefficients: others". dlv and p dlv,init (excluding)
[0140] Next, the motion planning unit 100 acquires the position coordinates of the transported objects from the measurement device 40 (step S102). dlv and the initial value p of the position of the transported object dlv,init Get the.
[0141] Next, the motion planning unit 100 generates an optimization model using the read plan setting information and the acquired position coordinates of the transport object (step S103). For example, the motion planning unit 100 generates an optimization model for the vector X of the decision variables shown in equation (56) using the constraint conditions shown in equations (1) to (53).
[0142] Then, the motion planning unit 100 executes a solution calculation for the generated optimization model, and calculates motion planning information from the obtained solution (step S104). In this case, the motion planning unit 100 calculates, for example, a solution X * Find the solution X * From the orbital information, p ee* and θpck* , θ plc* , θ cry* is extracted as the motion plan information.
[0143] The motion planning unit 100 outputs the calculated motion plan information (step S105). After the process of step S105 is executed, the motion planning unit 100 ends the process of FIG.
[0144] As described above, the motion planning device of this embodiment sets a first condition that the robot and the transported object that perform pick-and-place for one or more transported objects are located within a movable area that is an area where they will not collide with the collision-avoidable object, and a second condition that the movable area of the robot around the collision-avoidable object and the movable area of the transported object around the collision-avoidable object match when the robot holds and transports the transported object. Then, the motion planning device calculates a motion plan for the robot based on the first condition and the second condition. As a result, the motion planning device of this embodiment is capable of calculating a motion plan for pick-and-place that takes into account collision avoidance with high time efficiency.
[0145] <Second embodiment> In the first embodiment, the main purpose is to reduce the number of binary variables, but in the second embodiment, the main purpose is to substantially reduce the number of constraints by the big-M method. Specifically, the aim is to substantially reduce the number of constraints expressed by equations (43) and (44) (i.e., constraints that can determine whether or not the conveyed object is located in the movable area around the obstacle).
[0146] The system configuration of the motion planning device and the robot control system including the motion planning device in the second embodiment is similar to that of the robot control systems 1, 1a, and 1b described in the first embodiment with reference to Figs. 1 to 3. The hardware configuration of the robot control system in the second embodiment is also similar to that described in the first embodiment with reference to Fig. 5. The hardware configuration of the motion planning device in the second embodiment is also similar to that described in the first embodiment with reference to Fig. 4. The optimization model used in the second embodiment is also similar to that in the first embodiment. Hereinafter, the same reference numerals will be used to designate the same elements as in the first embodiment, and the description thereof will be omitted as appropriate.
[0147] In the second embodiment, the number of constraint conditions expressed by the equations (43) and (44) is substantially reduced by the decision variable φ ee,dlv This is realized by restricting the possible values of . This corresponds to removing the formulas (43) and (44) to the extent that it does not cause any problems from the viewpoint of collision avoidance. Specifically, in the second embodiment, an optimization model shown in the following formula (57) is set.
[0148]
number
[0149] The third term of the objective function shown in equation (57) is called the "soft path constraint." In addition, "Rc" is a set of index numbers of movable areas that are penalized for being used as the robot's path, and is called the "constrained path." In order to minimize the objective function, the soft path constraint aims to minimize the penalty caused by the movable area in which the robot is located, that is, to minimize as many φ ee,dlv In other words, for the movable area belonging to the constraint path Rc, φ ee,dlvWhen the value of is determined by the soft path constraint, the evaluation of equations (43) and (44) can be essentially skipped, which corresponds to a substantial reduction in the number of constraints in the big-M method.
[0150] The soft route constraint corresponds to preferentially selecting a route that does not pass through the movable area belonging to the constrained route Rc as much as possible. Therefore, by making the movable area that is predicted to be unlikely to be passed through into the element of the constrained route Rc, it is possible to efficiently reduce the above-mentioned constraint conditions.
[0151] In addition, the constraint "φ ee,dlv It is conceivable to forcibly prevent the end effector from passing through the movable area belonging to the constraint path Rc by setting "φ = 0". However, since there are generally many paths that the end effector can take around obstacles and transported objects, and these paths have complex dependencies, it is difficult to specify a movable area that the end effector cannot pass through, or, to be conservative, it is necessary to set constraints only for a small number of movable areas. For these reasons, the constraint "φ ee,dlv The method using "φ = 0" is efficient. ee,dlv On the other hand, the method using soft path constraints does not require the user to specify a traversable area that is completely unpassable, so it is practically impossible to determine the value of φ ee,dlv It has the effect of determining the value of.
[0152] A method for calculating the constraint path Rc will be described with reference to Fig. 5, Fig. 10(A) and Fig. 10(B). Fig. 10(A) is an example of an xz plane view of a movable area subject to soft path constraints (i.e., the constraint path Rc), and Fig. 10(B) is an xy plane view corresponding to Fig. 10(A). In Fig. 10(A) and Fig. 10(B), the movable area corresponding to the constraint path Rc is hatched.
[0153] As a characteristic of the pick-and-place operation, the probability that the end effector moves through the movable area above the transported object (predicted passing probability) is high, and conversely, the probability that the end effector moves through the movable area below the transported object (predicted passing probability) is low. Therefore, in the example shown in Fig. 10(A), the movable area below the transported object 60 (i.e., below the transported object 60 in the z direction) is the restricted path Rc.
[0154] Another characteristic of the pick-and-place operation is that the end effector moves along a path from the initial position (origin) of the transported object to the target position (destination), but in many cases the movement distance in either the x-direction or the y-direction is longer than the movement distance in the other axial direction. In the example of Figure 5, the movement distance in the x-direction is longer than the movement distance in the y-direction. In many cases, the end effector can complete a series of pick-and-place operations by passing through the movement area above the transported object and the movement area on both sides of the axial direction with the longer movement distance (x-direction in the example of Figure 5) without passing through the movement area on both sides of the axial direction with the shorter movement distance (y-direction in the example of Figure 5).
[0155] These pick-and-place characteristics can be utilized in the calculation of the constraint path Rc. Specifically, the motion planning unit 100 adds a movable area located below the transported object 60 in the z direction to the constraint path Rc (see FIG. 10A). Next, the motion planning unit 100 adds a movable area located on both sides of the transported object 60 in the axial direction with a shorter moving distance (the y direction in the example of FIGS. 10A and 10B) (see FIG. 10B). When determining an axis with a shorter moving distance, the motion planning unit 100 can, for example, calculate the centers of gravity of the initial positions and the target positions of the multiple transported objects, compare the magnitude relationship between the absolute value of the x component and the absolute value of the y component of the difference between them, and determine the smaller axis as the axis with the shorter moving distance.
[0156] 10(A) and 10(B), the calculation method of the constraint path Rc is not limited to the example described with reference to Fig. 10(A) and Fig. 10(B), and may be any calculation method based on prediction of a movable area where the robot is unlikely to pass by using plan setting information and measurement information. Specifically, the operation planning unit 100 sets, as the constraint path Rc, a movable area where the robot is predicted to pass by at a lower probability than a threshold value based on the initial position and the target position of the transported object.
[0157] In the example described with reference to Figures 10(A) and 10(B), the constraint path Rc is common to all transport objects and all time steps, but it may be different for each transport object and each time step. In this case, the constraint path Rc has variables m and t, such as constraint path Rc(m,t), and it becomes possible to determine the constraint path more finely. As a result, many φ ee,dlv This has the effect of allowing the value of
[0158] In the preferred embodiment, the soft path constraint φ ee,dlv By multiplying by a weighting coefficient, φ ee,dlv The weighting coefficient may be calculated based on the probability of passing through the movable area.
[0159] FIG. 11 is a flowchart showing an example of the processing steps of the action planning unit 100 in the second embodiment.
[0160] The motion planning unit 100 reads plan setting information from the setting storage unit 300 (step S201). The motion planning unit 100 acquires position coordinates of a transport object from the measurement device 40 (step S202). The processes of steps S201 and S202 are the same as steps S101 and S102 in the flowchart of FIG.
[0161] The motion planning unit 100 calculates a path constraint Rc using the read plan setting information and the acquired position coordinates of the transported object (step S203). For example, the motion planning unit 100 adds a movable area on the lower side in the z-axis direction and movable areas on both sides in the axial direction with a shorter moving distance to the path constraint Rc.
[0162] Next, the motion planning unit 100 generates an optimization model with soft path constraints using the read plan setting information, the acquired position coordinates of the transported object, and the calculated constraint path Rc (step S204). Specifically, the motion planning unit 100 generates an optimization model for the vector X of the decision variables shown in equation (57) using the constraint conditions shown in equations (1) to (53).
[0163] The motion planning unit 100 executes a solution calculation for the generated optimization model, and calculates motion planning information from the obtained solution (step S205). In this case, the motion planning unit 100 calculates, for example, a solution X * Find the solution X * From the orbital information, p ee* and θ pck* , θ plc* , θ cry* is extracted as the motion plan information.
[0164] The motion planning unit 100 outputs the calculated motion plan information (step S206). After the process of step S206 is executed, the motion planning unit 100 ends the process of FIG.
[0165] As described above, the motion planning device 10 according to the second embodiment sets, based on the initial position and the target position of the transported object, a movable area around the transported object in which the predicted passage probability of the robot is lower than a threshold as a constraint path in which there is a penalty for using it as the robot's path. Then, the motion planning device 10 calculates a motion plan for the robot based on the set constraint conditions and the constraint path. As a result, the motion planning device according to this embodiment is capable of calculating a time-efficient pick-and-place motion plan that takes collision avoidance into consideration.
[0166] <Third embodiment> 12 shows a schematic configuration diagram of a motion planning device 10X in the third embodiment. The motion planning device 10X mainly includes a condition setting means 90X and a motion planning means 100X. The motion planning device 10X may be composed of a plurality of devices. The motion planning device 10X may be, for example, any one of the motion planning device 10, 10a, and 10b in the first and second embodiments.
[0167] The condition setting means 90X sets a first condition that the robot performing pick-and-place for one or more transported objects and the transported objects are located within a movable area that is an area where the robot will not collide with the collision-avoidable object, and a second condition that the movable area of the robot around the collision-avoidable object and the movable area of the transported object around the collision-avoidable object match when the robot holds and transports the transported object. The motion planning means 100X calculates a motion plan for the robot based on the first condition and the second condition. The condition setting means 90X and the motion planning means 100X are examples of the motion planning unit 100 in the first and second embodiments.
[0168] 13 is an example of a flowchart executed by the motion planning device 10X in the third embodiment. The condition setting means 90X sets a first condition that the robot performing pick-and-place for one or more transported objects and the transported objects are located within a movable area that is an area where the robot will not collide with the collision avoidable object, and a second condition that the movable area of the robot around the collision avoidable object and the movable area of the transported object around the collision avoidable object match when the robot holds and transports the transported object (step S301). Then, the motion planning means 100X calculates a motion plan for the robot based on the first condition and the second condition (step S302).
[0169] According to the third embodiment, the motion planning apparatus 10X can suitably calculate a motion plan that is time-efficient for pick-and-place and takes collision avoidance into consideration.
[0170] In the present disclosure, the program can be stored using various types of non-transitory computer readable media and supplied to a computer. The non-transitory computer readable media includes various types of tangible storage media. Examples of the non-transitory computer readable media include magnetic storage media (e.g., flexible disks, magnetic tapes, hard disks), magneto-optical storage media (e.g., magneto-optical disks), CD-ROMs (Read Only Memory), CD-Rs, CD-R / Ws, DVDs (Digital Versatile Discs), BDs (Blu-ray (registered trademark) Discs), and semiconductor memories (e.g., mask ROMs, PROMs (Programmable ROMs), EPROMs (Erasable PROMs), flash ROMs, and RAMs (Random Access Memory). In addition, the configuration of the motion planning device in the present disclosure is not limited to a configuration using a computer. For example, the motion planning device may be configured using dedicated hardware, such as an ASIC (Application Specific Integrated Circuit) or an FPGA (Field Programmable Gate Array).
[0171] Although the present invention has been described above with reference to the embodiments, the present invention is not limited to the above embodiments. Various modifications that can be understood by those skilled in the art can be made to the configuration and details of the present invention within the scope of the present invention. In addition, the disclosures of the above cited non-patent documents and the like are incorporated herein by reference. [Explanation of symbols]
[0172] 1, 1a, 1b Robot control system 10, 10a, 10b Motion planning device 20 Control device 30 Setting storage device 40 Measuring Equipment 50 Robot
Claims
1. a condition setting means for setting a first condition that a robot that performs pick-and-place for one or more transported objects and the transported objects are located within a movable area that is an area where the robot will not collide with a collision-avoidable object, and a second condition that, when the robot is gripping and transporting the transported object, the movable area of the robot around the collision-avoidable object coincides with the movable area of the transported object around the collision-avoidable object being transported; a motion planning means for calculating a motion plan for the robot based on the first condition and the second condition; the first condition includes a third condition that the transported object is located within the movable area around the collision-avoided object; A motion planning apparatus, wherein the motion planning means, when calculating the motion plan, skips evaluation of the third condition if the object to be transported is not being transported by the robot.
2. A condition setting means for setting a first condition that a robot performing pick-and-place for one or more transported objects and the transported objects are located within a movable area which is an area in which the robot will not collide with a collision-avoidable object, and a second condition that when the robot is gripping and transporting the transported object, the movable area of the robot around the collision-avoidable object coincides with the movable area of the transported object around the collision-avoidable object being transported; a motion planning means for calculating a solution of an optimization model based on constraint conditions including the first condition and the second condition and an objective function related to at least one of a number of time steps until the pick-and-place is completed or a moving distance of the robot, and outputting the solution of the optimization model as a motion plan for the robot; A motion planning device having the above configuration.
3. a constraint path setting means for setting, based on an initial position and a target position of the object, the movable area around the object in which the robot has a predicted passage probability lower than a threshold value as a constraint path in which there is a penalty for using the movable area as a path of the robot; 3. The motion planning apparatus according to claim 1, wherein the motion planning means calculates the motion plan based on the conditions set by the condition setting means and the constraint path.
4. 4. The motion planning apparatus according to claim 3, wherein the constrained path setting means includes a movable area positioned below the transport object in the constrained path.
5. 5. The motion planning device according to claim 3, wherein the constraint path setting means includes in the constraint path a movable area located on both sides of the transported object in the axial direction of a coordinate axis in which the distance between the initial position and the target position is shorter among two coordinate axes corresponding to a horizontal plane.
6. 6. The motion planning device according to claim 1, wherein the motion planning means generates, as the motion plan, trajectory information regarding the robot and operation information regarding operation of the robot.
7. The robot has an end effector, 7. The motion planning apparatus according to claim 1, wherein the motion planning means determines whether the first condition and the second condition are satisfied by regarding the end effector as the robot.
8. The computer a first condition is set that a robot that performs pick-and-place for one or more transported objects and the transported objects are located within a movable area that is an area where the robot will not collide with a collision-avoidable object, and a second condition is set that, when the robot grasps and transports the transported object, the movable area of the robot around the collision-avoidable object coincides with the movable area of the transported object around the collision-avoidable object being transported; Calculating a motion plan for the robot based on the first condition and the second condition; the first condition includes a third condition that the transported object is located within the movable area around the collision-avoided object; A motion planning method, wherein, when calculating the motion plan, if the object to be transported is not being transported by the robot, evaluation of the third condition is skipped.
9. a first condition is set that a robot that performs pick-and-place for one or more transported objects and the transported objects are located within a movable area that is an area where the robot will not collide with a collision-avoidable object, and a second condition is set that, when the robot grasps and transports the transported object, the movable area of the robot around the collision-avoidable object coincides with the movable area of the transported object around the collision-avoidable object being transported; Calculating a motion plan for the robot based on the first condition and the second condition; the first condition includes a third condition that the transported object is located within the movable area around the collision-avoided object; a program for causing a computer to execute a process of skipping evaluation of the third condition when the object to be transported is not being transported by the robot, when the operation plan is calculated;
10. A computer comprising: a first condition is set that a robot that performs pick-and-place for one or more transported objects and the transported objects are located within a movable area that is an area where the robot will not collide with a collision-avoidable object, and a second condition is set that, when the robot grasps and transports the transported object, the movable area of the robot around the collision-avoidable object coincides with the movable area of the transported object around the collision-avoidable object being transported; a motion planning method for calculating a solution of an optimization model based on constraint conditions including the first condition and the second condition, and an objective function related to at least one of a number of time steps until the pick-and-place is completed or a distance traveled by the robot, and outputting the solution of the optimization model as a motion plan for the robot.
11. A first condition is set such that a robot performing pick-and-place for one or more transported objects and the transported objects are located within a movable area which is an area in which the robot will not collide with a collision-avoidable object, and a second condition is set such that when the robot grasps and transports the transported object, the movable area of the robot around the collision-avoidable object coincides with the movable area of the transported object around the collision-avoidable object being transported, The program causes a computer to execute a process of calculating a solution of an optimization model based on constraint conditions including the first condition and the second condition, and an objective function related to at least one of the number of time steps until the pick-and-place is completed or the distance traveled by the robot, and outputting the solution of the optimization model as a motion plan for the robot.
Citation Information
Patent Citations
Robot and method of generating trajectory thereof
JP2013184233A
HARDWARE FOR PLANNING THE MOVEMENT OF A DEDICATED ROBOT, AND METHOD OF MANUFACTURING AND USING THE SAME
JP2018505788A
JPP6707485B
