Yang Lv, Fengmin Wang, Xiankun Yu, Xin Li, Dachuan Xu, Ruiqi Yang
{"title":"Submodular Optimization for Heterogeneous UAV Deployment","authors":"Yang Lv, Fengmin Wang, Xiankun Yu, Xin Li, Dachuan Xu, Ruiqi Yang","doi":"10.1007/s10878-026-01435-2","DOIUrl":null,"url":null,"abstract":"Unmanned Aerial Vehicles (UAVs) are widely used in environmental monitoring tasks such as forest surveillance, agricultural mapping, and disaster assessment, where their ability to collect dense and high-resolution observations is particularly advantageous. However, many existing approaches implicitly assume that UAV platforms and onboard sensors are homogeneous. This assumption can introduce significant estimation errors in real-world deployments. This work studies the deployment of heterogeneous UAVs equipped with sensors of different accuracies for fire-scene assessment, using a point-of-interest–based model. Research on heterogeneous UAV measurements remains relatively limited. We introduce a weighted frame potential (WFP) that captures the orthogonality structure of sensing matrices under heterogeneous noise. By reformulating the problem as a submodular maximization task, we develop a Random Greedy Algorithm that guarantees a <inline-formula><alternatives><mml:math><mml:mrow><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">/</mml:mo><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>c</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:mrow></mml:math><tex-math>\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$1/(1+c)$$\\end{document}</tex-math></alternatives></inline-formula> approximation of the optimal solution, where <italic>c</italic> denotes the curvature of the submodular function. A theoretical upper bound on the reconstruction error induced by the selected UAV configuration is also established. Experiments on both small- and large-scale fire monitoring tasks show that the proposed method achieves higher reconstruction accuracy and better computational efficiency than existing algorithms.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"36 1","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2026-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-026-01435-2","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Unmanned Aerial Vehicles (UAVs) are widely used in environmental monitoring tasks such as forest surveillance, agricultural mapping, and disaster assessment, where their ability to collect dense and high-resolution observations is particularly advantageous. However, many existing approaches implicitly assume that UAV platforms and onboard sensors are homogeneous. This assumption can introduce significant estimation errors in real-world deployments. This work studies the deployment of heterogeneous UAVs equipped with sensors of different accuracies for fire-scene assessment, using a point-of-interest–based model. Research on heterogeneous UAV measurements remains relatively limited. We introduce a weighted frame potential (WFP) that captures the orthogonality structure of sensing matrices under heterogeneous noise. By reformulating the problem as a submodular maximization task, we develop a Random Greedy Algorithm that guarantees a 1/(1+c)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1/(1+c)$$\end{document} approximation of the optimal solution, where c denotes the curvature of the submodular function. A theoretical upper bound on the reconstruction error induced by the selected UAV configuration is also established. Experiments on both small- and large-scale fire monitoring tasks show that the proposed method achieves higher reconstruction accuracy and better computational efficiency than existing algorithms.
Unmanned Aerial Vehicles (UAVs) are widely used in environmental monitoring tasks such as forest surveillance, agricultural mapping, and disaster assessment, where their ability to collect dense and high-resolution observations is particularly advantageous. However, many existing approaches implicitly assume that UAV platforms and onboard sensors are homogeneous. This assumption can introduce significant estimation errors in real-world deployments. This work studies the deployment of heterogeneous UAVs equipped with sensors of different accuracies for fire-scene assessment, using a point-of-interest–based model. Research on heterogeneous UAV measurements remains relatively limited. We introduce a weighted frame potential (WFP) that captures the orthogonality structure of sensing matrices under heterogeneous noise. By reformulating the problem as a submodular maximization task, we develop a Random Greedy Algorithm that guarantees a 1/(1+c)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1/(1+c)$$\end{document} approximation of the optimal solution, where c denotes the curvature of the submodular function. A theoretical upper bound on the reconstruction error induced by the selected UAV configuration is also established. Experiments on both small- and large-scale fire monitoring tasks show that the proposed method achieves higher reconstruction accuracy and better computational efficiency than existing algorithms.
期刊介绍:
The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering.
The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.