Area targets observation mission planning of agile satellite considering the drift angle constraint
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
The generation of agile satellites has better flexible three-axis maneuverability, which makes dynamic imaging possible. A mission planning algorithm is proposed to deal with the area target observation problems of agile satellites, which takes the drift angle constraint of the observation instrument into account. First, an area target observation path planning algorithm is presented based on the dynamic imaging mode and the grid discretization approach. Second, the constraint of drift angle is introduced into the mission planning to account for the effect of image motion on time delay integration charge coupled device imaging. Third, an improved ant colony algorithm based on sensational and consciousness strategy is developed to solve the travelling salesman problem with constraints. Finally, the computer simulation results show that the proposed algorithm can effectively solve the area target mission planning problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Selecting and scheduling observations of agile satellites
Lemaı̂tre, M., Verfaillie, G., Jouhaud, F., Lachiver, J.-M., & Bataille, N. (2002) · Aerospace Science and Technology · doi:10.1016/s1270-9638(02)01173-2 · Cited by 472
Liu, X., Laporte, G., Chen, Y., & He, R. (2017) · Computers & Operations Research · doi:10.1016/j.cor.2017.04.006 · Cited by 250
Vasquez, M., & Hao, J.-K. (2001) · Computational Optimization and Applications · doi:10.1023/a:1011203002719 · Cited by 239
Gabrel, V., & Vanderpooten, D. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(01)00188-6 · Cited by 124
Genetic Algorithms for Satellite Scheduling Problems
Xhafa, F., Sun, J., Barolli, A., Biberaj, A., & Barolli, L. (2012) · Mobile Information Systems · doi:10.1155/2012/717658 · Cited by 108
Gabrel, V., Moulet, A., Murat, C., & Paschos, V. T. (1997) · Annals of Operations Research · doi:10.1023/a:1018920709696 · Cited by 96
Onboard Mission Planning for Agile Satellite Using Modified Mixed-Integer Linear Programming
She, Y., Li, S., & Zhao, Y. (2018) · Aerospace Science and Technology · doi:10.1016/j.ast.2017.11.009 · Cited by 88
Self-citation
Cited by
Wang, X., Wu, G., Xing, L., & Pedrycz, W. (2021) · IEEE Systems Journal · doi:10.1109/jsyst.2020.2997050 · Cited by 260
“Following [3, 15, 37], we define this kind of relatively large-scale target as area target, while the target that can be completely observed by one shot is named point target.”
BackgroundMethodInfluentialRobust earth observation satellite scheduling with uncertainty of cloud coverage
Wang, X., Song, G., Leus, R., & Han, C. (2020) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2019.2947978 · Cited by 70
“[8] provide an area target observation scheduling formulation and propose an ant colony algorithm to solve the problem.”
BackgroundA Multiple Agile Satellite Staring Observation Mission Planning Method for Dense Regions
Huang, W., Wang, H., Yi, D., Wang, S., Zhang, B., & Cui, J. (2023) · Remote Sensing · doi:10.3390/rs15225317 · Cited by 19
Self-citationSun, H., Xia, W., Wang, Z., & Hu, X. (2021) · Journal of Systems Science and Systems Engineering · doi:10.1007/s11518-021-5506-4 · Cited by 17
“…scheduling for general tasks, the corresponding scheduling algorithms mainly include the genetic algorithm (Wang et al. 2019), ant colony algorithm (Du et al. 2018, Cui et al. 2018), tabu search algorithm (Habet et al. 2010), greedy algorithm (Lemaître et al. 2002) and constructive heuristic…”
Method
Metadata
- Venue
- Journal of Astronomical Telescopes, Instruments, and Systems
- Publisher
- SPIE-Intl Soc Optical Eng
- Published
- 2018-10-17
- Volume
- 4
- Issue
- 04
- Pages
- 1
- ISSN
- 2329-4124 (ISSN-L)
- OpenAlex
- W3029035462
- Cited by
- 33
- References
- 7
- FWCI
- 2.02
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Area targets observation mission planning of agile satellite considering the drift angle constraint. https://app.cochat.ai/papers/10.1117/1.jatis.4.4.047002
- The paper
- Area targets observation mission planning of agile satellite considering the drift angle constraint. (2018). Journal of Astronomical Telescopes, Instruments, and Systems. https://doi.org/10.1117/1.jatis.4.4.047002
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.