Engineering topics

Lohn, Jason

Publications and source records attributed to Lohn, Jason.

16 records

NASA NTRS2014

Preliminary Assessment of Optimal Longitudinal-Mode Control for Drag Reduction through Distributed Aeroelastic Shaping

The emergence of advanced lightweight materials is resulting in a new generation of lighter, flexible, more-efficient airframes that are enabling concepts for active aeroelastic wing-shape control to achieve greater flight efficiency and increased safety margins. These elastically shaped aircraft concepts require non-traditional methods for large-scale multi-objective flight control that simultaneously seek to gain aerodynamic efficiency in terms of drag reduction while performing traditional command-tracking tasks as part of a complete guidance and navigation solution. This paper presents results from a preliminary study of a notional multi-objective control law for an aeroelastic flexible-wing aircraft controlled through distributed continuous leading and trailing edge control surface actuators. This preliminary study develops and analyzes a multi-objective control law derived from optimal linear quadratic methods on a longitudinal vehicle dynamics model with coupled aeroelastic dynamics. The controller tracks commanded attack-angle while minimizing drag and controlling wing twist and bend. This paper presents an overview of the elastic aircraft concept, outlines the coupled vehicle model, presents the preliminary control law formulation and implementation, presents results from simulation, provides analysis, and concludes by identifying possible future areas for research

aeroelastic↗

NASA NTRS2007

JavaGenes Molecular Evolution

JavaGenes is a general-purpose, evolutionary software system written in Java. It implements several versions of a genetic algorithm, simulated annealing, stochastic hill climbing, and other search techniques. This software has been used to evolve molecules, atomic force field parameters, digital circuits, Earth Observing Satellite schedules, and antennas. This version differs from version 0.7.28 in that it includes the molecule evolution code and other improvements. Except for the antenna code, JaveGenes is available for NASA Open Source distribution.

Lohn, Jason↗

NASA NTRS2006

Evolutionary Design of a Phased Array Antenna Element

We present an evolved S-band phased array antenna element design that meets the requirements of NASA's TDRS-C communications satellite scheduled for launch early next decade. The original specification called for two types of elements, one for receive only and one for transmit/receive. We were able to evolve a single element design that meets both specifications thereby simplifying the antenna and reducing testing and integration costs. The highest performance antenna found using a genetic algorithm and stochastic hill-climbing has been fabricated and tested. Laboratory results are largely consistent with simulation. Researchers have been investigating evolutionary antenna design and optimization since the early 1990s, and the field has grown in recent years its computer speed has increased and electromagnetic simulators have improved. Many antenna types have been investigated, including wire antennas, antenna arrays and quadrifilar helical antennas. In particular, our laboratory evolved a wire antenna design for NASA's Space Technology 5 (ST5) spacecraft. This antenna has been fabricated, tested, and is scheduled for launch on the three spacecraft in 2006.

Globus, Al↗

NASA NTRS2004

Intelligent Systems: Shaping the Future of Aeronautics and Space Exploration

Intelligent systems are nature-inspired, mathematically sound, computationally intensive problem solving tools and methodologies that have become important for NASA's future roles in Aeronautics and Space Exploration. Intelligent systems will enable safe, cost and mission-effective approaches to air& control, system design, spacecraft autonomy, robotic space exploration and human exploration of Moon, Mars, and beyond. In this talk, we will discuss intelligent system technologies and expand on the role of intelligent systems in NASA's missions. We will also present several examples of which some are highlighted m this extended abstract.

Krishnakumar, Kalmanje↗

NASA NTRS2004

Best of Breed

No team of engineers, no matter how much time they took or how many bottles of cabernet they consumed, would dream up an antenna that looked like a deer antler on steroids. Yet that's what a group at NASA Ames Research Center came up with-thanks to a little help from Darwin. NASA's Space Technology 5 nanosatellites, which are scheduled to start measuring Earth's magnetosphere in late 2004, requires an antenna that can receive a wide range of frequencies regardless of the spacecraft's orientation. Rather than leave such exacting requirements in the hands of a human, the engineers decided to breed a design using genetic algorithms and 32 Linux PCs. The computers generated small antenna-constructing programs (the genotypes) and executed them to produce designs (the phenotypes). Then the designs were evaluated using an antenna simulator. The team settled on the form pictured here. You won't find this kind of antenna in any textbook, design guide, or research paper. But its innovative structure meets a challenging set of specifications. If successfully deployed, it will be the first evolved antenna to make it out of the lab and the first piece of evolved hardware ever to fly in space.

Lohn, Jason↗

NASA NTRS2004

