The present invention relates generally to manned or unmanned omni-directional, normal-wheeled vehicles. More precisely, this invention involves a method and apparatus for controlling the motion of mobile base used as a vehicle.
Mobile bases with intended applications in robotics and industrial automation require a great deal of movement flexibility in order to be fully utilized. Current robot mobile bases often employ a “synchro-drive” mechanism—a complex set of gears and pulleys that constrains the wheels to steer and to translate simultaneously. Since steering and translation movement is fully decoupled in this system, “steering in place” is possible. (Contrast this maneuverability with that of a car.) While this allows a good deal of maneuverability, its mechanical complexity makes it difficult and expensive to manufacture. Additionally, this type of mobile base has limited movement due to its fixed orientation (i.e. its inability to rotate).
In general, a rigid body constrained to move in a plane (i.e. a mobile base moving on the floor) has three degrees of freedom (DOFs) such as, movement in the x direction, movement in the y direction and rotation. Combining these three DOFs results in movement in any direction while simultaneously rotating.
A holonomic mobile base, has the ability move in this manner and change its motion at any time. By constructing a mobile base out of wheels that each have two degrees of freedom (one for steering, one for translation) all three DOFs are possible under the proper control, and complex mechanisms found in synchro-drive mobile bases are no longer needed. Additionally, these 2-DOF wheels (2-DOFWs) can be easily integrated and manufactured as modular wheel assemblies. A complete description of one example of a robot base and modular wheel assembly is provided by U.S. patent application Ser. No. 09/134,241, by Holmberg et al., incorporated herein by reference.
It is also possible to increase the “caster” of a 2-DOFW by moving the translation axis behind the steering axis (
Various problems arise, however, when trying to control a mobile base constrained to three DOFs with more than three controllable DOFs (e.g. a base with four 2-DOFWs has eight DOFs). A base with this many DOFs under improper control will certainly result in undesired motion and motor axes that “fight” each other. (i.e. consider two wheels facing opposite directions playing tug-of-war.)
This in turn creates wheel slippage, increased tire wear, increased power consumption, and more frequent mechanical problems.
It is considered important in robotics to be able to accurately assess the motion of the mobile base either through direct measurement or through estimation. This motion estimation can also be “summed-up” over time to create a “dead reckoned” position estimate of the mobile base with respect to fixed coordinates, which is also useful for autonomous tasks such as navigation. That is, consider a robot that wishes to navigate to a location (room) of which it knows the x-y coordinates. Motion estimation is also responsible for proper control of the mobile base, as will be described below. A control algorithm which minimizes wheel slippage will also allow for maximum motion estimation accuracy.
The present invention overcomes the deficiencies in the prior art described above, and provides motion control for a mobile robot base that is more accurate and more maneuverable Referring to FIG. 3 and the Detailed Description of the Preferred Embodiments, an overview of the inventive control sequence is provided in the following paragraph.
A supervisory controller reads the input vector from a host processor, and maps the input vector to the desired axis motion vector (i.e. the desired motion of each axis) by using the equations in Section 2 below. It then predicts if the axes are capable of the desired motion by calculating their control envelopes (i.e. the motion possible within one control cycle Δt.) as described in Section 3. If all axes are capable of the desired motion within one control cycle the desired axis motion vector is passed to the low-level controller. If one or more axes are incapable of the desired motion, a modified axis motion vector is calculated as described in Section 4 and passed to the low-level controller. The modified axis motion vector lies within the control envelopes of all 2N axes while minimizing control error (i.e. the difference between the commanded input vector and the actual base motion.) The control algorithm then estimates the motion of the mobile base since the last control cycle using the technique described in Section 5. The estimated motion is then used to update the position and orientation [xB,yB,ψB]T of the base coordinate frame in the fixed world coordinate frame as described also in Section 5. The updated position and orientation is then made available for the host processor to read. The control algorithm then repeats the whole process by beginning another control cycle.
Section l—Overview of the Control Algorithm
Referring to Table 1, a description of notations and variables used herein is provided.
Referring to
Referring to
The control algorithm is optimal in that it controls the 2N axes such that the mobile base moves as commanded by the input vector as accurately and as quickly as possible within the physical limits of the motors.
For example, if a motor is commanded beyond what it is physically capable of (i.e. it is commanded beyond its “saturation point”) while other motors are commanded to within their physical limits, wheel slippage occurs. The control algorithm is able to predict this situation and correct it before it occurs. It accomplishes this by anticipating velocity or torque and saturation points with working models of each motor axis. Thus, the control algorithm simultaneously minimizes wheel slippage and minimizes the difference between desired motion specified by the input vector and actual mobile base motion (motion error).
Section 2—Mapping the Input Vector to the Desired Axis Motion Vector
This determines the axis motion vector (AMV), {right arrow over (m)}a, which is the motion required at each 2-DOFW and the corresponding motion at each axis such that the mobile base moves according to the commanded input vector (i.e. [{dot over (x)}d,{dot over (y)}d,{dot over (ψ)}d]T). Thus, the mapping is from 3 to 2N. It is accomplished by first calculating the desired velocity to each wheel attachment point as below. The desired wheel velocity for each wheel is expressed as a 2-vector [{dot over (x)}dWi,{dot over (y)}dWi]T in base coordinates (FIG. 4). (∀i: 1≦i≦N)(i.e. for all wheels i):
{dot over (x)}dWi={dot over (x)}d−ywi{dot over (ψ)}d
{dot over (y)}dWi={dot over (y)}d+xwi{dot over (ψ)}d
where the [xWi, yWi]T are the Cartesian coordinates of the wheel attachment point of each 2-DOFW i to the base in base coordinates (m, m).
The steering angle (θmWi) for each 2-DOFW is measured based on the raw measured encoder value of the steering axis (smWi) and the encoder pitch (σWi):
and will be used in many of the following calculations.
These desired wheel velocities are then mapped to the two axes of the 2-DOFW. For 2-DOFWs with no caster (cWi=0) the desired steering axis position and desired translation axis velocity [sdWi, {dot over (t)}dWi] are calculated for each 2-DOFW as follows:
θdWi=arctan 2({dot over (y)}dWi,{dot over (x)}dWi)
{dot over (μ)}dWi=√{square root over({dot over (x)})}dWi2+{dot over (y)}dWi2
sdWi=σWiθdWi
with
{right arrow over (m)}a=[sdW1,{dot over (t)}dW1, . . . ,sdWi,{dot over (t)}dWi, . . . ,sdWN,{dot over (t)}dWN]T
where
When using a velocity based low level controller for 2-DOFWs with caster (cWi≠0) the desired steering axis velocity and desired translation axis velocity [{dot over (s)}dWi,{dot over (t)}dWi] are calculated for each 2-DOFW as below.
with
{right arrow over (m)}a=[{dot over (s)}dW1,{dot over (t)}dW1, . . . ,{dot over (s)}dWi,{dot over (t)}dWi, . . . ,{dot over (s)}dWN,{dot over (t)}dWN]T
where
When using a torque based low level controller for 2-DOFWs with caster (cWi≠0) the desired steering axis torque and desired translation axis torque [γdWi,ρdWi]T are calculated for each 2-DOFW as below. First, gather coefficients of the base velocities from the previous equations used in the development of the velocity controller into the constraint matrix, C. The constraint matrix is defined by the ideal kinematic relationship:
{right arrow over (m)}a=C{right arrow over (m)}x
where {right arrow over (m)}a is the motion axis vector and {right arrow over (m)}x is the actual mobile base motion. The constraint matrix for the preferred embodiment is:
Calculate, Cf#, the force projection matrix, a generalized left inverse of C. Any generalized left inverse will work. By judicious choice of a particular Cf#various behaviors can be implemented. An example which is particularly useful is:
Cf#=(CTC)−1CT
which minimizes, in a least squares way, the axis torques. The axis motion vector containing the desired steering axis torque and desired translation axis torque [γdWi,ρdWi]T is then:
{right arrow over (m)}a=Cf#
where {right arrow over (m)}d is the 3-DOF force torque input vector. For control of a base with a known dynamic model, one can dynamically decouple the undesired forces by calculating the axis torques with the following expression:
{right arrow over (m)}a=Cf#
where {right arrow over (m)}d is the 3 DOF acceleration input vector and
{right arrow over (m)}a=[γdW1,ρdW1, . . . ,γdWi,ρdWi, . . . ,γdWN,ρdWN]T
are the axis torques.
When controlling the base in 3 DOF it is desirable to eliminate or greatly reduce the undesired motion of the vehicle due to the dynamic effects of the various motions of the 2-DOFWs. This can be accomplished by using Λ and μ in the above equations as found from the dynamic model of the base. It is well understood by those skilled in the art that the dynamic model, that is defined by the dynamic equations of a system (base) can be found and written as:
F=Λ{umlaut over (x)}+μ
where F is the 3 DOF linear and rotational force on the base, Λ is the mass matrix, {umlaut over (x)} is the acceleration of the base in 3DOF, and μ is the centripetal, coriolis, and gravity vector. It is possible to control a base with unknown dynamics by using an estimate of the dynamic parameters such as:
but the base will not produce the desired motion as closely as when the values of the dynamic parameters for the actual base are used.
Thus, by concatenating all N wheel motion pairs described above, we create a desired axis motion vector which is 2N in length.
Section 3—Calculating the Control Envelopes
The control envelope for an axis describes the possible motion an axis can perform within a fixed time. For a 2-DOFW i with no caster (cWi=0) we must calculate the steering axis position lower and upper bounds (slWi and suWi) and the translation axis velocity lower and upper bounds ({dot over (t)}lWi and {dot over (t)}uWi). First, calculating the steering position lower bound, we assume that the axis should move based on a value proportional to the error (sdWi-smWi) scaled by gain value (kp) minus a small tolerance (es) or based on the maximum (negative) acceleration possible for the steering axis ({umlaut over (s)}max Wi) (the measured position and velocity (smWi and {dot over (s)}mWi) are required to calculate the position as a result of maximum acceleration), whichever is greater:
slWi=max(smWi+kp(sdWi−smWi)−es,smWi+{dot over (s)}mWiΔt−½{umlaut over (s)}max WiΔt2)
Calculating the upper bound, we similarly assume the axis should move based on a value proportional to the error scaled by a gain value plus a small tolerance or based on the maximum (positive) acceleration, whichever is lesser.
suWi=min(smWi+kp(sdWi−smWi)+es,smWi+{dot over (s)}mWiΔt+½{umlaut over (s)}max WiΔt2)
Calculating the lower bound of the translation axis velocity, we assume the control envelope is determined by either maximum (negative) acceleration, or by the maximum possible (negative) velocity of the translation axis ({dot over (t)}max Wi), whichever is greater.
{dot over (t)}lWi=max({dot over (t)}mWi−{umlaut over (t)}max WiΔt, −{dot over (t)}max Wi)
Calculating the upper bound, we similarly assume the control envelope is determined by either the maximum (positive) acceleration, or by the maximum possible (positive) velocity of the translation axis, whichever is lesser.
{dot over (t)}uWi=min({dot over (t)}mWi+{umlaut over (t)}max WiΔt, {dot over (t)}max Wi)
Once these values have been determined, the desired motion [sdWi,{dot over (t)}dWi] lies within the control envelope for Δt time duration if and only if
sdWi≧slWi and sdWi≦smWi
or
sdWi≦suWi and sdWi≧smWi
For a 2-DOFW i with caster (cWi≠0) when a velocity based low level controller is used, we must calculate the steering axis velocity lower and upper bounds (slWiand suWi) and translation axis velocity lower and upper bounds ({dot over (t)}lWi and {dot over (t)}uWi) Calculating the lower bound of the steering axis velocity, we assume the control envelope is determined by either maximum (negative) acceleration ({umlaut over (s)}max Wi), or by the maximum possible (negative) velocity of the translation axis ({dot over (s)}max Wi), whichever is greater.
{dot over (s)}lWi=max({dot over (s)}mWi−{umlaut over (s)}max WiΔt, −{dot over (s)}max Wi)
Calculating the upper bound, we similarly assume the control envelope is determined by either the maximum (positive) acceleration, or by the maximum possible (positive) velocity of the steering axis, whichever is lesser.
{dot over (s)}uWi=min({dot over (s)}mWi+{umlaut over (s)}max WiΔt, {dot over (s)}max Wi)
Calculating the translation velocity lower and upper bounds is the same for 2-DOFWs with caster.
{dot over (t)}lWi=max({dot over (t)}mWi−{umlaut over (t)}max WiΔt, −{dot over (t)}max Wi)
{dot over (t)}uWi=min({dot over (t)}mWi+{umlaut over (t)}max WiΔt, {dot over (t)}max Wi)
Once these values have been determined, the desired motion [{dot over (s)}dWi,{dot over (t)}dWi] lies within the control envelope for Δt time duration if and only if
{dot over (s)}lWi≦{dot over (s)}dWi≦{dot over (s)}uWi
and
{dot over (t)}lWi≦{dot over (t)}dWi≦{dot over (t)}uWi
For a 2-DOFW i with caster (cWi≠0), when a torque based low level controller is used, we must determine if the motion input vector ({right arrow over (m)}d) is within the upper bound of the actuator torque (γuWi,ρuWi) and the lower bound of the actuator torque (γlWi,ρlWi):
γlWi≦γdWi≦γuWi
ρlWi≦ρdWi≦ρuWi
Thus we can determine for a given increment in time (Δt) the possible motion for each axis (control envelope) of each 2-DOFW, and for a given axis motion vector, whether it lies within the control envelopes.
Section 4—Calculating the Modified Axis Motion Vector
We describe an algorithm that can be applied when the desired axis motion vector mapped from the input vector does not lie within the control envelopes of all axes. Given a desired base motion input vector ({right arrow over (m)}d) and a current estimated base motion vector ({right arrow over (m)}e) (calculated in Section 5) we can determine a modified motion vector that is closest to the desired input vector while staying within the control envelopes of all axes.
When a velocity based low level controller is used, we begin by defining a parametric line ml(λ) as a function of λ, which varies between 0 and 1:
{right arrow over (m)}l(λ)=λ({right arrow over (m)}d−{right arrow over (m)}e)+{right arrow over (m)}e
0≦λ≦1
Evaluating ml(0) results in me, which is the current base motion vector. Evaluating ml(1) results in {right arrow over (m)}d, which is the desired input vector. Thus, we define an algorithm that finds a value of λ whose ml(λ) mapping is closest to the desired input vector and lies within the control envelopes when mapped to the axis motion vector. The basic idea is to increment λ by a small amount (δ) until the mapping of ml(λ) to the axis motion vector lies within the control envelopes. This becomes the modified axis motion vector.
When a torque based low level controller is used, we again begin by defining a parametric line ml(λ) as a function of λ, which varies between 0 and 1, where now:
{right arrow over (m)}l(λ)=λ{right arrow over (m)}d
0≦λ≦1
Evaluating ml(0) results in zero torque command such that the base continues its current base motion vector. Evaluating ml(1) results in {right arrow over (m)}d, which is the desired input vector. Thus, we define an algorithm that finds a value of λ whose ml(λ) mapping is closest to the desired input vector and lies within the control envelopes when mapped to the axis motion vector. The basic idea is to increment λ by a small amount (δ) until the mapping of ml(λ) to the axis motion vector lies within the control envelopes. This becomes the modified axis motion vector.
Note, there are many possible ways to implement the same algorithm. This method is presented because of its simplicity.
Section 5—Estimating the Motion of the Mobile Base
Here, we describe how to estimate the motion of the base during the discrete time interval Δt. First, we calculate the new apparent wheel positions with respect to the base coordinates. These new coordinates are expressed as xWi′ and yWi′ for wheel: i. For wheels with no caster (cWi≠0), we begin by calculating the measured steering angle as in Section 1:
We proceed by calculating the measured translation distance (ΔtmWi) since the beginning of the previous control cycle:
ΔtmWi=(tmWi−′tmWi)
Here, we introduce ′tmWi which is the measured translation axis position at the beginning of the previous control cycle expressed in encoders. The apparent wheel positions are then simply the wheel positions in base coordinates (xWi and yWi) plus the calculated motion:
For wheels with caster (cWi≠0), we similarly calculate the steering angle, θmWi, and the apparent wheel motion as a result of the translation axis, ΔtmWi. However, because of the caster offset, steering motion results in apparent wheel motion as well. Here we introduce ′smWi which is the measured steering axis position at the beginning of the previous control cycle expressed in encoders:
ΔsmWi=(smWi−′smWi)
The apparent wheel motion is then calculated by a rotation with respect to the steer angle:
We then use the apparent wheel motion to calculate the amount of base rotation Δψe since the last control cycle. We do this by calculating the rotation for each possible wheel pair and averaging the results:
M=C(N,2)
The above equation is summed over all possible wheel pairs j, k. That is, there are C(N,2) (N choose 2 combinatorial) possible wheel combinations.
Since the position of a mobile base having only two wheels (i.e. N=2) can be estimated with feedback from only three of its four motion axes (the fourth one being redundant), there are many other ways to estimate the motion of the base. The preceding formula can be used for bases having only two wheels, but there will only be one wheel pair to “average.” As the number of wheels used on a mobile base goes up (i.e. as N increases), the better the above estimation algorithm gets.
We now calculate the change in x and y coordinates (Δxe and Δye) by evaluating the following equations:
The estimated base motion vector can be calculated by dividing by the time increment Δt:
{right arrow over (m)}e=1/Δt [Δxe,Δye,Δψe]T
A similar method to calculate mi, which directly averages the measured readings with a more compact notation, uses the matrix, C, introduced above:
{right arrow over (m)}e=1/Δt Cx#[ΔsmW1,ΔtmWi, . . . ,ΔsmWi,ΔtmWi, . . . ,ΔsmWN,ΔtmWN]T
where Cx#, the velocity estimation matrix, is a generalized left inverse of C. Any generalized left inverse will work. By judicious choice of a particular Cx# various behaviors can be implemented. An example which is particularly useful is:
Cx#=(CTC)−1CT
which minimizes, in a least squares way, the difference in the measured motion of the axis sensors and the motion of axis sensors on an ideal model of the PCV which perfectly obeys the velocity relationship described by C.
The final step in motion estimation is determining the “summed-up” position of the mobile base in fixed world coordinates. This is accomplished by adding the rotation angle change ΔψeB to the existing angle estimate(ψeB). Similarly XeB and yeB are calculated by adding to the existing estimates the rotated change in x and y coordinates with respect to ψeB:
ψeB=ψeB+Δψe
xeB=xeB+Δxe cos(ψeB)−Δye sin(ψeB)
yeB=yeB+Δye cos(ψeB)−Δxe sin(ψeB)
Section 6—Summary
The present invention, as described above, provides a method and apparatus for controlling the motion of a mobile base with increased accuracy and maneuverability. In its preferred embodiment, the present invention is used on a mobile robot base having three wheels each with a predetermined amount of caster. The mobile robot is controlled by an off-board host processor (as shown in
The host processor and supervisory controller are preferably microprocessors that are commonly used for embedded control. Propriety software code is written preferably in C programming language to implement the inventive control method on the microprocessors and low level controllers.
The inventive method and apparatus can be utilized with other configurations (not shown), such as on drive systems for forklifts or automated guided vehicles (AGV's.) Also, the mobile base described above can be inverted with the positions of the mobile base and the surface it rolls on transposed. In other words, two degree of freedom wheels can be mounted pointed upward on a stationary base, and can translate and rotate a horizontal surface resting on the wheels. In another possible application (not shown), multiple bases, each having single or multiple wheels, can be pivotably linked together in a snake-fashion to form a non-rigid base which is controlled by the inventive method.
The above descriptions and drawings are for illustrative purposes only, and are not exhaustive of possible alternate embodiments of the invention. It is to be understood that the present invention is not limited to the sole embodiments described above and illustrated herein, but encompasses any and all variations falling within the scope of the appended claims.
This is a continuation-in-part of international application number PCT/US97/15605, filed on Sep. 5, 1997, which claims a priority of U.S. provisional application Ser. No. 60/025,406, filed on Sep. 6, 1996.
Number | Name | Date | Kind |
---|---|---|---|
4484294 | Noss | Nov 1984 | A |
4594671 | Sugimoto et al. | Jun 1986 | A |
4657104 | Holland | Apr 1987 | A |
4882528 | Sogabe et al. | Nov 1989 | A |
4925312 | Onaga et al. | May 1990 | A |
4967869 | Nagaoka et al. | Nov 1990 | A |
5101472 | Repperger | Mar 1992 | A |
5374879 | Pin et al. | Dec 1994 | A |
5426722 | Batchelder | Jun 1995 | A |
5559696 | Borenstein | Sep 1996 | A |
5568030 | Nishikawa et al. | Oct 1996 | A |
5576947 | Wienkop | Nov 1996 | A |
5719762 | Kanayama | Feb 1998 | A |
5739657 | Takayama et al. | Apr 1998 | A |
5764014 | Jakeway et al. | Jun 1998 | A |
5767648 | Morel et al. | Jun 1998 | A |
5794166 | Bauer et al. | Aug 1998 | A |
5796927 | Hegg | Aug 1998 | A |
5924512 | Wada | Jul 1999 | A |
Number | Date | Country | |
---|---|---|---|
60025406 | Sep 1996 | US |
Number | Date | Country | |
---|---|---|---|
Parent | PCTUS97/15605 | Sep 1997 | US |
Child | 09263163 | US |