Search NASA⌕ Search

SEARCH · Search NASA

Results for “Trajectory Planning”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Trajectory Planning for Mission Survivability of Autonomous Vehicles in Moderately to Extremely Uncertain Environments

Trajectory planning is a particularly challenging task for autonomous vehicles when there are moderate to extreme uncertainties in their operating environment, i.e., where the trajectories of hazards are partially known to completely unknown. In this paper, we propose a receding horizon control strategy with novel trajectory planning policies that enable dynamic updating of the planned trajectories of autonomous vehicles. The proposed policies utilize two metrics: (1) the number of feasible trajectories; and (2) the robustness of the feasible trajectories. We measure the effectiveness of the suggested policies in terms of mission survivability, which is defined as the probability that the primary mission is accomplished or, if that is not possible, the vehicle lands safely at an alternative site. We show that a linear combination of both metrics is an effective objective function when there is a mix of partially known and unknown uncertainties. When the operating environment is dominated by unknown disturbances, maximizing the number of feasible trajectories results in the highest mission survivability. These findings have significant implications for achieving safe aviation autonomy.

aviation autonomy↗
NASA NTRSDate not supplied

Trajectory Planning for Mission Survivability of Autonomous Vehicles in Moderately to Extremely Uncertain Environments

Trajectory planning is a particularly challenging task for autonomous vehicles when the uncertainties in their operating environment cannot be characterized statistically. In this paper, we propose a receding horizon control strategy with novel trajectory planning policies that enable dynamic updating of the planned trajectories of autonomous vehicles operating in environments where potential conflicts are, from a statistical perspective, either partially known or completely unknown. The proposed policies utilize two metrics: (1) the number of feasible trajectories; and (2) the robustness of the feasible trajectories. We measure the effectiveness of the suggested policies in terms of mission survivability, which is defined as the probability that the primary mission is accomplished or, if that is not possible, the vehicle lands safely at an alternative site. We show that a linear combination of both metrics is an effective objective function when there is a mix of partially known and unknown uncertainties. When the operating environment is dominated by unknown disturbances, maximizing the number of feasible trajectories results in the highest mission survivability. These findings have significant implications for achieving safe aviation. autonomy.

Aviation autonomy↗
NASA NTRS1991

Experimental study of trajectory planning and control of a high precision robot manipulator

The kinematic and trajectory planning is presented for a 6 DOF end-effector whose design was based on the Stewart Platform mechanism. The end-effector was used as a testbed for studying robotic assembly of NASA hardware with passive compliance. Vector analysis was employed to derive a closed-form solution for the end-effector inverse kinematic transformation. A computationally efficient numerical solution was obtained for the end-effector forward kinematic transformation using Newton-Raphson method. Three trajectory planning schemes, two for fine motion and one for gross motion, were developed for the end-effector. Experiments conducted to evaluate the performance of the trajectory planning schemes showed excellent tracking quality with minimal errors. Current activities focus on implementing the developed trajectory planning schemes on mating and demating space-rated connectors and using the compliant platform to acquire forces/torques applied on the end-effector during the assembly task.

Nguyen, Charles C.↗
NASA NTRS1988

Helicopter trajectory planning using optimal control theory

A methodology for optimal trajectory planning, useful in the nap-of-the-earth guidance of helicopters, is presented. This approach uses an adjoint-control transformation along with a one-dimensional search scheme for generating the optimal trajectories. In addition to being useful for helicopter nap-of-the-earth guidance, the trajectory planning solution is of interest in several other contexts, such as robotic vehicle guidance and terrain-following guidance for cruise missiles and aircraft. A distinguishing feature of the present research is that the terrain constraint and the threat envelopes are incorporated in the equations of motion. Second-order necessary conditions are examined.

Menon, P. K. A.↗
NASA NTRS1990

Optimal helicopter trajectory planning for terrain following flight

Helicopters operating in high threat areas have to fly close to the earth surface to minimize the risk of being detected by the adversaries. Techniques are presented for low altitude helicopter trajectory planning. These methods are based on optimal control theory and appear to be implementable onboard in realtime. Second order necessary conditions are obtained to provide a criterion for finding the optimal trajectory when more than one extremal passes through a given point. A second trajectory planning method incorporating a quadratic performance index is also discussed. Trajectory planning problem is formulated as a differential game. The objective is to synthesize optimal trajectories in the presence of an actively maneuvering adversary. Numerical methods for obtaining solutions to these problems are outlined. As an alternative to numerical method, feedback linearizing transformations are combined with the linear quadratic game results to synthesize explicit nonlinear feedback strategies for helicopter pursuit-evasion. Some of the trajectories generated from this research are evaluated on a six-degree-of-freedom helicopter simulation incorporating an advanced autopilot. The optimal trajectory planning methods presented are also useful for autonomous land vehicle guidance.

Menon, P. K. A.↗
NASA NTRS1994

