The increasing amount of space debris poses a major threat to the security of space assets. The timely acquisition of space debris orbital data through observations is essential. We established a mathematical model of optical satellite constellations for space debris observation, designed a high-quality constellation configuration, and designed a space debris tracking observation scheduling algorithm. These tools can realize the efficient networking of space debris from a large number of optical satellite observation facilities. We designed a constellation consisting of more than 20 low-Earth orbit (LEO) satellites, mainly dedicated to the observation of LEO space objects. According to the observation scheduling method, the satellite constellation can track and observe more than 93% of the targets every day, increase the frequency of orbital data updates, and provide support for the realization of orbital space debris cataloguing. Designing optical satellite constellations to observe space debris can help realize the advance perception of dangerous collisions, timely detect dangerous space events, make key observations about high-risk targets, greatly reduce the false alarm rate of collisions, and provide observational data support for space collisions.
1 February 2017 in Research in Astronomy and Astrophysics
The increasing number of space debris has created an orbital debris environment that poses increasing impact risks to existing space systems and human space flights. For the safety of in-orbit spacecrafts, we should optimally schedule surveillance tasks for the existing facilities to allocate resources in a manner that most significantly improves the ability to predict and detect events involving affected spacecrafts. This paper analyzes two criteria that mainly affect the performance of a scheduling scheme and introduces an artificial intelligence algorithm into the scheduling of tasks of the space debris surveillance network. A new scheduling algorithm based on the particle swarm optimization algorithm is proposed, which can be implemented in two different ways: individual optimization and joint optimization. Numerical experiments with multiple facilities and objects are conducted based on the proposed algorithm, and simulation results have demonstrated the effectiveness of the proposed algorithm.
Visible-band polarization-entangled photon sources (VBPEPSs) are preferred in quantum microscopy, imaging, and light-matter interactions with solid-state quantum memories, - centers, and trapped ions. They can be generated directly via spontaneous parametric down-conversion. However, that requires a high-power deep-ultraviolet pump laser. Additionally, the required ultraviolet-band nonlinear crystal is inefficient compared to periodically poled potassium titanyl phosphate or periodically poled lithium niobate crystals. The quantum frequency transduction of a near-infrared polarization-entangled photon source (NIPEPS) provides an effective way to overcome the drawbacks of direct generation. We demonstrate 634-nm VBPEPS generation via polarization-independent frequency transduction of 1080-nm NIPEPS. High-quality entanglement in the visible band is verified via two-photon polarization interference, Bell-inequality, and quantum-state tomography. This method could be applied to other visible wavelengths or be extended to the ultraviolet, which is difficult to generate directly. It has promising applications in quantum imaging, networks, and spectroscopy.
With the increasing number of space debris, the demand for telescopes to observe space debris is also constantly increasing. The telescope observation scheduling problem requires algorithms to schedule telescopes to maximize observation value within the visible time constraints of space debris, especially when dealing with large-scale problems. This paper proposes a practical heuristic algorithm to solve the telescope observation of space debris scheduling problem. In order to accelerate the solving speed of algorithms on large-scale problems, this paper combines the characteristics of the problem and partitions the large-scale problem into multiple sub-problems according to the observation time. In each sub-problem, a coding method based on the priority of the target going into the queue is proposed in combination with the actual observation data, and a decoding method matching the coding method is designed. In the solution process for each sub-problem, an adaptive variable neighborhood search is used to solve the space debris observation plan. When solving all sub-problems is completed, the observation plans obtained on all sub-problems are combined to obtain the observation plan of the original problem.