Yang Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yang Yang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Kun Hao
Tianjin Chengjian University
2 shared publications - Haoyi Chai
School of Computer and Information Engineering, Tianjin Chengjian University, Tianjin 300384, China
1 shared publication - Jiale Zhao
School of Information and Communication Engineering, Hainan University, Haikou 570228, China
1 shared publication - Jinjun Liu
School of Control and Mechanical Engineering, Tianjin Chengjian University, Tianjin 300384, China
1 shared publication - Xiaofang Zhao
School of Computer and Information Engineering, Tianjin Chengjian University, Tianjin 300384, China
1 shared publication - Yonglei Liu
School of Computer and Information Engineering, Tianjin Chengjian University, Tianjin 300384, China
1 shared publication
Latest Publications
- Open Access
Density-Based Detection Rapid Exploration Random Tree for Multirobot Formation Cooperative Path Planning
This paper proposes a multirobot formation path planning method based on the leader–follower formation control method to ensure smooth operation in the multirobot formation control area. First, on the basis of the rapidly exploring random tree (RRT), a density detection rapidly exploring random tree (DDRRT) algorithm is designed to avoid repeated exploration of by the RRT, to quickly generate a global path from the starting point to the destination for the leader robot, and to propose a rope shrinkage path optimization mechanism for path optimization. Second, the repulsion field function in the artificial potential field (APF) is optimized for local collaborative obstacle avoidance to enable multiple robots, and a rotational potential field is introduced to solve the problems of unreachable targets and local oscillations. Finally, a control law based on consistency control is used to control the followers and introduce a formation change mechanism based on polar coordinate transformation to enhance the formation control capability. The simulation results show that the proposed strategy can provide high-quality paths for robot formations in multiple obstacle areas and guide robot formations to avoid various local obstacles quickly through formation transformation.
Open AccessDensity-Based Detection Rapid Exploration Random Tree for Multirobot Formation Cooperative Path Planning
This paper proposes a multirobot formation path planning method based on the leader–follower formation control method to ensure smooth operation in the multirobot formation control area. First, on the basis of the rapidly exploring random tree (RRT), a density detection rapidly exploring random tree (DDRRT) algorithm is designed to avoid repeated exploration of by the RRT, to quickly generate a global path from the starting point to the destination for the leader robot, and to propose a rope shrinkage path optimization mechanism for path optimization. Second, the repulsion field function in the artificial potential field (APF) is optimized for local collaborative obstacle avoidance to enable multiple robots, and a rotational potential field is introduced to solve the problems of unreachable targets and local oscillations. Finally, a control law based on consistency control is used to control the followers and introduce a formation change mechanism based on polar coordinate transformation to enhance the formation control capability. The simulation results show that the proposed strategy can provide high-quality paths for robot formations in multiple obstacle areas and guide robot formations to avoid various local obstacles quickly through formation transformation.
- Open Access
- 26 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (17) , 9666
CERRT: A Mobile Robot Path Planning Algorithm Based on RRT in Complex Environments
In complex environments, path planning for mobile robots faces challenges such as insensitivity to the environment, low efficiency, and poor path quality with the rapidly-exploring random tree (RRT) algorithm. We propose a novel algorithm, the complex environments rapidly-exploring random tree (CERRT), to address these issues. The CERRT algorithm builds upon the RRT approach and incorporates two key components: a pre-allocated extension node method and a vertex death mechanism. These enhancements aim to improve vertex utilization and overcome the problem of becoming trapped in concave regions, a limitation of traditional algorithms. Additionally, the CERRT algorithm integrates environment awareness at collision points, enabling rapid identification and navigation through narrow passages using local simple sampling techniques. We also introduce the bidirectional shrinking optimization strategy (BSOS) based on the pruning optimization strategy (POS) to further enhance the quality of path solutions. Extensive simulations demonstrate that the CERRT algorithm outperforms the RRT and RRV algorithms in various complex environments, such as mazes and narrow passages. It exhibits shorter running times and generates higher-quality paths, making it a promising approach for mobile robot path planning in challenging environments.
- 26 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (17) , 9666
Open AccessCERRT: A Mobile Robot Path Planning Algorithm Based on RRT in Complex Environments
In complex environments, path planning for mobile robots faces challenges such as insensitivity to the environment, low efficiency, and poor path quality with the rapidly-exploring random tree (RRT) algorithm. We propose a novel algorithm, the complex environments rapidly-exploring random tree (CERRT), to address these issues. The CERRT algorithm builds upon the RRT approach and incorporates two key components: a pre-allocated extension node method and a vertex death mechanism. These enhancements aim to improve vertex utilization and overcome the problem of becoming trapped in concave regions, a limitation of traditional algorithms. Additionally, the CERRT algorithm integrates environment awareness at collision points, enabling rapid identification and navigation through narrow passages using local simple sampling techniques. We also introduce the bidirectional shrinking optimization strategy (BSOS) based on the pruning optimization strategy (POS) to further enhance the quality of path solutions. Extensive simulations demonstrate that the CERRT algorithm outperforms the RRT and RRV algorithms in various complex environments, such as mazes and narrow passages. It exhibits shorter running times and generates higher-quality paths, making it a promising approach for mobile robot path planning in challenging environments.