Search NASA⌕ Search

SEARCH · Search NASA

Results for “planning optimization”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Calibration of neural networks using genetic algorithms, with application to optimal path planning

Genetic algorithms (GA) are used to search the synaptic weight space of artificial neural systems (ANS) for weight vectors that optimize some network performance function. GAs do not suffer from some of the architectural constraints involved with other techniques and it is straightforward to incorporate terms into the performance function concerning the metastructure of the ANS. Hence GAs offer a remarkably general approach to calibrating ANS. GAs are applied to the problem of calibrating an ANS that finds optimal paths over a given surface. This problem involves training an ANS on a relatively small set of paths and then examining whether the calibrated ANS is able to find good paths between arbitrary start and end points on the surface.

Smith, Terence R.↗
NASA NTRS2020

Planning and Optimization for Multi-robot Planetary Cave Exploration under Intermittent Connectivity Constraints

Exploring subsurface structures with autonomous robots is of growing interest in the context of planetary caves studies. Communication between robots in these environments is severely degraded which complicates coordination and information distribution. In this paper we focus on planning for mobility and communication in a cave exploration scenario where the situational awareness of a static base station is critical. We propose a notion of information-consistency where a plan itself is part of the information to be shared between robots, and propose a method for generating information-consistent plans. We discuss in detail how the resulting plan can be robustly implemented with minimal communication through local mission executives that run on individual robots. We describe preliminary results on the performance of the planning algorithm and integration of the local mission executives in a high-fidelity simulation environment.

Murray, Richard M.↗
NASA NTRS2003

Optimal Limited Contingency Planning

For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications where it is desirable to strictly limit the number of decision points and branches in a plan. This raises the question of how one goes about finding optimal plans containing only a limited number of branches. In this paper, we present an any-time algorithm for optimal k-contingency planning. It is the first optimal algorithm for limited contingency planning that is not an explicit enumeration of possible contingent plans. By modelling the problem as a partially observable Markov decision process, it implements the Bellman optimality principle and prunes the solution space. We present experimental results of applying this algorithm to some simple test cases.

Meuleau, Nicolas↗
NASA NTRSDate not supplied

Energy-Optimized Path Planning for Uas in Varying Winds Via Reinforcement Learning

In this paper we propose a reinforcement learning (RL) algorithm for path planning of Unmanned Aviation Vehicles (UAVs) under varying wind conditions. Solutions to UAV path planning problems are becoming increasingly necessary as autonomous UAVs continue to enter commercial and government spaces. Path-planning is inherently challenging, as UAVs need 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 reinforcement learning (RL) have the potential to revolutionize how vehicles navigate in such uncertain environments. In this study, we compute UAV trajectories from a pre-determined starting position to a target cell within 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 any of the eight cardinal and inter-cardinal directions, under constant thrust profile. The resultant UAV state is sampled from a probability distribution which accounts for the UAV’s action, local wind velocity, and the presence of obstacles or boundaries. As the unmanned airspace gets more complex due to multiple vehicles and environmental uncertainties, trade-offs between energy consumption, operation time, risk tolerance, and mission assurance need to be made. Our Markov Decision Process (MDP) environment model can capture any combination of these in the optimization objective, making it novel compared to other work in the field.

trajectory planning↗
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↗
NASA NTRS2014

Multiagent Flight Control in Dynamic Environments with Cooperative Coevolutionary Algorithms

Dynamic flight environments in which objectives and environmental features change with respect to time pose a difficult problem with regards to planning optimal flight paths. Path planning methods are typically computationally expensive, and are often difficult to implement in real time if system objectives are changed. This computational problem is compounded when multiple agents are present in the system, as the state and action space grows exponentially. In this work, we use cooperative coevolutionary algorithms in order to develop policies which control agent motion in a dynamic multiagent unmanned aerial system environment such that goals and perceptions change, while ensuring safety constraints are not violated. Rather than replanning new paths when the environment changes, we develop a policy which can map the new environmental features to a trajectory for the agent while ensuring safe and reliable operation, while providing 92% of the theoretically optimal performance

Experimentation↗
NASA NTRSDate not supplied

Analysis and Optimization of Test Plans for Advanced Exploration Systems Reliability and Supportability

