research article feasible path planning for autonomous ...path planning is one of the most important...

13
Research Article Feasible Path Planning for Autonomous Vehicles Vu Trieu Minh 1 and John Pumwa 2 1 Department of Mechatronics, Tallinn University of Technology, Ehitajate tee 5, 19086Tallinn, Estonia 2 Department of Mechanical Engineering, Papua New Guinea University of Technology, Lae 411, Papua New Guinea Correspondence should be addressed to Vu Trieu Minh; [email protected] Received 8 January 2014; Revised 10 February 2014; Accepted 11 February 2014; Published 18 March 2014 Academic Editor: Sivaguru Ravindran Copyright Β© 2014 V. T. Minh and J. Pumwa. is is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. e objective of this paper is to find feasible path planning algorithms for nonholonomic vehicles including flatness, polynomial, and symmetric polynomial trajectories subject to the real vehicle dynamical constraints. Performances of these path planning methods are simulated and compared to evaluate the more realistic and smoother generated trajectories. Results show that the symmetric polynomial algorithm provides the smoothest trajectory. erefore, this algorithm is recommended for the development of an automatic control for autonomous vehicles. 1. Introduction Path planning is one of the most important parts of an autonomous vehicle. It deals with, searching a feasible path, taking into consideration the geometry of the vehicle and its surroundings, the kinematic constraints and others that may affect the feasible paths. Study of this paper can be used to develop a real-time control system for autonomous ground vehicles which can track exactly on any feasible paths from the global positioning system (GPS) maps or/and from unmanned aerial vehicle (UAV) images. is system can be also applied to autonomous unmanned ground vehicles (on road or off road) and autoparking and autodriving systems. e main idea of this paper is a system which can automatically generate an optimal feasible trajectory and then control the vehicle to track exactly on this path from any given starting points to any given destination points from a map subject to the vehicle physical constraints on obstacles, speed, steering angle, and so forth. From the existed pieces of literature on this research topic, there are still few research papers dealing with optimal trajectory generation subject to real automotive engineering constraints. Basic studies on the flatness, nonholonomic, and nonlinear systems can be read from the recent book of LΒ΄ evine in [1] where the fundamental motion planning of a vehicle is presented. e flatness and controllability conditions for this nonlinear system are also well investigated and defined. However, in this research, parking simulation of a two-trailer vehicle is also demonstrated but without the constraint of steering angle and steering angular velocity. e problem of trajectory generation for nonholonomic system is also presented by Dong and Guo in [2] where two trajectory generation methods are proposed. e control inputs are the second-order polynomial equations. By inte- grating those control inputs, coefficients for those second- order polynomial equations are found. However this paper is lacking constraint analysis on the vehicle velocity and the steering angle. e cell mapping techniques and reinforcement learning methods to obtain the optimal motion planning by Gomez et al. in [3] are tested for vehicles considering kinematics, dynamics, and obstacle constraints. is paper shows a simulation of a wheeled mobile robot moving on a path generated by the bang-bang trajectory generation. And the paper does not mention the algorithms used for generating the vehicle trajectory. Several other research papers on optimal trajectories and control of autonomous vehicles can be read in [4–7]; however, most of those studies are based on the real traffic flow roads and the control algorithms are to perform the maneuver tasks such as lane changing, merging, distance keeping, velocity keeping, stopping, and collision avoidance. is paper, therefore, focuses on the applicable algo- rithms to generate feasible trajectories from a starting point Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2014, Article ID 317494, 12 pages http://dx.doi.org/10.1155/2014/317494

Upload: others

Post on 26-Jan-2021

3 views

Category:

Documents


0 download

