Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Rendezvous algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

Targetting and guidance program documentation

A FORTRAN computer program was developed which automatically targets two and three burn rendezvous missions and performs feedback guidance using the GUIDE algorithm. The program was designed to accept a large class of orbit specifications and to automatically choose a two or three burn mission depending upon the time alignment of the vehicle and target. The orbits may be specified as any combination of circular and elliptical orbits and may be coplanar or inclined, but must be aligned coaxially with their perigees in the same direction. The program accomplishes the required targeting by repeatedly converging successively more complex missions. It solves the coplanar impulsive version of the mission, then the finite burn coplanar mission, and finally, the full plane change mission. The GUIDE algorithm is exercised in a feedback guidance mode by taking the targeted solution and moving the vehicle state step by step ahead in time, adding acceleration and navigational errors, and reconverging from the perturbed states at fixed guidance update intervals. A program overview is presented, along with a user's guide which details input, output, and the various subroutines.

Harrold, E. F.↗

Automated low-thrust guidance for the orbital maneuvering vehicle

This paper describes the highly autonomous OMV Guidance Navigation and Control system. Emphasis is placed on a key feature of the design, the low thrust guidance algorithm. The two guidance modes, orbit change guidance and rendezvous guidance, are discussed in detail. It is shown how OMV will automatically transfer from its initial orbit to an arbitrary target orbit and reach a specified rendezvous position relative to the target vehicle.

Rose, Richard E.↗

Generalized Reference Targeting for Spaceflight

For spaceflight programs to achieve some of the aggressive exploration initiatives such as visiting and landing on other celestial bodies, rendezvousing with other orbiting vehicles, and ultimately returning crew safely to Earth, an assortment of targeting algorithms to compute the necessary burns to strategically maneuver a spacecraft to a variety of destinations are required. Numerous examples exist, but rather than creating and implementing multiple targeting solutions, is it possible to have a general targeting model that can accommodate a variety of applications? Originally motivated for mission design and analysis purposes, this paper outlines a generalized reference targeting algorithm for spaceflight that may also have applications in on-orbit flight software. It accommodates arbitrary flight dynamics and both impulsive and finite burns for either absolute or relative targeting applications. It also allows for an arbitrary number of targeting design parameters such as multiple discrete correction burns or finite thrust parameters to satisfy numerous combinations of targeting constraints that can have fixed or variable time epochs. Given a reference trajectory, this targeting technique provides a general framework to quickly solve an assortment of targeting problems that may be well-defined, over-determined, or under-determined while naturally producing metrics providing insight into the controllability for a given problem formulation. Due to the derivation, speed, and accuracy of the algorithm, it lends to supporting rapid linear covariance analysis and robust trajectory design applications for a variety of flight phases such as rendezvous and docking, cislunar transfer, interplanetary flight, orbit maintenance, de-orbit, and powered descent and landing.

Targeting↗

Fast, Safe, Propellant-Efficient Spacecraft Motion Planning Under Clohessy-Wiltshire-Hill Dynamics

This paper presents a sampling-based motion planning algorithm for real-time and propellant-optimized autonomous spacecraft trajectory generation in near-circular orbits. Specifically, this paper leverages recent algorithmic advances in the field of robot motion planning to the problem of impulsively actuated, propellant- optimized rendezvous and proximity operations under the Clohessy-Wiltshire-Hill dynamics model. The approach calls upon a modified version of the FMT* algorithm to grow a set of feasible trajectories over a deterministic, low-dispersion set of sample points covering the free state space. To enforce safety, the tree is only grown over the subset of actively safe samples, from which there exists a feasible one-burn collision-avoidance maneuver that can safely circularize the spacecraft orbit along its coasting arc under a given set of potential thruster failures. Key features of the proposed algorithm include 1) theoretical guarantees in terms of trajectory safety and performance, 2) amenability to real-time implementation, and 3) generality, in the sense that a large class of constraints can be handled directly. As a result, the proposed algorithm offers the potential for widespread application, ranging from on-orbit satellite servicing to orbital debris removal and autonomous inspection missions.

spacecraft relative motio↗

Mars sample return by orbital rendezvous

