Related papers: Minimum Orbital Intersection Distance: Asymptotic …
In this paper, we improve upon our previous work[24,22] and establish convergence bounds on the objective function values of approximate proximal-gradient descent (AxPGD), approximate accelerated proximal-gradient descent (AxAPGD) and…
We propose and analyze asymptotic proximal point (APP) methods to find the global minimizer for a class of nonconvex, nonsmooth, or even discontinuous multiple minima functions. The method is based on an asymptotic representation of…
Trajectory optimization of low-thrust perturbed orbit rendezvous is a crucial technology for space missions in low Earth orbits, which is difficult to solve due to its initial value sensitivity, especially when the transfer trajectory has…
We introduce a method for efficiently computing the exact shortest path to the boundary of a mesh from a given internal point in the presence of self-intersections. We provide a formal definition of shortest boundary paths for…
A deep-space exploration mission with low-thrust propulsion to rendezvous with multiple asteroids is investigated. Indirect methods, based on the optimal control theory, are implemented to optimize the fuel consumption. The application of…
The (unweighted) point-separation problem asks, given a pair of points $s$ and $t$ in the plane, and a set of candidate geometric objects, for the minimum-size subset of objects whose union blocks all paths from $s$ to $t$. Recent work has…
This Engineering Note addresses the challenge of estimating the probability of collision for tethered spacecraft during close encounters with other space objects. Standard probability of collision methods, based on spherical hard-body…
As robots are being increasingly used in close proximity to humans and objects, it is imperative that robots operate safely and efficiently under real-world conditions. Yet, the environment is seldom known perfectly. Noisy sensors and…
Orbit-determination programs find the orbit solution that best fits a set of observations by minimizing the RMS of the residuals of the fit. For near-Earth asteroids, the uncertainty of the orbit solution may be compatible with trajectories…
This paper presents an analytical model for collision probability assessments between de-orbiting or injecting space objects and satellite constellations. Considering the first to be subjected to a continuous tangential acceleration, its…
Doppler orbitography uses the Doppler shift in a transmitted signal to determine the orbital parameters of satellites including range and range-rate (or radial velocity). We describe two techniques for atmospheric-limited optical Doppler…
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in which states of the system are observable only indirectly, via a…
The collision avoidance constraints are prominent as non-convex, non-differentiable, and challenging when defined in optimization-based motion planning problems. To overcome these issues, this paper presents a novel non-conservative…
This work presents a sequential convex program method to compute fuel-optimal collision avoidance maneuvers for long-term encounters. The low-thrust acceleration model is used to account for the control, but the method can compute…
Mixed observable Markov decision processes (MOMDPs) are a modeling framework for autonomous systems described by both fully and partially observable states. In this work, we study the problem of synthesizing a control policy for MOMDPs that…
Imaging a star's companion at multiple epochs over a short orbital arc provides only four of the six coordinates required for a unique orbital solution. Probability distributions of possible solutions are commonly generated by Monte Carlo…
Spatial join processing techniques that identify intersections between complex geometries (e.g., polygons) commonly follow a two-step filter-and-refine pipeline. The filter step evaluates the query predicate on the minimum bounding…
This paper presents a unique approach to the problem of calculating revisit time metrics for different satellite orbits, sensor geometries, and constellation configurations with application to early lifecycle design and optimisation…
Given a set $\mathcal{P}$ of $h$ pairwise disjoint simple polygonal obstacles in $\mathbb{R}^2$ defined with $n$ vertices, we compute a sketch $\Omega$ of $\mathcal{P}$ whose size is independent of $n$, depending only on $h$ and the input…
The problem of finding the shortest path for a vehicle visiting a given sequence of target points subject to the motion constraints of the vehicle is an important problem that arises in several monitoring and surveillance applications…