Experiments with small UAS to support SAR tomographic mission formulation
No abstract provided
Lavalle, Marco↗
Engineering topics
Chung, Soon-Jo
Publications and source records attributed to Chung, Soon-Jo.
Distributed Aperture Radar Tomographic Sensors (DARTS) to Map Surface Topography and Vegetation Structure
No abstract provided
Chung, Soon-Jo↗
Distributed Aperture Radar Tomographic Sensors (darts) to Map Surface Topography and Vegetation Structure
Distributed Aperture Radar Tomographic Sensors (DARTS)is a mission concept being studied at the NASA Jet PropulsionLaboratory in collaboration with the California Institute ofTechnology to enable global and repeated imaging of surfacetopography and three-dimensional vegetation structure usingsingle-pass tomographic SAR technique. The observing systemconsists of a distributed formation of multiple small syntheticaperture radar platforms deployed in space with variabledistances to achieve look angle diversity and sensitivityto the vertical distribution of vegetation components. Ourgoal is to identify the optimal system configuration startingfrom documented community needs and mature the criticaltechnologies that lead to a viable implementation of DARTS.Here, we provide an overview of DARTS and describe ourapproach for designing and demonstrating single-pass SARtomographic systems as part of an on-going funded NASA Instrument Incubator Program effort.
Chung, Soon-Jo↗
Collaborative Pose Estimation of An Unknown Target Using Multiple Spacecraft
A reliable method for pose estimation of an unknown and uncooperative space target using monocular vision remains an open problem. Vision-based pose determination can be challenging in case of unfavorable illumination, time-varying conditions due to rotational motion and relative orbit, and scale ambiguity resolution. To address these challenges, we propose a novel collaborative pose determination algorithm called Multi- Spacecraft Simultaneous Estimation of Pose and Shape algorithm or M-SEPS.Within M-SEPS, a team of chaser spacecraft, each equipped with a monocular camera, exchange information over a local network to jointly estimate the relative kinematic state of the target and its sparse shape landmarks. In this approach, each spacecraft processes its own images and observes particular target landmarks in parallel and in a distributed fashion. Then, the local network is exploited by the spacecraft to share their consensus proposals and aggregate them to achieve the joint estimate. We validate our algorithm using simulations of relative orbits and observations, captured by each chaser spacecraft. To the best of the authors’ knowledge, this is the first cooperative, vision-based algorithm for estimating the pose and shape of a space object for an arbitrary number of spacecraft.
Chung, Soon-Jo↗
Optical Navigation for Autonomous Approach of Small Unknown Bodies
State of the practice in navigation around small celestial bodies heavily relies on ground sup- port and human skill, in particular, for perception-based operations such as optical navigation and mapping. This leads to longer duration and more complex mission operations and sub- sequently higher cost. Furthermore, it imposes limitations for certain missions such as fast fly-bys or multi-agent operations. In this work, we present an autonomous navigation strat- egy suitable for approaching small unexplored bodies. During the approach, we estimate the body’s physical properties as well as the spacecraft’s relative trajectory and associated un- certainties. The autonomous navigation strategy, which is solely based on optical measure- ments, begins as soon as the body becomes resolved in the navigation camera and terminates at the start of proximity operations, when the spacecraft makes its first trajectory correction to stay in the vicinity of the body. Our strategy uses multiple image-processing algorithms: light-curve analysis for estimating the target body’s rotation rate, Shape-from-Silhouette for reconstructing the 3D shape and estimating its rotation pole, and feature tracking tailored to Small-Body images for estimating relative navigation parameters. We used the Mission Analysis, Operations, and Navigation Toolkit Environment (MONTE) developed by the Jet Propulsion Laboratory to evaluate the feasibility of this multi-phase navigation strategy using simulated images of an approach trajectory. We used the Rosetta mission data to generate photorealistic images to characterise the performance of this approach. This work is based on the assumptions that the spacecraft attitude is known, the body is a principal-axis rotator, a-priori estimates of ephemerides and scale are available, and the body is observed from a zero sun phase only during initial approach. Preliminary results show orbit determination performance that is on par with the human navigation from the Rosetta mission; albeit with a 1% bias in spacecraft-target radial distance estimate. The bias error is likely due to the robustness and accuracy of the visual tracking under dynamic lighting conditions and per- spective changes, which decrease accuracy.
Villa, Jacopo↗
Probabilistic Guidance of a Swarm Deployed from the Back Shell of the Mars Spacecraft
This paper presents a probabilistic guidance algorithm for a swarm of assets deployed from the back shell of the Mars spacecraft. Such a swarm could provide valuable science data, with large spatiotemporal variation, from the Martian surface. Our probabilistic swarm guidance algorithm maximizes the coverage area of the swarm while uniformly distributing the assets on the Martian surface and guaranteeing strong connectivity of the swarm’s communication network topology. Numerical simulations demonstrate the effectiveness and versatility of our probabilistic swarm guidance algorithm.
Hadaegh, Fred↗
Autonomous Small Body Mapping and Spacecraft Navigation
Current methods for pose and shape estimation of small bodies, such as comets and asteroids, rely on extensive ground support and significant use of radiometric measurements using the Deep Space Network. The Stereo-Photoclinometry (SPC) technique is currently used to provide detailed topological information about a small body as well as its absolute orientation and position. While this technique has produced very accurate estimates, the core algorithm cannot be run in real-time and requires a team of scientists on the ground who must communicate with the spacecraft in order to oversee SPC operations. Autonomous onboard navigation addresses these limitations by eliminating the need for human oversight. In this paper, we present an optimization-based estimation algorithm for navigation that allows the spacecraft to autonomously approach and maneuver around an unknown small body by mapping its geometric shape, estimating its orientation, and simultaneously determining the trajectory of the center of mass of the small body. We show the effectiveness of the proposed algorithm using simulated data from a previous flight mission to Comet 67P.
Bhaskaran, Shyamkumar↗
Distributed Spatiotemporal Motion Planning for Spacecraft Swarms in Cluttered Environments
This paper focuses on trajectory planning for spacecraft swarms in cluttered environments, like debris fields or the asteroid belt. Our objective is to reconfigure the spacecraft swarm to a desired formation in a distributed manner while minimizing fuel and avoiding collisions among themselves and with obstacles. In our prior work we proposed a novel distributed guidance algorithm for spacecraft swarms in static environments. In this paper, we present the Multi-Agent Moving-Obstacles Spherical Expansion and Sequential Convex Programming (MAMO SE-SCP) algorithm that extends our prior work to include spatiotemporal constraints such as time-varying, moving obstacles and desired time-varying terminal positions. In the MAMO SE-SCP algorithm, each agent uses a spherical-expansion-based sampling algorithm to cooperatively explore the time-varying environment, a distributed assignment algorithm to agree on the terminal position for each agent, and a sequential-convex-programming-based optimization step to compute the locally-optimal trajectories from the current location to the assigned time-varying terminal position while avoiding collision with other agents and moving obstacles. Simulation results demonstrate that the proposed distributed algorithm can be used by a spacecraft swarm to achieve a time-varying, desired formation around an object of interest in a dynamic environment with many moving and tumbling obstacles.
Bandyopadhyay, Saptarshi↗
Distributed Spatiotemporal Motion Planning for Spacecraft Swarms in Cluttered Environments
This paper focuses on trajectory planning for spacecraft swarms in cluttered environments, like debris fields or the asteroid belt. Our objective is to reconfigure the spacecraft swarm to a desired formation in a distributed manner while minimizing fuel and avoiding collisions among themselves and with the obstacles. In our prior work we proposed a novel distributed guidance algorithm for spacecraft swarms in static environments.1 In this paper, we present the Multi-Agent Moving-Obstacles Spherical Expansion and Sequential Convex Programming (MAMO SE–SCP) algorithm that extends our prior work to include spatiotemporal constraints such as time-varying, moving obstacles and desired time-varying terminal positions. In the MAMO SE–SCP algorithm, each agent uses a spherical-expansion-based sampling algorithm to cooperatively explore the time-varying environment, a distributed assignment algorithm to agree on the terminal position for each agent, and a sequential-convex-programming-based optimization step to compute the locally-optimal trajectories from the current location to the assigned time-varying terminal position while avoiding collision with other agent and the moving obstacles. Simulations results demonstrate that the proposed distributed algorithm can be used by a spacecraft swarm to achieve a time-varying, desired formation around an object of interest in a dynamic environment with many moving and tumbling obstacles.
Hadaegh, Fred Y.↗
Computationally Efficient Motion Planning Algorithms for Agile Autonomous Vehicles in Cluttered Environments
Fast, real-time motion planning of an agile, autonomous vehicle in a cluttered environment, with many geometrically-fixed obstacles, is a very complex problem, especially because of the vehicle dynamics constraints and resource constrained computational capabilities onboard the vehicle. In this paper, we present computationally-efficient versions of our novel motion planning algorithm called the Spherical Expansion and Sequential Convex Programming (SE–SCP) algorithm. The SE–SCP algorithm first uses a spherical-expansion-based randomized sampling algorithm to explore the workspace. Oncea path is found from the start position to the goal position, the algorithm computes a locally optimal trajectory, within its homotopy class for a desired cost function, by solving a sequence of convex optimization problems. Thus, the SE–SCP algorithm is anytime locally optimal and the trajectory is globally optimal if the number of samples tends to infinity. In this paper, we further enhance the computational efficiency of the SE–SCP algorithm using uni-directional and bi-directional rewiring techniques. We also present a detailed proof of the local optimality characteristics of the new SE–SCP algorithms for aspecial case of vehicle dynamics. Simulation examples involving quadrotor and spacecraft help demonstrate the effectiveness of our new algorithms.
Bandyopadhyay, Saptarshi↗
Distributed Fast Motion Planning for Spacecraft Swarms in Cluttered Environments using Spherical Expansions and Sequence of Convex Optimization Problems
This paper presents a novel guidance algorithm for spacecraft swarms in an environment cluttered with many obstacles like a debris field or the asteroid belt. The objective of this algorithm is to reconfigure the swarm to a desired formation in a distributed manner while minimizing fuel and avoiding collisions among themselves and with the obstacles. The agents first use a spherical-expansion-based sampling algorithm to cooperatively explore the workspace and find paths to the desired terminal positions. Using a distributed assignment algorithm, the agents converge on an optimal assignment of the target locations in the desired formation. Then each agent generates a locally optimal trajectory from its current location to its terminal position by solving a sequence of convex optimization problems. As the agent moves along this trajectory, it receives the position of other agents and updates its trajectory to avoid collisions with other agents and the obstacles. Thus the swarm achieves the desired formation in a distributed manner while avoiding collisions. Moreover, this algorithm is computationally efficient, therefore it can be implemented onboard resource-constrained spacecraft. Simulations results show that the proposed distributed algorithm can be used by a spacecraft swarm to reconfigure a desired formation around an asteroid in a collision-free manner.
Bandyopadhyay, Saptarshi↗
Distributed fast motion planning for spacecraft swarms in cluttered environments
UNKNOWN
Hadaegh, Fred Y.↗