arXiv subjects
Publications and source records attributed to Hui Zhi.
The mean apparent magnitude of Amazon Leo satellites is 6.28 based on 1,938 observations. For spacecraft in their operational mode, 92% exceeded the brightness limit recommended by the IAU for interference with research, while 25% distract from aesthetic appreciation of the night sky. The reflective characteristics are similar to Version 1 Starlink spacecraft.
The development of low earth orbit (LEO) mega-constellation fundamentally threatens ground-based optical astronomical observations. To study the photometric properties of the LEO mega-constellations, we used the Xinglong 50 cm telescope to conduct a large-sample, high-precision, and multicolor target-tracking photometry of two typical LEO Mega-constellations: Starlink and OneWeb. Over a three-month observation period starting on 2022 January 1st, we collected 1,447 light curves of 404 satellites in four typical versions: Starlink v1.0, DarkSat, VisorSat, Starlink v1.5, and OneWeb. According to data statistics, Starlink v1.0 has the smallest median magnitude at clear and SDSS $gri$ band, and OneWeb is the dimmest bus. The brightness of Starlink v1.5 is slightly brighter than VisorSat. We construct a detailed photometric model with solar phase angle variations by calculating the illumination-visibility geometry based on the orbital parameters. Our data analysis shows that the solar phase angle is the significant characteristic which influencing Starlink satellites' brightness, but it is not sensitive to OneWeb satellites. VisorSat and Starlink v1.5 version, which are equipped with deployable visors, have significantly reduced scattered light compared to the previous Starlink v1.0 version. The multiband LOWESS and color-index are analyzed in characterizing the energy and color features of LEO mega-constellation satellites. This work found that the proportion of scattered sunlight mitigation achieved with VisorSat and Starlink v1.5 was 55.1\% and 40.4\%, respectively. The color index of different buses shows an evident clustering feature. Our observation and analysis could provide valuable quantitative data and photometric models, which can contribute to assessing the impact of LEO mega-constellations on astronomical observations.
In this article, we propose a novel approach, called InPTC (Integrated Planning and Tube-Following Control), for prescribed-time collision-free navigation of wheeled mobile robots in a compact convex workspace cluttered with static, sufficiently separated, and convex obstacles. A path planner with prescribed-time convergence is presented based upon Bouligand's tangent cones and time scale transformation (TST) techniques, yielding a continuous vector field that can guide the robot from almost all initial positions in the free space to the designated goal at a prescribed time, while avoiding entering the obstacle regions augmented with safety margin. By leveraging barrier functions and TST, we further derive a tube-following controller to achieve robot trajectory tracking within a prescribed time less than the planner's settling time. This controller ensures the robot moves inside a predefined ``safe tube'' around the reference trajectory, where the tube radius is set to be less than the safety margin. Consequently, the robot will reach the goal location within a prescribed time while avoiding collision with any obstacles along the way. The proposed InPTC is implemented on a Mona robot operating in an arena cluttered with obstacles of various shapes. Experimental results demonstrate that InPTC not only generates smooth collision-free reference trajectories that converge to the goal location at the preassigned time of $250\,\rm s$ (i.e., the required task completion time), but also achieves tube-following trajectory tracking with tracking accuracy higher than $0.01\rm m$ after the preassigned time of $150\,\rm s$. This enables the robot to accomplish the navigation task within the required time of $250\,\rm s$.
In this paper, we propose a novel formation controller for nonholonomic agents to form general parametric curves. First, we derive a unified parametric representation for both open and closed curves. Then, a leader-follower formation controller is designed to form the parametric curves. We consider directed communications and constant input disturbances rejection in the controller design. Rigorous Lyapunov-based stability analysis proves the asymptotic stability of the proposed controller. Detailed numerical simulations and experimental studies are conducted to verify the performance of the proposed method.
This paper proposed a novel large neighborhood search-adaptive genetic algorithm (LNS-AGA) for many-to-many on-orbit repairing mission planning of geosynchronous orbit (GEO) satellites with mission deadline constraint. In the many-to-many on-orbit repairing scenario, several servicing spacecrafts and target satellites are located in GEO orbits which have different inclination, RAAN and true anomaly. Each servicing spacecraft need to rendezvous with target satellites to perform repairing missions under limited fuel. The mission objective is to find the optimal servicing sequence and orbit rendezvous time of every servicing spacecraft to minimize total cost of all servicing spacecrafts with all target satellites repaired. Firstly, a time-dependent orbital rendezvous strategy is proposed, which can handle the mission deadline constraint. Besides, it is also cost-effective compared with the existing strategy. Based on this strategy, the many-to-many on-orbit repairing mission planning model can be simplified to an integer programming problem, which is established based on the vehicle routing problem with time windows (VRPTW) model. In order to efficiently find a feasible optimal solution under complicated constraints, a hybrid adaptive genetic algorithm combining the large neighborhood search procedure is designed. The operations of "destroy" and "repair" are used on the elite individuals in each generation of the genetic algorithm to enhance local search capabilities. Finally, the simulations under different scenarios are carried out to verify the effectiveness of the presented algorithm and orbital rendezvous strategy, which performs better than the traditional genetic algorithm.