Energy-Dependent Mission Planning for Agile Earth Observation Satellite
Publication: Journal of Aerospace Engineering
Volume 32, Issue 1
Abstract
This paper investigates the energy-dependent mission planning of an agile earth observation satellite. According to the similarities between energy-dependent mission planning and the dynamic traveling salesman problem (DTSP), the energy-dependent mission planning is converted into a DTSP through two mappings from observation angle and energy to city and distance. In addition, to eliminate the uncertainty of feasible attitude trajectories/energy for a given scheduling strategy, a multiple-stage optimal energy factor is developed for the model extension. The paper further uses the time-optimal in the transition time constraint as an input of the model to enlarge the optional execution time for the subsequent target in a consecutive observation. To solve this problem, a hybrid method integrating the Gauss pseudospectral method and the genetic algorithm (GPM-GA) is proposed which uses the genetic algorithm to generate the feasible solutions for scheduling process, whereas the Gauss pseudospectral method (GPM) is used to optimize the energy and the transition time constraint parameter for each solution. Extensive simulation results show that, compared with the classical genetic algorithm (CGA), the energy consumption and simulation time of the proposed algorithm are decreased effectively. In particular, the simulation time decreases more obviously with larger target sizes. Furthermore, attitude trajectory projections of satellite motion provided by GPM-GA are much smoother. These numerical and visualization results demonstrate the superiority of GPM-GA in terms of energy efficiency, computational efficiency, and attitude trajectory smoothing.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgments
The authors thank the editor and anonymous reviewers for their helpful comments and suggestions. This work was supported by the National Natural Science Foundation of China (Grant No. 61633008), the National Natural Science Foundation of Heilongjiang Province (Grant No. F2017005), the Fundamental Research Fund for the Central University of Harbin Engineering University (Grant No. HEUCFP201768), the Postdoctoral Scientific Research Developmental Heilongjiang Province of China (Grant No. LBH-Q14054), and the China Scholarship Council Foundation.
References
Benson, D. A., G. T. Huntington, T. P. Thorvaldsen, and A. V. Rao. 2006. “Direct trajectory optimization and costate estimation via an orthogonal collocation method.” J. Guid. Control Dyn. 29 (6): 1435–1440. https://doi.org/10.2514/1.20478.
Burger, M., Z. Su, and B. De Schutter. 2018. “A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem.” Eur. J. Oper. Res. 265 (2): 463–477. https://doi.org/10.1016/j.ejor.2017.07.056.
Cong, B. L., X. L. Liu, and Z. Chen. 2011. “Distributed attitude synchronization of formation flying via consensus-based virtual structure.” Acta Astronaut. 68 (11–12): 1973–1986. https://doi.org/10.1016/j.actaastro.2010.11.014.
Darby, C. L. 2011. “Hp–pseudospectral method for solving continuous-time nonlinear optimal control problems.” Ph.D. thesis, Dept. of Mechanical and Aerospace Engineering, Univ. of Florida.
Darby, C. L., W. W. Hager, and A. V. Rao. 2011. “Direct trajectory optimization using a variable low-order adaptive pseudospectral method.” J. Spacecraft Rockets 48 (3): 433–445. https://doi.org/10.2514/1.52136.
Gabrel, V., A. Moulet, C. Murat, and V. T. Paschos. 1997. “A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts.” Ann. Oper. Res. 69 (1): 115–134. https://doi.org/10.1023/A:1018920709696.
Gabrel, V., and D. Vanderpooten. 2002. “Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite.” Eur. J. Oper. Res. 139 (3): 533–542. https://doi.org/10.1016/S0377-2217(01)00188-6.
Garg, D., M. A. Patterson, C. Francolin, C. L. Darby, G. T. Huntington, W. W. Hager, and A. V. Rao. 2011. “Direct trajectory optimization and costate estimation of finite-horizon and infinite-horizon optimal control problems using a Radau pseudospectral method.” Comput. Optim. Appl. 49 (2): 335–358. https://doi.org/10.1007/s10589-009-9291-0.
Guo, T. D., F. H. Jiang, and J. F. Li. 2012. “Homotopic approach and pseudospectral method applied jointly to low thrust trajectory optimization.” Acta Astronaut. 71: 38–50. https://doi.org/10.1016/j.actaastro.2011.08.008.
Habet, D., M. Vasquez, and Y. Vimont. 2010. “Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite.” Comput. Optim. Appl. 47 (2): 307–333. https://doi.org/10.1007/s10589-008-9220-7.
Jain, S., and P. Tsiotras. 2008. “Trajectory optimization using multiresolution techniques.” J. Guid. Control Dyn. 31 (5): 1424–1436. https://doi.org/10.2514/1.32220.
Karami, A. H., and M. Hasanzadeh. 2015. “An adaptive genetic algorithm for robot motion planning in 2D complex environments.” Comput. Electr. Eng. 43: 317–329. https://doi.org/10.1016/j.compeleceng.2014.12.014.
Kirk, D. E. 2004. Optimal control theory: An introduction, 227–240. New York: Dover.
Kobeaga, G., M. Merino, and J. A. Lozano. 2018. “An efficient evolutionary algorithm for the orienteering problem.” Comput. Oper. Res. 90: 42–59. https://doi.org/10.1016/j.cor.2017.09.003.
Lai, L. C., C. C. Yang, and C. J. Wu. 2007. “Time-optimal maneuvering control of a rigid spacecraft.” Acta Astronaut. 60 (10): 791–800. https://doi.org/10.1016/j.actaastro.2006.09.039.
Lemaitre, M., G. Verfaillie, F. Jouhaud, J. M. Lachiver, and N. Bataille. 2002. “Selecting and scheduling observations of agile satellites.” Aerosp. Sci. Technol. 6 (5): 367–381.
Li, J., and X. N. Xi. 2015. “Time-optimal reorientation of the rigid spacecraft using a pseudospectral method integrated homotopic approach.” Optimal Control Appl. Methods 36 (6): 889–918. https://doi.org/10.1002/oca.2145.
Lin, W. C., D. Y. Liao, C. Y. Liu, and Y. Y. Lee. 2005. “Daily imaging scheduling of an Earth observation satellite.” IEEE Trans. Syst. Man Cybern. Part A Syst. Humans 35 (2): 213–223. https://doi.org/10.1109/TSMCA.2005.843380.
Liu, S., Y. W. Chen, L. N. Xing, and X. J. Guo. 2016. “Time-dependent autonomous task planning of agile imaging satellites.” J. Intell. Syst. 31 (3): 1365–1375. https://doi.org/10.3233/IFS-162202.
Mavrovouniotis, M., and S. X. Yang. 2011. “A memetic ant colony optimization algorithm for the dynamic travelling salesman problem.” Soft Comput. 15 (7): 1405–1425. https://doi.org/10.1007/s00500-010-0680-1.
Mehrpouya, M. A., and M. Shamsi. 2015. “Gauss pseudospectral and continuation methods for solving two-point boundary value problems in optimal control theory.” Appl. Math. Modell. 39 (17): 5047–5057. https://doi.org/10.1016/j.apm.2015.04.009.
Patterson, M. A., and A. V. Rao. 2014. “GPOPS-II: A MATLAB software for solving multiple-phase optimal control problems using hp-adaptive Gaussian quadrature collocation methods and sparse nonlinear programming.” ACM Trans. Math. Software 41 (1): 1–37. https://doi.org/10.1145/2558904.
Sarkheyli, A., A. Bagheri, B. Ghorbani-Vaghei, and R. Askari Moghadam. 2013. “Using an effective tabu search in interactive resources scheduling problem for LEO satellites missions.” Aerosp. Sci. Technol. 29 (1): 287–295. https://doi.org/10.1016/j.ast.2013.04.001.
Tangpattanakul, P., N. Jozefowiez, and P. Lopez. 2015. “A multi-objective local search heuristic for scheduling earth observations taken by an agile satellite.” Eur. J. Oper. Res. 245 (2): 542–554. https://doi.org/10.1016/j.ejor.2015.03.011.
Tsiotras, P. 1996. “Stabilization and optimality results for the attitude control problem.” J. Guid. Control Dyn. 19 (4): 772–779. https://doi.org/10.2514/3.21698.
Vasquez, M., and J. K. Hao. 2001. “A ’logic-constrained’ knapsack formulation and a tabu algorithm for the daily photograph scheduling of an Earth observation satellite.” Comput. Optim. Appl. 20 (2): 137–157. https://doi.org/10.1023/A:1011203002719.
Verfaillie, G., M. Lemaitre, and T. Schiex. 1996. “Russian doll search for solving constraint optimization problems.” In Proc., 13th Int. Conf. on Artificial Intelligence (AAAI-96), 181–187. Portland, OR.
Wang, X. W., Z. Chen, and C. Han. 2016. “Scheduling for single agile satellite, redundant targets problem using complex networks theory.” Chaos Solitons Fractals 83: 125–132. https://doi.org/10.1016/j.chaos.2015.12.003.
Wolfe, W. J., and S. E. Sorensen. 2000. “Three scheduling algorithms applied to the earth observing systems domain.” Manage. Sci. 46 (1): 148–166. https://doi.org/10.1287/mnsc.46.1.148.15134.
Wu, G. H., J. Liu, M. H. Ma, and D. S. Qiu. 2013. “A two-phase scheduling method with the consideration of task clustering for earth observing satellites.” Comput. Oper. Res. 40 (7): 1884–1894. https://doi.org/10.1016/j.cor.2013.02.009.
Xhafa, F., J. Z. Sun, A. Barolli, A. Biberaj, and L. Barolli. 2012. “Genetic algorithms for satellite scheduling problems.” Mob. Inf. Syst. 8 (4): 351–377. https://doi.org/10.3233/MIS-2012-00153.
Xu, R., H. P. Chen, X. L. Liang, and H. M. Wang. 2016. “Priority-based constructive algorithms for scheduling agile earth observation satellites with total priority maximization.” Expert Syst. Appl. 51: 195–206. https://doi.org/10.1016/j.eswa.2015.12.039.
Zhang, L. M., H. T. Gao, Z. Q. Chen, Q. L. Sun, and X. H. Zhang. 2013. “Multi-objective global optimal parafoil homing trajectory optimization via Gauss pseudospectral method.” Nonlinear Dyn. 72 (1): 1–8. https://doi.org/10.1007/s11071-012-0586-9.
Information & Authors
Information
Published In
Journal of Aerospace Engineering
Volume 32 • Issue 1 • January 2019
Copyright
©2018 American Society of Civil Engineers.
History
Received: Nov 7, 2017
Accepted: Jun 14, 2018
Published online: Sep 26, 2018
Published in print: Jan 1, 2019
Discussion open until: Feb 26, 2019
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.