Haoyu Tian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Haoyu Tian has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Guanghui Sun
School of Astronautics, Harbin Institute of Technology, Harbin 150001, China
5 shared publications - Weiran Yao
Harbin Institute of Technology
5 shared publications - Ligang Wu
Harbin Institute of Technology
4 shared publications - Zisen Nie
School of Astronautics, Harbin Institute of Technology, Harbin, China
2 shared publications - Bo Dong
China Nuclear Power Engineering Co., Ltd, Beijing
1 shared publication - Chengwei Wu
Department of Control Science and Engineering, Harbin Institute of Technology, Harbin, China
1 shared publication
Latest Publications
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (9) , 10903-10910
CB-BSH: Multi-Agent Motion Planning With Heterogeneous Kinematics and Geometric Envelopes
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (9) , 10903-10910
CB-BSH: Multi-Agent Motion Planning With Heterogeneous Kinematics and Geometric Envelopes
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (9) , 10186-10193
Congestion-Aware Efficient Multi-Robot Task Planning via Invocation-Pruning Task Evaluation
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (9) , 10186-10193
Congestion-Aware Efficient Multi-Robot Task Planning via Invocation-Pruning Task Evaluation
- 10 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (4) , 6081-6093
Task-Extended Utility Tensor Method for Decentralized Multi-Vehicle Mission Planning
In multi-vehicle systems, the coupling problem between the task allocation and path planning and the variability of task execution solutions creates challenges for utility estimation and affects the effectiveness of distributed mission planning. To characterize the effect of task sequences on the task utilities and implement a task-extended distributed allocation, we propose a task-extended utility tensor algorithm (TEUTA) based on market mechanism. In the mission planning problem of multi-vehicle system, we consider the impact of the task schedule on the vehicle trajectory, and indicate the vehicle task execution utilities under different preceding task points in the form of tensors. Further, a task-extended utility tensor iterative algorithm (TEUTIA) is presented based on an iterative strategy to improve the algorithm in terms of computational complexity. A task execution utility estimation model and an algorithm framework are designed for the implementation of the two proposed algorithms. The simulation and experimental results show that compared with the non-tensor method, TEUTA and TEUTIA can achieve higher task execution performance, and TEUTIA has better computational efficiency. Note to Practitioners —This work presents two novel multi-vehicle distributed mission planning algorithms based on the market mechanism. TEUTA and TEUTIA proposed in this paper can be applied to address the impact of vehicle motion constraints on mission planning, which are widely present in various types of common nonholonomic vehicles such as two-wheel differential drive vehicles and Ackerman steering vehicles. In the application of the algorithms, an accurate kinematic model of the vehicles is required for trajectory planning to estimate the task execution reward precisely, which is necessary for effective mission planning. When the vehicle trajectory planning algorithm is computationally intensive, TEUTIA can significantly reduce the computational consumption and improve the mission planning efficiency compared with TEUTA without losing task execution reward. Finally, a stable inter-vehicle communication network is required for the interactive process of the market mechanism, where bi-directional communication exists between any two vehicles, to ensure the stability of mission planning.
- 10 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (4) , 6081-6093
Task-Extended Utility Tensor Method for Decentralized Multi-Vehicle Mission Planning
In multi-vehicle systems, the coupling problem between the task allocation and path planning and the variability of task execution solutions creates challenges for utility estimation and affects the effectiveness of distributed mission planning. To characterize the effect of task sequences on the task utilities and implement a task-extended distributed allocation, we propose a task-extended utility tensor algorithm (TEUTA) based on market mechanism. In the mission planning problem of multi-vehicle system, we consider the impact of the task schedule on the vehicle trajectory, and indicate the vehicle task execution utilities under different preceding task points in the form of tensors. Further, a task-extended utility tensor iterative algorithm (TEUTIA) is presented based on an iterative strategy to improve the algorithm in terms of computational complexity. A task execution utility estimation model and an algorithm framework are designed for the implementation of the two proposed algorithms. The simulation and experimental results show that compared with the non-tensor method, TEUTA and TEUTIA can achieve higher task execution performance, and TEUTIA has better computational efficiency. Note to Practitioners —This work presents two novel multi-vehicle distributed mission planning algorithms based on the market mechanism. TEUTA and TEUTIA proposed in this paper can be applied to address the impact of vehicle motion constraints on mission planning, which are widely present in various types of common nonholonomic vehicles such as two-wheel differential drive vehicles and Ackerman steering vehicles. In the application of the algorithms, an accurate kinematic model of the vehicles is required for trajectory planning to estimate the task execution reward precisely, which is necessary for effective mission planning. When the vehicle trajectory planning algorithm is computationally intensive, TEUTIA can significantly reduce the computational consumption and improve the mission planning efficiency compared with TEUTA without losing task execution reward. Finally, a stable inter-vehicle communication network is required for the interactive process of the market mechanism, where bi-directional communication exists between any two vehicles, to ensure the stability of mission planning.
- 17 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. 8 (3) , 2415-2425
An FTSA Trajectory Elliptical Homotopy for Unmanned Vehicles Path Planning With Multi-Objective Constraints
This article investigates a fixed-time simultaneous arrival (FTSA) problem in terms of the equilibrium of path lengths of unmanned vehicles. A novel trajectory elliptical homotopy method (TEHM) is designed to solve the FTSA problem of unmanned vehicles in a multi-objective constrained environment. Considering the constraints of obstacle avoidance and kinematics of unmanned vehicles, the trajectories elliptical homotopy is selected for path planning. The obtained trajectory homotopy guarantees obstacle avoidance and motion stability at the same time. To handle the non-cooperative and dynamic obstacle avoidance, a trajectory elliptical homotopy decomposition (TEHD) algorithm is proposed with an FTSA constraint. Based on the TEHM and TEHD, a multiple unmanned vehicle fixed-time regular-triangle formation algorithm is designed and implemented on real vehicles. Simulations and experiments validate the performance of the proposed methods and show how fixed-time arrival formation under obstacles and kinematic constraints was obtained.
- 17 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. 8 (3) , 2415-2425
An FTSA Trajectory Elliptical Homotopy for Unmanned Vehicles Path Planning With Multi-Objective Constraints
This article investigates a fixed-time simultaneous arrival (FTSA) problem in terms of the equilibrium of path lengths of unmanned vehicles. A novel trajectory elliptical homotopy method (TEHM) is designed to solve the FTSA problem of unmanned vehicles in a multi-objective constrained environment. Considering the constraints of obstacle avoidance and kinematics of unmanned vehicles, the trajectories elliptical homotopy is selected for path planning. The obtained trajectory homotopy guarantees obstacle avoidance and motion stability at the same time. To handle the non-cooperative and dynamic obstacle avoidance, a trajectory elliptical homotopy decomposition (TEHD) algorithm is proposed with an FTSA constraint. Based on the TEHM and TEHD, a multiple unmanned vehicle fixed-time regular-triangle formation algorithm is designed and implemented on real vehicles. Simulations and experiments validate the performance of the proposed methods and show how fixed-time arrival formation under obstacles and kinematic constraints was obtained.