Cooperative search by multiple unmanned aerial vehicles in a nonconvex environment

DOI10.1155/2015/196730zbMath1394.90325OpenAlexW1559321162WikidataQ59117567 ScholiaQ59117567MaRDI QIDQ1664949

Xiangke Wang, Lincheng Shen, Xiaoting Ji, Yi-Feng Niu

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/196730

Mathematics Subject Classification ID

Search theory (90B40) Network design and communication in computer systems (68M10)

Related Items (1)

Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions

Cites Work

• Unnamed Item
• Unnamed Item
• Maximizing Search Coverage Using Future Path Projection for Cooperative Multiple UAVs with Limited Communication Ranges
• Decomposing a Polygon into Simpler Components
• Decomposition of Polygons into Convex Sets
• Distributed Coverage Control and Data Collection With Mobile Sensor Networks
• Vector analysis

This page was built for publication: Cooperative search by multiple unmanned aerial vehicles in a nonconvex environment