System of path planning for robotic manipulators based on maximum acceleration and finite jerk constraints

BACKGROUND OF THE INVENTION

[0002] 1. Field of Invention

[0003] The present invention relates generally to wafer handling systems, and more particularly to a system that allows wafers to be moved from point to point under known conditions of acceleration and velocity as well as the rate-of-change of derivative of acceleration called jerk.

[0004] 2. DESCRIPTION OF THE PRIOR ART

[0005] In the processing of semiconductor wafers, from which semiconductor chips are produced, the wafers must be transferred from one location to another. In the majority of semiconductor processes, the wafers are oriented such that the disk is parallel to the plane of the floor (the planer orientation). Although the wafer can be rotated such that it is non-planer with the floor in order to facilitate certain semiconductor processes, most of the wafer handling from the wafer storage device, through the tool and then back into another wafer storage device is done with the wafer in this planer orientation. This invention concerns semiconductor wafers or similar substrates that are moving in planer space.

[0006] Modern semiconductor wafer processing machines move the wafers with wafer handling robots. Wafer handling robots consist of mechanisms optimized for moving wafers.

[0007] Some semiconductor processes are conducted in a vacuum chamber. As a result, some of the wafer handling robots operate inside the vacuum environment and some wafer handling robots operate outside the vacuum environment. So called atmospheric wafer handling robots handle wafers outside the vacuum chamber and serve to pass wafers to and from the vacuum robot which operates inside the vacuum chamber. All wafer handling robots are equipped with a manipulator which hold the wafer on the end of the robot arm. Sometimes the wafers are grasped by the manipulator. Other times, the wafer simply rests on tiny pads without otherwise being held by the manipulator.

SUMMARY

[0008] It is an object of the present invention to provide an improved system for wafer handling.

[0009] It is a further object of the present invention to provide a system for wafer handling that minimizes path length and maximizes safe wafer handling speed.

[0010] Briefly, a preferred embodiment of the present invention includes a system for wafer handling employing a complex numerical method for calculating a path of wafer travel that controls wafer acceleration and jerk, and results in maximum safe speed of wafer movement from a first point to a second point. Motion is begun along a straight line segment while accelerating to a first path velocity. During this acceleration, the system computer calculates a series of straight line segments and interconnecting sinusiodally shaped paths over which the wafer is to be guided to the second point. The straight line segments and sinusiodally shaped paths are calculated so as to minimize total path length and the time required to move the wafer from the first point to the second point. The system computes the point of entrance and exit to and from each straight and sinusoidal path.

IN THE DRAWING

[0011]
FIG. 1 illustrates the system of the present invention used for example for moving wafers between wafer aligner, process chamber and storage devices;

[0012]
FIG. 2 illustrates a typical prior art path of wafer movement;

[0013]
FIG. 3 shows a prior art path with rounded corners;

[0014]
FIG. 4 illustrates a path according to the present invention;

[0015]
FIG. 5 illustrates another path according to the present invention;

[0016]
FIG. 6 illustrates details of an arced path according to the present invention;

[0017]
FIG. 7 is a plot of minimum and maximum values of β over a specified range of ΔΦ;

[0018]
FIG. 8 is a plot of F versus β;

[0019]
FIG. 9 is a chart given as an example of path generation using the planning algorithm;

[0020]
FIG. 10 is a chart given as an example of path planning; and

[0021]
FIG. 11 is an illustration for explaining the sine-wave-arc generation.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

[0022] Because wafers are expensive disks containing extremely complex semiconductor circuits, the wafers must be handled carefully. Bumping, jarring or otherwise mishandling the wafers can result in damage to the wafer or its delicate structures. In addition, sometimes the wafers are not gripped by the manipulator, they are prevented from being flung to their destruction only by friction between the wafer and manipulator. If the acceleration or rate of change of acceleration experienced by the wafer it too high, the valuable wafer can be damaged. Therefore, an object of this invention is to allow wafers to be moved from point to point under known conditions of acceleration and velocity as well as the rate-of-change or derivative of acceleration called jerk.

[0023] In general, a wafer cannot be moved from one location to another location via a simple straight-line path. In general, the wafer must be extracted from one storage location and then placed on or in another device or storage location. For example, a wafer might be removed from a storage device (a wafer cassette or a Front Opening Universal Pod (FOUP)) and then placed on a device called a wafer aligner that finds the center and aligns a wafer. After the alignment is complete, the wafer might be removed from the wafer aligner and placed in a wafer process chamber where some process might be performed. The process might include deposition, etch, implant or wafer cleaning, among other process steps. After the wafer is processed, it might be removed from the process chamber and then placed in the same or a different wafer storage device. See FIG. 1.

[0024] An object of the present invention is to insure that the wafer being moved from location to location is moved along a path that results in smooth motion of the wafer. At the same time, the wafer must be moved as quickly as possible along a direct path to insure that the time required to move the wafer from point to point is as short as practical. Although smoothness of wafer motion is critical, quickly moving the wafer is an imperative given the high cost of the wafer processing machines and therefore the high cost per hour of operation.