Future crewed exploration missions beyond Low Earth Orbit (LEO) will operate farther from Earth and be logistically isolated for longer than any previous human spaceflight mission. Under these conditions, supportability and reliability willbestronger drivers of mission mass and risk than they have been in the past. Items with high failure rates, or uncertain failure rates, can result in high spares mass requirements and/or high risk on deep space missions. Testing is a critical element of system development which provides the opportunity to identify and resolve design issues, defects, or other failure modes before they cause problems during a mission. Reliability growth programs can reduce failure rates by identifying and remove failure modes via design changes, and long-duration life testing can provide valuable data to reduce failure rate estimate uncertainty and verify (to some level of confidence) that components are as reliable as expected. Testing activities take time and resources, however, and must be incorporated into program plans in order to be fully effective. This paper presents an integrated reliability test plan analysis and optimization methodology, which has been used to inform Advanced Exploration Systems (AES) Life Support Systems (LSS) ground test planning for future missions. The methodology determines the optimal number of test units to purchase and allocation of test time –split between reliability growth and uncertainty reduction testing –across a given set of items in order to minimize spares mass for a given mission under constraints on total test cost and schedule. Model outputs also include expected spares mass after testing and the expected number of modifications or refurbishments during testing, both of which can inform program planning. Discussion of the model, conclusions, and future work are also presented.

Testing↗
NASA NTRSDate not supplied

Analysis and Optimization of Test Plans for Advanced Exploration Systems Reliability and Supportability

Future crewed exploration missions beyond Low Earth Orbit (LEO) will operate farther from Earth and be logistically isolated for longer than any previous human spaceflight mission. Under these conditions, supportability and reliability willbestronger drivers of mission mass and risk than they have been in the past. Items with high failure rates, or uncertain failure rates, can result in high spares mass requirements and/or high risk on deep space missions. Testing is a critical element of system development which provides the opportunity to identify and resolve design issues, defects, or other failure modes before they cause problems during a mission. Reliability growth programs can reduce failure rates by identifying and remove failure modes via design changes, and long-duration life testing can provide valuable data to reduce failure rate estimate uncertainty and verify (to some level of confidence) that components are as reliable as expected. Testing activities take time and resources, however, and must be incorporated into program plans in order to be fully effective. This paper presents an integrated reliability test plan analysis and optimization methodology, which has been used to inform Advanced Exploration Systems (AES) Life Support Systems (LSS) ground test planning for future missions. The methodology determines the optimal number of test units to purchase and allocation of test time –split between reliability growth and uncertainty reduction testing –across a given set of items in order to minimize spares mass for a given mission under constraints on total test cost and schedule. Model outputs also include expected spares mass after testing and the expected number of modifications or refurbishments during testing, both of which can inform program planning. Discussion of the model, conclusions, and future work are also presented.

Testing↗
NASA NTRSDate not supplied

OceanWATERS Lander Robotic Arm Operation

Ocean Worlds Autonomy Testbed for Exploration Research and Simulation (OceanWATERS) is an open-source simulator for developing onboard autonomy software for robotic exploration of ocean worlds, such as Europa, Enceladus, and Titan, built on the Robot Operating System (ROS) and Gazebo simulation environment. Inevitable ground communication delays increase demand for a high degree of autonomy during excavation, collection and transfer of samples to scientific instruments for in-situ analysis. This paper offers a detailed discussion of the robotic arm design and operation for such autonomous surface exploration, taking as reference the Europa Lander mission. The lander arm, which is designed primarily to acquire icy surface and subsurface samples within the arm’s workspace, is a 6-degree-of-freedom manipulator with two end effectors: a sample excavation tool and a trenching end-effector. The robotic arm’s modes and operations can be summarized as follows: stowed arm, intended as the lander arm default configuration characterized by zero-power consumption; un-stowed arm, target arm configuration after its first deployment; selection and deployment of the end-effector to use next; guarded move, to detect ground level at the desired trenching location; drill ice using the grinder; dig trench at a particular location using the scoop; deliver sample to the sample transfer dock; discard redundant samples. The motion planning tool used for the lander arm is MoveIt, a ROS package. MoveIt uses sampling-based planning and collision checking libraries to determine safe paths. The Rapidly Exploring Random Trees* (RRT*) has been chosen as default planning algorithm as it provides optimal plans with an exponential speed and is guaranteed to find a solution, if feasible solutions exist. Furthermore, this work quantifies and discusses the energy requirements for excavating and collecting samples. In OceanWATERS, force feedback from the terrain, which influences the arm dynamics, is modelled using a discrete element method (DEM) simulation. The DEM and Gazebo software run in parallel and communicate through a co-simulation plugin. This paper presents an analysis and comparison of three DEM open source software (YADE, ESyS-Particle, Project Chrono) for implementation in OceanWATERS and motivates the choice of YADE as most suitable candidate.