The return of Mars surface samples by the orbital rendezvous mode would require smaller, lighter vehicles than the direct return mode and would limit the exposure of the earth return systems to possible contamination by Martian biota. The reference mission considered would use a single Titan IIIE/Centaur launch vehicle, carry a 1 kg sample, and be launched in late 1981. The spacecraft would consist of an orbiter, a Mars lander, a Mars ascent vehicle, an earth return vehicle, and an earth entry capsule. The Mars ascent vehicle is the only all-new vehicle required, the others being derived from Viking and other programs. A key consideration is the feasibility of automatic rendezvous and sample transfer between the ascent vehicle and orbiter in Mars orbit. The maneuvers required and the maneuver algorithm developed in a NASA feasibility study are described in detail. The possibility of international cooperation on a Mars orbital rendezvous mission is discussed.

Moore, J. W.↗

Optimal K/S impulsive transfer

The necessary equations in K/S variables (E-formulation) are developed for an optimal N-impulse solution of the time-open and rendezvous problems. The equations are particularly simple when only two impulses are assumed. The developed algorithm is extremely fast and reliable because the equations that must be solved are smooth, well-behaved (almost sinusoidal) functions. Numerical results for a two-impulse time-open and rendezvous problem are presented.

Jezewski, D. J.↗

A manned maneuvering unit proximity operations planning and flight guidance display and control system

This task concerns the design, development, testing, and evaluation of a new proximity operations planning and flight guidance display and control system for manned space operations. A forecast, derivative manned maneuvering unit (MMU) was identified as a candidate for the application of a color, highway-in-the-sky display format for the presentation of flight guidance information. A silicon graphics 4D/20-based simulation is being developed to design and test display formats and operations concepts. The simulation includes the following: (1) real-time color graphics generation to provide realistic, dynamic flight guidance displays and control characteristics; (2) real-time graphics generation of spacecraft trajectories; (3) MMU flight dynamics and control characteristics; (4) control algorithms for rotational and translational hand controllers; (5) orbital mechanics effects for rendezvous and chase spacecraft; (6) inclusion of appropriate navigation aids; and (7) measurement of subject performance. The flight planning system under development provides for: (1) selection of appropriate operational modes, including minimum cost, optimum cost, minimum time, and specified ETA; (2) automatic calculation of rendezvous trajectories, en route times, and fuel requirements; (3) and provisions for manual override. Man/machine function allocations in planning and en route flight segments are being evaluated. Planning and en route data are presented on one screen composed of two windows: (1) a map display presenting a view perpendicular to the orbital plane, depicting flight planning trajectory and time data attitude display presenting attitude and course data for use en route; and (2) an attitude display presenting local vertical-local horizontal attitude data superimposed on a highway-in-the-sky or flight channel representation of the flight planned course. Both display formats are presented while the MMU is en route. In addition to these displays, several original display elements are being developed, including a 3DOF flight detector for attitude commanding, a different flight detector for translation commands, and a pictorial representation of velocity deviations.

Gershzohn, Gary R.↗

Terminal guidance and navigation for comet and asteroid rendezvous

A terminal guidance and navigation scheme developed in earlier work was modified and evaluated for a solar electric propulsion rendezvous mission to comet Encke. The scheme is intended for autonomous, on-board use. The guidance algorithm is based on optimal control theory and minimizes the time integrated square of thrust acceleration. The navigation algorithm employs a modified Kalman filter set in measurement variables. Random sequences were generated to simulate measurement errors, and the evaluation was conducted with detailed numerical computations which include actual motions of spacecraft and comet. The evaluations showed that the scheme attains rendezvous and maintains station after rendezvous within less than 10 km for estimated best measurements and within less than 100 km for estimated worst measurements. The measurements required are angles, range, and range rate. Angles and range appear to be absolutely necessary; range rate is not as strong a measurement type, and further modifications of the filter will allow a scheme that does not require the rate measurements.

Bennett, A. G.↗

A constrained discrete optimal guidance strategy for low-thrust space flight