A Comparison of Techniques for Scheduling Earth-Observing Satellites

Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks, conditions where evolutionary and related algorithms are often effective. However, there are many such algorithms and the best one to use is not clear. Here we compare multiple variants of the genetic algorithm: stochastic hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on ten realistically-sized EOS scheduling problems. Schedules are represented by a permutation (non-temperal ordering) of the observation requests. A simple deterministic scheduler assigns times and resources to each observation request in the order indicated by the permutation, discarding those that violate the constraints created by previously scheduled observations. Simulated annealing performs best. Random mutation outperform a more 'intelligent' mutator. Furthermore, the best mutator, by a small margin, was a novel approach we call temperature dependent random sampling that makes large changes in the early stages of evolution and smaller changes towards the end of search.

Globus, Al↗

NASA NTRS2004

Evolvable Hardware for Space Applications

This article surveys the research of the Evolvable Systems Group at NASA Ames Research Center. Over the past few years, our group has developed the ability to use evolutionary algorithms in a variety of NASA applications ranging from spacecraft antenna design, fault tolerance for programmable logic chips, atomic force field parameter fitting, analog circuit design, and earth observing satellite scheduling. In some of these applications, evolutionary algorithms match or improve on human performance.

Lohn, Jason↗

NASA NTRS2004

Evolvable Hardware for Space Applications

Lohn, Jason↗

NASA NTRS2004

Teleoperated Modular Robots for Lunar Operations

Solar system exploration is currently carried out by special purpose robots exquisitely designed for the anticipated tasks. However, all contingencies for in situ resource utilization (ISRU), human habitat preparation, and exploration will be difficult to anticipate. Furthermore, developing the necessary special purpose mechanisms for deployment and other capabilities is difficult and error prone. For example, the Galileo high gain antenna never opened, severely restricting the quantity of data returned by the spacecraft. Also, deployment hardware is used only once. To address these problems, we are developing teleoperated modular robots for lunar missions, including operations in transit from Earth. Teleoperation of lunar systems from Earth involves a three second speed-of-light delay, but experiment suggests that interactive operations are feasible.' Modular robots typically consist of many identical modules that pass power and data between them and can be reconfigured for different tasks providing great flexibility, inherent redundancy and graceful degradation as modules fail. Our design features a number of different hub, link, and joint modules to simplify the individual modules, lower structure cost, and provide specialized capabilities. Modular robots are well suited for space applications because of their extreme flexibility, inherent redundancy, high-density packing, and opportunities for mass production. Simple structural modules can be manufactured from lunar regolith in situ using molds or directed solar sintering. Software to direct and control modular robots is difficult to develop. We have used genetic algorithms to evolve both the morphology and control system for walking modular robots3 We are currently using evolvable system technology to evolve controllers for modular robots in the ISS glove box. Development of lunar modular robots will require software and physical simulators, including regolith simulation, to enable design and test of robot software and hardware, particularly automation software. Ready access to these simulators could provide opportunities for contest-driven development ala RoboCup (http://www.robocup.org/). Licensing of module designs could provide opportunities in the toy market and for spin-off applications.

Globus, Al↗

NASA NTRS2003

A Genetic Representation for Evolutionary Fault Recovery in Virtex FPGAs

Most evolutionary approaches to fault recovery in FPGAs focus on evolving alternative logic configurations as opposed to evolving the intra-cell routing. Since the majority of transistors in a typical FPGA are dedicated to interconnect, nearly 80% according to one estimate, evolutionary fault-recovery systems should benefit hy accommodating routing. In this paper, we propose an evolutionary fault-recovery system employing a genetic representation that takes into account both logic and routing configurations. Experiments were run using a software model of the Xilinx Virtex FPGA. We report that using four Virtex combinational logic blocks, we were able to evolve a 100% accurate quadrature decoder finite state machine in the presence of a stuck-at-zero fault.

Lohn, Jason↗

NASA NTRS2003

Scheduling Earth Observing Satellites with Evolutionary Algorithms

We hypothesize that evolutionary algorithms can effectively schedule coordinated fleets of Earth observing satellites. The constraints are complex and the bottlenecks are not well understood, a condition where evolutionary algorithms are often effective. This is, in part, because evolutionary algorithms require only that one can represent solutions, modify solutions, and evaluate solution fitness. To test the hypothesis we have developed a representative set of problems, produced optimization software (in Java) to solve them, and run experiments comparing techniques. This paper presents initial results of a comparison of several evolutionary and other optimization techniques; namely the genetic algorithm, simulated annealing, squeaky wheel optimization, and stochastic hill climbing. We also compare separate satellite vs. integrated scheduling of a two satellite constellation. While the results are not definitive, tests to date suggest that simulated annealing is the best search technique and integrated scheduling is superior.

Globus, Al↗

NASA NTRS2003

A Comparison of Techniques for Scheduling Fleets of Earth-Observing Satellites

