Beruflich Dokumente
Kultur Dokumente
This paper illustrates a method for the optimal control and optimal design of two-wheeled vehicles
and presents results of its application to minimum lap time, obstacle avoidance and dynamic
parameter optimisation problems. The task is to find the best control trajectory for a defined
manoeuvre within a constrained state-space, which can include both fixed and moving obstacles.
If the vehicle model includes free design parameters, then these are simultaneously optimised to
best facilitate the prescribed manoeuvre.
2. VEHICLE MODEL vehicles. The subscripts 𝑓 and 𝑟 will identify the front
and rear contact points respectively.
scalar function is the cost associated with the This large sparse NLP problem can be attacked
terminal conditions and is the stage cost assigned to using methods from the mature field of numerical
the instantaneous state and control. optimisation.
It goes without saying that an explicit analytical
solution does not generally exist for problems of this 4. RESULTS
type and so one must resort to numerical algorithms for
a solution. The approach adopted here is one of For our calculations we have used the ‘Imperial
transcribing the given problem into a general College London Optimal Control Software’ (ICLOCS,
finite-dimensional Non-Linear Programming (NLP) http://www.ee.ic.ac.uk/ICLOCS/), an open source
problem. Following the methodology given in [13] the toolbox for the direct transcription of continuous time
dynamic system is discretised in time, while the optimal control problems. We interfaced ICLOCS with
continuous state and control functions are quantised into the multi-body software VehicleSim (www.carsim.com)
a finite set of decision variables as follows: so that optimal control problems involving complex
mechanical systems can be transcribed and solved
[ ] automatically. The NLP problems are solved with the
[𝑥( ) 𝑥( ) 𝑥( ) 𝑥( ) ] open-source interior point optimizer IPOPT [14].
(4)
[ ( ) ( ) ( ) ] 4.1 Minimum lap time problem
[ ] The aim of this section is to study the optimal
control of our modified Timoshenko-Young bicycle
The difference equations coming from the model. The task is to complete a lap of a prescribed
discretisation of the continuous-time differential closed track in minimum time. The cost and constraints
dynamics are considered as a set of constraints on the for the optimal control problem are defined as follows:
decision variables:
(𝑥( ) ) (𝑥( ) ( ) )
𝑓 (𝑥( ) 𝑥( ) ( ) ) (𝑥( ) ( ) )
𝐹 ( ) [ ] (5) (𝑥( ) ( ) ) (𝑥( ))
𝑓 (𝑥( ) 𝑥( ) ( ) )
(𝑥( ))
where the functions 𝑓 represents a discrete time
(𝑥( )) (8)
approximation of the continuous time differential
equations* 𝑓 from (3). | | 𝑚 𝑥
The cost and the constraints are then reformulated [|𝐹𝑥 | |𝐹 | ]
as functions of the decision variables : (𝑥( ) 𝑥( ) ) 𝑥( ) 𝑥( )
(𝑥( ) 𝑥( ) )
( ) (𝑥( ) )
∑ {[ (𝑥( ) ( ) ) The minimum time objective can be embedded in
the terminal cost term; there is no need for the integral
(𝑥( ) ( ) )] term in (2). If one were to require a penalty of such
( )⁄ } things as energy consumption, then the stage cost term
(𝑥( ) ( ) ) would be required. The last row of defines a
(6) constraint on the maximum magnitude of the drive force
( ) [ (𝑥( ) ( ) )] applied to the main frame, which is consistent with the
(𝑥( ) 𝑥( ) ) characteristics of the tyres and reproduces the concept
(𝑥( ) ( ) ) of a ‘friction circle’ for the rear tyre. The second last
( ) row is a box constraint on the lean angle with
[ (𝑥( ) ( ) )] 𝑚 𝑥 6 °, which is introduced to enforce upright
(𝑥( ) 𝑥( ) ) running and assist the NLP convergence. The other
entries of are used to describe the track and obstacles.
Following discretisation, (3) is solved as a NLP The circuit is defined in terms of feasible sets in the
problem: state space, which constrain the movement of the rear
wheel ground contact point. In our case the obstacle
( ) boundaries are defined in terms of circles (shown in Fig.
𝐹 ( ) 2), with the feasible zones either inside or outside these
(7) circles:
{ ( )
( )
(𝑥( )) ((𝑥 ( ) 𝑥 )
(9)
( ( ) ) 𝑟 )
*
Here the trapezoidal rule is used, for which
[𝑥( ) 𝑥( )]⁄( )
[𝑓(𝑥( ) ( ) ) 𝑓(𝑥( ) ( ) )]⁄ .
AVEC ’12
Fig. 2 Bicycle trajectory for the time optimal control problem. The cartoons show the configurations of the bicycle
at equally spaced time instants (~ 𝑠). The thick grey curves show the obstacles and track boundaries, while
the thin grey-scaled curve is the trajectory of the rear contact point. The grey scale shading corresponds to time,
and is consistent with that used in Fig. 3, Fig. 4 and Fig. 5 (later times are darker). The axes are given in metres,
with optimal lap time 𝑡𝑓 ≈ 4 𝑠.
16
60
200
40
15
[m/s]
100
[N]
20
xm
[deg]
Longitudinal force F
14
Longitudinal speed v
0 0
Lean angle
60 hard constraint
13 -20
-100
45 friction limit
-40
12 -200
-60
0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9 10
Time [s] Time [s]
Fig. 3 Longitudinal speed 𝑥̂ (solid line) and Fig. 4 Lean angle for the minimum time trajectory.
longitudinal force 𝐹𝑥 at the rear contact point
(dashed line) for the minimum time trajectory in The solution of this and other minimum time
Fig. 2. problems confirms some results derived theoretically,
such as the non-minimum phase behaviour of a
The quantities 𝑥 and are the coordinates of two-wheeled vehicle entering a corner [1]. Some
ℎ
the centre of the obstacle, 𝑟 is its radius and the intuitive results were also obtained, such as the wheels
sign stipulates whether the unfeasible zone is on the working close to their friction peaks to attain the highest
inside or the outside of the obstacle boundary. For this available cornering force (see Fig. 5).
problem the obstacles are fixed and is time invariant. The method also reproduced counter-steering
Equality constraints are used to enforce the continuity of behaviour and drifting under extreme cornering, both of
the trajectory at the initial and final time, thereby which are observable in real motorcycle riding.
defining a minimum lap time racing problem. Some interesting results were obtained in special
Fig. 2 shows the optimal minimum-time lap cases, such as the non-circular minimum-time trajectory
trajectory for the modified Timoshenko-Young bicycle of a Timoshenko-Young bicycle running around a
around a simple closed circuit, with the longitudinal circular track when the lean angle is limited and the
speed and drive force given in Fig. 3. The roll angle is maximum absolute value of the longitudinal force is
given in Fig. 4. Note that the tyre friction saturation large. This is analogous to having tyres with high
effectively limits the roll angle to approximately 4 °. friction in the longitudinal and low friction in the lateral
direction, thus favouring long straight accelerations and
slow tight corners to trace a quasi-polygonal trajectory.
AVEC ’12
Fig. 5 Front- and rear-wheel lateral friction forces 𝐹𝑦𝑓 and 𝐹𝑦𝑟 , respectively on the left and in the middle. The
total rear-wheel force is shown in the right-hand diagram. The markers correspond to time-indexed operating
points with grey scales consistent with Fig. 2.
4.2 Avoiding moving obstacles of the obstacles; here 𝑧 8.
Fig. 6 illustrates a minimum time problem in which
𝑥(𝑡𝑓 ) the modified Timoshenko-Young bicycle performs a
Moving moving variant of the double lane change manoeuvre
obstacle (original manoeuvre in [15]) in which an object moves
across the lane obstructing the road. The optimal control
calculation procedure finds simultaneously the vehicle
trajectory and steering control to avoid the obstacles and
reach the target in minimum time (the drive force is
imposed to maintain a constant longitudinal speed as
𝑥(𝑡 ) required in [15]). In order to minimise the trajectory
length the rear contact point travels at the boundary of
the invading obstacle. A similar problem, with an
Fig. 6 Extended Timoshenko-Young bicycle obstacle leaving the vehicle path (as opposed to
travelling at ~110 km/h (as required in [15]) and invading it) has been solved using the same techniques.
avoiding an obstacle that is invading the road at a As expected, this showed that the vehicle must wait
speed of 1.25 m/s. The dotted lines are the start until a clear path appears to the target, and then enter
and finish lines. Grey scales are associated with this path at the maximum possible speed as soon as it
time instants for moving objects, with darker plots opens up.
corresponding to later times, apart from the near 4.3 Design optimization
and far objects, which are static. The straight lines There is a third line of investigation relating to the
are the lane boundaries. optimisation of vehicle design. Using the direct method,
the model parameters are included in the optimal control
A second optimal control application is the problem as optimisation variables. For this purpose the
avoidance of moving obstacles. The direct transcription differential equations in (3) are rewritten with an
methodology allows the straightforward introduction of explicit dependency on the model parameters vector 𝑝
time varying path constraints that can be used to
represent moving obstacles. In this case is an explicit 𝑓(𝑥̇ ( ) 𝑥( ) ( ) 𝑝 ) (12)
function of time:
and, accordingly, the constraints (5) now read
(𝑥( ) ( ) ) (𝑥( ) )
(𝑥( ) ) 𝐹 ( 𝑝 )
(10)
[ ] 𝑓 (𝑥( ) 𝑥( ) ( ) 𝑝 )
(𝑥( ) ) (13)
[ ]
𝑓 (𝑥( ) 𝑥( ) ( )𝑝 )
An extension of (9) allows the introduction of an
obstacle that moves into the vehicle’s path using With the inclusion of free vehicle parameters the
constraints of the form: NLP problem from (7) becomes:
(𝑥( ) ) ((𝑥 𝑟 ( ) 𝑥 ( )) ( )
{ }
(11) 𝐹 ( 𝑝 )
( ( ) ( )) 𝑟 ) (14)
𝑟 { ( )
( )
where the exponent 𝑧 is used to change the shape
AVEC ’12