A low-thrust guidance algorithm suitable for operational use is formulated. Using linear stochastic control theory, a linear feedback control law is obtained for a minimum terminal miss performance criterion. The control variables are restricted to constant values over specified time intervals and are explicitly limited. Both fixed and variable time-of-arrival guidance are considered. Guidance equations are presented in deterministic (operational) and in statistical form; and computational procedures necessary for implementation are outlined. The performance of the guidance algorithm is evaluated by applying it to the approach phase of the 1980 rendezvous mission with the comet Encke.

Jacobson, R. A.↗

MXER Simulation Study (Appendix B)

The task of prediction of the motion of a momentum exchange system with a 9-digit accuracy is extremely challenging, and it is relentlessly testing our ability to gain fundamental insights into the nature of the tether dynamics in this system. It has been show that the modal decomposition approach developed in the first part of this study is a very powerful and precise tool for the simulation of the dynamics of momentum exchange tethers. However, to get a prediction with required accuracy using this tool, one must have precise inputs, including the initial state, system parameters, and the environmental models. In simulations, the tether tip positioning has been observed to be quite sensitive to even small variations of the parameters involved in the calculations. It is therefore imperative that precise estimation and control algorithms be developed to compensate for the inevitable uncertainties and support high precision rendezvous.

Levin, E. M.↗

Flight data results of estimate fusion for spacecraft rendezvous navigation from shuttle mission STS-69

A recently developed rendezvous navigation fusion filter that optimally exploits existing distributed filters for rendezvous and GPS navigation to achieve the relative and inertial state accuracies of both in a global solution is utilized here to process actual flight data. Space Shuttle Mission STS-69 was the first mission to date which gathered data from both the rendezvous and Global Positioning System filters allowing, for the first time, a test of the fusion algorithm with real flight data. Furthermore, a precise best estimate of trajectory is available for portions of STS-69, making possible a check on the performance of the fusion filter. In order to successfully carry out this experiment with flight data, two extensions to the existing scheme were necessary: a fusion edit test based on differences between the filter state vectors, and an underweighting scheme to accommodate the suboptimal perfect target assumption made by the Shuttle rendezvous filter. With these innovations, the flight data was successfully fused from playbacks of downlinked and/or recorded measurement data through ground analysis versions of the Shuttle rendezvous filter and a GPS filter developed for another experiment. The fusion results agree with the best estimate of trajectory at approximately the levels of uncertainty expected from the fusion filter's covariance matrix.

Carpenter, J. Russell↗

Six degree of freedom simulation system for evaluating automated rendezvous and docking spacecraft

Future logistics supply and servicing vehicles such as cargo transfer vehicles (CTV) must have full 6 degree of freedom (6DOF) capability in order to perform requisite rendezvous, proximity operations, and capture operations. The design and performance issues encountered when developing a 6DOF maneuvering spacecraft are very complex with subtle interactions which are not immediately obvious or easily anticipated. In order to deal with these complexities and develop robust maneuvering spacecraft designs, a simulation system and associated family of tools are used at TRW for generating and validating spacecraft performance requirements and guidance algorithms. An overview of the simulator and tools is provided. These are used by TRW for autonomous rendezvous and docking research projects including CTV studies.

Rourke, Kenneth H.↗

CNES Approaching Guidance Experiment within FFIORD

This article outlines the relative orbit control (guidance algorithm and its preliminary performance tests evaluation) that will be tested by the CNES Team on FFIORD (Formation Flying In Orbit Ranging Demonstration) onboard PRISMA mission. After a brief summary of the PRISMA mission context, the paper provides a full description of the rendezvous function involved in the approaching guidance experiment. This FFIORD onboard function is detailed in terms of on-board algorithmic method (basic algorithm and enhanced alternative), sensibility analysis used to construct maneuver plans and preliminary tests results.

Berges, Jean-Claude↗

GTOC9: Methods and Results from the Jet Propulsion Laboratory Team

The removal of 123 pieces of debris from the Sunsynchronous LEO environment is accomplished by a 10-spacecraft campaign wherein the spacecraft, flying in succession over an 8-yr period, rendezvous with a series of the debris objects, delivering a de-orbit package at each one before moving on to the next object by means of impulsive manoeuvres. This was the GTOC9 problem, as posed by the European Space Agency. The methods used by the Jet Propulsion Laboratory team are described, along with the winning solution found by the team. Methods include branch-and-bound searches that exploit the natural nodal drift to compute long chains of rendezvous with debris objects, beam searches for synthesising campaigns, ant colony optimisation, and a genetic algorithm. Databases of transfers between all bodies on a fine time grid are made, containing an easyto- compute yet accurate estimate of the transfer V . Lastly, a final non-linear programming optimisation is performed to ensure the trajectories meet all the constraints and are locally optimal in initial mass.

