The first step of any active debris removal (ADR) mission is the selection of the target. The optimal choice is to find the most dangerous debris that can be removed considering the chaser spacecraft requirements and mission constraints. After creating a catalog of the current space population in low Earth orbit (LEO), the MIT Monte Carlo Orbital Capacity Assessment Tool (MOCAT-MC) is used to simulate and predict the future space environment and the interaction among the space population. A novel performance index to quantify the criticality of each debris and the risk that it presents to the space environment is proposed. The new risk index considers the proximity of the debris to highly populated regions, its persistence in orbit, its likelihood to collide, and the estimated number and mass of debris that it can generate. The risk index is then optimized to work either with the full space population or a subset of it, where the ranking of risk among debris is highlighted. Multiple risk analyses are proposed in the test cases, where the ranked list of optimal targets is provided.
In this paper, we propose a set of guidelines to select a solver for the solution of nonlinear programming problems. We conduct a comparative analysis of the convergence performances of commonly used solvers for both unconstrained and constrained nonlinear programming problems. The comparison metrics involve accuracy, convergence rate, and computational time. MATLAB is chosen as the implementation platform due to its widespread adoption in academia and industry. Our study includes solvers which are either freely available or require a license, or are extensively documented in the literature. Moreover, we differentiate solvers if they allow the selection of different optimal search methods. We assess the performance of 24 algorithms on a set of 60 benchmark problems. We also evaluate the capability of each solver to tackle two large-scale UAV optimal path planning scenarios, specifically the 3D minimum time problem for UAV landing and the 3D minimum time problem for UAV formation flying. To enrich our analysis, we discuss the effects of each solver’s inner settings on accuracy, convergence rate, and computational time.
This paper presents two different attitude control strategies for a fixed target-tracking remote sensing CubeSat. In particular, the observation mission profile requires the CubeSat to quickly reorient itself from its initial attitude to point an imager toward a fixed target area on the Earth’s surface. It will then be required to slew in order to maintain a very accurate pointing of the same area for the several seconds required to the image acquisition. We first consider a classical proportional-derivative controller based on the feedback of quaternions, representative of the satellite attitude. Secondly, we implement an innovative optimal guidance based on a direct optimization method, the Inverse Dynamics in the Virtual Domain, and a nonlinear programming solver, the Sequential Gradient-Restoration Algorithm. The key advantage of such optimal guidance is the quick calculation of minimum-time reorientation maneuver.