In order to solve the problem of unmanned aerial vehicle(UAV) swarm path selection in complex environments, this paper designs a path recommendation system based on UAV swarm missions. It processes multi-source data, predicts the intention of scenario task generation, and consequently carries out path planning and recommendation. The system provides a comprehensive UAV flight control platform that supports real-time monitoring, flight planning and management, cross-platform compatibility, and ensures precise and safe operation. Its core algorithm is a segmented function delay approximation algorithm (TDTS) based on the mission area, which realises fuzzy data fusion and path planning in a dynamic environment. Finally, the system is implemented in a system environment of microservice architecture. The experimental results show that the system throughput of TDTS is improved by 5%, 8% and 1% over the shortest-distance-first, maximum-data-first and sine-cosine algorithms, respectively.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Path Recommendation System Based on UAV Swarm Missions

  • Shouze Tang,
  • Yu Wu,
  • Yishuo Chen,
  • Kai Shao,
  • Yuzhen Zhang,
  • Jiaxin Ren,
  • Li Zhou

摘要

In order to solve the problem of unmanned aerial vehicle(UAV) swarm path selection in complex environments, this paper designs a path recommendation system based on UAV swarm missions. It processes multi-source data, predicts the intention of scenario task generation, and consequently carries out path planning and recommendation. The system provides a comprehensive UAV flight control platform that supports real-time monitoring, flight planning and management, cross-platform compatibility, and ensures precise and safe operation. Its core algorithm is a segmented function delay approximation algorithm (TDTS) based on the mission area, which realises fuzzy data fusion and path planning in a dynamic environment. Finally, the system is implemented in a system environment of microservice architecture. The experimental results show that the system throughput of TDTS is improved by 5%, 8% and 1% over the shortest-distance-first, maximum-data-first and sine-cosine algorithms, respectively.