Related papers: A convex solution to Psiaki's first joint attitude…
In this paper we present a unified framework for solving a general class of problems arising in the context of set-membership estimation/identification theory. More precisely, the paper aims at providing an original approach for the…
Relative pose estimation, a fundamental computer vision problem, has been extensively studied for decades. Existing methods either estimate and decompose the essential matrix or directly estimate the rotation and translation to obtain the…
In this paper, SAR image reconstruction with joint phase error estimation (autofocusing) is formulated as an inverse problem. An optimization model utilising a sparsity-enforcing Cauchy regularizer is proposed, and an alternating…
A fundamental control problem for autonomous vehicle formations is formation shape control, in which the agents must maintain a prescribed formation shape using only information measured or communicated from neighboring agents. While a…
This paper investigates the infinite horizon optimal control problem (OCP) for space applications characterized by nonlinear dynamics. The proposed approach divides the problem into a finite horizon OCP with a regularized terminal cost,…
In this paper, we introduce a generalized dynamical unbalanced optimal transport framework by incorporating limited control input and mass dissipation, addressing limitations in conventional optimal transport for control applications. We…
We present a continuous nonlinear optimization model for the Spin Glass Problem (SGP), building on a classical result by Rosenberg (1972), which shows that for a class of multilinear polynomial problems the optimal values of the continuous…
Air-bearing platforms for simulating the rotational dynamics of satellites require highly precise ground truth systems. Unfortunately, commercial motion capture systems used for this scope are complex and expensive. This paper shows a novel…
In this work feedback control laws are designed for achieving three-axis attitude stabilization of inertial pointing spacecraft using only magnetic torquers. The designs are based on an almost periodic model of geomagnetic field along the…
We formulate a semiclassical theory for systems with spin-orbit interactions. Using spin coherent states, we start from the path integral in an extended phase space, formulate the classical dynamics of the coupled orbital and spin degrees…
In the first part of this paper, inspired by the geometric method of Jean-Pierre Marec, we consider the two-impulse Hohmann transfer problem between two coplanar circular orbits as a constrained nonlinear programming problem. By using the…
In order to circumvent the difficulties in solving numerically the discrete optimal transport problem, in which one minimizes the linear target function $P\mapsto\langle C,P\rangle:=\sum_{i,j}C_{ij}P_{ij}$, Cuturi introduced a variant of…
Lower-bound analyses for nonconvex strongly-concave minimax optimization problems have shown that stochastic first-order algorithms require at least $\mathcal{O}(\varepsilon^{-4})$ oracle complexity to find an $\varepsilon$-stationary…
In this paper, we present a new method to solve a certain type of Semidefinite Programming (SDP) problems. These types of SDPs naturally arise in the Quadratic Convex Reformulation (QCR) method and can be used to obtain dual bounds of…
The classical problem of attitude stability in a central gravity field is generalized to that on a stationary orbit around a uniformly-rotating asteroid. This generalized problem is studied in the framework of geometric mechanics. Based on…
We present a closed-form solution to Wahba's problem in the quaternion domain for the special case of two vector observations. Existing approaches, including Davenport's $q$-method, QUEST, Horn's method, and ESOQ algorithms, recover the…
We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…
Conjunction analysis and maneuver planning for spacecraft collision avoidance remains a manual and time-consuming process, typically involving repeated forward simulations of hand-designed maneuvers. With the growing density of satellites…
In this paper, we study the gradient descent-ascent method for convex-concave saddle-point problems. We derive a new non-asymptotic global convergence rate in terms of distance to the solution set by using the semidefinite programming…
For the planar $N$-body problem, we first introduce a class of moving frame suitable for orbits near central configurations, especially for total collision orbits, which is the main new ingredient of this paper. The moving frame allows us…