Damiana Catanoso↗
NASA NTRS2014

Multiagent Flight Control in Dynamic Environments with Cooperative Coevolutionary Algorithms

Dynamic environments in which objectives and environmental features change with respect to time pose a difficult problem with regards to planning optimal paths through these environments. Path planning methods are typically computationally expensive, and are often difficult to implement in real time if system objectives are changed. This computational problem is compounded when multiple agents are present in the system, as the state and action space grows exponentially with the number of agents in the system. In this work, we use cooperative coevolutionary algorithms in order to develop policies which control agent motion in a dynamic multiagent unmanned aerial system environment such that goals and perceptions change, while ensuring safety constraints are not violated. Rather than replanning new paths when the environment changes, we develop a policy which can map the new environmental features to a trajectory for the agent while ensuring safe and reliable operation, while providing 92% of the theoretically optimal performance.

Coevolution↗
NASA NTRS1977

Space shuttle life sciences requirements development and documentation

Planning requirements identified in this study cover a range of functions including management plans, payload planning, optimization and analysis, flight and mission planning, and mission reporting, as well as all the design, integration and test functions that are hardware oriented. Some of the above functions would be done only once for the entire program, others would be done once for each payload, and others are applicable to each of the many experiments or end items in each payload.

Vannordstrand, P. C.↗
NASA NTRS2005

Planning with Continuous Resources in Stochastic Domains

We consider the problem of optimal planning in stochastic domains with metric resource constraints. Our goal is to generate a policy whose expected sum of rewards is maximized for a given initial state. We consider a general formulation motivated by our application domain--planetary exploration--in which the choice of an action at each step may depend on the current resource levels. We adapt the forward search algorithm AO* to handle our continuous state space efficiently.

Mausam, Mausau↗
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 NTRS2013

Alternative to Nitric Acid for Passivation of Stainless Steel Alloys

Corrosion is an extensive problem that affects the Department of Defense (DoD) and National Aeronautics and Space Administration (NASA). The deleterious effects of corrosion result in steep costs, asset downtime affecting mission readiness, and safety risks to personnel. Consequently, it is vital to reduce corrosion costs and risks in a sustainable manner. The DoD and NASA have numerous structures and equipment that are fabricated from stainless steel. The standard practice for protection of stainless steel is a process called passivation. Typical passivation procedures call for the use of nitric acid; however, there are a number of environmental, worker safety, and operational issues associated with its use. Citric acid offers a variety of benefits including increased safety for personnel, reduced environmental impact, and reduced operational cost. DoD and NASA agreed to collaborate to validate citric acid as an acceptable passivating agent for stainless steel. This paper details our investigation of prior work developing the citric acid passivation process, development of the test plan, optimization of the process for specific stainless steel alloys, ongoing and planned testing to elucidate the process' resistance to corrosion in comparison to nitric acid, and preliminary results.

Lewis, Pattie L.↗
NASA NTRS1977

Shuttle payload vibroacoustic test plan evaluation. Free flyer payload applications and sortie payload parametric variations

A preliminary assessment of vibroacoustic test plan optimization for free flyer STS payloads is presented and the effects on alternate test plans for Spacelab sortie payloads number of missions are also examined. The component vibration failure probability and the number of components in the housekeeping subassemblies are provided. Decision models are used to evaluate the cost effectiveness of seven alternate test plans using protoflight hardware.

Stahle, C. V.↗
NASA NTRS1999

Real Time Optima Tracking Using Harvesting Models of the Genetic Algorithm

Tracking optima in real time propulsion control, particularly for non-stationary optimization problems is a challenging task. Several approaches have been put forward for such a study including the numerical method called the genetic algorithm. In brief, this approach is built upon Darwinian-style competition between numerical alternatives displayed in the form of binary strings, or by analogy to 'pseudogenes'. Breeding of improved solution is an often cited parallel to natural selection in.evolutionary or soft computing. In this report we present our results of applying a novel model of a genetic algorithm for tracking optima in propulsion engineering and in real time control. We specialize the algorithm to mission profiling and planning optimizations, both to select reduced propulsion needs through trajectory planning and to explore time or fuel conservation strategies.

Baskaran, Subbiah↗
NASA NTRS2013

Mixed Integer Programming and Heuristic Scheduling for Space Communication

Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

Lee, Charles H.↗