17 August 2022 in IEEE Transactions on Intelligent Transportation Systems
In the context of autonomous driving, the iterative linear quadratic regulator (iLQR) is known to be an efficient approach to deal with the nonlinear vehicle model in motion planning problems. Particularly, the constrained iLQR algorithm has shown noteworthy advantageous outcomes of computation efficiency in achieving motion planning tasks under general constraints of different types. However, the constrained iLQR methodology requires a feasible trajectory at the first iteration as a prerequisite when the logarithmic barrier function is used. Also, the methodology leaves open the possibility for incorporation of fast, efficient, and effective optimization methods (i.e., fast-solvers) to further speed up the optimization process such that the requirements of real-time implementation can be successfully fulfilled. In this paper, a well-defined and commonly-encountered motion planning problem is formulated under nonlinear vehicle dynamics and various constraints, and the alternating direction method of multipliers (ADMM) is utilized to determine the optimal control actions leveraging the iLQR. With this development, the approach is able to circumvent the feasibility requirement of the trajectory at the first iteration. An illustrative example of motion planning for autonomous vehicles is then investigated with different driving scenarios taken into consideration, and a noteworthy achievement of high computation efficiency is attained with the proposed development. Comparing with the constrained iLQR algorithm based on the logarithmic barrier function, our proposed method reduces the average computation time by $31.93\%$ , $38.52\%$ , and $44.57\%$ in the three scenarios; compared with the optimization solver IPOPT, our proposed method reduces the average computation time by $46.02\%$ , $53.26\%$ , and $88.43\%$ in the three scenarios. As a result, real-time computation and implementation can be realized through our proposed framework, and thus it provides additional safety to the on-road driving tasks.
2 May 2022 in IEEE Transactions on Neural Networks and Learning Systems
Trajectory planning is one of the indispensable and critical components in robotics and autonomous systems. As an efficient indirect method to deal with the nonlinear system dynamics in trajectory planning tasks over the unconstrained state and control space, the iterative linear quadratic regulator (iLQR) has demonstrated noteworthy outcomes. In this article, a local-learning-enabled constrained iLQR algorithm is herein presented for trajectory planning based on hybrid dynamic optimization and machine learning. Rather importantly, this algorithm attains the key advantage of circumventing the requirement of system identification, and the trajectory planning task is achieved with a simultaneous refinement of the optimal policy and the neural network system in an iterative framework. The neural network can be designed to represent the local system model with a simple architecture, and thus it leads to a sample-efficient training pipeline. In addition, in this learning paradigm, the constraints of the general form that are typically encountered in trajectory planning tasks are preserved. Several illustrative examples on trajectory planning are scheduled as part of the test itinerary to demonstrate the effectiveness and significance of this work.
24 November 2020 in IEEE Transactions on Cybernetics
Continued great efforts have been dedicated toward high-quality trajectory generation based on optimization methods; however, most of them do not suitably and effectively consider the situation with moving obstacles; and more particularly, the future position of these moving obstacles in the presence of uncertainty within some possible prescribed prediction horizon. To cater to this rather major shortcoming, this work shows how a variational Bayesian Gaussian mixture model (vBGMM) framework can be employed to predict the future trajectory of moving obstacles; and then with this methodology, a trajectory generation framework is proposed which will efficiently and effectively address trajectory generation in the presence of moving obstacles, and incorporate the presence of uncertainty within a prediction horizon. In this work, the full predictive conditional probability density function (PDF) with mean and covariance is obtained and, thus, a future trajectory with uncertainty is formulated as a collision region represented by a confidence ellipsoid. To avoid the collision region, chance constraints are imposed to restrict the collision probability, and subsequently, a nonlinear model predictive control problem is constructed with these chance constraints. It is shown that the proposed approach is able to predict the future position of the moving obstacles effectively; and, thus, based on the environmental information of the probabilistic prediction, it is also shown that the timing of collision avoidance can be earlier than the method without prediction. The tracking error and distance to obstacles of the trajectory with prediction are smaller compared with the method without prediction.
14 July 2021 in IEEE Transactions on Intelligent Transportation Systems
This paper investigates the cooperative planning and control problem for multiple connected autonomous vehicles (CAVs) in different scenarios. In the existing literature, most of the methods suffer from significant problems in computational efficiency. Furthermore, as the optimization problem is nonlinear and nonconvex, it typically poses great difficulty in determining the optimal solution. To address this issue, this work proposes a novel and completely parallel computation framework by leveraging the alternating direction method of multipliers (ADMM). The nonlinear and nonconvex optimization problem in the autonomous driving problem can be divided into two manageable sub-problems; and the resulting sub-problems can be solved by using effective optimization methods in a parallel framework. Here, the differential dynamic programming (DDP) algorithm is capable of addressing the nonlinearity of the system dynamics rather effectively; and the nonconvex coupling constraints with small dimensions can be resolved by invoking the notion of semi-definite relaxation (SDR), which can also be solved in a very short time. Due to the parallel computation and efficient relaxation of nonconvex constraints, our proposed approach effectively realizes real-time implementation; and thus extra assurance of driving safety is provided. In addition, two transportation scenarios for multiple CAVs are used to illustrate the effectiveness and efficiency of the proposed method.
19 January 2021 in IEEE Transactions on Automatic Control
The $\mathcal {H}_2$ -guaranteed cost decentralized control problem is investigated in this article. More specifically, on the basis of an appropriate $\mathcal {H}_2$ reformulation that we put in place, the optimal control problem in the presence of parameter uncertainties is then suitably characterized by convex restriction and solved in parameter space. It is shown that a set of stabilizing decentralized controller gains for the uncertain system is parameterized in a convex set through appropriate convex restriction, and then an approximated conic optimization problem is constructed. This facilitates the use of the symmetric Gauss–Seidel (sGS) semi-proximal augmented Lagrangian method (ALM), which attains high computational effectiveness. A comprehensive analysis is given on the application of the approach in solving the optimal decentralized control problem; and subsequently, the preserved decentralized structure, robust stability, and robust performance are all suitably guaranteed with the proposed methodology. Furthermore, an illustrative example is presented to demonstrate the effectiveness of the proposed optimization approach.
14 July 2021 in IEEE/ASME Transactions on Mechatronics
This paper proposes a global iterative sliding mode control approach for high-precision contouring tasks of a flexure-linked biaxial gantry system. For such high-precision contouring tasks, it is the typical situation that the involved multi-axis cooperation is one of the most challenging problems. As also would be inevitably encountered, various factors render the multi-axis cooperation rather difficult; such as the strong coupling (which naturally brings nonlinearity) between different axes due to its mechanical structure, the backlash and deadzone caused by the friction, and the difficulties in system identification, etc. To overcome the above-mentioned issues, this work investigates an intelligent model-free contouring control method for such a multi-axis motion stage. Essentially in the methodology developed here, it is firstly ensured that all the coupling, friction, nonlinearity, and disturbance (regarded as uncertain dynamics in each axis) are suitably posed as uncertainties; and then a varying-gain sliding mode control method is proposed to adaptively compensate for the matched unknown dynamics in the time domain, while an iterative learning law is applied to suppress the undesirable effects arising from the remaining repetitive matched and unmatched uncertainties in the iteration domain. With this approach, the chattering that typically results from the over-estimated control gains in the sliding mode control is thus suppressed during the iterations. To analyze the contouring performance and show the improved outcomes, rigorous proof is furnished on both the stability in the time domain and the convergence in the iteration domain; and the real-time experiments also illustrate that the requirements of precision motion control towards high-speed and complex-curvature references can be satisfied using the proposed method, without prior knowledge of the boundary to the unknown dynamics.