Preprint
Article

Open-loop Control Strategies and Feasible System Response for a Rear-Axle Bicycle Robot

Altmetrics

Downloads

101

Views

25

Comments

0

This version is not peer-reviewed

Submitted:

21 January 2023

Posted:

29 January 2023

You are already at the latest version

Alerts
Abstract
This paper aims at computing feasible control strategies and the corresponding feasible state trajectories to drive an autonomous rear-axle bicycle robot from a given initial state to a final state such that the total running cost is minimized. Pontryagin’s Minimum Principle is applied and derives the optimality conditions from which the feasible control functions, expressed as functions of state and costate variables, are substituted into the combined state-costate system to obtain a new free-control state-costate nonlinear system of ordinary differential equations. A computer program was written in Scilab to solve the combined state-costate system and obtain the feasible state functions, the feasible costate functions and the feasible control functions. Associated Computational Simulations were provided to show the effectiveness and the reliability of the approach.
Keywords: 
Subject: Engineering  -   Control and Systems Engineering

1. Introduction

Most of vehicle crash investigations performed by some country transport departments certified that vehicle accidents are mostly caused by drivers who sometimes, when driving long distances, get tired and lose control, and then cannot manage the business of obstacle avoidance properly. The use of autonomous vehicles in general allows to reduce transport costs and can, in fast ways, avoid obstacles and then prevent accidents and thus save lives. Path planning of autonomous bicycles and study of their performances are subject to equilibrium constraints and create a lot of research questions, business and research opportunities. The study and the control of the dynamics of autonomous bicycles have become current and major concerns for the industrial operators and managers, and then attract the attention of research engineers, research mathematicians, research physicists, research computer scientists, etc. who develop suitable strategies, tools and methods to tackle and address all the problems associated to autonomous bicycles. There exists a considerable number of works on autonomous bicycles carried out since some years. Paper [1] developed a bicycle robot with balancing control. Paper [2] controlled the balance of a two-wheeled vehicle. Paper [3] controlled a bicycle to illustrate the control of nonholonomic and under-actuated systems with symmetry. Paper [4] designed and controlled a ball riding bicycle robot. Paper [5] proposed a dynamical model for a bicycle. Book [6] presents a different and unified perspective of the mechanics, planning and control of robots. The authors present the state of the art, the serew theoretic techniques which capture the most salient features of a robot in an intuitive way. Book [7] provides fundamental notions on mobile robots, navigation, localization, manipulator-arm kinematics, dynamics, and point level control as well as camera modelling, image processing, feature extraction and multi-view geometry. Paper [8] developed and analysed the kinematic and the dynamic models for a three wheeled bicycle called pedicab. Paper [9] presented modelling and control strategies for an autonomous three wheeled mobile robot with front wheel steer and front wheel drive. Book [10] provides a summary of common vehicle control systems and the dynamic models which are used to develop those control systems. All the above-mentioned papers are closely connected with the main subject of this paper because they deal in one way or another with control. To the best of my knowledge, none of those articles considered the control of an autonomous bicycle robot where the desired point is the rear Axle and uses optimal control theory methods. None of them computed the optimal state of the system, the corresponding costate functions and optimal speed . Generally it is noticeable that for other articles, before applying optimal control theory, the system is first reduced into a simpler one so that its characteristics can be determined easily. Most of time, the state system is linearized with respect to an equilibrium point, and inthose papers certain parameters are set in simpler values. The simplifications are performed to easily apply certain operations such as designing a quadratic regulator. However, when a nonlinear control system is reduced into a linear one, if no strategy is adopted, there will be loss of information, and then the final results will be considerably and significantly different from the exact ones. In this paper, the control system is highly nonlinear and has been studied as it is. No other paper has addressed the minimization of the running energy. No paper has computed the optimality conditions. No article has performed the derivation of a costate system of ordinary differential equations adjoining the state system. In the literature no paper found as considering the impact of the size of the initial costate vector on the length of the trajectory. So, most of the above-cited papers and others not cited addressed the bicycle stability problem, the tracking problem, etc., without considering the minimization of the running costs. This article is based on the control of the kinematics of a bicycle robot where the reference point is the center of the rear wheel. This paper uses optimal control theory to compute feasible control strategies of an autonomous bicycle and feasible state trajectories such that the bicycle running cost is minimize. The main contributions of this paper are the design and computation of two feasible control strategies, the computation of the solution of the combined state-costate system of ordinary differential equations which is defined by six feasible state functions representing the feasible system responses to reference commands, six costate (adjoint) functions. To perform computation, scilab computer programs were developed and applied.
This paper is organized as follows: Section 2 develops different relevant mathematical models and formulates the problem as an optimal control problem. Section 3 computes the system Hamiltonian, derives and solves the normal equations of optimality. Section 4 applies Pontryagin’s Minimum Principle to derive all the relevant nonlinear ordinary differential equations. Section 5 develops relevant computer programs in Scilab to compute the feasible control trajectories, the corresponding state and costate (adjoint) trajectories, the bicycle speed function and all the other outputs. Section 6 designs the associated computational simulations.

