Engineering Papers⌕ Search

Engineering topics

Rahmani, Amir

Publications and source records attributed to Rahmani, Amir.

17 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2022

Robust Vision-based Multi-spacecraft Guidance Navigation and Control using CNN-based Pose Estimation

In this paper, we present an end-to-end simulation framework for tracking an uncooperative Target spacecraft in Low Earth Orbit using a CubeSat-class Ego spacecraft outfitted with a camera. Currently, capturing high-fidelity realistic images in space for this scenario is difficult and exorbitantly expensive. Therefore, we developed a framework to simulate the spacecraft orbits in Basilisk software and generate high-fidelity realistic images of spacecraft in Unreal Engine, including the effects from Sun, Earth, Moon and stars. The Ego spacecraft uses cameras to capture images of the uncooperative Target and estimates its position and attitude using a CNN based 6DOF pose estimation pipeline, eliminating need for large SWAP-C(Size, Weight, Power and Cost) sensors like LIDAR or reliance on inter-spacecraft communication, This CNN, which is motivated by ESA’s Pose Estimation challenge of 2019, is trained using simulated data from our end-to-end simulation framework. We compare the performance of two distinct CNNbased algorithms for pose estimation along a nominal trajectory. In presence of non-Gaussian modeling uncertainties, the statedependent estimation error is characterized with a quadratic upper-bound. The quadratically-bounded error can be used by a robust controller to maneuver

Rahmani, Amir↗
NASA NTRS2022

Robust Controller Synthesis for Vision-based Spacecraft Guidance and Control

This work develops a method for Robust Controller for Vision-based Spacecraft (RCVS) guidance and control, integral to the robust autonomy framework for multi-spacecraft for- mation control and reconfiguration applications. The method is built around the use of a photo-realistic simulator, where a camera is deployed on a tracking spacecraft (ego) in order to observe an uncontrolled spacecraft (target) in a Low Earth Orbit (LEO). In this direction, the proposed approach performs the relative state (attitude and position) estimation of the target spacecraft using Convolutional Neural Network (CNN). The state estimation error is then modeled and the corresponding error-bounds are obtained around a nominal trajectory of the ego and target spacecraft. Next, this work proposes a linear matrix inequalities (LMIs) based approach to controller synthesis, guaranteed to be robust against both model uncertainties and measurement errors, resulting from vision-based estimation. This controller is comprised of two distinct components, one synthesized based on the nominal trajectory, while the “robust” component corrects for deviations from the nominal trajectory. Finally, a tracking scenario that directly utilize the image data for spacecraft guidance and control, is presented to showcase the performance of the proposed robust autonomy framework.

Rahmani, Amir↗
NASA NTRS2021

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↗
NASA NTRS2020

Multi-Agent Motion Planning using Deep Learning for Space Applications

State-of-the-art motion planners cannot scale to a large number of systems. Motion planning for multiple agents is an NP (non-deterministic polynomial-time) hard problem, so the computation time increases exponentially with each addition of agents. This computational demand is a major stumbling block to the motion planner's application to future NASA missions involving the swarm of space vehicles. We applied a deep neural network to transform computationally demanding mathematical motion planning problems into deep learning-based numerical problems. We showed optimal motion trajectories can be accurately replicated using deep learning-based numerical models in several 2D and 3D systems with multiple agents. The deep learning-based numerical model demonstrates superior computational efficiency with plans generated 1000 times faster than the mathematical model counterpart.

Madani, Ramtin↗
NASA NTRS2020

Communication-Aware Orbit Design for Small Spacecraft Swarms around Small Bodies

Exploration of small Solar System bodies has traditionally been performed by single monolithic spacecraft carrying a number of science instruments. However, science instruments typically cannot be operated simultaneously due to the instrument requirements including optimal viewing angle, surface illumination, altitude and ground resolution, power, and data constraints. This observation has motivated interest in multi-spacecraft architectures where a swarm of small spacecraft, each carrying a single science instrument, studies a small body after being deployed by a carrier spacecraft, which then collects data from the vehicles and relays it to Earth. Such architectures hold promise to yield significant improvements in mission efficiency, increases in data quality, and shorter mission duration. A key difficulty in the design of such missions is the selection of orbits for the small spacecraft, which must satisfy not only instrument requirements, but also strict inter-spacecraft communication and on-board storage constraints. To address this, in this paper, we present a novel computationally-efficient optimization algorithm for \emph{communication-aware design} of the orbits of a small spacecraft swarm orbiting a small body. The proposed approach captures constraints including instrument requirements, inter-spacecraft communication bandwidths, and on-board memory usage, and it can accommodate highly irregular gravity field models and surface geometries. We propose an efficient algorithm for optimization of instrument observations and inter-spacecraft communications; we then leverage the differentiable nature of the proposed algorithm to accelerate a gradient-based global search algorithm. Numerical simulations of a six-spacecraft swarm studying 433 Eros show that the proposed approach successfully identifies high-quality orbits, and significantly outperform communication-agnostic optimization techniques, resulting in a 10% increase in scientific returns and a 30% increase in the quality of the collected data.