Earth observing satellite (EOS) scheduling is a complex real-world domain representative of a broad class of over-subscription scheduling problems. Over-subscription problems are those where requests for a facility exceed its capacity. These problems arise in a wide variety of NASA and terrestrial domains and are .XI important class of scheduling problems because such facilities often represent large capital investments. We have run experiments comparing multiple variants of the genetic algorithm, hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on two variants of a realistically-sized model of the EOS scheduling problem. These are implemented as permutation-based methods; methods that search in the space of priority orderings of observation requests and evaluate each permutation by using it to drive a greedy scheduler. Simulated annealing performs best and random mutation operators outperform our squeaky (more intelligent) operator. Furthermore, taking smaller steps towards the end of the search improves performance.

Globus, Al↗

NASA NTRS2002

Molnets: An Artificial Chemistry Based on Neural Networks

The fundamental problem in the evolution of matter is to understand how structure-function relationships are formed and increase in complexity from the molecular level all the way to a genetic system. We have created a system where structure-function relationships arise naturally and without the need of ad hoc function assignments to given structures. The idea was inspired by neural networks, where the structure of the net embodies specific computational properties. In this system networks interact with other networks to create connections between the inputs of one net and the outputs of another. The newly created net then recomputes its own synaptic weights, based on anti-hebbian rules. As a result some connections may be cut, and multiple nets can emerge as products of a 'reaction'. The idea is to study emergent reaction behaviors, based on simple rules that constitute a pseudophysics of the system. These simple rules are parameterized to produce behaviors that emulate chemical reactions. We find that these simple rules show a gradual increase in the size and complexity of molecules. We have been building a virtual artificial chemistry laboratory for discovering interesting reactions and for testing further ideas on the evolution of primitive molecules. Some of these ideas include the potential effect of membranes and selective diffusion according to molecular size.

Colombano, Silvano↗

NASA NTRS2002

Scheduling Earth Observing Fleets Using Evolutionary Algorithms: Problem Description and Approach

We describe work in progress concerning multi-instrument, multi-satellite scheduling. Most, although not all, Earth observing instruments currently in orbit are unique. In the relatively near future, however, we expect to see fleets of Earth observing spacecraft, many carrying nearly identical instruments. This presents a substantially new scheduling challenge. Inspired by successful commercial applications of evolutionary algorithms in scheduling domains, this paper presents work in progress regarding the use of evolutionary algorithms to solve a set of Earth observing related model problems. Both the model problems and the software are described. Since the larger problems will require substantial computation and evolutionary algorithms are embarrassingly parallel, we discuss our parallelization techniques using dedicated and cycle-scavenged workstations.

Globus, Al↗

NASA NTRS2002

On Polymorphic Circuits and Their Design Using Evolutionary Algorithms

This paper introduces the concept of polymorphic electronics (polytronics) - referring to electronics with superimposed built-in functionality. A function change does not require switches/reconfiguration as in traditional approaches. Instead the change comes from modifications in the characteristics of devices involved in the circuit, in response to controls such as temperature, power supply voltage (VDD), control signals, light, etc. The paper illustrates polytronic circuits in which the control is done by temperature, morphing signals, and VDD respectively. Polytronic circuits are obtained by evolutionary design/evolvable hardware techniques. These techniques are ideal for the polytronics design, a new area that lacks design guidelines, know-how,- yet the requirements/objectives are easy to specify and test. The circuits are evolved/synthesized in two different modes. The first mode explores an unstructured space, in which transistors can be interconnected freely in any arrangement (in simulations only). The second mode uses a Field Programmable Transistor Array (FPTA) model, and the circuit topology is sought as a mapping onto a programmable architecture (these experiments are performed both in simulations and on FPTA chips). The experiments demonstrated the synthesis. of polytronic circuits by evolution. The capacity of storing/hiding "extra" functions provides for watermark/invisible functionality, thus polytronics may find uses in intelligence/security applications.

Stoica, Adrian↗

NASA NTRS1997

Genetic Algorithm Approaches to Prebiobiotic Chemistry Modeling

We model an artificial chemistry comprised of interacting polymers by specifying two initial conditions: a distribution of polymers and a fixed set of reversible catalytic reactions. A genetic algorithm is used to find a set of reactions that exhibit a desired dynamical behavior. Such a technique is useful because it allows an investigator to determine whether a specific pattern of dynamics can be produced, and if it can, the reaction network found can be then analyzed. We present our results in the context of studying simplified chemical dynamics in theorized protocells - hypothesized precursors of the first living organisms. Our results show that given a small sample of plausible protocell reaction dynamics, catalytic reaction sets can be found. We present cases where this is not possible and also analyze the evolved reaction sets.

Lohn, Jason↗