2. Mathematical Models

2.1. Control System, Kinematic Model

The reference point for the motion is at the centre of the rear-axle of the bicycle. The motion of an autonomous bicycle on the horizontal plane is modelled as follows:
d x d t = c 1 ω c o s ( θ )
d y d t = c 1 ω s i n ( θ )
d θ d t = c 2 ω t a n ( δ )
d δ d t = c 3 φ
where c 1 = R and c 2 = R / L are constant of proportionality, R and L are respectively the radius of the wheels and the distance between the centre of the rear and the front wheels. ( x , y ) are the coordinates of the projection of the rear-axle’s center (which is the reference point for the motion) on the horizontal plane, θ is the heading angle, δ is the steering angle, φ is the steering angle’s velocity.
The reference commands which regulate the bicycle angular velocity and the steering angle velocity are modelled as solution to a closed-loop system defined by:
d ω d t = a 1 ω + a 1 τ 1
d φ d t = a 2 φ + a 2 τ 2
τ 1 and τ 2 are the unknown input control variables to be developed. a 1 and a 2 are constants of proportionality.
The whole robot kinematic control system is
d x d t = c 1 ω c o s ( θ )
d y d t = c 1 ω s i n ( θ )
d θ d t = c 2 ω t a n ( δ )
d δ d t = c 3 φ
d ω d t = a 1 ω + a 1 τ 1
d φ d t = a 2 φ + a 2 τ 2
Figure 1. Rear-Axle Bicycle Robot Geometric Model.
Figure 1. Rear-Axle Bicycle Robot Geometric Model.
Preprints 67711 g001

2.2. Objective Functional

In this paper, the total running cost to be minimized is as follows:
J u = J ( τ 1 , τ 2 ) = t 0 t f τ 1 2 + τ 2 2 d t
where t 0 and t f are respectively the bicycle motion’s starting and final times, τ 1 and τ 2 are the reference commands which control respectively the bicycle angular velocity and steering angle velocity. τ 1 2 + τ 2 2 is called cost rate.

2.3. Problem Formulation

This paper addresses the following problem: Compute the feasible control strategies and the associated feasible state functions, also called feasible robot system responses, to bring the autonomous bicycle robot from a given initial state to a final state such that the total running cost is minimized.

3. Hamiltonian and Feasible Controls

The Hamiltonian of the system is given by
H ( t , Y t , α t , ω t , φ ( t ) ) = h ( t ) + k = 1 6 α k ( t ) f k ( Y t , ω t , φ t )
Where we have
h ( t ) = τ 1 2 + τ 2 2 is the energy cost rate,
f 1 ( Y t , ω t , φ t ) = c 1 ω c o s θ is the x component of the linear velocity of the bicycle,
f 2 ( Y t , ω t , φ t ) = c 1 ω s i n θ is the y component of the linear velocity of the bicycle,
f 3 ( Y t , ω t , φ t ) = c 2 ω t a n δ is the rate of change of the heading angle of the bicycle,
f 4 ( Y t , ω t , φ t ) = c 3 φ is the rate of change of the steering angle of the bicycle,
f 5 ( Y t , ω t , φ t ) = a 1 ω + a 1 τ 1 is the rate of change of the bicycle angular velocity,
f 6 ( Y t , ω t , φ t ) = a 2 φ + a 2 τ 2 is the rate of change of the velocity of steering angle.
Y t = ( x ( t ) ,   y ( t ) ,   θ ( t ) ,   δ ( t ) ,   ω t ,   φ ( t ) ) is the unkown state vector function. It is built to store all the state functions.
α t = ( α 1 ( t ) ,   α 2 ( t ) ,   α 3 ( t ) ,   α 4 ( t ) ,   α 5 t ,   α 6 ( t ) ) is the unkown costate (adjoint) vector function.
It is built to store all the costate functions. Concerning the control functions, the normal equations for optimality are as follows:
H τ 1 = 2 τ 1 + a 1 α 5 = 0
H τ 2 = 2 τ 2 + a 2 α 6 = 0
The feasible control functions are given by
τ 1 = 0.5 a 1 α 5
τ 2 = 0.5 a 2 α 6

4. Normal Condition for Optimality

