Related papers: Nonlinear Programming of Low-Thrust Multi-Rendezvo…
Near-Earth Objects (NEOs) are attractive exploration targets due to their accessibility, scientific value, and resources. Although trajectory design has revealed efficient pathways to these bodies, systematic strategies for Earth-NEO…
In this paper a direct method based on a transcription by finite elements in time has been used to design optimal interplanetary trajectories, exploiting a combination of gravity assist maneuvers and low-thrust propulsion. A multiphase…
The prevailing assumption holds that on-orbit servicing (OOS) of mega-constellations is infeasible due to prohibitive fuel consumption incurred by multiple rendezvous maneuvers across vast and dispersed satellite populations. To address…
High-precision radial velocity planet searches have surveyed over ~2000 nearby stars and detected over ~200 planets. While these same stars likely harbor many additional planets, they will become increasingly challenging to detect, as they…
Langevin dynamics (LD) has been proven to be a powerful technique for optimizing a non-convex objective as an efficient algorithm to find local minima while eventually visiting a global minimum on longer time-scales. LD is based on the…
Crystal structure optimization is fundamental to materials modeling but remains computationally expensive when performed with density-functional theory (DFT). Machine-learning (ML) approaches offer substantial acceleration, yet existing…
Low-rank matrix estimation under heavy-tailed noise is challenging, both computationally and statistically. Convex approaches have been proven statistically optimal but suffer from high computational costs, especially since robust loss…
We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different…
The preliminary mission design of spacecraft missions to asteroids often involves, in the early phases, the selection of candidate target asteroids. The final result of such an analysis is a list of asteroids, ranked with respect to the…
A novel decentralised trajectory generation algorithm for Multi Agent systems is presented. Multi-robot systems have the capacity to transform lives in a variety of fields. But, trajectory generation for multi-robot systems is still in its…
A novel trajectory design methodology is proposed in the current work to minimize the state uncertainty in the crucial mission of spacecraft rendezvous. The trajectory is shaped under constraints utilizing a multiple-impulse approach. State…
A possible mean to stabilize the LEO debris population is to remove each year 5 heavy debris like spent satellites or launchers stages from that space region. This paper investigates the DeltaV requirement for such a Space Debris Collecting…
The computation of the distance of two time series is time-consuming for any elastic distance function that accounts for misalignments. Among those functions, DTW is the most prominent. However, a recent extensive evaluation has shown that…
Estimating the probability of collision between spacecraft is crucial for risk management and collision-avoidance strategies. Current methods often rely on Gaussian assumptions and simplifications, which can be inaccurate in highly…
Ground robots navigating in complex, dynamic environments must compute collision-free trajectories to avoid obstacles safely and efficiently. Nonconvex optimization is a popular method to compute a trajectory in real-time. However, these…
An algorithm is devised for solving minimization problems with equality constraints. The algorithm uses first-order derivatives of both the objective function and the constraints. The step is computed as a sum between a steepest-descent…
This paper develops a sequential convex programming approach for Mars entry trajectory planning by range discretization. To improve the accuracy of numerical integration, the range of entry trajectory is selected as the independent variable…
This paper proposes a systematic method for generating practical and robust low-thrust spacecraft trajectories. One contribution is to consider the change in mass of the spacecraft at two levels: a) the propulsive acceleration and b) the…
Alternating minimization (AM) procedures are practically efficient in many applications for solving convex and non-convex optimization problems. On the other hand, Nesterov's accelerated gradient is theoretically optimal first-order method…
We investigate the computation of stable fracture paths in brittle thin films using one-dimensional damage models with an elastic foundation. The underlying variational formulation is non-convex, making the evolution path sensitive to…