[0025] Recalling the basic laws of motion, we know that moving a wafer quickly from point to point requires a high acceleration and a high velocity, however there are limits on the magnitude and the rate of change of the acceleration. The rate of change of acceleration is usually called jerk. In order to minimize potential damage or slipping of the wafer, acceleration should be smooth and continuous—that is, jerk is not infinite—and maximum velocity should be attained quickly.

[0026] We also recall that in planer motion, there are components of the velocity, acceleration and jerk in two dimensions. A key to rapid, smooth wafer motion in a plane is to maintain control over velocity, jerk and acceleration in two dimensions.

[0027] The prior art attempts to blend multiple path segments into a single path. Thus the prior art employs pre-determined line- and arc-segment shapes (e.g. U.S. Pat. No. 6,216,058). In a standard polar-coordinate wafer handling robot, line segments allow the wafer to move radially while the arcs are concentric with the center of the robot. Unfortunately, the prior art, by virtue of its limited repertoire of paths, provides for motion along paths that are longer than are possible using the present invention. In addition, the prior art cannot maximize the acceleration in two dimensions.

[0028] The prior art does attempt to eliminate the need to stop between segments and arcs. So-called blended moves allow a second move to begin before a first move has completed. Whereas these blended moves result in somewhat faster wafer transfers, the path that the wafer takes is often longer than necessary as taught by the present invention.

[0029] Therefore, an objective of the present invention is to allow on-the-fly wafer paths to be determined between arbitrary starting and ending points that result in rapid transfer of the wafer with a known path acceleration and a finite jerk.

[0030]
FIG. 2 shows a typical path utilized by the prior art. Note that it is obvious from observation that the path taken by the wafer is longer than a more direct path. Also, we note that considerable jerk occurs at the cusps of the arcs, as labeled unless the motion is stopped before reaching the cusps.

[0031] The present invention uses a very different method of determining the wafer path between the arbitrary wafer starting and stopping points. Whereas the prior art is limited to following arcs that are concentric to the robot axis and lines that are more or less radial, the present invention determines a path that is not only shorter—and therefore more direct—than the prior art, but the path guarantees that the acceleration of the wafer will be maximized, smooth and the jerk will be bounded. The benefit of the present invention is that wafers may be transferred smoother and faster using conventional wafer handling robotics.

[0032] In order to understand the teaching of the present invention, let us begin by examining the prior art with what appears to be a simple direct path between two wafer locations as shown in FIG. 2. The move begins with a line segment as the wafer is withdrawn from the wafer cassette. The move stops at the cusp in FIG. 2. The motion resumes as we enter a circular arc, ending at the second cusp. The transfer is completed at the end of the second line segment in FIG. 2.

[0033] In FIG. 3, the prior art eliminates the need to stop at the cusps by taking advantage of the fact that a round substrate, for example a wafer, has no corners. Therefore, the radial movement can begin before the movement reaches the end of the first line segment. We are literally “cutting the corner” in FIG. 3. The path in FIG. 3 is therefore shorter than the path in FIG. 2.

[0034] While the path in FIG. 3 is shorter than the path of FIG. 2, we note that the path is still not as short as a more direct path would be because the prior art necessarily follows a circular arc concentric with the rotational axis of the robot. That is, FIG. 3 differs from FIG. 2 only in the respect that the circular move is begun before the first radial move is complete.

[0035] The present invention joins the line segment and the arc segment in a very different manner. The present invention does not instantaneously begin the arc at the juncture with the line segment. Rather, a sinusoidal change in acceleration is imposed upon the wafer. Because the derivative of a sinusoid is also a sinusoid, the path taken by the wafer, as shown in FIG. 4 does not contain an instantaneous change in acceleration. Rather, the juncture between the line segment and the arc segment is much more gentle. We note that this path is considerably more complex than the prior art: the path of the wafer does not follow standard segments concentric or collinear with the robot axes. We also note that, compared to the prior art, the path of the present invention can achieve higher path accelerations than the prior art. Thus the present invention employs a shorter path and higher accelerations. Another example of a path according to the present invention is shown in FIG. 5.

[0036] The prior art, as represented by U.S. Pat. Nos. 5,655,060 and 6,216,058, overcomes the long-standing problem wherein the motion of the wafer stops at the termination of each path segment. The prior art attempts to reduce the time to transfer a wafer by blending one move into the next move. Refer to FIG. 2. Rather than waiting for the termination of the first segment at the cusp before beginning the second segment, the prior art begins the second segment before the end of the first segment. The resulting path is shown in FIG. 3. Although this path provides limited acceleration and finite jerk, the total acceleration of the wafer is lower than the maximum acceleration possible and the path is longer than necessary.

[0037] One reason for the poor behavior of the prior art is its use of fundamental trajectory shapes, meaning line segments oriented toward the center of the robot's axis of rotation and arcs whose centers are at the center of the robot's axis of rotation.

[0038] Another reason for the poor behavior of the prior art is its goal of numerical efficiency. The present invention utilizes a far more sophisticated and complicated numerical method, relying upon a significantly more powerful computer to perform the numerical calculations.

[0039] In contrast to the prior art, the present invention is not limited to a simple set of lines and arcs. Also, the present invention employs a far more complex numerical method. Whereas the prior art joins arcs to line segments all based upon the center of rotation of the robot, the present invention creates a path that results in limited wafer acceleration and a non-infinite jerk. Whereas the prior art wafer path is longer than necessary and subjects the wafer to lower acceleration than allowable, the present invention provides for a more direct wafer path and maximizes the acceleration of the wafer in two dimensions.

