{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:58:23Z","timestamp":1780707503652,"version":"3.54.1"},"reference-count":44,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T00:00:00Z","timestamp":1679443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61901446"],"award-info":[{"award-number":["61901446"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>This paper presents a scheduling problem of using multiple synthetic aperture radar (SAR) satellites to observe a large irregular area (SMA). SMA is usually considered as a kind of nonlinear combinatorial optimized problem and its solution space strongly coupled with geometry grows exponentially with the increasing magnitude of SMA. It is assumed that each solution of SMA yields a profit associated with the acquired portion of the target area, and the objective of this paper is to find the optimal solution yielding the maximal profit. The SMA is solved by means of a new method composed of three successive phases, namely, grid space construction, candidate strip generation and strip selection. First, the grid space construction is proposed to discretize the irregular area into a set of points in a specific plane rectangular coordinate system and calculate the total profit of a solution of SMA. Then, the candidate strip generation is designed to produce numerous candidate strips based on the grid space of the first phase. At last, in the strip selection, the optimal schedule for all the SAR satellites is developed based on the result of the candidate strip generation. In addition, this paper proposes a normalized grid space construction algorithm, a candidate strip generation algorithm and a tabu search algorithm with variable neighborhoods for the three successive phases, respectively. To verify the effectiveness of the proposed method in this paper, we perform simulation experiments on several scenarios and compare our method with the other seven methods. Compared to the best of the other seven methods, our proposed method can improve profit by 6.38% using the same resources.<\/jats:p>","DOI":"10.3390\/s23063353","type":"journal-article","created":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T08:36:16Z","timestamp":1679474176000},"page":"3353","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Scheduling Method of Using Multiple SAR Satellites to Observe a Large Area"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0991-7478","authenticated-orcid":false,"given":"Qicun","family":"Zheng","sequence":"first","affiliation":[{"name":"Department of Space Microwave Remote Sensing System, Aerospace Information Research Institute, Chinese Academy of Sciences, Beijing 100190, China"},{"name":"School of Electronic, Electrical and Communication Engineering, University of Chinese Academy of Sciences, Beijing 100049, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haixia","family":"Yue","sequence":"additional","affiliation":[{"name":"Department of Space Microwave Remote Sensing System, Aerospace Information Research Institute, Chinese Academy of Sciences, Beijing 100190, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3665-1978","authenticated-orcid":false,"given":"Dacheng","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Space Microwave Remote Sensing System, Aerospace Information Research Institute, Chinese Academy of Sciences, Beijing 100190, China"},{"name":"School of Electronic, Electrical and Communication Engineering, University of Chinese Academy of Sciences, Beijing 100049, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoxue","family":"Jia","sequence":"additional","affiliation":[{"name":"Department of Space Microwave Remote Sensing System, Aerospace Information Research Institute, Chinese Academy of Sciences, Beijing 100190, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Lee, S., Park, S.-Y., Kim, J., Ka, M.-H., and Song, Y. (2023). Mission Design and Orbit-Attitude Control Algorithms Development of Multistatic SAR Satellites for Very-High-Resolution Stripmap Imaging. Aerospace, 10.","DOI":"10.3390\/aerospace10010033"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Sarno, S., Iervolino, M., and Fasano, G. (2022). An Adaptive Approach for Impulsive Formation Maintenance Relevant to Distributed SAR Missions. Aerospace, 9.","DOI":"10.3390\/aerospace9030142"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Havivi, S., Schvartzman, I., Maman, S., Rotman, S., and Blumberg, D. (2018). Combining TerraSAR-X and Landsat Images for Emergency Response in Urban Environments. Remote Sens., 10.","DOI":"10.3390\/rs10050802"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"3022","DOI":"10.1109\/TGRS.2020.3009284","article-title":"Ship classification in medium-resolution SAR images via densely connected triplet CNNs integrating Fisher discrimination regularized metric learning","volume":"59","author":"He","year":"2020","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Rydlewski, J., Rajabi, Z., Tariq, M., Muttil, N., Sidiqui, P., Shah, A., Khan, N., Irshad, M., Alam, A., and Butt, T. (2022). Identification of Embodied Environmental Attributes of Construction in Metropolitan and Growth Region of Melbourne, Australia to Support Urban Planning. Sustainability, 14.","DOI":"10.3390\/su14148401"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Sun, C., Zhang, H., Ge, J., Wang, C., Li, L., and Xu, L. (2022). Rice Mapping in a Subtropical Hilly Region Based on Sentinel-1 Time Series 412 Feature Analysis and the Dual Branch BiLSTM Model. Remote Sens., 14.","DOI":"10.3390\/rs14133213"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1559","DOI":"10.1109\/TGRS.2006.887024","article-title":"A novel approach for disaster monitoring: Fractal models and tools","volume":"45","author":"Iodice","year":"2007","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Wu, Z., Li, L., Li, Y., and Gao, Y. (2019, January 3\u20135). Simulation of Two-Satellite Reconnaissance System with Intelligent Decision Based on Object Detection. Proceedings of the Chinese Control and Decision Conference (CCDC), Nanchang, China.","DOI":"10.1109\/CCDC.2019.8832641"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1729881419890715","DOI":"10.1177\/1729881419890715","article-title":"A mission planning method for multi-satellite wide area observation","volume":"16","author":"Ji","year":"2019","journal-title":"Int. J. Adv. Rob. Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.tcs.2016.10.011","article-title":"Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete","volume":"659","year":"2017","journal-title":"Theor. Comput. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/opre.2016.1557","article-title":"Optimal policies for a dual-sourcing inventory problem with endogenous stochastic lead times","volume":"65","author":"Song","year":"2017","journal-title":"Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1287\/trsc.2014.0521","article-title":"The destination-loader-door assignment problem for automated package sorting centers","volume":"50","author":"Jarrah","year":"2014","journal-title":"Transp. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1287\/ijoc.2014.0632","article-title":"Heuristic and exact algorithms for the interval min\u2013max regret knapsack problem","volume":"27","author":"Furini","year":"2015","journal-title":"INFORMS J. Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1080\/02331934.2013.804077","article-title":"On a single machine-scheduling problem with separated position and resource effects","volume":"64","author":"Janiak","year":"2015","journal-title":"Optimization"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.actaastro.2019.10.041","article-title":"Multi-satellite scheduling framework and algorithm for very large area observation","volume":"167","author":"Xu","year":"2020","journal-title":"Acta. Astronaut."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1007\/s00454-017-9884-9","article-title":"Complexity of Tiling a Polygon with Trominoes or Bars","volume":"58","author":"Horiyama","year":"2017","journal-title":"Discrete. Comput. Geom."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s004540010023","article-title":"Covering squares with squares","volume":"24","author":"Abbott","year":"2000","journal-title":"Discrete. Comput. Geom."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/j.jcta.2005.08.005","article-title":"Covering a square of side n + \u03b5 with unit squares","volume":"113","author":"Soifer","year":"2006","journal-title":"J. Comb. Theory. A."},{"key":"ref_19","first-page":"174","article-title":"A Note on Covering a Square of Side Length 2 + \u220a with Unit Squares","volume":"116","author":"Januszewski","year":"2009","journal-title":"Am. Math. Mon."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.comgeo.2019.01.001","article-title":"Covering segments with unit squares","volume":"79","author":"Acharyya","year":"2019","journal-title":"Comp. Geom-Theor. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1137\/S0097539799358835","article-title":"Covering rectilinear polygons with axis -parallel rectangles","volume":"32","author":"Kumar","year":"2003","journal-title":"SIAM J. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/TASE.2005.860617","article-title":"Exact algorithms for single frame selection on multiaxis Satellites","volume":"3","author":"Song","year":"2006","journal-title":"IEEE T. Autom. Sci. Eng."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1109\/TRO.2007.907488","article-title":"Approximate Algorithms for a Collaboratively Controlled Robotic Camera","volume":"23","author":"Song","year":"2007","journal-title":"IEEE T. Robot."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1287\/ijoc.2016.0722","article-title":"Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones","volume":"29","author":"Bansal","year":"2017","journal-title":"INFORMS J. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1026488509554","article-title":"Earth observation satellite management","volume":"4","author":"Bensana","year":"1999","journal-title":"Constraints"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011203002719","article-title":"A \u201clogic-constrained\u201d knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite","volume":"20","author":"Vasquez","year":"2001","journal-title":"Comput. Optim. Appl."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1021950608048","article-title":"Upper bounds for the SPOT 5 daily photograph scheduling problem","volume":"7","author":"Vasquez","year":"2003","journal-title":"J. Comb. Optim."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10878-006-7912-4","article-title":"Strengthened 0\u20131 linear formulation for the daily satellite mission planning","volume":"11","author":"Gabrel","year":"2006","journal-title":"J. Comb. Optim."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/A:1018920709696","article-title":"A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts","volume":"69","author":"Gabrel","year":"1997","journal-title":"Ann. Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/S0377-2217(01)00188-6","article-title":"Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite","volume":"139","author":"Gabrel","year":"2002","journal-title":"Eur. J. Oper. Res."},{"key":"ref_31","unstructured":"Gabrel, V., and Murat, C. (2003). Operations Research in Space and Air, Springer."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1884","DOI":"10.1016\/j.cor.2013.02.009","article-title":"A two-phase scheduling method with the consideration of task clustering for earth observing satellites","volume":"40","author":"Wu","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.amc.2013.12.109","article-title":"Multi satellites scheduling algorithm based on task merging mechanism","volume":"230","author":"Liu","year":"2014","journal-title":"Appl. Math. Comput."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.jcss.2014.06.016","article-title":"Towards dynamic real-time scheduling for multiple earth observation satellites","volume":"81","author":"Wang","year":"2015","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S1270-9638(02)01173-2","article-title":"Selecting and scheduling observations of agile satellites","volume":"6","author":"Verfaillie","year":"2002","journal-title":"Aerosp. Sci. Technol."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1057\/palgrave.jors.2601926","article-title":"Maximizing the value of an earth observation satellite orbit","volume":"56","author":"Cordeau","year":"2005","journal-title":"J. Oper. Res. Soc."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejor.2005.12.026","article-title":"A heuristic for the multi-satellite, multi-orbit and multi-user management of earth observation satellites","volume":"177","author":"Bianchessi","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10589-008-9220-7","article-title":"Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite","volume":"47","author":"Habet","year":"2010","journal-title":"Comput. Optim. Appl."},{"key":"ref_39","unstructured":"Tangpattanakul, P., Jozefowiez, N., and Lopez, P. (2015). Recent Advances in Computational Optimization, Springer."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1016\/j.ejor.2015.03.011","article-title":"A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite","volume":"245","author":"Tangpattanakul","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.ast.2008.01.001","article-title":"Planning and scheduling algorithms for the COSMO-SkyMed constellation","volume":"12","author":"Bianchessi","year":"2008","journal-title":"Aerosp. Sci. Technol."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.cie.2011.02.015","article-title":"A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation","volume":"61","author":"Wang","year":"2011","journal-title":"Comput. Ind. Eng."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","article-title":"A genetic algorithm for the set covering problem","volume":"94","author":"Beasley","year":"1996","journal-title":"Eur. J. Oper. Res."},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zhang, S., and Hu, H. (2022). A Simulated Annealing Algorithm with Tabu List for the Multi-Satellite Downlink Schedule Problem Considering Waiting Time. Aerospace, 9.","DOI":"10.3390\/aerospace9050235"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/6\/3353\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:00:46Z","timestamp":1760122846000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/6\/3353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,22]]},"references-count":44,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["s23063353"],"URL":"https:\/\/doi.org\/10.3390\/s23063353","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,22]]}}}