Rahmani, Amir↗
NASA NTRS2018

Conceptual Ideas for Radio Telescope on the Far Side of the Moon

A radio telescope on the far-side of the Moon has tremendous advantages compared to Earth-based telescopes because it could observe the universe at wavelengths that are hitherto poorly explored by humans so far and the Moon acts as a physical shield that isolates the telescope from the radio interference and noises from Earth. This paper presents a novel concept for building a radio telescope on the far-side of the Moon. The main idea is to shape a suitable existing lunar crater (1 − 50km in diameter) on the far-side of the Moon into a spherical reflecting dish. The proposed Lunar Crater Radio Telescope (LCRT) would be able to observe the universe in the 5 − 100m wavelength band (i.e., 3 − 60MHz radio frequency band). The key innovations of this concept are: (1) LCRT would be the largest filled-aperture radio telescope in the Solar System. (2) LCRT could potentially make tremendous scientific discoveries in fields of cosmology and extrasolar planets by observing the universe in the 5−100m λ band(i.e., 3−60MHz ν band) that has been hitherto poorly explored. (3) It would require only a few robots from Earth and autonomously modify an existing lunar crater to build the LCRT; thereby significantly reducing launch weight and cost compared to all previous lunar surface telescope mission concepts. (4) Furthermore, the Earth based robots are not consumed during construction of LCRT. Therefore, they could create a network of LCRTs to (i) observe different regions of the universe, and (ii) enable lunar Very-Long-Baseline Interferometry (VLBI) astronomy. We envisage that this concept would unlock the potential for groundbreaking scientific discoveries in radio astronomy.

Rahmani, Amir↗
NASA NTRS2017

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↗
NASA NTRS2017

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.↗
NASA NTRS2017

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↗
NASA NTRS2017

Autonomous Guidance Navigation and Control for Agile Quadrotors Using Polynomial Trajectory Planning and L1 Adaptive Control

We address the challenge to allow efficient autonomous flight in real world environments, both indoor and outdoor. We use a straight-line SE-SCP (Spherical Expansion and Sequential Convex Programming) [algorithm] to find an initial route through the environment and minimum snap trajectory generation using piecewise polynomials. Then, we implement an adaptive robust control able to address some robustness issues for quadrotors in outdoor flight, such as mass variation and wind disturbances. Coupling these techniques we allow high-speed and aggressive autonomous flight through obstacle-dense indoor environments, as well as address outdoor disturbances.

Landolfi, Mattia↗
NASA NTRS2017

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↗
NASA NTRS2017

CARACaS multi-agent maritime autonomy for unmanned surface vehicles in the Swarm II harbor patrol demonstration

This paper describes new autonomy technology that enabled a team of unmanned surface vehicles (USVs) to execute cooperative behaviors in the USV Swarm II harbor patrol demonstration and provides a description of autonomy performance in the event. The new developments extend the NASA Jet Propulsion Laboratory’s CARACaS (Control Architecture for Robotic Agent Command and Sensing) autonomy architecture, which pro- vides foundational software infrastructure, core executive functions, and several default robotic technology mod- ules. In Swarm II, CARACaS demonstrated higher levels of autonomy and more complex cooperation than previous on-water exercises, using full-sized vehicles and real-world sensing and communication. The core au- tonomous behaviors to support the harbor patrol scenario included Patrol, Track, Inspect, and Trail, providing the capability of finding all vessels entering the patrol area, keeping track of them, inspecting them to infer intent, and trailing suspect vessels. Significantly, CARACaS assumed responsibility for not only executing tasks safely and efficiently but also recognizing what tasks needed to be accomplished, given the current state of the world. Since the heterogeneous USV teams shared world model that evolved, such as due to (dis)appearance of vessels in the area or a change in health or availability of a USV, CARACaS replanned to generate and reallocate the new task list. Thus, human intervention was never required in the loop to task USVs during mission execution, though a supervisory role was supported in the autonomy system for mission monitoring and exception handling. Finally, CARACaS also ensured the USVs avoided hazards and obeyed the applicable rules of the road, using its local motion planning modules.

Sandoval, Michael↗
NASA NTRS2015

Road-Following Formation Control of Autonomous Ground Vehicles

This work presents a novel cooperative path planning for formation keeping robots traversing along a road with obstacles and possible narrow passages. A unique challenge in this problem is a requirement for spatial and temporal coordination between vehicles while ensuring collision and obstacle avoidance.

Ono, Masahiro↗