[0040] The present invention provides the transition from line to arc, arc to arc, and arc to line segments in planar space without imposing the boundary constraint that the velocity at the transition between move segments be zero. The sub-optimal motion along the straight line and the arc line will remain within a user specified, maximum acceleration. In addition, the total acceleration along the path will be continuously differentiable, causing the wafer jerk to be finite.

[0041] The wafer will travel at some speed Vout at the transition from the previous move segment to motion along the arc. The position of the wafer along the arc will be defined using polar coordinates, ρ. and φ. as in FIG. 6.

[0042] The components of velocity along the arc are defined through the following equations.

Vt=ρφ′ (−1)

Vr=ρ′. (0)

[0043] The tangential and radial velocities are represented by the variables, V_t and V_r, respectively. ρ is the radial position and ρ′ is its first derivative with respect to time. φ′. is the first derivative of the angular position with respect to time.

[0044] In order to ensure continuous velocity at the transition, point o, two constraints are imposed on the arc. First the radial velocity, Vr—o, and thus ρ′o must equal zero.

Vr—o=ρ′o=0, (2)

[0045] where the subscript o denotes the instantaneous value of the variable at the transition.

[0046] Second, the tangential velocity must equal the velocity of the wafer at the end of the line segment. Consequent to these constraints, the arc must be tangent to the velocity vector of the previous move segment with which it connects at point o.

Vt—o=ρoφ′o=Vout. (1)

[0047] To further ensure smooth motion, the acceleration of the wafer will also be continuously differentiable. The acceleration of the wafer is also expressed in radial and tangential components along the path.

A

t
=ρφ″+2ρ′φ′ (3)

A

r
=ρ″−ρφ′2, (4)

[0048] where At and Ar are the tangential and radial components of acceleration, respectively. ρ″ and φ″ are the second derivatives of radial and angular orientation with respect to time, respectively.

[0049] For simplification, the total wafer acceleration at point o is zero. Therefore, the orthogonal components of acceleration along the arc at point o are,

A

to
=ρoφ″o+2ρ′oφ′o=0 (5)

A

ro
=ρ″o−ρoφ′o2=0 (6)

[0050] From (2) ρ′o=0 and from (5) Ato=0. Thus,

φ″o=0 (7)

[0051] From (1), the tangential velocity is necessarily non-zero and therefore the centripetal acceleration will be non-zero as well. In order to ensure (6), the radial acceleration will be designed to be equal and opposite to the centripetal acceleration,

ρ″o=ρoφ′o2 (7a)

[0052] Similarly, to ensure continuous velocity and acceleration through the transition at the end of the arc, identical boundary conditions are. imposed on the point f.

Vt—f=ρfφ′f=Vout (8)

φ″f=0 (9)

ρ′f=0 (10)

ρ″f=ρfφ′f2. (11)

[0053] In order to solve the boundary value problem imposed by the above constraints on ρ and its derivatives, a sinusoidal function in time is employed with frequency, ω. The frequency, ω is structured such that,

ω=2π/Δt, (12)

where,

Δt=tf−to. (13)

[0054] to and tf are the times at transition point o and point f, respectively.

[0055] 1.1 Radial Position and its Derivatives

[0056] The second derivative of radial position with respect to time is defined as,

ρ″(t)=ρoφ′o2 cos(ω(t−to)). (14)

[0057] The first derivative of radial position is defined as,

ρ′(t)=ρoφ′o2/ω sin(ω(t−to)). (15)

[0058] The radial position is defined as,

ρ(t)=ρo+ρoφ′o2/ω2(1−cos(ω(t−to))). (15a)

[0059] 1.2 Angular Position and its Derivatives

[0060] The second derivative of angular position with respect to time is also defined as a sinusoidal function,

ρ″(t)=−B sin(ω(t−to)). (16)

[0061] The first derivative of angular position with respect to time is defined as,

φ′(t)=φ′+B/ω(cos(ω(t−to))−1). (17)

[0062] The angular position is defined as,

φ(t)=(φ′o−B/ω)(t−to)+B/ω2 sin(ω(t−to))+φo. (18)

[0063] The angular position at the completion of the arc, at time tf, is,

φf+φ(tf)=(φ′o−B/ω)(tf−to)+B/ω2 sin(ω(tf−to))+φo. (19)

[0064] The total angular displacement between point o and f is,

Δφ=φf−φo. (19a)

[0065] From (13) and (19), the time necessary to move between point o and f is,

Δt=Δφ/(φ′o−B/ω) (20)

[0066] Solving for ω given (12), (19a) and (20),

ω=πφ′o2/(2Δφ)6(π/Δφ(πφ′o2/Δφ−2 B))1/2 (22)

[0067] In order for ω to be real,

B*πφ′

o

2
/(2Δφ) (23)

[0068] The case where B is zero corresponds with constant angular velocity and co reduces to,

ω(B=0)πφ′o2/(2Δφ)6πφ′o2/(2Δφ)=πφ′o2/Δφ or 0. (24)