Sims, Jon↗

Robust Trajectory Optimization and GN&C Performance Analysis for NRHO Rendezvous

This paper evaluates several candidate Near-Rectilinear Halo Orbits (NRHO) rendezvous trajectory designs using linear covariance (LinCov) analysis and determines the optimal locations for NRHO rendezvous translational maneuver locations. The performance of several candidate relative trajectory designs are determined as a function of relative navigation accuracy (angles only), inertial optical navigation (OpNav), range observability maneuvers, maneuver execution errors, relative maneuver targeting, and environment uncertainties. Further, the optimal locations of rendezvous maneuvers are determined for each of the candidate reference trajectories. The long-term goal of this research is to utilize LinCov and a genetic optimization algorithm (GA) to determine a complete end-to-end optimal NRHO trajectory design that is robust to navigation errors, maneuver execution errors, and environment uncertainties. This paper represents a first step toward this goal. Three candidate rendezvous trajectories with varying numbers of range-observability maneuvers are evaluated for their robustness to uncertainties, errors, and total trajectory correction delta-v performance. Some key elements of this analysis include relative navigation performance in an NRHO, relative trajectory dispersion performance, and total 3-sigma delta-v performance. This development provides the foundation to then determine an optimal and robust end-to-end NRHO rendezvous trajectory, including the determination of the optimal locations of range observability maneuvers, if needed.

Linear Covariance Analysis↗

Orbit Maintenance and Navigation of Human Spacecraft at Cislunar Near Rectilinear Halo Orbits

Multiple studies have concluded that Earth-Moon libration point orbits are attractive candidates for staging operations. The Near Rectilinear Halo Orbit (NRHO), a member of the Earth-Moon halo orbit family, has been singularly demonstrated to meet multi-mission architectural constraints. In this paper, the challenges associated with operating human spacecraft in the NRHO are evaluated. Navigation accuracies and human vehicle process noise effects are applied to various station keeping strategies in order to obtain a reliable orbit maintenance algorithm. Additionally, the ability to absorb missed burns, construct phasing maneuvers to avoid eclipses and conduct rendezvous and proximity operations are examined.

Davis, Diane↗

Constrained low-thrust guidance.

Constrained low thrust guidance algorithms for three axis and spin-stabilized, constant power, solar electric propelled spacecraft on fixed time rendezvous missions are developed. A 'bang-bang' type of minimum-propellant thrust program is used. Control constraints arise from the specification that the thrust vector must remain fixed relative to the solar panels. The guidance law is derived from deterministic linear perturbation theory and is controllable to first order on trajectories containing at least two thrust arcs. The number and timing of guidance updates and the effectiveness of the guidance law in compensating for state and control estimation biases and uncertainties are discussed. Numerical comparisons between the optimal control and the restricted control case are presented on a Encke comet rendezvous.

Ungs, M. J.↗

Compressed/reconstructed test images for CRAF/Cassini

A set of compressed, then reconstructed, test images submitted to the Comet Rendezvous Asteroid Flyby (CRAF)/Cassini project is presented as part of its evaluation of near lossless high compression algorithms for representing image data. A total of seven test image files were provided by the project. The seven test images were compressed, then reconstructed with high quality (root mean square error of approximately one or two gray levels on an 8 bit gray scale), using discrete cosine transforms or Hadamard transforms and efficient entropy coders. The resulting compression ratios varied from about 2:1 to about 10:1, depending on the activity or randomness in the source image. This was accomplished without any special effort to optimize the quantizer or to introduce special postprocessing to filter the reconstruction errors. A more complete set of measurements, showing the relative performance of the compression algorithms over a wide range of compression ratios and reconstruction errors, shows that additional compression is possible at a small sacrifice in fidelity.

Dolinar, S.↗