Hierarchical Control and Trajectory Planning

Most of the time on this project was spent on the trajectory planning problem. The construction is equivalent to the classical spline construction in the case that the system matrix is nilpotent. If the dimension of the system is n then the spline of degree 2n-1 is constructed. This gives a new approach to the construction of splines that is more efficient than the usual construction and at the same time allows the construction of a much larger class of splines. All known classes of splines are reconstructed using the approach of linear control theory. As a numerical analysis tool control theory gives a very good tool for constructing splines. However, for the purposes of trajectory planning it is quite another story. Enclosed in this document are four reports done under this grant.

Martin, Clyde F.↗
NASA NTRS1991

Exact and explicit optimal solutions for trajectory planning and control of single-link flexible-joint manipulators

An optimal trajectory planning problem for a single-link, flexible joint manipulator is studied. A global feedback-linearization is first applied to formulate the nonlinear inequality-constrained optimization problem in a suitable way. Then, an exact and explicit structural formula for the optimal solution of the problem is derived and the solution is shown to be unique. It turns out that the optimal trajectory planning and control can be done off-line, so that the proposed method is applicable to both theoretical analysis and real time tele-robotics control engineering.

Chen, Guanrong↗
NASA NTRS1990

Trajectory planning and control of a 6 DOF manipulator with Stewart platform-based mechanism

The trajectory planning and control was studied of a robot manipulator that has 6 degrees of freedom and was designed based on the mechanism of the Stewart Platform. First the main components of the manipulator is described along with its operation. The solutions are briefly prescribed for the forward and inverse kinematics of the manipulator. After that, two trajectory planning schemes are developed using the manipulator inverse kinematics to track straight lines and circular paths. Finally experiments conducted to study the performance of the developed planning schemes in tracking a straight line and a circle are presented and discussed.

Nguyen, Charles C.↗
NASA NTRS1987

Collision-free trajectory planning algorthm for manipulators

Collision-free trajectory planning for robotic manipulators is investigated. The task of the manipulator is to move its end-effector from one point to another point in an environment with polyhedral obstacles. An on-line algorithm is developed based on finding the required joint angles of the manipulator, according to goals with different priorities. The highest priority is to avoid collisions, the second priority is to plan the shortest path for the end effector, and the lowest priority is to minimize the joint velocity for smooth motion. The pseudo-inverse of the Jacobian matrix is applied for inverse kinematics. When a possible collision is detected, a constrained inverse kinematic problem is solved such that the collision is avoided. This algorithm can also be applied to a time-variant environment.

Pourboghrat, F.↗
NASA NTRS2003

On-Board Entry Trajectory Planning Expanded to Sub-orbital Flight

A methodology for on-board planning of sub-orbital entry trajectories is developed. The algorithm is able to generate in a time frame consistent with on-board environment a three-degree-of-freedom (3DOF) feasible entry trajectory, given the boundary conditions and vehicle modeling. This trajectory is then tracked by feedback guidance laws which issue guidance commands. The current trajectory planning algorithm complements the recently developed method for on-board 3DOF entry trajectory generation for orbital missions, and provides full-envelope autonomous adaptive entry guidance capability. The algorithm is validated and verified by extensive high fidelity simulations using a sub-orbital reusable launch vehicle model and difficult mission scenarios including failures and aborts.

Lu, Ping↗
NASA NTRS2008

Trajectory Planning by Preserving Flexibility: Metrics and Analysis

In order to support traffic management functions, such as mitigating traffic complexity, ground and airborne systems may benefit from preserving or optimizing trajectory flexibility. To help support this hypothesis trajectory flexibility metrics have been defined in previous work to represent the trajectory robustness and adaptability to the risk of violating safety and traffic management constraints. In this paper these metrics are instantiated in the case of planning a trajectory with the heading degree of freedom. A metric estimation method is presented based on simplifying assumptions, namely discrete time and heading maneuvers. A case is analyzed to demonstrate the estimation method and its use in trajectory planning in a situation involving meeting a time constraint and avoiding loss of separation with nearby traffic. The case involves comparing path-stretch trajectories, in terms of adaptability and robustness along each, deduced from a map of estimated flexibility metrics over the solution space. The case demonstrated anecdotally that preserving flexibility may result in enhancing certain factors that contribute to traffic complexity, namely reducing proximity and confrontation.

Idris, Husni R.↗
NASA NTRSDate not supplied

Markov Decision Process based Trajectory Planning for UAVs under Uncertain Wind Conditions

