Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum Optimization Methods for Satellite Mission Planning

Published 8 Apr 2024 in quant-ph | (2404.05516v1)

Abstract: Satellite mission planning for Earth observation satellites is a combinatorial optimization problem that consists of selecting the optimal subset of imaging requests, subject to constraints, to be fulfilled during an orbit pass of a satellite. The ever-growing amount of satellites in orbit underscores the need to operate them efficiently, which requires solving many instances of the problem in short periods of time. However, current classical algorithms often fail to find the global optimum or take too long to execute. Here, we approach the problem from a quantum computing point of view, which offers a promising alternative that could lead to significant improvements in solution quality or execution speed in the future. To this end, we study a planning problem with a variety of intricate constraints and discuss methods to encode them for quantum computers. Additionally, we experimentally assess the performance of quantum annealing and the quantum approximate optimization algorithm on a realistic and diverse dataset. Our results identify key aspects like graph connectivity and constraint structure that influence the performance of the methods. We explore the limits of today's quantum algorithms and hardware, providing bounds on the problems that can be currently solved successfully and showing how the solution degrades as the complexity grows. This work aims to serve as a baseline for further research in the field and establish realistic expectations on current quantum optimization capabilities.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (48)
  1. G. Zhang, X. Li, G. Hu, Z. Zhang, J. An, and W. Man, “Mission planning issues of imaging satellites: Summary, discussion, and prospects,” International Journal of Aerospace Engineering, vol. 2021, pp. 1–20, 2021.
  2. E. Bensana, M. Lemaitre, and G. Verfaillie, “Earth observation satellite management,” Constraints, vol. 4, no. 3, pp. 293–299, 1999.
  3. R. M. Karp, “On the computational complexity of combinatorial problems,” Networks, vol. 5, no. 1, pp. 45–68, 1975.
  4. M. Vasquez and J.-K. Hao, “Upper bounds for the spot 5 daily photograph scheduling problem,” Journal of Combinatorial Optimization, vol. 7, pp. 87–103, 2003.
  5. G. M. Ribeiro, M. F. Constantino, and L. A. N. Lorena, “Strong formulation for the spot 5 daily photograph scheduling problem,” Journal of combinatorial optimization, vol. 20, pp. 385–398, 2010.
  6. W.-C. Lin and D.-Y. Liao, “A tabu search algorithm for satellite imaging scheduling,” in 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), vol. 2, pp. 1601–1606 vol.2, 2004.
  7. M. Barkaoui and J. Berger, “A new hybrid genetic algorithm for the collection scheduling problem for a satellite constellation,” Journal of the Operational Research Society, vol. 71, no. 9, pp. 1390–1410, 2020.
  8. N. Bianchessi, J.-F. Cordeau, J. Desrosiers, G. Laporte, and V. Raymond, “A heuristic for the multi-satellite, multi-orbit and multi-user management of earth observation satellites,” European Journal of Operational Research, vol. 177, no. 2, pp. 750–762, 2007.
  9. X. Jiang, Y. Song, and L. Xing, “Dual-population artificial bee colony algorithm for joint observation satellite mission planning problem,” IEEE Access, vol. 10, pp. 28911–28921, 2022.
  10. X. Wang, J. Wu, Z. Shi, F. Zhao, and Z. Jin, “Deep reinforcement learning-based autonomous mission planning method for high and low orbit multiple agile earth observing satellites,” Advances in Space Research, vol. 70, no. 11, pp. 3478–3493, 2022.
  11. B. C. Symons, D. Galvin, E. Sahin, V. Alexandrov, and S. Mensa, “A practitioner’s guide to quantum algorithms for optimisation problems,” arXiv preprint arXiv:2305.07323, 2023.
  12. Y. Li, M. Tian, G. Liu, C. Peng, and L. Jiao, “Quantum optimization and quantum learning: A survey,” IEEE Access, vol. 8, pp. 23568–23593, 2020.
  13. T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse ising model,” Physical Review E, vol. 58, no. 5, p. 5355, 1998.
  14. E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” 2014.
  15. R. Kaltenbaek, A. Acin, L. Bacsardi, P. Bianco, P. Bouyer, E. Diamanti, C. Marquardt, Y. Omar, V. Pruneri, E. Rasel, et al., “Quantum technologies in space,” Experimental Astronomy, vol. 51, no. 3, pp. 1677–1694, 2021.
  16. G. Vallone, D. Bacco, D. Dequal, S. Gaiarin, V. Luceri, G. Bianco, and P. Villoresi, “Experimental satellite quantum communications,” Physical Review Letters, vol. 115, no. 4, p. 040502, 2015.
  17. S.-K. Liao, W.-Q. Cai, W.-Y. Liu, L. Zhang, Y. Li, J.-G. Ren, J. Yin, Q. Shen, Y. Cao, Z.-P. Li, et al., “Satellite-to-ground quantum key distribution,” Nature, vol. 549, no. 7670, pp. 43–47, 2017.
  18. F. Müller, O. Carraz, P. Visser, and O. Witasse, “Cold atom gravimetry for planetary missions,” Planetary and Space Science, vol. 194, p. 105110, 2020.
  19. Packt Publishing Ltd, 2023.
  20. P. Dubey and A. Hein, “Satellite routing with quantum annealing: Collecting space debris and on-orbit servicing,” in Proceedings of the International Astronautical Congress, International Astronautical Federation, 06 October 2023.
  21. G. Bass, C. Tomlin, V. Kumar, P. Rihaczek, and J. Dulny, “Heterogeneous quantum computing for satellite constellation optimization: solving the weighted k-clique problem,” Quantum Science and Technology, vol. 3, no. 2, p. 024010, 2018.
  22. T. Stollenwerk, V. Michaud, E. Lobe, M. Picard, A. Basermann, and T. Botter, “Image acquisition planning for earth observation satellites with a quantum annealer,” arXiv preprint arXiv:2006.09724, 2020.
  23. T. Stollenwerk, V. Michaud, E. Lobe, M. Picard, A. Basermann, and T. Botter, “Agile earth observation satellite scheduling with a quantum annealer,” IEEE Transactions on Aerospace and Electronic Systems, vol. 57, no. 5, pp. 3520–3528, 2021.
  24. S. Rainjonneau, I. Tokarev, S. Iudin, S. Rayaprolu, K. Pinto, D. Lemtiuzhnikova, M. Koblan, E. Barashov, M. Kordzanganeh, M. Pflitsch, and A. Melnikov, “Quantum algorithms applied to satellite mission planning for earth observation,” IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, vol. 16, pp. 7062–7075, 2023.
  25. N. Quetschlich, V. Koch, L. Burgholzer, and R. Wille, “A hybrid classical quantum computing approach to the satellite mission planning problem,” in 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 1, pp. 642–647, IEEE, 2023.
  26. A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’brien, “A variational eigenvalue solver on a photonic quantum processor,” Nature communications, vol. 5, no. 1, p. 4213, 2014.
  27. A. Makarov, M. M. Taddei, E. Osaba, G. Franceschetto, E. Villar-Rodríguez, and I. Oregi, “Optimization of image acquisition for earth observation satellites via quantum computing,” in International Conference on Intelligent Data Engineering and Automated Learning, pp. 3–14, Springer, 2023.
  28. Y. Zhang, X. Hu, W. Zhu, and P. Jin, “Solving the observing and downloading integrated scheduling problem of earth observation satellite with a quantum genetic algorithm,” Journal of Systems Science and Information, vol. 6, no. 5, pp. 399–420, 2018.
  29. H. Zhi, W. Liang, P. Han, Y. Guo, and C. Li, “Variable observation duration scheduling problem for agile earth observation satellite based on quantum genetic algorithm,” in 2021 40th Chinese Control Conference (CCC), pp. 1715–1720, IEEE, 2021.
  30. A. Lucas, “Ising formulations of many np problems,” Frontiers in physics, vol. 2, p. 5, 2014.
  31. T. Albash and D. A. Lidar, “Adiabatic quantum computation,” Reviews of Modern Physics, vol. 90, no. 1, p. 015002, 2018.
  32. F. Glover, G. Kochenberger, and Y. Du, “Quantum Bridge Analytics I: A tutorial on formulating and using QUBO models,” 4OR, vol. 17, pp. 335–371, Dec. 2019.
  33. E. Boros and P. L. Hammer, “Pseudo-boolean optimization,” Discrete Applied Mathematics, vol. 123, no. 1, pp. 155–225, 2002.
  34. T. Albash and D. A. Lidar, “Adiabatic quantum computation,” Rev. Mod. Phys., vol. 90, p. 015002, Jan 2018.
  35. M. Born and V. Fock, “Beweis des adiabatensatzes,” Zeitschrift für Physik, vol. 51, no. 3, pp. 165–180, 1928.
  36. X. Lee, Y. Saito, D. Cai, and N. Asai, “Parameters fixing strategy for quantum approximate optimization algorithm,” in 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), (Los Alamitos, CA, USA), pp. 10–16, IEEE Computer Society, oct 2021.
  37. D-Wave Developers, “D-Wave Hybrid Solver Service: An Overview,” Tech. Rep. 14-1039A-B, D-Wave Systems Inc., 05 2020.
  38. D-Wave Developers, “Hybrid Solver for Constrained Quadratic Models,” Tech. Rep. 14-1055A-A, D-Wave Systems Inc., 10 2021.
  39. E. Osaba, E. Villar-Rodriguez, A. Gomez-Tejedor, and I. Oregi, “Hybrid quantum solvers in production: how to succeed in the nisq era?,” arXiv preprint arXiv:2401.10302, 2024.
  40. T. Lubinski, C. Coffrin, C. McGeoch, P. Sathe, J. Apanavicius, and D. E. B. Neira, “Optimization applications as quantum performance benchmarks,” arXiv preprint arXiv:2302.02278, 2023.
  41. A. Makarov, C. Pérez-Herradón, G. Franceschetto, M. Taddei, and E. Osaba, “Benchmark dataset and results for the satellite mission planning problem.” http://dx.doi.org/10.17632/y3zx2fht3c.1, 2024. Online at Mendeley Data.
  42. L. Perron and V. Furnon, “Or-tools.”
  43. Dordrecht: Springer Netherlands, 1994.
  44. V. Bergholm, J. Izaac, M. Schuld, C. Gogolin, S. Ahmed, V. Ajith, M. S. Alam, G. Alonso-Linaje, B. AkashNarayanan, A. Asadi, et al., “Pennylane: Automatic differentiation of hybrid quantum-classical computations,” arXiv preprint arXiv:1811.04968, 2018.
  45. J. Preskill, “Quantum computing in the nisq era and beyond,” Quantum, vol. 2, p. 79, 2018.
  46. K. Blekos, D. Brand, A. Ceschini, C.-H. Chou, R.-H. Li, K. Pandya, and A. Summer, “A review on quantum approximate optimization algorithm and its variants,” Physics Reports, vol. 1068, pp. 1–66, 2024.
  47. L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, “Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices,” Physical Review X, vol. 10, p. 021067, June 2020.
  48. M. M. Wauters, G. B. Mbeng, and G. E. Santoro, “Polynomial scaling of the quantum approximate optimization algorithm for ground-state preparation of the fully connected p -spin ferromagnet in a transverse field,” Physical Review A, vol. 102, p. 062404, Dec. 2020.
Citations (5)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.

Sign Up for Free