This invention relates generally to a method for calibrating and adapting gearshift controllers in automatic transmissions and, more specifically, to a model-based learning method for automating the calibration effort and procedures for adopting this calibration method for online adaptation.
The calibration of transmission controllers in a controlled lab environment instead of a test track represents front-loading of the calibration effort, as the time and effort spent by a calibration engineer in the vehicle on a test track is dramatically reduced in this method of calibration. Such methods allow calibration of transmission controllers before integration of the transmission with the engine and other vehicle systems. Front loading of the calibration effort is often done using transmission dynamometers (and sometimes chassis dynamometers), where gearshifts can be commanded at different operating conditions in a controlled and automated manner.
Minimally, a dynamometer under electronic control for scheduling a preplanned sequence of gearshifts is required for automated calibration of gearshift controllers. The dynamometer can either be a transmission or chassis dynamometer. If done on a chassis dynamometer, typically, the mechanism of securing the vehicle to the ground has a load cell for measuring the vehicle acceleration during a gearshift, which is used for objective evaluation of the shift. In one available automated calibration method, the test plans generated by a calibration engineer using design-of-experiments (DoE) approaches are preprogrammed into the dynamometer and using the vehicle sensor data acquired during this automated testing, the calibration parameters, better known as calibration labels, are optimized post-testing for all the allowed gearshifts at different operating conditions. A typical DoE approach involves conducting a gearshift at different control inputs, and choosing the optimum based on objectively evaluated (such as on a scale of 1 to 10) performance indices such as shift spontaneity and shift comfort, collectively represented as shift-quality.
Automatic transmissions with 8, 9, and 10 speeds require much more calibration effort as compared to older transmissions with 4-5 speeds, as the total number of legal/allowed gearshifts increases steeply. For example, a 10-speed GMTM transmission allowing 26 gearshifts requires 22,000 calibration labels as opposed to 800 calibration labels required by a 4-speed transmission that allows 6 gearshifts. While some of these labels are scalar values, others are two-dimensional look-up tables with multiple values. As described, a typical DOE approach involves conducting a gearshift at different control inputs, resulting in the large number of gearshifts required for the automated calibration of gearshift controllers in transmissions with a greater number of transmission speeds.
The DoE-based calibration method is essentially a combination of modeling (system identification) and optimization (using the identified model), implying that the method used for initial (factory) calibration of a transmission controller cannot be used for online adaptation during normal driving, as a model of the system that changes over time due to wear and use is impossible to generate online using DoE approaches. This aspect of the DoE-based calibration approach requires additional calibration effort for tuning of the adaptive routines that learn the system behavior, and correct for the changed behavior, over a sequence of gearshifts.
In automatic transmissions, a set of offgoing clutches are released (or disengaged) and another set of oncoming clutches are engaged during gearshifts. As a special case, in clutch-to-clutch gearshifts, one clutch is released, and another one is engaged. Typically, the hand-off between the set of offgoing clutches and oncoming clutches is controlled in different phases. Each phase is controlled using a set of gearshift control parameters that should be tuned to achieve the desired control objective during that phase. Control performance in a particular phase, in addition to depending on the gearshift control parameters of that phase, also depends on the gearshift control parameters of the preceding phases. In published PCT application WO 2020/117935A1 titled “Method for Automated Calibration and Adaptation of Automatic Transmission Controllers”, the inventors proposed a sequential phase-by-phase method for calibrating and adapting gearshift control parameters, wherein for a sequence of gearshifts performed on a dynamometer repetitively, performance of the control parameters determining the gearshift response during a particular phase (or control objective satisfaction in that phase) is first checked for each gearshift in the sequence of gearshifts performed after every repetition, which if found satisfactory, the check is performed for the next phase, and if not found satisfactory, the control parameters for that phase are updated (or corrected). The process of check-and-update is repeated till all the control parameters for each gearshift in the sequence of gearshifts performed are iteratively learned, resulting in good gearshift response of each gearshift in the sequence of gearshifts performed. This sequential method of gearshift calibration and adaptation, while being suitable for the application of adaptation, may require a greater number of gearshifts to be conducted for automated calibration of gearshift controllers.
Known automated calibration and online adaptation of gearshift controllers indicate that state-of-the-art techniques for automated calibration relies heavily on DoE based approaches, and for online adaptation, on rule-based adaptive policies.
What is needed is a model-based learning approach that simultaneously learns all the gearshift control parameters, resulting in an automated calibration procedure requiring a substantially lower number of gearshifts for transmission control calibration and adaptation.
To these and other ends, in one embodiment, the invention includes a method for automated calibration of a gearshift controller in an automatic transmission having one or more speed sensors, each configured to generate a signal, and allowing one or more gearshifts with associated gearshift output sets ji that are functions of the speed sensor signals and desired gearshift output sets ∞i, the gearshift controller having one or more gearshift control parameter sets Urji to be calibrated, each set including gearshift control parameters for an allowed gearshift at one operating condition, and learning controllers Li, sets Hi of system models Hi, and positive definite matrices Pi for updating Urji during sequences of allowed gearshifts, the method comprising:
In another embodiment, the invention includes a method for adaptation of a gearshift controller in an automatic transmission having one or more speed sensors, each configured to generate a signal, and allowing one or more gearshifts with associated gearshift output sets ji that are functions of speed sensor signals and desired gearshift output sets ∞i, the gearshift controller having one or more gearshift control parameter sets Urji for control of the allowed gearshifts during vehicle operation and stored in look-up tables as functions of one or more operating conditions i, and learning controllers Li, Hi sets of system models Hi, and positive definite matrices Pi for updating Urji during a sequence of allowed gearshifts, the sequence of the allowed gearshift occurring at operating conditions j, that are same or different than i, the method comprising:
Other embodiments in accordance with the invention are described below.
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and, with a detailed description of the embodiments given below, serve to explain the principles of the invention.
With continued reference to
One embodiment of the invention will be described using an example of a power-on upshift, and directions will be given to adopt that example to other types of gearshifts.
At the initiation of a power-on upshift, the oncoming clutch is filled with transmission fluid and the clutch piston stroked, reducing the clearance between the plates of the clutch pack to zero, and marking the end of the fill phase. The moment at which the clearance between the clutch plates reduces to zero, or the plates kiss, is called the kiss point. The oncoming clutch starts transmitting torque after the kiss point, which marks the beginning of the torque phase. With reference to
Following the clutch fill phase, the transmission system enters the torque phase, where the oncoming clutch pressure command is ramped-up to a pressure p3 in t3 time units, transferring the load from the offgoing to the oncoming clutch. This is shown by the decreasing offgoing clutch torque 56 during the torque phase, where because load is transferred from the path of higher gear ratio to one with a lower gear ratio, the driveshaft torque 47, 48 drops if the turbine torque is relatively unchanged 45, 46, as shown in
During the inertia phase, the oncoming clutch pressure command 49 is further increased to p4 in t4 time units, which increases the driveshaft torque 47 and decelerates the engine, resulting in a decrease of engine speed 44, as shown in
As part of the method, the offgoing clutch control is assumed calibrated, resulting in reduction of the offgoing clutch torque capacity 55 according to a prescribed set of rates. Using the method for automated calibration and online adaptation, the oncoming clutch and engine torque control parameters are iteratively learned to coordinate with this offgoing clutch control resulting in gearshifts of higher quality. More specifically, the control parameters specifying the commanded oncoming clutch pressure and engine torque trajectories, p1-p4, Tδ, and t1-t4, are iteratively learned using a model-based learning technique.
The automated calibration method that simultaneously calibrates all the control. parameters of a gearshift is explained here using the example of power-on upshifts, however, extensions to other types of gearshifts such as power-off upshifts, power-on downshifts, and power-off downshifts will be clear to someone skilled in the art. It is customary to calibrate the fill phase control parameters p1 and p2 separate from, and prior to, the calibration to torque and inertia phase control parameters—p3 and p4. Thus, in what follows, simultaneous calibration method of p3 and p4 will be described.
A reduced order model of the powertrain during the torque and inertia phases of a 1-2 power-on upshift is developed for control design, described in equations (1) and (2), with the following assumptions. First, the torque converter clutch is assumed to be locked. Second, the oncoming clutch hydraulic system is modeled for purpose of learning control design as a first order linear system described by the steady state gain Konc and time-constant τone. Third, the output inertia is assumed to be small and the driveline is assumed to be rigid. Fourth, the change in vehicle speed is assumed to be zero during the gearshift. Fifth, the longitudinal slip of the powered wheels is assumed to be zero. Under these assumptions, the resulting control-oriented powertrain models during the torque and inertia phases are described in (1) and (2) respectively, where ΔTs, ΔPoncc, and ωonc denote the change in the driveshaft torque—the output to be controlled during the torque phase, the change in the oncoming clutch pressure command—the control input, and the oncoming clutch slip speed—the output to be controlled during the inertia phase, respectively. The change in the driveshaft torque over the torque phase, and change of oncoming clutch slip speed during the inertia phase constitutes the gearshift output set =[ΔTsωonc]T. The goal of automated calibration and adaptation during operation is to learn the control parameters such that converges to *, the desired gearshift output set. The parameters Ie, It, be, r1, r2, and rd denote the engine inertia, turbine inertia, engine damping coefficient, first gear ratio, second gear ratio, and final drive ratio respectively. The changes in the driveshaft torque and oncoming clutch pressure command are computed with respect to their values at the start of the torque phase. The reduced order models (1) and (2) will be used to compute learning controllers for the automated calibration of gearshift controller parameters.
A model-based iterative learning method is now described for automating the calibration of gearshift controllers. The idea involves using an electronically controlled dynamometer for automatically executing a gearshift repeatedly, and iteratively learning the required feedforward control parameters. More specifically, for every allowed gear ratio transition, the gearshift is performed at multiple operating conditions of vehicle speed and engine torque repeatedly and, using the learning controller computed via the design methods presented herein, iterative tuning of the control parameters stored in look-up tables is performed automatically.
Iterative learning control is a model-based learning method that uses simple learning controllers computed via simple and potentially inaccurate models of the underlying systems. The hybrid nature of the gearshifting process and shape-constraints on the control input resulting from the use of look-up tables are two challenges in the application of iterative learning control (ILC) for gearshift control calibration. The inventors have extended the theory of ILC to hybrid systems, which, in conjunction with the formulation of ILC for systems with shape-constrained control inputs used here, are used in this invention to compute learning controllers for the automated calibration and adaptation of gearshift controllers.
As the task of output trajectory tracking is best described by an input-output model of the underlying physical system, the super-vector approach of system representation that allows the treatment of an essentially two-dimensional system in the time and trial domains as a one-dimensional system (in lifted form) in the trial domain are used. A discrete-time (DT) SISO linear system during the jth trial of length N corresponding to the sampling time step ts and trial duration T is represented in lifted form as yi=Huj+D, where the DT input and output trajectories yi and ui are represented as N-dimensional vectors, known as super-vectors, the (causal) input-output model is represented by a lower-triangular matrix H, which is Toeplitz (see equation (3)), if the underlying system is time-invariant, and D represents the contribution of initial condition x0 to the system output yi. The matrix H is commonly referred to as the Markov matrix. The Markov matrix His made up of DT finite impulse response of the underlying linear time-invariant system represented by the DT triplet (C,A,B), i.e., h1=CB, h2=CAB . . . hN=CAN−1B with h1≠0.
A lifted form representation of a class of hybrid systems described by a set of trial-invariant DT linear time-invariant state space realizations (Ci, Ai, Bi), i=1 . . . m, and corresponding input-output dependent switching rules determining the transition of system output from one linear vector field to another, is described in equations (4)-(8), where j the hybrid Markov matrix, Uj and Yj denote the DT input and output trajectories during the jth trial respectively, Dj represents the contribution of non-zero initial conditions to the system output Yj, yij, uij, i=1 . . . m, nij denote the DT durations for which the underlying hybrid system is represented by ith mode, Hij represent the Markov matrices for (Ci,Ai,Bi), Hpij, p=2 . . . m, l=1 . . . p−1, and the matrix operator k [ ] denotes the kth row of its argument, k=1 . . . npj. Owing to the assumption of input-output dependent switching rules, nij are trial-varying, which implies that j and Dj are trial-varying.
A lifted form representation of the powertrain during the torque and inertia phases, a hybrid system with two modes, m=2, is developed using the powertrain models described in (1) and (2), the continuous-time state-space realizations for which are denoted by the triplets (C1c, A1c, B1c) and (C2c, A2c, B2c) respectively, and described in equations (9) and (10) respectively. The lifted form representation is a hybrid Markov matrix that is computed using equations (4)-(8).
The switching occurs in the A-matrix, resulting from the release of the offgoing clutch, and in the C-matrix, resulting from the change in the system output to be controlled. The hybrid Markov matrix j is N times N, where N denotes the sum of the desired durations of the torque and inertia phases, maps the change in oncoming clutch pressure command [ΔPoncc(1)ΔPoncc(2) . . . ΔPoncc(N)]T=Uj to the change in driveshaft torque [ΔTs(1)ΔTs(2) . . . ΔTs(N1j)]T=Y1j during the torque phase (mode index 1) and oncoming clutch slip speed [ωonc(1)ωonc(2) . . . ωonc(N)]T=Uj(Nj−N1j)]=Y2i during inertia phase (mode index 2) of the jth gearshift (trial). Here, N1i denotes the switching time instant at which the powertrain switches from the torque to the inertia phase, and Nj denotes the sum of the durations of the torque and inertia phases during the jth gearshift. Let Yj=[Y1jTY2jT]T. An early termination of gearshifts, i.e., Nj<N, is possible, for example, for power-on upshifts, excessive oncoming clutch pressure command levels in the inertia phase during iterative learning may result in abrupt clutch lock-up and a shortened trial duration. For gearshifts with shortened durations, the rows and columns of the corresponding hybrid Markov matrix j with indices greater than Nj are set equal to zero, and N−Nj zeros are added to the measured output trajectory so that Yj is N-dimensional. The desired outputs during the torque and inertia phases are denoted by Y1∞ and Y2∞ respectively, the concatenation of which is denoted by the desired trajectory Y∞, and the tracking error Ej=Y∞−Yj.
The desired time instant for the release of offgoing clutch, i.e., switching from the torque to the inertia phase, is denoted by N1, which is the length of Y1∞. The hybrid Markov matrix in (4)-(8) with N1i=N1 and Nj=N is denoted by ∞. Similarly, D∞ is defined. It is expected that, as the oncoming clutch pressure command during the torque phase is iteratively tuned, the switching time instant N1j will be trial-varying. It is reasonable to assume that the switching time instant N1j is lower-bounded, i.e., N1<=N1j for all j since, due to the limitations on actuator dynamics, the clutch pressures cannot be changed instantaneously. It should be noted that N1j<=N1 since, during iterative learning of the command pressure for the oncoming clutch, the offgoing clutch is configured to completely release at N1, implying that the torque phase ends before or at N1 for all trials, i.e., for all j.
Similar to the assumption on N1i, Nj can be assumed to be lower-bounded as well, i.e., N<=Nj. However, unlike the torque phase, the gearshift may extend beyond N, resulting from a long inertia phase. In one example, the inertia phase is terminated forcibly after N discrete time steps, allowing for the assumption Nj<=N for all j. Even without considering such forced termination routines, for trials with duration greater than N, the first N elements of the system trajectories can always be used fir iterative learning. In addition, Nj is assumed to be lower bounded by N1, which is satisfied in practice due to the limitations of clutch hydraulics dynamics. The bounds on N1j and Nj imply that the hybrid Markov matrix representing a powertrain during gearshifting is known to belong to a finite set H={j:N1j=N1 . . . . N1 and Nj=N . . . . N}. In order to compute this set, two nested for loops are used, using which j is computed for each combination of N1j and Nj.
The use of look-up tables for parametrization of feedforward control naturally results in shape constraints on the control input trajectory, as illustrated by the oncoming clutch pressure command in
The shape constrained control input ΔPonccj during the torque and inertia phases of the jth trial is shown in
A Markov matrix during the jth trial with shape-constrained inputs is described here using a projection matrix Tu. The shape-constrained control input ΔPonccj, represented by 112 and 113 in
The first row of zeros in Tu constrains Uj(1)=0 for all j, the rows of Tu indexed by k=2 . . . . N1+1 and k=N1+2 . . . . N1+N2+1 linearly interpolate the corresponding elements of Uj between 0 and u1j, and u1j and u2j, respectively, and the remaining rows of Tu equate the corresponding elements of Uj to u2j. The shape-constrained hybrid Markov matrix His defined in equation (12), where j denotes the hybrid Markov matrix modeling the powertrain during the jth trial of the gearshift, as described earlier. Natural number Nu denotes the number of parameters required for describing the shape constrained control input Uj, which is equal to 2 for the input shown in
scj=jTu, Tu∈N×N
Yj=scjUrj+Dj (13)
For control design, a squaring-down approach is used here to derive a lifted form representation of the shape-constrained Markov matrix scj (Nu times Nu, using which a learning controller Lr is computed. The resulting controller ensures the convergence of Erj to zero, where Erj denotes a projection of the tracking error Ej onto smaller Nu dimensional space. It is noted that N>>Nu. For the shape-constrained hybrid Markov matrix scj, the lifted form representation is denoted by rj and described in equation (14), where Tyj projects the system output Yj onto Nu dimensional space and squares down the non-square shape-constrained hybrid Markov matrix scj.
rj=Tyjscj (14)
For the application of gearshift control, a natural choice of Tyj exists. Because only one control parameter is calibrated per gearshift phase, one point is sampled from the measured output trajectories Y1j and Y2j during the two phases. The trial-varying output projection matrix Tyj for the jth trial is a matrix of size Nu times N with all entries equal to zero except those represented by the row-column index pairs (1, N1j) and (2,Nj), which are equal to 1. It can be verified that the reduced Markov matrix rj=TyjjTu is lower triangular, which facilitates control design greatly, as will be discussed shortly. A learning controller Lr ensuring the convergence of the projected tracking error Erj, to zero is designed next using three methods.
The learning control law described in equation (15) is proposed here for iterative learning control of hybrid systems with shape-constrained control inputs. As Nu=2 for the application of gearshift control, Urj, Erj are two dimensional.
Urj+1=Urj+LrErj (15)
Trial-invariance of i) system dynamics of powertrains during gearshifting, ii) initial conditions for gearshifting, and iii) the desired reference trajectory Y∞ to be tracked are assumed for control design. Trial-invariance of trial duration, i.e., gearshift duration, is not assumed here, per the discussion regarding abrupt clutch lock-ups presented earlier. It is assumed here that there exist a control input Ur∞ such that the equality in equation (16) holds.
Y∞=sc∞Ur∞+D∞ (16)
This assumption establishes the existence of a control input Ur∞ such that a desired trajectory Y∞ can be tracked by the output of the shape constrained hybrid system sc∞, and is standard in ILC literature.
The philosophy of control design is described next. The evolution of δUrj, denoting the difference of the desired control input Ur∞ and the jth trial control input Urj in the trial domain, is governed by the discrete-time dynamics in equation (17).
δUrj+1=(I−Lrrj)δUrj+LrTyj(j−∞)TuUr∞+LrTyj(Dj−D∞) (17)
Note that for j=∞ and Dj=D∞, Ur∞=0 is an equilibrium of equation (17). The use of a Lyapunov framework for the design of learning controllers that ensure the stability of trial-varying internal dynamics I−Lrrj, with rj in Hr, is proposed here. The set of closed-loop systems I−Lrrj, with rj in Hr, in equation (17) is said to be quadratically stable if a Lyapunov function Pr=PrT>0 (positive definite) exists such that the set of inequalities in (18) is satisfied, where denotes the radius of the disc in which the eigenvalues of I−Lrrj, with rj in Hr are placed, such placement controlling the rate of convergence of δUrj to zero. As Hr is a finite set, the number of inequalities in (21), equal to the cardinality of Hr, is also finite. In the first embodiment of the proposed design method presented here, the causal controller is computed as Lr=Pr−1Qr, Pr and Qr being solutions to the finite set of LMIs in (18), where and denote the set of all diagonal and lower triangular matrices of size Nu times Nu respectively
In another embodiment of the design method, the set rj is (conservatively) represented as a lower triangular interval system Hrj={rj:rMin<=rj<=rMax, where <= here denotes the element-wise less than or equal to operation, and rMin and rMax denote the bounding matrices of the interval. Conservatism is introduced since Hr is a subset of HrI$, but this also implies increased robustness of the second design to modeling errors. It is fairly straight-forward to show that a lower-triangular interval system can be equivalently represented as a convex hull of Nv vertex matrices Nv=2(Nu(Nu+1))/2. The lower-triangular vertex matrices are derived using rMin and rMax. For the application of gearshift control, because Nu=2, Nv=8, and the vertex matrices ( ), wherein the matrix elements are elements of rMin and rMax. A causal learning controller for stabilization of the set HrI is computed using (18) and (19) but for the system matrices in (20).
The major difference between automated calibration and online adaptation from the perspective of iterative learning control application is that for automated calibration, the gearshift conditions, i.e., the engine torque and vehicle speed during the gearshift, are accurately controlled to be repetitive and equal to the break-points of the look-up tables in which the control parameters p3 and p4 are stored. In contrast to this, for the application of online adaptation, where gearshift control parameters are learned during normal vehicle operation, gearshifts occur randomly at different operating conditions.
The main technical challenge in implementing the hybrid ILC controller described earlier (for automated calibration) relates to the fixed values of engine torque and vehicle speed at which these gearshifts with potential for adaptation are executed. More specifically, as look-up tables are constructed using a finite number of break points of engine torque and vehicle speed (see
The control parameter p3is stored as a function of the engine torque and p4 is stored as a function of vehicle speed. The break-points are used to store the control parameter p3 be denoted by Teγ, γ=1 . . . . NTe, where NTe denote the total number of break-points or engine torque values used for storing p3. Similarly, let Vγ, γ=1 . . . . NV, where Nv denote the total number of break-points of vehicle speed values used for storing p4. Let p3γ and p4γ denote the values of control parameters p3 and p2 corresponding to these break-points respectively. As gearshifts occur multiple times during vehicle operation, the performance of the stored parameters may be evaluated after every occurrence or repetition, or trial of iterative learning, and updated for improved gearshift quality. The operating conditions Teγ and Vγ are packed in a two dimensional vector γ[TeγVγ]T.
Iterative learning laws for adaptation of the gearshift control parameters p3γj and p4γj—the values of the stored control p3γ and p4γ during Jth trial or iteration, are described next. Here, starting from the inaccurate control parameter values p3γ0 and p4γ0the goal is to iteratively learn the accurate (optimal) values p3γ∞ and p4γ∞. Consider the adaptation of p3γj first. For control of gearshifts during normal vehicle operation, the control parameter value p3j corresponding to the engine torque Tej is computed via linear interpolation of the control parameter values p3j1 and p3j2. In
Similarly, the adaptation law for the inertia phase is described in (24)-(26).
While the invention has been illustrated by a description of various embodiments, and while these embodiments have been described in considerable detail, it is not the intention of the Applicant to restrict or in any way limit the scope of the appended claims to such detail. Additional advantages and modifications will readily appear to those skilled in the art. The invention in its broader aspects is, therefore, not limited to the specific details, the representative apparatus and method, and illustrative examples shown and described. Accordingly, departures may be made from such details without departing from the spirit or scope of the Applicant's general inventive concept.
This application claims priority to and the filing benefit of U.S. Provisional Patent Application No. 63/082,636, filed Sep. 24, 2020, the disclosure of which is expressly incorporated by reference herein in its entirety.
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/US2021/051739 | 9/23/2021 | WO |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2022/066897 | 3/31/2022 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
4208925 | Miller | Jun 1980 | A |
4943921 | Baltusis et al. | Jul 1990 | A |
6078856 | Malson | Jun 2000 | A |
9869387 | Monajemi | Jan 2018 | B2 |
20080282583 | Koellner | Nov 2008 | A1 |
20150019090 | Robinette | Jan 2015 | A1 |
20180372214 | Haria | Dec 2018 | A1 |
Number | Date | Country |
---|---|---|
2018136773 | Jul 2018 | WO |
2020117935 | Jun 2020 | WO |
Entry |
---|
European Patent Office; Search Report and Written Opinion in related International Patent Application No. PCT.US2021/051739 dated Dec. 10, 2021; 14 pages. |
Number | Date | Country | |
---|---|---|---|
20230375085 A1 | Nov 2023 | US |
Number | Date | Country | |
---|---|---|---|
63082636 | Sep 2020 | US |