In this paper we propose a Markov Decision Process (MDP) algorithm for path-planning of Unmanned Aviation Vehicles (UAVs) under varying wind conditions. Solutions to path-planning for UAVs are becoming increasingly necessary as autonomous UAVs continue to enter commercial and government spaces. Path-planning is inherently challenging, as UAVs needs to account for dynamically changing flying conditions such as weather, obstacle or no-fly zones, degraded vehicle health and off-nominal battery power consumption. Machine learning methods such as Markov Decision Process (MDPs) have the potential to revolutionize how vehicles navigate in such uncertain environments. Previous papers have demonstrated the use of MDPs to optimize UAV path-planning for energy consumption under time-varying wind distribution. In this study, UAV trajectories from a pre-determined waypoint to target cell, will be computed on a 7X7 grid environment by optimizing parameters for mission assurance and safety limits in addition to the energy consumption, and operation time. The UAV navigates the grid by taking actions to move in either of the eight cardinal and intercardinal directions, under constant thrust profile. The next state of the UAV is calculated by considering its action, transition probability, obstacle cells and the wind speed magnitude and direction. Both constant and stochastic wind will be considered in this paper, the parameters being extracted from real wind measurements in proximity to an experimental UAV flight. One of the studies to be demonstrated in this paper is that as the unmanned airspace gets more complex with multiple vehicles and environmental uncertainties, trade-offs between energy consumption, operation time, risk tolerance, and mission assurance needs to be made. Further, MDPs are capable of fast computation of UAV trajectories under varying wind, hence making them suitable for in-flight path planners.

decision-making↗
NASA NTRS1991

Use of automated rendezvous trajectory planning to improve spacecraft operations efficiency

The current planning process for space shuttle rendezvous with a second Earth-orbiting vehicle is time consuming and costly. It is a labor-intensive, manual process performed pre-mission with the aid of specialized maneuver processing tools. Real-time execution of a rendezvous plan must closely follow a predicted trajectory, and targeted solutions leading up to the terminal phase are computed on the ground. Despite over 25 years of Gemini, Apollo, Skylab, and shuttle vehicle-to-vehicle rendezvous missions flown to date, rendezvous in Earth orbit still requires careful monitoring and cannot be taken for granted. For example, a significant trajectory offset was experienced during terminal phase rendezvous of the STS-32 Long Duration Exposure Facility retrieval mission. Several improvements can be introduced to the present rendezvous planning process to reduce costs, produce more fuel-efficient profiles, and increase the probability of mission success.

Mulder, Tom A.↗
NASA NTRSDate not supplied

Onboard Autonomous Trajectory Planning for Mars Power Descent

In recent years, there has been an increasing interest in space-qualified processors such as multi-core central processing units and graphics processing units that can withstand the adverse effects of space radiation. These processors can allow parallel programming to perform tasks that typically demand high computational power. One can study guidance schemes that can take advantage of these currently developing processors and provide more robust guidance. Software for Multi-model Autonomous Real-time Trajectories (SMART) guidance can identify robust trajectories by running an onboard Monte Carlo analysis. SMART guidance can take advantage of knowledge updates obtained from the onboard sensors, allowing it to consider the off-nominal cases that it would not typically encounter during the offline trajectory analysis. This work uses the SMART guidance for the powered divert at Mars simulation in Program to Optimize and Simulated Trajectories- II.

Autonomous Planning↗
NASA NTRS1991

Minimum jerk trajectory planning for robotic manipulators

It has been experimentally verified that the jerk of the desired trajectory adversely affects the performance of the tracking control algorithms for robotic manipulators. In this paper, the reasons behind this effect are investigated, and an optimization problem that minimizes joint jerk over a prespecified Cartesian space trajectory is stated. The necessary conditions are derived, and a numerical algorithm is presented.

Kyriakopoulos, K. J.↗
NASA NTRS1991

A trajectory planning scheme for spacecraft in the space station environment

Simulated annealing is used to solve a minimum fuel trajectory problem in the space station environment. The environment is special because the space station will define a multivehicle environment in space. The optimization surface is a complex nonlinear function of the initial conditions of the chase and target crafts. Small permutations in the input conditions can result in abrupt changes to the optimization surface. Since no prior knowledge about the number or location of local minima on the surface is available, the optimization must be capable of functioning on a multimodal surface. It was reported in the literature that the simulated annealing algorithm is more effective on such surfaces than descent techniques using random starting points. The simulated annealing optimization was found to be capable of identifying a minimum fuel, two-burn trajectory subject to four constraints which are integrated into the optimization using a barrier method. The computations required to solve the optimization are fast enough that missions could be planned on board the space station. Potential applications for on board planning of missions are numerous. Future research topics may include optimal planning of multi-waypoint maneuvers using a knowledge base to guide the optimization, and a study aimed at developing robust annealing schedules for potential on board missions.

Soller, Jeffrey Alan↗
NASA NTRS1996

Time Optimal Trajectory Planning in Dynamic Environments

A method is presented for planning the motion of a robot in a dynamic environment by computing a trajectory that avoids all obstacles and that satisfies the robot dynamics and its actuator constraints. This method consists of two steps -- the computation of the trajectory and its refinement with a dynamic optimization.

Robotics Velocity Obstacle↗