If u = ( τ 1 , τ 2 ) is the optimal control of the above problem and Y = x , y , θ , δ , ω , φ the corresponding optimal system response to the input control u = ( τ 1 , τ 2 ) , then there exists a costate vector function α = ( α 1 , α 2 , α 3 , α 4 , α 5 , α 6 ) , also called adjoint vector such that the following are satisfied:
J ( u ) J ( u )
d x d t = c 1 ω c o s ( θ )
d y d t = c 1 ω s i n ( θ )
d θ d t = c 2 ω t a n ( δ )
d δ d t = c 3 φ
d ω d t = a 1 ω + a 1 τ 1
d φ d t = a 2 φ + a 2 τ 2
d α 1 d t = 0
d α 2 d t = 0
d α 3 d t = c 1 ω ( α 1 s i n ( θ ) α 2 c o s ( θ ) )
d α 4 d t = c 2 α 3 ω s e c 2 ( δ )
d α 5 d t = c 1 α 1 c o s θ α 2 s i n θ + a 1 α 5
d α 6 d t = c 3 α 4 + a 2 α 6
By letting u * = ( τ 1 * , τ 2 * ) , with τ 1 * = 0.5 a 1 α 5 * and τ 2 * = 0.5 a 2 α 6 * for the control functions,
z 1 = x , z 2 = y , z 3 = θ , z 4 = δ , z 5 = ω and z 6 = φ for the state functions,
z 7 = α 1 , z 8 = α 2 , z 9 = α 3 , z 10 = α 4 , z 11 = α 5 and z 12 = α 6 for the costate functions
and by combining all the state and costate functions into a vector z = [ Y , α ] , then the combined state-costate system can be rewritten as
d z 1 d t = c 1 z 5 c o s ( z 3 )
d z 2 d t = c 1 z 5 s i n ( z 3 )
d z 3 d t = c 2 z 5 t a n ( z 4 )
d z 4 d t = c 3 z 6
d z 5 d t = a 1 z 5 + a 1 τ 1
d z 6 d t = a 2 z 6 + a 2 τ 2
d z 7 d t = 0
d z 8 d t = 0
d z 9 d t = c 1 z 5 ( z 7 s i n ( z 3 ) z 8 c o s ( z 3 ) )
d z 10 d t = c 2 z 9 z 5 s e c 2 ( z 4 )
d z 11 d t = c 1 z 7 c o s z 3 z 8 s i n z 3 + a 1 z 11
d z 12 d t = c 3 z 10 + a 2 z 12
Vector z is built to vectorize the combined state and costate system of equations so that the system can be analyzed and processed in a easy and rigorous manner.
Notice that in the system (32)-(43) the right hand side and its gradient are continuous. Therefore, the solution exists and is unique.

5. Computer Program

Pontryagin’s Minimum Principle applied in this article involves a costate system of ordinary differential equations which combined to the state system and the feasible controls gives a combined free-control state-costate system of ordinary differential equations. I order to solve any system of ordinary differential equations which is an initial value problem, I developed (in Matlab) an algorithm coding a fourth-order Runge-Kutta method. Such an algorithm can be translated into many other programming languages. It is as follows:
Preprints 67711 i001
The above algorithm can be used to solve any initial value problem. Let’s use it to solve the system (32)-(43) of equations. By translating and developing the algorithm into Scilab codes we have the following set of codes:
Preprints 67711 i002a
Preprints 67711 i002b
Preprints 67711 i002c
Preprints 67711 i002d

6. Computational Simulations

