YXYuan Xie
Yuan Xie
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yuan Xie has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Junxi Zhu
School of Aeronautics and Astronautics, Shenzhen Campus of Sun Yat-sen University, Shenzhen 518107, China
1 shared publication - Xiaokun Jiang
School of Aeronautics and Astronautics, Shenzhen Campus of Sun Yat-sen University, Shenzhen 518107, China
1 shared publication - Xitongn Zhou
School of Aeronautics and Astronautics, Shenzhen Campus of Sun Yat-sen University, Shenzhen 518107, China
1 shared publication - Zheng Zi
School of Aeronautics and Astronautics, Shenzhen Campus of Sun Yat-sen University, Shenzhen 518107, China
1 shared publication - Zhizhou Zhang
School of Aeronautics and Astronautics, Shenzhen Campus of Sun Yat-sen University, Shenzhen 518107, China
1 shared publication
Latest Publications
- Open Access
Cooperative Search Method of Multi-UAVs for Mountain Search and Rescue Missions
Mountain search-and-rescue missions require multiple unmanned aerial vehicles (UAVs) to cooperate efficiently under limited communication and constrained operational resources. Existing multi-UAV search methods often rely on centralized task allocation or explicit coordination mechanisms, while exhaustive coverage strategies may allocate excessive search effort to low-value regions, reducing search efficiency in large-scale environments. To address these challenges, this paper proposes a probability-guided and pheromone-assisted distributed cooperative search framework that enables autonomous UAV decision-making without centralized control. Each UAV independently selects its motion according to local observations, prior target probability, and digital pheromone information, while intermittent communication and occupancy-map fusion enable implicit coordination through local interactions. The proposed framework balances target-oriented exploitation and spatial exploration by combining probability attraction with pheromone repulsion, thereby suppressing redundant revisits while maintaining effective distributed cooperation. It is evaluated through representative two-dimensional mountain search simulations under distance-limited communication constraints. In the baseline () scenario, the proposed framework achieves search success rates comparable to conventional coverage-based methods while reducing the average search cost from 1074.2 and 1005.0 steps to 581.9 steps. As the search environment expands, its performance advantage becomes increasingly pronounced, demonstrating higher search efficiency and improved mission reliability under limited search resources. Parameter sensitivity and scalability analyses further show that the proposed framework maintains favorable robustness and cooperative efficiency across different parameter settings and search scales. These results demonstrate that the proposed distributed search framework provides an effective and scalable solution for multi-UAV mountain search-and-rescue missions under limited communication and operational resources.Open AccessCooperative Search Method of Multi-UAVs for Mountain Search and Rescue Missions
Mountain search-and-rescue missions require multiple unmanned aerial vehicles (UAVs) to cooperate efficiently under limited communication and constrained operational resources. Existing multi-UAV search methods often rely on centralized task allocation or explicit coordination mechanisms, while exhaustive coverage strategies may allocate excessive search effort to low-value regions, reducing search efficiency in large-scale environments. To address these challenges, this paper proposes a probability-guided and pheromone-assisted distributed cooperative search framework that enables autonomous UAV decision-making without centralized control. Each UAV independently selects its motion according to local observations, prior target probability, and digital pheromone information, while intermittent communication and occupancy-map fusion enable implicit coordination through local interactions. The proposed framework balances target-oriented exploitation and spatial exploration by combining probability attraction with pheromone repulsion, thereby suppressing redundant revisits while maintaining effective distributed cooperation. It is evaluated through representative two-dimensional mountain search simulations under distance-limited communication constraints. In the baseline () scenario, the proposed framework achieves search success rates comparable to conventional coverage-based methods while reducing the average search cost from 1074.2 and 1005.0 steps to 581.9 steps. As the search environment expands, its performance advantage becomes increasingly pronounced, demonstrating higher search efficiency and improved mission reliability under limited search resources. Parameter sensitivity and scalability analyses further show that the proposed framework maintains favorable robustness and cooperative efficiency across different parameter settings and search scales. These results demonstrate that the proposed distributed search framework provides an effective and scalable solution for multi-UAV mountain search-and-rescue missions under limited communication and operational resources.