Tianhao Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tianhao Liu has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Runqi Chai
Beijing Institute of Technology
5 shared publications - Senchun Chai
Beijing Institute of Technology
3 shared publications - Barry Lennox
Control Systems and Robotics Group (CSR), Department of Electrical and Electronic Engineering, The University of Manchester, Manchester, U.K.
2 shared publications - Kaiyuan Chen
Vanke School of Public Health, Tsinghua University, Beijing, China
2 shared publications - Yuanqing Xia
Zhongyuan University of Technology
2 shared publications - Antonios Tsourdos
Faculty of Engineering and Applied Sciences, Cranfield University, College Road, Bedford MK43 0AL, UK
1 shared publication
Latest Publications
- 9 February 2026
- Published by Elsevier in Control Engineering Practice
- Vol. 170
Convex optimization-based parallel trajectory stitching in dynamic environments: A dual-layer trajectory planning framework
- 9 February 2026
- Published by Elsevier in Control Engineering Practice
- Vol. 170
Convex optimization-based parallel trajectory stitching in dynamic environments: A dual-layer trajectory planning framework
- 14 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 12 (9) , 1814-1829
Adaptive Dual-Loop Disturbance Observer-Based Robust Model Predictive Tracking Control for Autonomous Hypersonic Vehicles
To solve the attitude trajectory tracking problem for hypersonic vehicles in the presence of system constraints and unknown disturbances, this paper designed a nonlinear robust model predictive control (RMPC) scheme, which can produce near-optimal tracking commands. Unlike the existing designs, the proposed scheme is less conservative and successfully prioritizes the solution optimality. The established RMPC follows a dualloop structure. Specifically, in the outer feedback loop, the reference attitude angle profiles are optimally tracked, while in the inner feedback loop, the control moment commands are produced by optimally tracking the desired angular rate trajectories. Besides, an adaptive disturbance observer (ADO) is designed and embedded in the inner and outer RMPC controllers to alleviate the negative effects caused by unknown external disturbances. The recursive feasibility of the optimization process, together with the input-to-state stability of the proposed RMPC, is theoretically guaranteed by introducing a tightened control constraint and terminal region. The derived property reveals that our proposal can steer the tracking error within a small region of convergence. Finally, the effectiveness of the proposed scheme is demonstrated by performing simulation studies.
- 14 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 12 (9) , 1814-1829
Adaptive Dual-Loop Disturbance Observer-Based Robust Model Predictive Tracking Control for Autonomous Hypersonic Vehicles
To solve the attitude trajectory tracking problem for hypersonic vehicles in the presence of system constraints and unknown disturbances, this paper designed a nonlinear robust model predictive control (RMPC) scheme, which can produce near-optimal tracking commands. Unlike the existing designs, the proposed scheme is less conservative and successfully prioritizes the solution optimality. The established RMPC follows a dualloop structure. Specifically, in the outer feedback loop, the reference attitude angle profiles are optimally tracked, while in the inner feedback loop, the control moment commands are produced by optimally tracking the desired angular rate trajectories. Besides, an adaptive disturbance observer (ADO) is designed and embedded in the inner and outer RMPC controllers to alleviate the negative effects caused by unknown external disturbances. The recursive feasibility of the optimization process, together with the input-to-state stability of the proposed RMPC, is theoretically guaranteed by introducing a tightened control constraint and terminal region. The derived property reveals that our proposal can steer the tracking error within a small region of convergence. Finally, the effectiveness of the proposed scheme is demonstrated by performing simulation studies.
- 1 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (9) , 6151-6158
Chance Constrained Mobile Robot Trajectory Optimization in Partially Known Environments
This article studies a mobile robot trajectory optimization problem where the control path constraints are affected by stochastic parameters and the obstacle information is limited. Based on online measured data, an upper confidence bound (UCB) is designed such that the estimated obstacle regions are guaranteed to cover the real obstacles with a predefined probability, thus avoiding collisions. Using the proposed approach, the control path constraints are transformed into deterministic constraints using analytic approximations. By adjusting the parameters in the proposed approximation function, the feasible set of the approximate optimization problem converges to the real feasible set conservatively. Such a property leads to both feasibility and suboptimality of the solution obtained by solving a deterministic optimization problem. Numerical results demonstrate that the designed UCB and approximation function are effective for trajectory optimization problems with control bounds and obstacle avoidance chance constraints. Comparative studies verified that the approximation function ensures the feasibility of the original chance constrained problem and reduces conservatism.
- 1 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (9) , 6151-6158
Chance Constrained Mobile Robot Trajectory Optimization in Partially Known Environments
This article studies a mobile robot trajectory optimization problem where the control path constraints are affected by stochastic parameters and the obstacle information is limited. Based on online measured data, an upper confidence bound (UCB) is designed such that the estimated obstacle regions are guaranteed to cover the real obstacles with a predefined probability, thus avoiding collisions. Using the proposed approach, the control path constraints are transformed into deterministic constraints using analytic approximations. By adjusting the parameters in the proposed approximation function, the feasible set of the approximate optimization problem converges to the real feasible set conservatively. Such a property leads to both feasibility and suboptimality of the solution obtained by solving a deterministic optimization problem. Numerical results demonstrate that the designed UCB and approximation function are effective for trajectory optimization problems with control bounds and obstacle avoidance chance constraints. Comparative studies verified that the approximation function ensures the feasibility of the original chance constrained problem and reduces conservatism.
- 7 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 71 (12) , 16602-16613
Fast Collision-Free Multi-Vehicle Lane Change Motion Planning and Control Framework in Uncertain Environments
In this article, we focus on the design, test and validation of a hierarchical control framework capable of optimizing lane change trajectories and steering the motion of multiple automated guided vehicles (AGVs) in an uncertain environment. In the upper-level maneuver planning phase, a convex feasible set-based real-time optimization algorithm is adopted to plan the optimal motion trajectories for AGVs. The main novelty of this approach lies in its optimization process, where a sequence of convex feasible sets around the current solution is iteratively constructed such that the nonconvex collision avoidance constraints can be approximated. Subsequently, an improved sequential convex programming (SCP) algorithm is designed and applied to reshape the current maneuver trajectory in the preconstructed convex feasible sets and reduce the error caused by successive linearization of vehicle kinematics and constraints. The planned lane change trajectories are then provided to the lower-level motion controller, where a deep reinforcement learning (DRL)-based collision-free tracking control method is established and applied onboard to produce the control commands. This approach has the capability to deal with unexpected obstacles (e.g., those that suddenly appear around the vehicle). The proposed training method integrates a consensus algorithm with actor-critic deep reinforcement learning to allow multiagent training to achieve faster training speed and improved performance compared with single-agent training. The feasibility and effectiveness of the proposed design are verified by carrying out simulation case studies. Moreover, the validity of the designed hierarchical control framework is further confirmed by executing hardware-in-the-loop tests.
- 7 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 71 (12) , 16602-16613
Fast Collision-Free Multi-Vehicle Lane Change Motion Planning and Control Framework in Uncertain Environments
In this article, we focus on the design, test and validation of a hierarchical control framework capable of optimizing lane change trajectories and steering the motion of multiple automated guided vehicles (AGVs) in an uncertain environment. In the upper-level maneuver planning phase, a convex feasible set-based real-time optimization algorithm is adopted to plan the optimal motion trajectories for AGVs. The main novelty of this approach lies in its optimization process, where a sequence of convex feasible sets around the current solution is iteratively constructed such that the nonconvex collision avoidance constraints can be approximated. Subsequently, an improved sequential convex programming (SCP) algorithm is designed and applied to reshape the current maneuver trajectory in the preconstructed convex feasible sets and reduce the error caused by successive linearization of vehicle kinematics and constraints. The planned lane change trajectories are then provided to the lower-level motion controller, where a deep reinforcement learning (DRL)-based collision-free tracking control method is established and applied onboard to produce the control commands. This approach has the capability to deal with unexpected obstacles (e.g., those that suddenly appear around the vehicle). The proposed training method integrates a consensus algorithm with actor-critic deep reinforcement learning to allow multiagent training to achieve faster training speed and improved performance compared with single-agent training. The feasibility and effectiveness of the proposed design are verified by carrying out simulation case studies. Moreover, the validity of the designed hierarchical control framework is further confirmed by executing hardware-in-the-loop tests.
- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (5) , 6259-6269
Chance-Constrained Trajectory Optimization for Automatic Parking Based on Conservative Approximation
In this article, the optimal parking trajectory planning problem with chance constraints is considered. A conservative approximation-based method is presented to handle the chance constraints. Based on a designed parametric continuous function, the probabilistic constraints are replaced by the ones with explicit expression and the original chance-constrained optimization problem is approximated by a nonlinear programming problem. It is proved that the feasible set of this approximation problem is a subset of the original feasible set and converges to it. Moreover, the cluster point of the optimal solutions obtained by solving a sequence of approximation problems is shown to be the optimal solution of the original problem. Numerical results are presented to verify the effectiveness and conservatism of using the proposed approach to solve the chance-constrained optimal parking trajectory planning problem. Comparative simulations are also conducted, showing that the approximation problem is enough to reflect the actual situation in terms of the optimal maneuver time.
- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (5) , 6259-6269
Chance-Constrained Trajectory Optimization for Automatic Parking Based on Conservative Approximation
In this article, the optimal parking trajectory planning problem with chance constraints is considered. A conservative approximation-based method is presented to handle the chance constraints. Based on a designed parametric continuous function, the probabilistic constraints are replaced by the ones with explicit expression and the original chance-constrained optimization problem is approximated by a nonlinear programming problem. It is proved that the feasible set of this approximation problem is a subset of the original feasible set and converges to it. Moreover, the cluster point of the optimal solutions obtained by solving a sequence of approximation problems is shown to be the optimal solution of the original problem. Numerical results are presented to verify the effectiveness and conservatism of using the proposed approach to solve the chance-constrained optimal parking trajectory planning problem. Comparative simulations are also conducted, showing that the approximation problem is enough to reflect the actual situation in terms of the optimal maneuver time.