Figure 2 gives the feasible trajectory of the bicycle robot. The starting point of the path is (0,0).
Figure 2. Feasible Bicycle Robot Trajectory.
Figure 2. Feasible Bicycle Robot Trajectory.
Preprints 67711 g002
Figure 3. First three feasible state functions.
Figure 3. First three feasible state functions.
Preprints 67711 g003
Figure 4. Last three feasible state functions.
Figure 4. Last three feasible state functions.
Preprints 67711 g004
The above plotted function s t a t e 1 describes the instantaneous robot’s position in the x direction. In other words we have s t a t e 1 =   x ( t ) , t [ 0,6 ] . The above plotted function s t a t e 2 describes the instantaneous robot’s position in the y direction. In other words we have s t a t e 2 =   y ( t ) , t [ 0,6 ] . The above plotted function s t a t e 3 describes the instantaneous robot’s heading angle. In other words we have s t a t e 3 =   θ ( t ) , t [ 0,6 ] . The above plotted function s t a t e 4 describes the instantaneous steering angle. s t a t e 4 =   δ ( t ) , t [ 0,6 ] . The above plotted function s t a t e 5 describes the instantaneous angular velocity. s t a t e 5 =   ω t , t [ 0,6 ] . The above plotted function s t a t e 6 describes the instantaneous steering angle’s velocity. s t a t e 6 =   φ ( t ) , t [ 0,6 ] .
Figure 5. First three feasible costate functions.
Figure 5. First three feasible costate functions.
Preprints 67711 g005
Figure 6. Last three feasible costate functions.
Figure 6. Last three feasible costate functions.
Preprints 67711 g006
The function c o s t a t e 1 is the adjoint function to the function s t a t e 1 . c o s t a t e 1 = α 1 t , t [ 0,6 ] . The function c o s t a t e 2 is the adjoint function to the function s t a t e 2 . c o s t a t e 2 = α 2 t , t [ 0,6 ] . The function c o s t a t e 3 is the adjoint function to the function s t a t e 3 . c o s t a t e 3 = α 3 t , t [ 0,6 ] . The function c o s t a t e 4 is the adjoint function to the function s t a t e 4 . c o s t a t e 4 = α 4 t , t [ 0,6 ] .
The function c o s t a t e 5 is the adjoint function to the function s t a t e 5 . c o s t a t e 5 = α 5 t , t [ 0,6 ] . The function c o s t a t e 6 is the adjoint function to the function s t a t e 4 . c o s t a t e 6 = α 6 t , t [ 0,6 ] .
One can notice that α 1 t and α 2 t are constant because their time derivatives are zeros.
Figure 7. Feasible control strategies.
Figure 7. Feasible control strategies.
Preprints 67711 g007
The function c o n t r o l 1 describes the instantaneous reference command to the robot angular velocity. In other words we have 1 =   τ 1 t ,   t [ 0,6 ] . The function c o n t r o l 1 describes the instantaneous reference command to the robot angular velocity. In other words we have 2 =   τ 2 t ,   t [ 0,6 ] .

7. Conclusions

The aim of this paper was to compute the feasible control strategies and the associated feasible state functions, also called feasible robot system response to control, for an autonomous rear-axle bicycle robot to bring it from a given initial state to a final state such that the total running cost is minimized. A fourth-order Runge-Kutta was used to solve the combined free-control state-costate system of ordinary differential equations obtained from Pontryagin’s Minimum Principle. The obtained results enable to predict the performance of the autonomous bicycle robot so that it can be controlled accurately and efficiently. The computer programs are useful to any reader or any researcher who is familiar with programming and who would want to learn more. Computational Simulations are provided to show the effectiveness and the reliability of the approach. In future, control policies will be developed for the rear-axle bicycle robot to asymptotically track a prescribed trajectory. Some methodology will be performed to develop optimal control strategies using Lagrange Interpolating polynomial.

Funding

This research was funded by the University of Johannesburg, Faculty of Engineering through UJ-GES.

Data Availability Statement

This study did not report any data.

Acknowledgments

The authors of this paper thanks the university of Johannesburg for financial support. They thank also the reviewers for relevant and helpful comments.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Anan Suebsomran, Balancing Control of Bicycle Robot (2012), 2012 IEEE International Conference on cyber technology in Automation, control and Intelligent Systems(Cyber), pp. 69-73. [CrossRef]
  2. Ngoc Kien Vu., Hong Quang Nguyen, Balancing control of a Two-wheeled bicycle (2020), Mathematical Problems in Engineering. Published by Hindawi. [CrossRef]
  3. Neil H. Getz, Jerrold E. Marsden, Control for an Autonomous Vehicle, Department of Electrical Engineering, University of California. Berkeley, CA 94720, getz@eecs.berkeley.edu.
  4. Pongsakorn Seekkao and Manukid Parnichkun, Development and control of a bicycle robot based on steering and pendulum balancing, Mechatronics, Volume 69, August 2020. [CrossRef]
  5. Y. Tanaka and T. Murakami, Self Sustaining Bicycle Robot with Steering Controller, Advanced Control, 2004 IEEE International Workshop on Advanced Control, 27-31 may 2012. [CrossRef]
  6. Lynch, Kevin M., and franck C. Park, Modern Robotics: Mechanics, Planning, and Control 1st edition, Cambridge Press, 2017.
  7. Corke, Peter I. Robotics, Vision and Control: Fundamental Algorithms in Matlab, Springer, 2011.
  8. Noverina, Nur Hamid, Grafika Jati, M. Anwar Ma’sum, Wisnu Jatmiko, Kinematics and Dynamics Analysis of an Autonomous Three-Wheeled Bicycle Modeling, 2019 4th Asia-Pacific Conference on Intelligent Robot Systems (Conference Paper), July 2019.
  9. Pandey, S. Jha, and D. Chakravarty, Modeling and Control of an autonomous three-wheeled mobile robot with front steer, Proceeding 2017 1st Conference on Robot and Computing. IRC 2017, pp. 136-142, 2017. [CrossRef]
  10. R. Rajamani, Vehicle Dynamics and Control, vol. Spec No. 2001.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated