Tianyi Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tianyi Zhang has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Jiankun Wang
Southern University of Science and Technology
2 shared publications - Max Qing-Hu Meng
Southern University of Science and Technology, Shenzhen, China
2 shared publications - Nachuan Ma
College of Electronics and Information Engineering, State Key Laboratory of Autonomous Intelligent Unmanned Systems, and Robotics and Artificial Intelligence Lab (RAIL), Tongji University, Shanghai, China
2 shared publications - Bryan Donyanavard
San Diego State University
1 shared publication - Fadi J. Kurdahi
University of California Irvine
1 shared publication - Fei Meng
Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong
1 shared publication
Latest Publications
- 2 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 19 (4) , 3434-3443
Deep Neural Network Enhanced Sampling-Based Path Planning in 3D Space
Robot path planning in 3D space is a challenging problem for its complex configuration. Sampling-based algorithms have gained great success in solving path planning problems in 3D space, but the quality of the initial path is not guaranteed and the convergence to the optimal solution is slow. To address these problems, in this article, we present a novel sampling-based path planning framework enhanced by the deep neural network (DNN) with applications to 3D space. In the proposed framework, we first train the DNN with a number of successful path planning cases in 3D space. Then the DNN is utilized to predict the promising region where the feasible path probably exists for a given path planning problem. This predicted promising region serves as a nonuniform sampling heuristic to bias the sampling process of the path planner. In this way, the path planner can focus on the promising region in the exploration and exploitation process so that the path planning speed gets accelerated. We conduct numerical simulations to evaluate the performance of the proposed algorithm and the results show that it can perform much better than conventional path planning algorithms. Furthermore, we also investigate the performance of different DNN architectures for path planning in 3D space. Note to Practitioners—In this work, we aim to provide an efficient learning-based method to accelerate the robot path planning process in 3D space. Conventional path planning algorithms need to perceive the environment first, and then implement a series of calculations such as collision checking and data storing to generate a feasible path. When facing complex and high-dimensional environments, they do not perform well. But the proposed neural network method in this article can predict the promising region where the feasible path exists for any given environment. This prediction result is used to guide the path planning process so that the algorithm performance can get significantly improved. Apart from sampling-based algorithms, the proposed neural network model can also be extended to other types of path planning algorithms.
- 2 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 19 (4) , 3434-3443
Deep Neural Network Enhanced Sampling-Based Path Planning in 3D Space
Robot path planning in 3D space is a challenging problem for its complex configuration. Sampling-based algorithms have gained great success in solving path planning problems in 3D space, but the quality of the initial path is not guaranteed and the convergence to the optimal solution is slow. To address these problems, in this article, we present a novel sampling-based path planning framework enhanced by the deep neural network (DNN) with applications to 3D space. In the proposed framework, we first train the DNN with a number of successful path planning cases in 3D space. Then the DNN is utilized to predict the promising region where the feasible path probably exists for a given path planning problem. This predicted promising region serves as a nonuniform sampling heuristic to bias the sampling process of the path planner. In this way, the path planner can focus on the promising region in the exploration and exploitation process so that the path planning speed gets accelerated. We conduct numerical simulations to evaluate the performance of the proposed algorithm and the results show that it can perform much better than conventional path planning algorithms. Furthermore, we also investigate the performance of different DNN architectures for path planning in 3D space. Note to Practitioners—In this work, we aim to provide an efficient learning-based method to accelerate the robot path planning process in 3D space. Conventional path planning algorithms need to perceive the environment first, and then implement a series of calculations such as collision checking and data storing to generate a feasible path. When facing complex and high-dimensional environments, they do not perform well. But the proposed neural network method in this article can predict the promising region where the feasible path exists for any given environment. This prediction result is used to guide the path planning process so that the algorithm performance can get significantly improved. Apart from sampling-based algorithms, the proposed neural network model can also be extended to other types of path planning algorithms.
- Open Access
- 21 May 2021
- Published by Institution of Engineering and Technology (IET) in IET Cyber-Systems and Robotics
- Vol. 3 (4) , 302-314
A survey of learning‐based robot motion planning
A fundamental task in robotics is to plan collision‐free motions among a set of obstacles. Recently, learning‐based motion‐planning methods have shown significant advantages in solving different planning problems in high‐dimensional spaces and complex environments. This article serves as a survey of various different learning‐based methods that have been applied to robot motion‐planning problems, including supervised, unsupervised learning, and reinforcement learning. These learning‐based methods either rely on a human‐crafted reward function for specific tasks or learn from successful planning experiences. The classical definition and learning‐related definition of motion‐planning problem are provided in this article. Different learning‐based motion‐planning algorithms are introduced, and the combination of classical motion‐planning and learning techniques is discussed in detail.
- 21 May 2021
- Published by Institution of Engineering and Technology (IET) in IET Cyber-Systems and Robotics
- Vol. 3 (4) , 302-314
Open AccessA survey of learning‐based robot motion planning
A fundamental task in robotics is to plan collision‐free motions among a set of obstacles. Recently, learning‐based motion‐planning methods have shown significant advantages in solving different planning problems in high‐dimensional spaces and complex environments. This article serves as a survey of various different learning‐based methods that have been applied to robot motion‐planning problems, including supervised, unsupervised learning, and reinforcement learning. These learning‐based methods either rely on a human‐crafted reward function for specific tasks or learn from successful planning experiences. The classical definition and learning‐related definition of motion‐planning problem are provided in this article. Different learning‐based motion‐planning algorithms are introduced, and the combination of classical motion‐planning and learning techniques is discussed in detail.
- 7 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Embedded Systems Letters
- Vol. 13 (3) , 85-89
Predicting Failures in Embedded Systems Using Long Short-Term Inference
Users of embedded and cyber-physical systems expect dependable operation for an increasingly diverse set of applications and environments. Reactive self-diagnosis techniques either use unnecessarily conservative guardbands, or do not prevent catastrophic failures. In this letter, we utilize machine-learning techniques to design a prediction engine in order to predict failures on-device in the embedded systems. We evaluate our prediction engine’s effectiveness for predicting temperature behavior on a mobile system-on-chip and propose a realizable hardware implementation for the use-case.
- 7 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Embedded Systems Letters
- Vol. 13 (3) , 85-89
Predicting Failures in Embedded Systems Using Long Short-Term Inference
Users of embedded and cyber-physical systems expect dependable operation for an increasingly diverse set of applications and environments. Reactive self-diagnosis techniques either use unnecessarily conservative guardbands, or do not prevent catastrophic failures. In this letter, we utilize machine-learning techniques to design a prediction engine in order to predict failures on-device in the embedded systems. We evaluate our prediction engine’s effectiveness for predicting temperature behavior on a mobile system-on-chip and propose a realizable hardware implementation for the use-case.