[0069] For a non-zero frequency, ω, the quadratic equation requires a +. Therefore,

ω=πφ′o2/(2Δφ)1(π/Δφ(πφ′o2/Δφ−2 B))1/2 (25)

[0070] To simplify further calculations, the variable β is introduced as

β=B 2Δφ/(πφ′o2), (28)

[0071] Substituting (28) into (25)

ω=πφ′o/Δφ(1+(1−β)1/2). (30)

[0072] Due to the sinusoidal nature of equations (15) and (16), ρ′ and φ″ at (Δt/2) are both zero.

[0073] Therefore, from (3), the tangential acceleration at (Δt/2) is always zero.

A

t
(Δt/2)=0. (31)

[0074] Substituting the sinusoidal functions into (4) and then recognizing (12), the radial component of acceleration at (Δt /2) is,

A

r
(Δt/2)=ρ″(Δt/2)+ρ(Δt/2)φ′(Δt/2)2 (32a )

[0075] Where,

\begin{matrix} ρ^{″} (Δ t / 2) = ρ_{o} φ_{o}^{' 2} \cos (ω Δ t / 2) & (32 b) \\ = - ρ_{o} φ_{o}^{' 2}, & (32 c) \\ ρ (Δ t / 2) = ρ_{o} + ρ_{o} φ_{o}^{' 2} / ω^{2} (1 - \cos (ω Δ t / 2)) & (32 d) \\ = ρ_{o} + 2 ρ_{o} φ_{o}^{' 2} / ω^{2}, & (32 e) \\ and, \\ φ^{'} (Δ t / 2) = φ_{o}^{'} + B / ω (\cos (ω Δ t / 2) - 1) & (32 f) \\ = φ_{o}^{'} + - 2 B / ω . & (32 g) \end{matrix}

[0076] Substituting (32c), (32e), and (32g) into (32a),

A

r
(Δt/2)=−ρoφ′o2−(ρo+2ρoφ′o2/ω2)(φ′o+−2B/ω)2 (32h)

[0077] Substituting (28) and (30) into (32h),

A

r
(Δt/2)=−ρoφ′o2C, (32i)

where,

C
=(1+(1+2/(1+(1−β)1/2)2(Δφ/π)2)(1−β/(1+(1−β)1/2)). (33)

[0078] It is important to note that C is a function of β and the total angular rotation Δφ only.

[0079] 1.3 The Arc Segment Acceleration Profile for known ρo and Δφ

[0080] When the initial radius, ρo, and total angular displacement, Δφ, are known, two design constraints are imposed on the acceleration profile:

[0081] 1. The maximum wafer acceleration within the arc move segment will occur at time (Δt/2).

[0082] 2. The total wafer acceleration at time, (Δt/2), will not exceed the user specified maximum acceleration, Amax.

[0083] 1.3.1 First Constraint

[0084] The total wafer acceleration is the resultant vector sum of the tangential and radial components of acceleration. The magnitude of the total wafer acceleration vector is,

A

total
(t)=(At(t)+Ar(t))1/2, (34)

[0085] Where Amax(t) is the magnitude of the total wafer acceleration at time t.

[0086] The magnitude of the total acceleration is linear in ρoφ′o2 as shown below,

A

shape
(t,β,Δφ)=Atotal(t)/(ρoφ′o2) (35)

[0087] From (33b), the shape of the acceleration profile, Ashape(t,β,Δφ), will be a function of β and Δφ alone. Therefore, the first constraint may be satisfied by ensuring that for a given Δφ, the selected β must lie within an allowable range of β such that the maximum acceleration occurs at (Δt/2).

[0088] As may be observed in the above equations, At(t) and Ar(t), are each composed of non-linear functions. Therefore, the explicit solution for the maximum acceleration along the acceleration profile would be extremely difficult. Since the total acceleration is of high order in time, multiple solutions could potentially exist over the range of Δt for individual values of β.

[0089] The trivial case occurs when β equals zero, when the angular velocity is constant over the arc. The acceleration will always be greatest at (Δt/2) for all Δφ. The bounding values above and below β are sought as a function of Δφ to provide the allowable range of β for a given Δφ.

[0090] Maximum Beta as a Function of Total Rotation

[0091] The maximum values for β, βmax(Δφ), are found algorithmically. For each value of Δφ, β is incremented from 0 in positive increments of δβ. For each successive value of β, Ashape(t,β,Δφ) is calculated for all t between 0 and Δt and the maximum value is stored. For each successive value of β, C is calculated from (33). The first constraint has been violated when max(Ashape) is greater than C. The maximum allowable value of β for the particular value of Δφ, Bmax(Δφ), is then defined as the previous iteration of β.

[0092] Once βmax(Δφ) has been found over the range of Δφ, βmax(Δφ) may be approximated as a third order polynomial,

βmax=p1Δφ3+p2Δφ2+p3Δφ+p4. (36)

[0093] Where p1 through p4 are the third order, least squares polynomial coefficients relating βmax to Δφ.

[0094] Minimum Beta as a Function of Total Rotation

[0095] Similarly, the minimum values for β, βmin(Δφ), are found algorithmically. For each value of Δφ, β is incremented from 0 in decrements of −δβ. For each successive value of β, Ashape(t,β, Δφ) is calculated for all t between 0 and Δt and the maximum value is stored. For each successive value of β, C is calculated from (33). The first constraint has been violated when max(Ashape) is greater than C. The minimum allowable value of β for the particular value of Δφ, βmin(Δφ), is then defined as the previous iteration of Δ.

[0096] Once βmin(Δφ) has been found over the range of Δφ, βmin(Δφ) may be approximated as a third order polynomial,

βmin=p5Δφ3+p6Δφ2+p7Δφ+p8. (37)

[0097] Where p5 through p8 are the third order, least squares polynomial coefficients relating βmin to Δφ.

[0098] The range of allowable , lies between the lower and upper bounds,

βmin*β*βmax. (38)

[0099] The plot of minimum and maximum values of β over the specified range of Δφ is shown in FIG. 7.

[0100] 1.3.2 Second Constraint

[0101] The value of Vout is integral to the design of the arc motion profile. Vout will always be greater than zero. For a given ρo, Δφ, and Amax, there is a maximum allowable entry/exit velocity, Voutmax, such that,

0<Vout*Voutmax. (39)

[0102] For Unspecified Velocity, Vout

[0103] From the first constraint, the maximum acceleration will occur at (Δt/2). From (32I), the acceleration at (Δt/2) will be composed entirely by radial acceleration, Ar. The second derivative of radial position at (Δt/2) is not influenced by the selection of β. However, the centripetal acceleration component, ρ(Δt/2)φ′(Δt/2)2 may be decreased by implementing positive β. The maximum allowable decrease, and thus the maximum allowable Vout will occur for β=βmax from (36).

[0104] Solving for the corresponding value for C,

C

max

=C
(βmax, Δφ) (40)

[0105] Where Cmax is the maximum allowable value for C.

[0106] From (34) and (1),

V

outmax
=(Amaxρo/Cmax)1/2 (41)

[0107] Finally, from (1),

φ′o=Voutmax/ρo. (42)

[0108] For Specified Velocity, Vout

[0109] Often, due to constraints outside of the design of the individual arc move segment, Vout will be some specified value adhering to (39).

[0110] Similar to (42) the initial angular velocity is,

φ′o=Vout/ρo. (42a)

[0111] In this case, βmax could be applied, however, the angular rotation will be brought to an unnecessarily slow rate such that the magnitude of the acceleration at (Δt/2) is less than. the maximum allowable acceleration, Amax. This could waste considerable move time. In order to optimize move efficiency given ρo, Δφ, φ′o, and Amax, an optimal β, βopt may be found such that the total wafer acceleration at (Δt/2) is equal to the maximum allowable acceleration, Amax.

[0112] Setting the magnitude of (32i) equal to Amax,

Amax=ρoφ′o2C. (43)

[0113] Introducing the function,

F
(βopt)=−Amax/(ρoφ′o2)+C(βopt, Δφ)=0. (44)

[0114] For a given ρo, Δφ, φ′o, and Amax, the optimized β is that which satisfies (44). The function F is fourth order in β, making the explicit solution of βopt very difficult to solve. However, F is nearly linear in the operating range of β. Therefore, F may be linearized and a linear approximation for βopt may be found.

[0115] The linearized equation for optimum F, approximated at βapprox,

F
(βopt)=δF/δβ(βapprox).βopt+F(βapprox), (45)

[0116] where δF/δβ is the partial derivative of F with respect to β.

[0117] As in (44), the optimum value of F is zero such that (44) is satisfied. From (44) and (45), the linearly approximated solution for optimum β is,

βopt=−F(βapprox)/(δF/δβ(βapprox)). (46)

[0118] The partial derivative of F with respect to β is,

δF/δβ=(1+(1−β)1/2−β).(−2Δφ2.(1+(1−β)1/2−8π2.(1+(1−β)1/2−β)+βπ2.(4.(1−β)1/2−1)))/(π2.(1+)1−β)1/2)5), (47)