TRANSCRIPT

  • Research ArticleFeasible Path Planning for Autonomous Vehicles

    Vu Trieu Minh1 and John Pumwa2

    1 Department of Mechatronics, Tallinn University of Technology, Ehitajate tee 5, 19086Tallinn, Estonia2Department of Mechanical Engineering, Papua New Guinea University of Technology, Lae 411, Papua New Guinea

    Correspondence should be addressed to Vu Trieu Minh; [email protected]

    Received 8 January 2014; Revised 10 February 2014; Accepted 11 February 2014; Published 18 March 2014

    Academic Editor: Sivaguru Ravindran

    Copyright Β© 2014 V. T. Minh and J. Pumwa. This is an open access article distributed under the Creative Commons AttributionLicense, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properlycited.

    Theobjective of this paper is to find feasible path planning algorithms for nonholonomic vehicles including flatness, polynomial, andsymmetric polynomial trajectories subject to the real vehicle dynamical constraints. Performances of these path planning methodsare simulated and compared to evaluate the more realistic and smoother generated trajectories. Results show that the symmetricpolynomial algorithm provides the smoothest trajectory. Therefore, this algorithm is recommended for the development of anautomatic control for autonomous vehicles.

    1. Introduction

    Path planning is one of the most important parts of anautonomous vehicle. It deals with, searching a feasible path,taking into consideration the geometry of the vehicle andits surroundings, the kinematic constraints and others thatmay affect the feasible paths. Study of this paper can beused to develop a real-time control system for autonomousground vehicles which can track exactly on any feasible pathsfrom the global positioning system (GPS) maps or/and fromunmanned aerial vehicle (UAV) images. This system can bealso applied to autonomous unmanned ground vehicles (onroad or off road) and autoparking and autodriving systems.

    The main idea of this paper is a system which canautomatically generate an optimal feasible trajectory and thencontrol the vehicle to track exactly on this path fromany givenstarting points to any given destination points from a mapsubject to the vehicle physical constraints on obstacles, speed,steering angle, and so forth.

    From the existed pieces of literature on this researchtopic, there are still few research papers dealing with optimaltrajectory generation subject to real automotive engineeringconstraints. Basic studies on the flatness, nonholonomic, andnonlinear systems can be read from the recent book of Lévinein [1] where the fundamental motion planning of a vehicleis presented. The flatness and controllability conditions forthis nonlinear system are also well investigated and defined.

    However, in this research, parking simulation of a two-trailervehicle is also demonstrated but without the constraint ofsteering angle and steering angular velocity.

    The problem of trajectory generation for nonholonomicsystem is also presented by Dong and Guo in [2] wheretwo trajectory generation methods are proposed.The controlinputs are the second-order polynomial equations. By inte-grating those control inputs, coefficients for those second-order polynomial equations are found. However this paperis lacking constraint analysis on the vehicle velocity and thesteering angle.

    The cell mapping techniques and reinforcement learningmethods to obtain the optimal motion planning by Gomezet al. in [3] are tested for vehicles considering kinematics,dynamics, and obstacle constraints. This paper shows asimulation of a wheeled mobile robot moving on a pathgenerated by the bang-bang trajectory generation. And thepaper does not mention the algorithms used for generatingthe vehicle trajectory. Several other research papers onoptimal trajectories and control of autonomous vehicles canbe read in [4–7]; however, most of those studies are based onthe real traffic flow roads and the control algorithms are toperform the maneuver tasks such as lane changing, merging,distance keeping, velocity keeping, stopping, and collisionavoidance.

    This paper, therefore, focuses on the applicable algo-rithms to generate feasible trajectories from a starting point

    Hindawi Publishing CorporationMathematical Problems in EngineeringVolume 2014, Article ID 317494, 12 pageshttp://dx.doi.org/10.1155/2014/317494

  • 2 Mathematical Problems in Engineering

    to any destination point subject to vehicle constraints. Thispaper refers to the vehicle sideslip model and estimation byMinh in [8, chapter 8].The nonlinear computational schemesfor the nonlinear systems are referred to by Minh andAfzulpurkur in [9]. Although the holonomic dynamical tra-jectories generation is not new, recent research articles havetried to develop those trajectories in different applications.Trajectory for autonomous ground vehicles based on Beziercurves operating under waypoints and corridor constraintscan be referred to by Choi et al. in [10] and a real-timetrajectory generation for car-like vehicles navigating dynamicenvironments can be read by Delsart et al. in [11]. A newpaper of trajectory generation model-based IMM trackingfor safe driving in intersection scenario can be read by Zhouet al. in [12] to reduce traffic accidents at intersections.Another paper of dynamic trajectory generation for wheeledrobots is referred to by Missura and Behnke in [13] wherea dynamic motion of wheeled robots can be determined inreal-time onboard.The real vehiclemodels and conditions forstabilizability of dynamic systems are referred to in [14, 15].

    This paper introduces three (flatness, polynomial, andsymmetric) conventional holonomic trajectories generationsubject to steering angle constraint for autonomous vehicles.Performances of these three algorithms are compared. Datataken from simulation on the vehicle longitudinal velocityand its steering angular velocity will be used to develop thecontrol algorithms for the vehicle tracking on those trajecto-ries in the next part of this paper. The outline of this paper isas follows. Section 2 describes the kinematicmodel; Section 3presents the flatness method; Section 4 produces the trajec-tory generation subject steering angle constrained violation;Section 5 presents the polynomial method; Section 6 devel-ops the symmetric polynomial method; Section 7 analysesthe performance of the three methods; finally conclusion isdrawn in Section 8. Simulations in this paper are conductedin the MATLAB Simulink R2009a.

    2. Kinematic Model of a Vehicle

    The constraints for this vehicle model are based on theassumption that the wheels are rolling without slipping andthe steering angle is simplified as a single wheel in themidpoint of the two frond wheels. Then, a kinematic modelof a vehicle can be drawn in Figure 1.

    The kinematic model of a forward rear-wheel drivingvehicle can be written as

    [[[[

    οΏ½Μ‡οΏ½Μ‡π‘¦Μ‡πœƒ

    οΏ½Μ‡οΏ½

    ]]]]=[[[[[

    cos πœƒsin πœƒtanπœ‘π‘™0

    ]]]]]

    π‘ŸV1+ [[[[

    0001

    ]]]]V2, (1)

    where 𝑋 = [π‘₯, 𝑦, πœƒ, πœ‘] is the system state variables, (π‘₯, 𝑦)are the Cartesian coordinates of the middle point of the rearwheel axis, πœƒ is the angle of the vehicle body to the π‘₯-axis,πœ‘ is the steering angle, 𝑙 is the vehicle wheel base, π‘Ÿ is thewheel radius, V

    1is the angular velocity of the rear wheel,

    and V2is the angular steering velocity. Given the initial state

    𝑋(0) = [π‘₯0, 𝑦0, πœƒ0, πœ‘0] at time 𝑑 = 0 and the final state

    y

    y

    xx

    πœƒ

    πœ‘

    l

    r

    Figure 1: A simplified vehicle model.

    𝑋(𝑇) = [π‘₯𝑇, 𝑦𝑇, πœƒπ‘‡, πœ‘π‘‡] at time 𝑑 = 𝑇, the paper generates

    a feasible trajectory for this vehicle.Similarly, the model for a forward front-wheel driving

    vehicle is presented as

    [[[[

    οΏ½Μ‡οΏ½Μ‡π‘¦Μ‡πœƒ

    οΏ½Μ‡οΏ½

    ]]]]=[[[[[

    cos πœƒ cosπœ‘sin πœƒ cosπœ‘

    tanπœ‘π‘™0

    ]]]]]

    π‘ŸV1+ [[[[

    0001

    ]]]]V2. (2)

    The model for a forward rear-wheel driving vehicle in (1)will be used for all calculations and simulations in this paper.From this kinematic model, flatness equations for the vehicletrajectory generation are presented in the next section.

    3. Vehicle Flatness Trajectory Generation

    The flatness system is the system of nonlinear differentialequations in (1) whose movement curves are in smooth andflat space. From Figure 1, the vehicle angular velocity can becalculated as

    V1=βˆšοΏ½Μ‡οΏ½2 + ̇𝑦2

    π‘Ÿ .(3)

    Transforming from (1), the vehicle body angle is

    πœƒ = arctan( ̇𝑦�̇�) . (4)

    From the derivative of the above trigonometric, πœƒ, the bodyangular velocity, Μ‡πœƒ, is achieved as follows:

    Μ‡πœƒ = Μˆπ‘¦οΏ½Μ‡οΏ½ βˆ’ �̈� ̇𝑦�̇�21

    ( ̇𝑦/οΏ½Μ‡οΏ½)2 + 1= Μˆπ‘¦οΏ½Μ‡οΏ½ βˆ’ �̈� ̇𝑦�̇�2 + ̇𝑦2 =

    tanπœ‘π‘™ π‘ŸV1. (5)

    Therefore, πœƒ and πœ‘ can be directly calculated from variables:οΏ½Μ‡οΏ½, �̈�, and ̇𝑦, Μˆπ‘¦. And it means that the above system is flat [1].Thus, all state and input variables can be presented by the flatoutputs π‘₯ and 𝑦.

  • Mathematical Problems in Engineering 3

    From (5), the boundary conditions for the outputs π‘₯ and𝑦 are

    πœ•2π‘¦πœ•π‘₯2 =

    tanπœ‘π‘™cos3πœƒ .

    (6)

    The initial state at time, 𝑑 = 0, to the final state at time, 𝑑 = 𝑇,for π‘₯(𝑑), is

    π‘₯ (0) = π‘₯0, π‘₯ (𝑇) = π‘₯

    𝑇. (7)

    The initial state for 𝑦(𝑑) = 𝑦(0) is

    𝑦 (0) = 𝑦0= tan πœƒ

    0β‡’ πœ•

    2π‘¦πœ•π‘₯2

    𝑑=0= tanπœ‘0𝑙cos3πœƒ

    0

    . (8)

    The final state for 𝑦(𝑑) = 𝑦(𝑇) is

    𝑦 (𝑇) = 𝑦𝑇= tan πœƒ

    𝑇⇒ πœ•

    2π‘¦πœ•π‘₯2

    𝑑=𝑇= tanπœ‘π‘‡π‘™cos3πœƒ

    𝑇

    . (9)

    From the initial state (π‘₯0, 𝑦0, πœƒ0, πœ‘0) at the time 𝑑 = 0 to the

    final state (π‘₯𝑇, 𝑦𝑇, πœƒπ‘‡, πœ‘π‘‡), under a real condition that |οΏ½Μ‡οΏ½(𝑑)| β‰₯

    πœ€ > 0, if it is assumed that = |π‘₯π‘‡βˆ’ π‘₯0|/2𝑇 > 0, the trajectory

    of π‘₯(𝑑) can be written freely as

    π‘₯ (𝑑) = (𝑇 βˆ’ 𝑑𝑇 ) π‘₯0 +𝑑𝑇π‘₯𝑇 +

    π‘₯𝑇 βˆ’ π‘₯0𝑑 (𝑑 βˆ’ 𝑇)2𝑇2 . (10)

    And the trajectory of 𝑦(𝑑) can be selected as

    𝑦 (𝑑) = 𝑦0+ 𝑑𝛼1tan πœƒ0+ 𝑑2 𝛼2 tanπœ‘02𝑙cos3πœƒ

    0

    + 𝑑3𝑏1+ 𝑑4𝑏2+ 𝑑5𝑏3,(11)

    where 𝛼1= (2(π‘₯

    π‘‡βˆ’π‘₯0)βˆ’|π‘₯π‘‡βˆ’π‘₯0|)/2𝑇, 𝛼

    2= |π‘₯π‘‡βˆ’π‘₯0|/𝑇2, and

    𝛼3= (2(π‘₯

    π‘‡βˆ’ π‘₯0) + |π‘₯π‘‡βˆ’ π‘₯0|)/2𝑇; and 𝑏 = [𝑏

    1, 𝑏2, 𝑏3] = π΄βˆ’1𝑐

    with

    𝐴 = [[

    𝑇3 𝑇4 𝑇53𝑇2 4𝑇3 5𝑇46𝑇 12𝑇2 20𝑇3

    ]],

    𝑐 =

    [[[[[[[[[

    π‘¦π‘‡βˆ’ 𝑦0βˆ’ 𝑇𝛼1tan πœƒ0βˆ’ 𝑇2𝛼2 tanπœ‘02𝑙cos3πœƒ

    0

    𝛼3tan πœƒπ‘‡βˆ’ 𝛼1tan πœƒ0βˆ’ 𝑇𝛼2 tanπœ‘0𝑙cos3πœƒ

    0

    𝛼2tanπœ‘π‘‡

    𝑙cos3πœƒπ‘‡

    βˆ’ 𝛼2 tanπœ‘0𝑙cos3πœƒ0

    ]]]]]]]]]

    .

    (12)

    From (10),

    πœƒ = arctan(2𝑇2 (𝛼1tan πœƒ0+ 𝛼2 tanπœ‘0𝑙cos3πœƒ

    0

    𝑑

    +3𝑏1𝑑2 + 4𝑏

    2𝑑3 + 5𝑏

    3𝑑4)

    Γ— (2𝑇 (π‘₯π‘‡βˆ’ π‘₯0)

    βˆ’ 𝑇 π‘₯𝑇 βˆ’ π‘₯0 + 2 π‘₯𝑇 βˆ’ π‘₯0 𝑑)βˆ’1)

    (13)

    And, from (5),

    πœ‘ = arctan((𝛼2 tanπœ‘0𝑙cos3πœƒ0

    + 6𝑏1𝑑 + 12𝑏

    2𝑑2 + 20𝑏

    3𝑑3)

    Γ— (2𝑇2)2𝑙cos3πœƒ

    Γ— ( (2𝑇 (π‘₯π‘‡βˆ’ π‘₯0)

    βˆ’π‘‡ π‘₯𝑇 βˆ’ π‘₯0 + 2 π‘₯𝑇 βˆ’ π‘₯0 𝑑)2)βˆ’1) .

    (14)

    The angular velocity of the vehicle in (1) can be calculatedfrom (13) and (14).

    For derivative of 𝑦,

    ̇𝑦 (𝑑) = (𝛼1tan πœƒ0+ 𝛼2 tanπœ‘0𝑙cos3πœƒ

    0

    𝑑 + 3𝑏1𝑑2 + 4𝑏

    2𝑑3 + 5𝑏

    3𝑑4)(15)

    and, then,

    Μˆπ‘¦ (𝑑) = (𝛼2 tanπœ‘0𝑙cos3πœƒ0

    + 6𝑏1𝑑 + 12𝑏

    2𝑑2 + 20𝑏

    3𝑑3) (16)

    and derivative of π‘₯ is

    οΏ½Μ‡οΏ½ (𝑑) = ((2𝑇 (π‘₯𝑇 βˆ’ π‘₯0) βˆ’ 𝑇π‘₯𝑇 βˆ’ π‘₯0 + 2 π‘₯𝑇 βˆ’ π‘₯0 𝑑)2𝑇2 )

    (17)

    And, then,

    �̈� (𝑑) = (π‘₯𝑇 βˆ’ π‘₯0

    𝑇2 ) . (18)

    The absolute vehicle velocity can be calculated from (15) to(18) with

    V1(𝑑) =

    βˆšοΏ½Μ‡οΏ½2 + ̇𝑦2π‘Ÿ

    (19)

    or with another formula to calculate V1(𝑑) is V

    1(𝑑) =

    (οΏ½Μ‡οΏ½(𝑑) cos πœƒ/π‘Ÿ) + ( ̇𝑦(𝑑) sin πœƒ/π‘Ÿ)); then

    V1(𝑑) = ((2𝑇 (π‘₯𝑇 βˆ’ π‘₯0) βˆ’ 𝑇

    π‘₯𝑇 βˆ’ π‘₯0 + 2 π‘₯𝑇 βˆ’ π‘₯0 𝑑)2π‘Ÿπ‘‡2 )

    Γ— cos πœƒ + ((𝛼1tan πœƒ0+ 𝛼2 tanπœ‘0𝑙cos3πœƒ

    0

    + 3𝑏1𝑑2

    + 4𝑏2𝑑3 + 5𝑏

    3𝑑4) sin πœƒΓ— (π‘Ÿ)βˆ’1) .

    (20)

    To calculate Μ‡πœƒ from (5),

    Μ‡πœƒ = Μˆπ‘¦οΏ½Μ‡οΏ½ βˆ’ �̈� ̇𝑦�̇�2 + ̇𝑦2 =tanπœ‘π‘™ π‘ŸV1. (21)

  • 4 Mathematical Problems in Engineering

    0 1 2 3 4 5 6 7 8 9 100

    5

    10

    Posit

    ion y

    Position x

    0 10 20 30 40 50 60 70 80 90 1000

    1

    2

    3

    4

    Time t

    Vehi

    cle v

    eloc

    ityοΏ½1

    (km

    )

    Figure 2: Trajectory and velocity.

    To calculate V2(𝑑) = οΏ½Μ‡οΏ½, from (14), if πœ‘ = arctan(𝑋), then,

    οΏ½Μ‡οΏ½ = οΏ½Μ‡οΏ½ ( 11 + 𝑋2 ) with

    𝑋 = ((𝛼2 tanπœ‘0𝑙cos3πœƒ0

    + 6𝑏1𝑑 + 12𝑏

    2𝑑2 + 20𝑏

    3𝑑3) (2𝑇2)2𝑙cos3πœƒ

    Γ— ( (2𝑇 (π‘₯π‘‡βˆ’ π‘₯0)

    βˆ’ 𝑇 π‘₯𝑇 βˆ’ π‘₯0 + 2 π‘₯𝑇 βˆ’ π‘₯0 𝑑)2)βˆ’1) .

    (22)

    Another formula to calculate V2(𝑑) = οΏ½Μ‡οΏ½which is derived from

    (5) is

    οΏ½Μ‡οΏ½ = πœ•(𝑙 Μˆπ‘¦οΏ½Μ‡οΏ½ βˆ’ �̈� Μ‡π‘¦π‘Ÿ(οΏ½Μ‡οΏ½2 + ̇𝑦2)3/2

    )

    Γ—( 11 + (𝑙 ( Μˆπ‘¦οΏ½Μ‡οΏ½ βˆ’ �̈� ̇𝑦/π‘Ÿ(οΏ½Μ‡οΏ½2 + ̇𝑦2)3/2))2

    ).(23)

    Simulation for this flatness technique and all other simu-lations for different path planning algorithms in this paperare conducted with the vehicle’s parameters of 𝑙 = 2m andπ‘Ÿ = 0.25m; the vehicle initial state at time 𝑑 = 0 is π‘₯(0) =[π‘₯0, 𝑦0, πœƒ0, πœ‘0] = [0, 0, 0, 0]; the vehicle final state at time

    𝑑 = 𝑇 = 100 is π‘₯(𝑇) = [π‘₯𝑇, 𝑦𝑇, πœƒπ‘‡, πœ‘π‘‡] = [10, 10, 0, πœ‹/6].

    Figure 2 shows the trajectory (π‘₯, 𝑦) for the vehicle fromthe initial position to the final position and its velocity.Figure 3 shows the vehicle body angle, πœƒ, and the steeringangle, πœ‘, corresponding to their angular velocities, Μ‡πœƒ and οΏ½Μ‡οΏ½.

    Themaximum steering angle for this movement is πœ‘max =64∘; it exceeds the physical constraint of steering angle withβˆ’45∘ ≀ πœ‘max ≀ 45∘. Therefore, the above trajectory is notfeasible. The problem is that the distance from the startingpoint to the destination point is too short subject to the realvehicle physical constraints. A solution for this problem is tolengthen the travelling distance until it meets the constrainton steering angle. This issue is discussed in the next section.

    4. Trajectory Subject toSteering Angle Constraint

    The maximum steering angle of a vehicle depends on its realstructure space anddesign. In this paper, it is assumed that thereal structure constraint for the vehicle is (βˆ’πœ‹/4) ≀ πœ‘ ≀ πœ‹/4or the maximum steering angle for this vehicle is in a rangeof βˆ’45∘ ≀ πœ‘ ≀ 45∘:

    βˆ’πœ‹4 ≀ πœ‘ β‰€πœ‹4 . (24)

    Simulation in the previous part shows the maximum steeringangle, πœ‘max = 64∘, exceeding the limitation in (24).Therefore,a new technique for the vehicle trajectory generation subjectthe constraint in (25) is proposed.

    For time 𝑑 from initial state, 𝑑 = 0, to the final state, 𝑑 = 𝑇,the feasible trajectories π‘₯(𝑑) and 𝑦(𝑑) subject to conditions in(10) and (11) can be generated. During the progress of timing,𝑑, recalculate the steering angle, πœ‘, in (14) and then checkfor the steering constraint in (24). If the constraint in (24) isviolated, the distance from the initial position (π‘₯

    0, 𝑦0) to the

    final position (π‘₯𝑇, 𝑦𝑇) is too short for satisfying the steering

    angle limit.In this case, it is proposed that to lengthen the distance

    𝑑0= √(π‘₯

    π‘‡βˆ’ π‘₯0)2 + (𝑦

    π‘‡βˆ’ 𝑦0)2 to a new distance,

    𝑑𝑁𝑖= πœŒπ‘–π‘‘0

    with 𝜌 > 1 (25)for 𝑖 = 1, 2, 3, . . . 𝑛 until the constraint in (24) is satisfied andwith 𝜌 being an amplification coefficient, 𝜌 > 1.

    Then the new coordinates are

    π‘₯𝑇𝑁

    = πœŒπ‘› (π‘₯π‘‡βˆ’ π‘₯0) , 𝑦

    𝑇𝑁= πœŒπ‘› (𝑦

    π‘‡βˆ’ 𝑦0) . (26)

    The next simulation is done with the same parameters in theprevious part and subject to the constraint in (24) with anamplification coefficient 𝜌 = 1.1. The constraint in (24) willbe satisfied after 𝑛 = 4 iterations.Thenew coordinate isπ‘₯

    𝑇𝑁=

    𝑦𝑇𝑁

    = 23.579.Figure 4 shows the new trajectory and new velocity of the

    vehicle with the new lengthened distance. The velocity of thevehicle is increased since the final time 𝑇 is not changed.

    Figure 5 shows the new vehicle body angle, πœƒ, velocity, Μ‡πœƒ,steering angle, πœ‘, and velocity, οΏ½Μ‡οΏ½, for the new trajectory. Thenew steering angle has now satisfied the constraint πœ‘ = 40∘.

    Due to the size of this paper, the sideslip of the vehiclemodel is ignored. In reality, the sideslip of a vehicle dependson the tire stiffness and the cornering velocity. Then thetrajectory generation in this study does not depend on thevehicle velocity. In the next part, a new vehicle trajectorygeneration based on polynomial equations is investigated.

    5. Polynomial Trajectory Generation

    For faster generation of a feasible vehicle tracking, a second-order polynomial for trajectory generation is presented.Equation (1) is separated into the following forms:

    𝑧1= π‘₯, 𝑧

    2= tanπœ‘π‘™cos3πœƒ , 𝑧3 = tan πœƒ, 𝑧4 = 𝑦. (27)

  • Mathematical Problems in Engineering 5

    Time t Time t

    Time t Time t

    0 50 100

    0

    50

    100

    0 50 100

    0

    0.5

    1

    0 50 100

    0

    50

    100

    0 50 100

    0

    1

    2

    3

    βˆ’0.5

    βˆ’50 βˆ’50

    βˆ’1

    Body

    angl

    ė

    πœƒ(r

    pm)

    Stee

    r vel

    ocity

    πœ‘(r

    pm)

    Body

    angl

    eπœƒβˆ˜

    Stee

    r ang

    leπœ‘βˆ˜

    Figure 3: Body and steering angle.

    0 5 10 15 2005

    10152025

    0 10 20 30 40 50 60 70 80 90 1000

    2

    4

    6

    8

    Posit

    ion y

    Position x

    Time t

    Vehi

    cle v

    eloci

    tyοΏ½1

    (km

    )

    Figure 4: Trajectory and velocity.

  • 6 Mathematical Problems in Engineering

    0 50 100

    0

    50

    100

    0 50 100

    0

    20

    40

    0 50 100

    0

    0.5

    1

    βˆ’50 βˆ’20

    βˆ’0.50 50 100

    0

    0.5

    1

    βˆ’0.5

    Time t Time t

    Time t Time t

    Body

    angl

    ė

    πœƒ(r

    pm)

    Stee

    r vel

    ocity

    πœ‘(r

    pm)

    Body

    angl

    eπœƒβˆ˜

    Stee

    r ang

    leπœ‘βˆ˜

    Figure 5: Body and steering angle.

    Then, οΏ½Μ‡οΏ½1= οΏ½Μ‡οΏ½, (28)

    οΏ½Μ‡οΏ½2= V2𝑙 cos

    2πœƒ + 3π‘ŸV1cos πœƒ sin πœƒsin2πœ‘

    𝑙2cos5πœƒcos2πœ‘ ,

    οΏ½Μ‡οΏ½3= tanπœ‘π‘™cos2πœƒπ‘ŸV1,

    οΏ½Μ‡οΏ½4= ̇𝑦 = sin πœƒπ‘ŸV

    1.

    (29)

    The vehicle will move from the initial state (π‘₯0, 𝑦0, πœƒ0, πœ‘0) at

    time 𝑑 = 0 to the final state (π‘₯𝑇, 𝑦𝑇, πœƒπ‘‡, πœ‘π‘‡) at time 𝑑 = 𝑇

    corresponding from the initial state at (𝑧1.0, 𝑧2.0, 𝑧3.0, 𝑧4.0) to

    the final state at (𝑧1.𝑇, 𝑧2.𝑇, 𝑧3.𝑇, 𝑧4.𝑇).

    For 0 ≀ 𝑑 ≀ 𝑇, the calculation of [𝑧1(𝑑), 𝑧2(𝑑), 𝑧3(𝑑), 𝑧4(𝑑)]

    will be

    𝑧1(𝑑) = 𝑧

    1.0+ 𝑔𝑑,

    𝑧2(𝑑) = 𝑧

    2.0+ β„Ž1𝑑 + 12β„Ž2𝑑

    2 + 13β„Ž3𝑑3,

    𝑧3(𝑑) = 𝑧

    3.0+ 𝑔𝑧2.0𝑑 + 12π‘”β„Ž1𝑑

    2 + 16π‘”β„Ž2𝑑3 + 112π‘”β„Ž3𝑑

    4,

    𝑧4(𝑑) = 𝑧

    4.0+ 𝑔𝑧3.0𝑑 + 12𝑔

    2𝑧2.0𝑑2

    + 16𝑔2β„Ž1𝑑3 + 124𝑔

    2β„Ž2𝑑4 + 160𝑔

    2β„Ž3𝑑5

    (30)

    with

    𝑔 = 𝑧1.𝑇 βˆ’ 𝑧1.0𝑇 ,[β„Ž1, β„Ž2, β„Ž3] = π·βˆ’1𝑒,

    𝐷 =[[[[[[[[

    𝑇 12𝑇2 1

    3𝑇3

    12𝑔𝑇2 1

    6𝑔𝑇3 1

    12𝑔𝑇4

    16𝑔2𝑇3 124𝑔

    2𝑇4 160𝑔2𝑇5

    ]]]]]]]]

    ,

    𝑒 =[[[[[

    𝑧2.𝑇

    βˆ’ 𝑧2.0

    𝑧3.𝑇

    βˆ’ 𝑧3.0βˆ’ 𝑔𝑧2.0𝑇

    𝑧4.𝑇

    βˆ’ 𝑧4.0βˆ’ 𝑔𝑧3.0𝑇 βˆ’ 12𝑔

    2𝑧2.0𝑇2]]]]]

    .

    (31)

  • Mathematical Problems in Engineering 7

    0 1 2 3 4 5 6 7 8 9 1002468

    10

    0 10 20 30 40 50 60 70 80 90 1000

    2

    4

    6

    8

    Posit

    ion y

    Position x

    Time t

    Vehi

    cle v

    eloc

    ityοΏ½1

    (km

    )

    Figure 6: Trajectory and velocity.

    Simulation of this method is conducted with the sameparameters in Section 2 and is shown in Figures 6 and 7 usingthe following equations:

    πœƒ = arctan (𝑧3) ,

    πœ‘ = arctan (𝑧2𝑙cos3πœƒ) ,

    οΏ½Μ‡οΏ½ (𝑑) = οΏ½Μ‡οΏ½1(𝑑) = 𝑔,

    ̇𝑦 (𝑑) = οΏ½Μ‡οΏ½4(𝑑) = 𝑔𝑧

    3.0+ 𝑔2𝑧

    2.0𝑑

    + 12𝑔2β„Ž1𝑑2 + 18𝑔

    2β„Ž2𝑑3 + 112𝑔

    2β„Ž3𝑑4,

    V1(𝑑) =

    βˆšοΏ½Μ‡οΏ½2 (𝑑) + ̇𝑦2 (𝑑)π‘Ÿ ,

    Μ‡πœƒ = οΏ½Μ‡οΏ½3cos2πœƒ = (𝑔𝑧

    2.0+ π‘”β„Ž1𝑑 + 12π‘”β„Ž2𝑑

    2 + 13π‘”β„Ž3𝑑3) cos2πœƒ,

    (32)

    And, from (28),

    οΏ½Μ‡οΏ½ = οΏ½Μ‡οΏ½2(𝑑) 𝑙cos3πœƒ cos2πœ‘ βˆ’ 3 Μ‡πœƒ tan πœƒ sinπœ‘ cosπœ‘. (33)

    Figure 6 shows the trajectory (π‘₯,𝑦) for the vehicle from initialpoint to the final point and the velocity of the vehicle.

    Figure 7 shows the vehicle body angle, πœƒ, and the steeringangle,πœ‘, corresponding to the angular velocity, Μ‡πœƒ and οΏ½Μ‡οΏ½, of thevehicle.

    As shown in Figure 7, the maximum steering angle forthis trajectory generation is πœ‘ = 41.5736∘ and satisfiedthe constraint βˆ’45∘ ≀ πœ‘ ≀ 45∘. Therefore this trajectorygeneration is better than the flatness method in the previouspart.

    From Figure 6, it is really not realistic when the vehiclespeed is increasing exponentially. It is expected that, when avehicle is moving from one point to another point, the speedwill increase gradually at the starting point and decreasegradually to the destination point. Therefore, in the nextpart, new symmetric polynomial equations in third order areinvestigated.

    6. Symmetric PolynomialTrajectory Generation

    Since the system is flat and each flat output can be parame-terized by a sufficiently smooth polynomial, symmetric third-order polynomial equations are tried for this trajectory gen-eration. Because the sideslip is ignored, the vehicle trajectorydoes not depend on its speed, V

    1, and on the travelling time,

    𝑇. A new time variable, therefore, for this system is appliedwith a ratio of 𝑑/𝑇 for 𝑑 = 0 Γ· 𝑇:

    π‘₯ (𝑑) = βˆ’( 𝑑𝑇 βˆ’ 1)3

    π‘₯0+ ( 𝑑𝑇)

    3

    π‘₯𝑇

    + π‘Žπ‘₯( 𝑑𝑇)2

    ( 𝑑𝑇 βˆ’ 1) + 𝑏π‘₯𝑑𝑇(

    𝑑𝑇 βˆ’ 1)

    2(34)

    and the trajectory of 𝑦 is

    𝑦 (𝑑) = βˆ’( 𝑑𝑇 βˆ’ 1)3

    𝑦0+ ( 𝑑𝑇)

    3

    π‘₯𝑇

    + π‘Žπ‘¦( 𝑑𝑇)2

    ( 𝑑𝑇 βˆ’ 1) + 𝑏𝑦𝑑𝑇(

    𝑑𝑇 βˆ’ 1)

    2

    .(35)

    Derivation of π‘₯(𝑑) is

    οΏ½Μ‡οΏ½ (𝑑) = βˆ’3( 𝑑𝑇 βˆ’ 1)2

    π‘₯0+ 3( 𝑑𝑇)

    2

    π‘₯𝑇+ π‘Žπ‘₯2 𝑑𝑇 (

    𝑑𝑇 βˆ’ 1)

    + π‘Žπ‘₯( 𝑑𝑇)2

    + 𝑏π‘₯( 𝑑𝑇 βˆ’ 1)

    2

    + 𝑏π‘₯2 𝑑𝑇 (

    𝑑𝑇 βˆ’ 1)

    (36)

    and derivation of 𝑦(𝑑) is

    ̇𝑦 (𝑑) = βˆ’3( 𝑑𝑇 βˆ’ 1)2

    𝑦0+ 3( 𝑑𝑇)

    2

    𝑦𝑇+ π‘Žπ‘¦2 𝑑𝑇 (

    𝑑𝑇 βˆ’ 1)

    + π‘Žπ‘¦( 𝑑𝑇)2

    + 𝑏𝑦( 𝑑𝑇 βˆ’ 1)

    2

    + 𝑏𝑦2 𝑑𝑇 (

    𝑑𝑇 βˆ’ 1) .

    (37)

    Then,

    �̈� (𝑑) = βˆ’6 ( 𝑑𝑇 βˆ’ 1) π‘₯0 + 6𝑑𝑇π‘₯𝑇 + π‘Žπ‘₯2 (2

    𝑑𝑇 βˆ’ 1)

    + π‘Žπ‘₯2 𝑑𝑇 + 𝑏π‘₯2 (

    𝑑𝑇 βˆ’ 1) + 𝑏π‘₯2 (2

    𝑑𝑇 βˆ’ 1) ,

    (38)

    Μˆπ‘¦ (𝑑) = βˆ’6 ( 𝑑𝑇 βˆ’ 1)𝑦0 + 6𝑑𝑇𝑦𝑇 + π‘Žπ‘¦2 (2

    𝑑𝑇 βˆ’ 1)

    + π‘Žπ‘¦2 𝑑𝑇 + 𝑏𝑦2 (

    𝑑𝑇 βˆ’ 1) + 𝑏𝑦2 (2

    𝑑𝑇 βˆ’ 1) .

    (39)

    The constraint on speed is

    π‘ŸV1= οΏ½Μ‡οΏ½cos πœƒ =

    ̇𝑦sin πœƒ . (40)

    The constraint at starting point 𝑑 = 0 is

    οΏ½Μ‡οΏ½ (0) = π‘˜0cos πœƒ0, ̇𝑦 (0) = π‘˜

    0sin πœƒ0. (41)

    The constraint at destination point 𝑑 = 𝑇 is

    οΏ½Μ‡οΏ½ (𝑇) = π‘˜π‘‡cos πœƒπ‘‡, ̇𝑦 (𝑇) = π‘˜

    𝑇sin πœƒπ‘‡. (42)

  • 8 Mathematical Problems in Engineering

    0 50 100

    0

    50

    100

    0 50 100

    0

    0.5

    0 50 100

    0

    50

    0 50 100

    0

    0.5

    1

    βˆ’50 βˆ’50

    βˆ’0.5βˆ’0.5

    Time t Time t

    Time t Time t

    Body

    angl

    ė

    πœƒ(r

    pm)

    Stee

    r vel

    ocity

    πœ‘(r

    pm)

    Body

    angl

    eπœƒβˆ˜

    Stee

    r ang

    leπœ‘βˆ˜

    Figure 7: Body and steering angle.

    0 1 2 3 4 5 6 7 8 9 100

    5

    10

    0 10 20 30 40 50 60 70 80 90 1000

    1

    2

    3

    Posit

    ion y

    Position x

    Time t

    Vehi

    cle v

    eloci

    tyοΏ½1

    (km

    )

    Figure 8: Trajectory and velocity.

  • Mathematical Problems in Engineering 9

    0 50 1000

    20

    40

    60

    0 50 100

    0

    20

    40

    60

    0 50 100

    0

    20

    40

    60

    0 50 100

    0

    1

    2

    βˆ’20

    βˆ’20

    βˆ’1

    Time t Time t

    Time t Time t

    Body

    angl

    ė

    πœƒ(r

    pm)

    Stee

    r vel

    ocity

    πœ‘(r

    pm)

    Body

    angl

    eπœƒβˆ˜

    Stee

    r ang

    leπœ‘βˆ˜

    Figure 9: Body and steering angle.

    0 1 2 3 4 5 6 7 8 9 100

    5

    10

    FlatnessPolynomialSymmetric polynomial

    0 10 20 30 40 50 60 70 80 90 1000

    2

    4

    6

    8

    Posit

    iony

    Position x

    Time t

    Velo

    cityοΏ½1

    Figure 10: Comparison of trajectory and velocity.

  • 10 Mathematical Problems in Engineering

    0 50

    50

    100

    0

    20

    40

    60

    FlatnessPolynomialSymmetric polynomial Symmetric polynomial

    FlatnessPolynomial

    0 100

    0

    50

    0 50 100

    0

    50

    0 50 100

    0

    0.5

    1

    1.5

    βˆ’50

    βˆ’50

    Time t Time t

    Time t Time t

    Body

    angl

    ė

    πœƒ(r

    pm)

    Stee

    r vel

    ocity

    πœ‘(r

    pm)

    Body

    angl

    eπœƒβˆ˜

    Stee

    r ang

    leπœ‘βˆ˜

    Figure 11: Comparison of body and steering angle.

    0 2 4 6 8 100

    5

    10

    0 10 20 30 40 50 60 70 80 90 100

    0

    2

    4

    βˆ’2

    Posit

    ion y

    Position x

    Time t

    Vehi

    cle v

    eloci

    tyοΏ½1

    (km

    )

    Figure 12: Trajectory and velocity in reverse speed.

  • Mathematical Problems in Engineering 11

    0 50 100

    0

    50

    100

    0 50 100

    0

    50

    0 50 100

    0

    20

    40

    0 50 100

    0

    1

    2

    βˆ’1

    βˆ’2

    βˆ’20

    βˆ’50

    βˆ’50

    βˆ’100

    Time t Time t

    Time t Time t

    Body

    angl

    ė

    πœƒ(r

    pm)

    Stee

    r vel

    ocity

    πœ‘(r

    pm)

    Body

    angl

    eπœƒβˆ˜

    Stee

    r ang

    leπœ‘βˆ˜

    Figure 13: Body and steering angle in reverse speed.

    From (38), (39), (41), and (42), for the calculation simplicity,it is assumed that the speed coefficients at the starting anddestination points, π‘˜

    0= π‘˜π‘‡= π‘˜; then

    π‘Žπ‘₯= π‘˜ cos πœƒ

    π‘‡βˆ’ 3π‘₯𝑇, 𝑏

    π‘₯= π‘˜ cos πœƒ

    0βˆ’ 3π‘₯0. (43)

    Similarly,

    π‘Žπ‘¦= π‘˜ sin πœƒ

    π‘‡βˆ’ 3𝑦𝑇, 𝑏

    𝑦= π‘˜ sin πœƒ

    0βˆ’ 3𝑦0. (44)

    Simulation is conducted with the same parameters in theprevious parts and is shown in Figures 8 and 9. The speedcoefficients are π‘˜

    0= π‘˜π‘‡= π‘˜ = 1. Other parameters are

    calculated in the following equations:

    V1=βˆšοΏ½Μ‡οΏ½2 + ̇𝑦2

    π‘Ÿ ,

    πœƒ = arctan( ̇𝑦�̇�) ,

    πœ‘ = arctan(𝑙cos3πœƒ Μˆπ‘¦

    (οΏ½Μ‡οΏ½)2 )

    or πœ‘ = arctan(𝑙 Μˆπ‘¦οΏ½Μ‡οΏ½ βˆ’ �̈� Μ‡π‘¦π‘Ÿ(οΏ½Μ‡οΏ½2 + ̇𝑦2)3/2

    ) ,

    Μ‡πœƒ = Μˆπ‘¦οΏ½Μ‡οΏ½ βˆ’ �̈� ̇𝑦�̇�21

    ( ̇𝑦/οΏ½Μ‡οΏ½ )2 + 1= Μˆπ‘¦οΏ½Μ‡οΏ½ βˆ’ �̈� ̇𝑦�̇�2 + ̇𝑦2 =

    tanπœ‘π‘™ π‘ŸV1,

    οΏ½Μ‡οΏ½ =πœ• (arctan(𝑙 (( Μˆπ‘¦οΏ½Μ‡οΏ½ βˆ’ �̈� ̇𝑦) /π‘Ÿ(οΏ½Μ‡οΏ½2 + ̇𝑦2)3/2)))

    πœ•π‘‘ .(45)

    It can be seen from Figure 8 that the trajectory of thissymmetric polynomial is more realistic because the velocityincreases from the starting point and decreases in the desti-nation point as per the expectation.

    The maximum steering angle for the symmetric polyno-mial method is πœ‘ = 41.1622∘ and satisfied the constraintβˆ’45∘ ≀ πœ‘ ≀ 45∘. This steering angle is smaller than thesteering angle in the second-order polynomial method. Inthe next part, a comparison of the previous three methodsis presented.

  • 12 Mathematical Problems in Engineering

    7. Performance Analysis

    Performances of the three methods on the trajectory genera-tion and the vehicle velocity are shown in Figures 10 and 11.

    It can be seen that the symmetric polynomial generationcan produce a more realistic speed and a smoother trajectorysince it allows the vehicle gradually to increase the speed atthe starting point and reduce the speed at the destinationpoint.

    Figure 11 shows the symmetric polynomial method pro-viding the lowest body angle, πœƒ(𝑑), the body angle velocity,Μ‡πœƒ(𝑑), the steering angle, πœ‘(𝑑), and the steering angle velocity,οΏ½Μ‡οΏ½(𝑑). Therefore, this method is recommended for the devel-opment of an automatic control of tracking vehicles.

    For the vehicle moving in reverse speeds, as mentionedin (1), the vehicle velocity, V

    1, will change the sign. The

    speed coefficients in (43) and (44) will be minus values.Simulations for the reverse speeds are conducted with thespeed coefficients π‘˜

    0= π‘˜π‘‡= π‘˜ = βˆ’1. Results of the simulation

    are shown in Figures 12 and 13.Since the vehicle is forced to reverse at the starting point

    with π‘˜0= βˆ’1 and at the destination pointwith π‘˜

    π‘‡βˆ’1, Figure 12

    shows the vehicle reversing out at the starting point, goingforward to the destination, and then again reversing to theparking space. The vehicle velocity is changing the directionin three times.

    Figure 13 shows the body angle, πœƒ, switching 180∘ in twotimes corresponding to each reverse speed. The maximumsteering angle in this reverse speed is πœ‘max = 33.7097∘. Thisnumber ismuch lower than the numbers of the forward speedmovements. However the travelling distance is also longer inthe reverse speed trajectory.

    8. Conclusion

    The paper has presented three methods of trajectory genera-tion for autonomous vehicles subject to constraints. Regard-ing the real vehicle speed development, the third-ordersymmetric polynomial trajectory is recommended. Simula-tions and analyses are also conducted for vehicle moving inforward and in reverse speeds. Results from this study canbe used to develop a real-time control system for autodrivingand autoparking vehicles. The limitation of this study is theignorance of the vehicle sideslip due to the cornering velocity.However this error can be eliminated with the feedbackcontrol loop and some offset margins of the steering angleconstraint.

    Conflict of Interests

    The authors declare that there is no conflict of interests regar-ding the publication of this paper.

    References

    [1] J. Lévine, Analysis and Control of Nonlinear Systems: A Flatness-Based Approach, Springer, 1st edition, 2009.

    [2] W. Dong and Y. Guo, β€œNew trajectory generation methods fornonholonomic mobile robots,” in Proceedings of the Interna-tional SymposiumonCollaborative Technologies and Systems, pp.353–358, Saint Louis, Mo, USA, 2005.

    [3] M. Gomez, V. González, T. Mart́ınez-Maŕın, D. Meziat, and S.Sánchez, β€œOptimal motion planning by reinforcement learningin autonomousmobile vehicles,”Robotica, vol. 30, no. 2, pp. 159–170, 2012.

    [4] J.Wang, Z. Lu,W. Chen, and X.Wu, β€œAn adaptive trajectory tra-cking control of wheeled mobile robots,” in Proceedings of the6th IEEE Conference on Industrial Electronics and Applications(ICIEA ’11), pp. 1156–1160, Beijing, China, 2011.

    [5] M. Werling, S. Kammel, J. Ziegler, and L. Gröll, β€œOptimal traj-ectories for time-critical street scenarios using discretized ter-minal manifolds,” International Journal of Robotics Research,vol. 31, no. 3, pp. 346–359, 2012.

    [6] K. Kanjanawanishkul, M. Hofmeister, and A. Zell, β€œSmoothreference tracking of amobile robot using nonlinearmodel pre-dictive control,” in Proceedings of the 4th European Conferenceon Mobile Robots (ECMR ’09), pp. 161–166, Dubrovnik, Croatia,2009.

    [7] G. Klančar and I. Škrjanc, β€œTracking-errormodel-based predic-tive control for mobile robots in real time,” Robotics and Auto-nomous Systems, vol. 55, no. 6, pp. 460–469, 2007.

    [8] V. T. Minh, Advanced Vehicle Dynamics, Malaya Press, KualaLumpur, Malaysia, 1st edition, 2012.

    [9] V. T. Minh and N. Afzulpurkar, β€œA comparative study on comp-utational schemes for nonlinear model predictive control,”Asian Journal of Control, vol. 8, no. 4, pp. 324–331, 2006.

    [10] J. Choi, R. Curry, and G. Elkaim, β€œCurvature-continuous tra-jectory generation with corridor constraint for autonomousground vehicles,” in Proceedings of the 49th IEEE Conference onDecision and Control, pp. 7166–7171, Atlanta, Ga, USA, 2010.

    [11] V. Delsart, T. Fraichard, and L. Martinez, β€œReal-time trajectorygeneration for car-like vehicles navigating dynamic environ-ments,” in Proceedings of the IEEE International Conference onRobotics and Automation (ICRA ’09), pp. 3401–3406, Kobe,Japan, 2009.

    [12] T. Zhou, M. Li, X. Mai, Q. Wang, F. Liu, and Q. Li, β€œTrajectorygenerationmodel-based IMM tracking for safe driving in inter-section scenario,” International Journal of Vehicular Technology,vol. 2011, Article ID 103696, 8 pages, 2011.

    [13] M. Missura and S. Behnke, β€œEfficient kinodynamic trajectorygeneration for wheeled robots,” in Proceedings of the IEEEInternational Conference onRobotics andAutomation, pp. 4883–4888, Shanghai, China, 2011.

    [14] V. T.Minh and A. A. Rashid, β€œAutomatic control of clutches andsimulations for parallel hybrid vehicles,” International Journal ofAutomotive Technology, vol. 13, no. 4, pp. 645–651, 2012.

    [15] V. T.Minh,M. Awang, and S. Parman, β€œConditions for stabiliza-bility of linear switched systems,” International Journal of Con-trol, Automation and Systems, vol. 9, no. 1, pp. 139–144, 2011.

  • Submit your manuscripts athttp://www.hindawi.com

    Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    MathematicsJournal of

    Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    Mathematical Problems in Engineering

    Hindawi Publishing Corporationhttp://www.hindawi.com

    Differential EquationsInternational Journal of

    Volume 2014

    Applied MathematicsJournal of

    Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    Probability and StatisticsHindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    Journal of

    Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    Mathematical PhysicsAdvances in

    Complex AnalysisJournal of

    Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    OptimizationJournal of

    Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    CombinatoricsHindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    International Journal of

    Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    Operations ResearchAdvances in

    Journal of

    Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    Function Spaces

    Abstract and Applied AnalysisHindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    International Journal of Mathematics and Mathematical Sciences

    Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    The Scientific World JournalHindawi Publishing Corporation http://www.hindawi.com Volume 2014

    Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    Algebra

    Discrete Dynamics in Nature and Society

    Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    Decision SciencesAdvances in

    Discrete MathematicsJournal of

    Hindawi Publishing Corporationhttp://www.hindawi.com

    Volume 2014 Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014

    Stochastic AnalysisInternational Journal of