[0119] A reasonable point from which to approximate is βapprox=0. Evaluating (47) at β equals zero,

\begin{matrix} δ F / δ β (β_{approx} = 0) = {(Δ φ / π)}^{2} \cdot (2 - 1 / (4 π^{2})) & (48 a) \\ = 0.2001 \cdot Δ φ^{2} . & (48 b) \end{matrix}

[0120] The value of F at the approximated point must be determined as well.

F(β

approx
=0)=−Amax/(ρoφ′o2)+2.(1+(Δφ/π)2). (49)

[0121] For the case where (βapprox=0),

βopt=(Amax/(ρoφ′o2)−2.(1+(Δφ/π)2))/(0.2001.Δφ2). (50)

[0122] For any predefined βapprox, the coefficients required to determine βopt may be calculated and saved a priori of the real time calculation.

[0123]
FIG. 8 is a plot of the function F versus β for various ΔΦ, from zero to π.

[0124] Because the shape of the function F over β is convex, the linearization will always over-approximate the value of β to some degree. The fact that it may only be over estimated is desirable because a larger than truly optimal β will only serve to reduce the maximum speed of angular velocity. Therefore, the maximum acceleration will never exceed Amax.

[0125] A final check is imposed on the value of βopt. If βopt is greater than βmax then βopt is set equal to βmax. Similarly, if βopt is less than βmin then βopt is set equal to βmin. Therefore, Popt satisfies (38).

βmin*βopt*βmax. (52)

[0126] 1.4 The Arc Segment Acceleration Profile for unknown ρo and Δφ

[0127] If the geometry of the arc has not been specified, the rotational displacement of the arc, Δφ, and initialarc radius, ρo, is unknown. If this is the case, Vout will be specified outside the design of the arc. For unknown Δφ, two rules apply in order to avoid violating the above acceleration constraints. First, the maximum value of Δφ must be assumed. Second, β must equal zero. With these rules in place, for any Δφ, the acceleration shape will not violate acceleration constraint one. As stated above, the acceleration shape, Ashape(t, β, Δφ), will never violate acceleration constraint one if β equals zero.

β=0 (52)

[0128] For a maximum allowable angular displacement of Δφ=π and from (52), evaluation of (33) and (34) produces,

C
(β=0, Δφ=π)=2.5, (53)

Amax=2.5 ρoφ′o2 (54)

φ′o=Amax/(2.5 Vout ) (55)

[0129] Since C is predetermined in this case, the ρo to allow for maximum acceleration may be found through the equation,

ρo=2.5Vout2/Amax. (56)

[0130] 2. Path Planning Implementation

[0131] This section describes how the path planning algorithm described theoretically in Section 1 has been implemented. Also, note that the discussion below makes the assumption that the path planning implementation is used on a robot. Nevertheless, the applicability of path planning algorithm is not exclusive to robots.

[0132] 2.1 General Description

[0133] In the current implementation, the path is a combination of line segments and sinusoidal-arc segments. The path will be specified by multiple number of points (N>=1). If the user specifies only one point then the path will be a straight line between the current position and the specified point. If two points are specified then the path will comprise of two straight-line segments and a sinusoidal-arc connecting the two line segments. For an illustration of how the path planning algorithm works see FIG. 9. This path is generated by specifying three points.

[0134] For the above example the motion starts from the point (600, 150) where 600 is the radial distance [mm] from origin and 150 is the angle in degrees from 0 (counter-clockwise). The user will specify three points to generate this path: (400, 270), (400, 0) and finally (600, 60). The starting point and the user-specified points are indicated in FIG. 9 by asterisks.

[0135] As part of the setup of the motion parameters, the user must set maximum acceleration, and maximum allowable jerk. The implementation will ensure that the path generated will reach the maximum acceleration during the sine-wave-arc, and stay within the maximum allowable jerk.

[0136] For the path to begin the arm must be at rest, or cruising at a constant velocity in a straight-line (as a result of an earlier path command). At the time of the path command, if the arm is not cruising then the new path command will be queued until the arm reaches cruise velocity (constant velocity), or until arm comes to rest.

[0137] The current implementation has the capacity to do two-dimensional path planning as described in section 1, and at the same time coordinate the move of a third axis. The third axis would typically be a Z-axis (Lift) for a robot. Thus as soon as the wafer has cleared a station the Z-axis can be commanded to move and this Z-move would be done before the arm reaches the entrance point of the next wafer station. However, note that Z-move is an independent move except that the start and end time is coordinated with the path planning move. In other words, we do not propose a three-dimensional path planning algorithm.

[0138] 2.2 Path Planning Parameters

[0139] Motion control requires that user specify parameters such as maximum acceleration, maximum velocity, etc., before the motion command is issued. Once the motion command is issued, the motion control software generates a motion profile (for position, velocity, and acceleration) that the closed loop control algorithm will attempt to track. The profiler algorithm may be S-curve or trapezoidal algorithm, where those names refer to the shape velocity profile curve. Depending on whether the velocity profile is S-curve or trapezoidal, the number of parameters needed would vary.

[0140] The same profiler parameters mentioned above would also be needed for motion along the path also. However, for specifying motion along a path we will need additional parameters. They are:

[0141] 1. Safe start and end distances (Ds, De): The motion at the start of the path and at the end is constrained to be in a straight-line for a user-specified distance. The safe start distance would make sure that when the robot arm will not start on the arc until the arm is safely out of the cassette. The safe end distance would make sure that the robot arm has finished the arc and is traveling in a straight-line as the arm is moving into the cassette. These same distances are used to denote when to start and end Z-move. These clearances for Z-move may also be defined separately from Ds and De.

[0142] 2. Singularity radius (Rs): A region around the origin (center of robot) is excluded for path planning. This is because closer the path gets to the center of the robot, greater the rotational velocity needed to achieve the motion.

[0143] 3. Maximum Jerk (Jm): Maximum allowable jerk that is allowed during the move (jerk is derivative of acceleration).

[0144] 2.3 Definition of Wafer Obstacles

[0145] Every defined wafer station will, in itself, represent an obstacle. Thus the path must have prior knowledge of these obstacles so that the obstacles can be avoided. The obstacle will be defined by specifying a center, radius, and a height (cylinder). If need arises additional shapes will be included in the future (sphere, cube, etc.). The checks for obstacles will be done at the start of the move to see if the generated path will encounter any obstacle. Also during runtime, there will be checks to see if the actual position gets “too close” to an obstacle.

[0146] 2.4 Path Feasibility

[0147] When the user issues a path command, the path generation algorithm checks for the feasibility of the path algorithm before the motion begins—so that the path can be successfully completed. The path may not be feasible for several reasons:

[0148] 1. The first point may be too close to the starting point to reach cruise velocity. The last point may be too close to the second to last point for sufficient stopping distance.

[0149] 2. User selected target positions (for defining the path) may be too close together to generate a path within the selected maximum acceleration.

[0150] 3. The path will violate the maximum allowable jerk.

[0151] 4. The path generated will run into obstacles.

[0152] 2.5 Path Generation Implementation

[0153] This section will describe the steps involved in generating the path. First we provide an overview of the steps involved. Then we provide details of the crucial steps involved.

[0154] In the example below, to simplify matters, it is assumed that user specifies only three points. See FIG. 10. Generating paths with more than three points can easily be extrapolated from this example. Once the two-dimensional path is generated, then that path will be converted into motion profiles for the motors that drive the robot. This will be explained later in Section 2.6.

[0155] Say the user has set the profiler and the path-specific parameters and issued a path command with two target positions. Here are the steps involved:

[0156] 1. The firmware checks for path feasibility. See Section 2.4 for more details.

[0157] 2. The arm accelerates towards the first target position in straight-line until the arm reaches cruise velocity. Here note that algorithm does not wait until the actual velocity reaches cruise velocity. Rather the arm waits until the profile velocity reaches cruise velocity. Closed loop control algorithms will ensure that actual velocity will track the profiled velocity within user defined error bands.

[0158] 3. After the cruise velocity has been reached, the maximum acceleration constraint would require that at a certain distance from the next target position (towards which the arm is moving) the sine-wave-arc begin. Moreover, the maximum acceleration will be reached half way through the arc.

[0159] 4. After the arc is finished the arm is traveling at cruise velocity towards the second target position.

[0160] 5. Same as step 3 above. Note that the distance (from the next target position) at which the sine-wave-arc begins may vary at each of the target positions.

[0161] 6. After the arc is finished the arm is traveling towards the final target position in a straight-line at cruise velocity.

[0162] 7. Once the arc is finished, the distance between the arm and the final target position will be greater than safe end distance (De). If this could not be achieved, an error would have been generated before the motion started.

[0163] 8. The arm comes to a complete stop by the final target position.

[0164] In the above example, it is assumed that the arm is at rest before the path command is issued. It is possible to issue a path command while the arm is in the middle of an earlier path command. The new path command would be queued until the earlier path has reached cruise velocity (or zero, i.e., stopped) and is traveling in a straight-line. The rest of the steps would be executed in a similar manner as above.

[0165] Now we will describe in more detail the crucial steps involved in the path generation. The path implementation uses the same fundamental idea described in Section 1 (combinations straight-line segments with sinusoidal arcs), with the following differences:

[0166] 1. Path algorithm uses Cartesian coordinate frame, rather than polar coordinate frame.

[0167] 2. In the write-up earlier it was assumed that p(t) and +(t) are explicit sinusoidal functions. Here y(t) is a sinusoidal function of x(t). This assumption simplifies the calculations dramatically so that real-time implementation is more readily possible.

[0168] 3. In this approach we can achieve the maximum acceleration (which means faster move times). In the approach taken in Section 1, the acceleration was only guaranteed to be under the maximum acceleration.

[0169] 4. In this approach, the maximum jerk can be easily calculated, whereas jerk was not calculated in the approach in Section 1. This will ensure that we will always stay under a user defined maximum jerk.

[0170] Say the robot arm is at rest at position (ρo, φ0), in polar coordinates with origin at the center of the robot. See FIG. 11. Say the user issues a path command with positions (ρ1, φ1) and (ρ2, φ2). As described in the steps above, the robot arm will first travel towards (ρ1, φ1) in a straight-line until the arm reaches cruise velocity. This part is straightforward to implement—break up the motion into an independent motion in ρ(or φ), and the other coordinate is dependent on the freely moving coordinate so that straight-line motion is accomplished. Once the cruise velocity is reached, say V0, we are traveling towards (ρ1, φ1) in a straight-line (this straight-line is the line connecting (ρ0, φ0) and (ρ1, φ1). Say the sine-wave-arc begins at point (X0, Y0)—here we switch to Cartesian coordinate system for convenience.

[0171] Say the sine-wave-arc begins at point (X0, Y0)—here we switch to Cartesian coordinate system for convenience. We will take this position (X0, Y0) as the origin of the Cartesian coordinate system, i.e., X0=0, Y0=0. We will describe later how to pick (X0, Y0). Let (X1, Y1) be the point on the straight-line segment connecting (ρ1, φ1) and (ρ2, φ2) where the sine-wave-arc ends. Once the arc ends at (X1, Y1) the robot arm will continue towards the final target position (ρ2, φ2) in a straight-line.

[0172] We already know the origin of our Cartesian coordinate system. Now we let us define the axes. The X-axis is the line connecting (0,0) and (X1, Y1), and the Y-axis is the line perpendicular to the X-axis. The arrows in the figure indicate the positive X and Y directions.

[0173] Now we have to find a sine-wave-arc that begins at (X0, Y0) and ends at (X1, Y1) as shown by the dotted line in FIG. 11. We make the following assumptions that restrict our range of solutions:

[0174] 1. Distance between (X1, Y1) and (ρ1, φ1) is the same as distance between (0, 0) and (ρ1, φ1).

[0175] 2. Once the sine-wave-arc is finished at (X1, Y1), the arm is moving in a straight-line at the same cruise velocity V0 towards (ρ2, φ2).

[0176] 3. The Acceleration along X-axis is zero. Or in other words that velocity along X-axis remains constant.

[0177] Once we work out the mathematics, we will know that these assumptions did not restrict us from obtaining the solution we are looking for.

[0178] Let Vx0 and Vy0 denote starting velocities along X-axis and Y-axis respectively. They can be easily calculated from the known geometry. Let the distance between (0,0) and (X1, Y1) be L. Define also the time when the arm is at (0,0) as zero.

[0179] Define position along Y-axis as a function of position along X-axis as below,

y
(t)=A sin(ωx(t)),

[0180] where ω=π/L, and A is as yet unknown. Differentiating y(t) with respect to time (to get velocity along Y-axis), and noting that x′(t)=Vxo is a constant,

y
′(t)=AωVx0 cos(ωx(t)).

[0181] From the above equation we know that at x=0, y′=Vy0. Thus,

A=V

y0
/(ωVx0).

[0182] Differentiating y′(t) with respect to time again (to get acceleration along Y-axis) and noting that x″(t)=0,

y
″(t)=−ω2A(Vx0)2 sin(ωx(t)).

[0183] From the above equations we can conclude that as x traverses from 0 to X1, the path traversed is a sinusoidal arc as shown in FIG. 11. Also, it can be concluded that acceleration is continuous all the way through. Acceleration starts from 0 at (0,0) and goes back to 0 at (X1, Y1).

[0184] Acceleration along Y-axis, y″(t) can be re-written as

y
″(t)=−ω2(Vx0)2y(t).

[0185] Clearly y(t) reaches its maximum value at the mid-point of the travel, i.e., x=L/2. Thus, the maximum acceleration along the path is

y
″max=−ω2(Vx0)2A.

[0186] Note that in calculating maximum acceleration along the path we consider only the component along Y-axis because the component along X-axis is (by design) set to zero.

[0187] From the profiler parameters we know the maximum allowable acceleration the user has set for the robot arm. Now from the above equation, and knowing that A=Vy0/(ωVx0), we can calculate the value of ω, A, and L. Once we know the value of L, we know at what point the sine-wave-arc should begin.

[0188] As an aside, Jerk can be calculated as

y
′″(t)=−ω3A(V Vx0)3 cos(ωx(t)).

[0189] From the above equation it can be seen that jerk is discontinuous at the start and end of the sine-wave-arc. However, the magnitude of the maximum jerk is

y
′″max=−ω3A(Vx0)3,

[0190] which can be re-written as

y′″

max

=Aωy″

max

=y″

max

V

y0/Vx

0
.

[0191] From the above equations, we can see that the maximum jerk is achieved at the beginning and at the end of the sine-wave-arc. More importantly, once the user picks the maximum acceleration and cruise velocity, the maximum jerk is automatically determined. Consequently, although we can make sure that we achieve the maximum acceleration during the arc, we can only ensure that we stay under a maximum allowable jerk y′″max.

[0192] Also note that Vy0/Vx0 is the slope of the straight-line connecting (ρ0, ω0) and (ρ1, Φ1) with respect to the Cartesian coordinate frame X-Y. These slopes (one for each sine-wave-arc) are fixed once the user picks the target positions. Thus, for a given move the maximum allowable jerk is exceeded, the user has three different options:

[0193] 1. Lower the maximum acceleration.

[0194] 2. Increase the angle between straight-line segment (i.e., angle between line from (ρ0, φ1) to (ρ1, φ1) and line from (ρ1, φ1) to (ρ2, φ2) in FIG. 11) at the target position where the maximum jerk is violated.

[0195] In other words, once the user picks the maximum acceleration, the maximum angle between straight-line segments connecting intermediate target positions are constrained to be under a certain pre-computed value.

[0196] 2.6 Robot Motion Control

[0197] The path motion profile (path position, path velocity, path acceleration) is calculated in real-time (every 0.5 milliseconds). As each point in the path motion profile is calculated, that information is translated into the position, velocity, and acceleration of the motors that drive the robot. This translation is also done in real-time (every 0.5 milliseconds). Once the motion profiles for the motors are calculated that information is used to control the motors in real-time (every 0.5 milliseconds) in closed loop so that the actual position, velocity, and acceleration of the robot arm tracks the path generated by the path planning algorithm.

[0198] Although a preferred embodiment of the present invention has been described above, it will be appreciated that certain modifications or alterations thereon will be apparent to those skilled in the art. It is therefore requested that the appended claims be interpreted as covering all such alterations and modifications that fall within the true spirit and scope of the invention.

System of path planning for robotic manipulators based on maximum acceleration and finite jerk constraints

Information

Publication Number

Date Filed

Date Published

Inventors

CPC

US Classifications

International Classifications

Abstract

Description

Claims

Parent Case Info

Provisional Applications (1)