Search NASA⌕ Search

SEARCH · Search NASA

Results for “Autonomic Computing”

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 217 records · Page 12

A Strategic Approach for Dense, Integrated, Vehicle Navigation

Drone usage has been on the rise in recent years with applications that include parcel delivery, wildlife protection, precision farming, law enforcement, and industrial inspection, just to name a few. This paper addresses drone separation in time and distance for high volume corridors (en route) and lanes (on ground), merging as well as crossing intersections of multiple corridors/lanes. There exists a gamut of approaches to solving merging and intersection crossing problems. At one end of the extreme are the conservative yet low cost and verifiable solutions of today that deal with two drones at a time. At the other end are complex Machine Learning-based solutions with high computing requirements for fully autonomous drones of the future that are expected to handle all contentions. This paper presents a feasible and verifiable strategic approach to solving these problems that is based on distributed cooperation between the UAVs/UASs and the infrastructure. Unlike existing centralized and pre-planned approaches, the proposed solution is fully distributed and enables autonomous aircraft to decide to adjust their speed and distance with respect to the preceding aircraft, dynamically. Three phases of the strategic approach (Prepare, Adjust, Commit) are presented. Simulation results are presented that show the proposed approach is stable and resilient to induced perturbations and guarantees a set of fixed-wing UAVs/UASs to merge and cross intersections by adjusting their speed based on their distance to the aircraft in front of them.

Distributed↗

NASA Small Spacecraft Technology (SST) Program - Recent and Upcoming Technology Demonstrations and Development Efforts

The Small Spacecraft Technology (SST) program within NASA’s Space Technology Mission Directorate, expands the ability to execute unique missions through rapid development and demonstration of capabilities for small spacecraft applicable to exploration, science and the commercial space sector. Through targeted development and frequent in space testing, the program: • Enables execution of missions at much lower cost than previously possible • Substantially reduces the time required for development of spacecraft • Enables new mission architectures through the use of small spacecraft • Expands the reach of small spacecraft to new destinations and challenging new environments • Enables the augmentation of existing assets and future missions with supporting small spacecraft. The program achieves its objectives through: • Identification and investment in the development of new subsystem technologies to enhance or expand the capabilities of small spacecraft • Sponsorship of flight demonstrations of new technologies, capabilities and applications for small spacecraft • Promotion of the use of small spacecraft as platforms for testing and demonstrating technologies and capabilities that might have more general applications in larger-scale spacecraft and systems Technologies funded by the program that are key to advancing the utility and capability of small spacecraft were demonstrated in 2022 and 2023. Notable on-orbit demonstrations include the following. • The Cislunar Autonomous Positioning System Technology Operations and Navigation Experiment’s (CAPSTONE) navigation technology that was demonstrated for the first time in 2023 could provide autonomous onboard navigation information for future lunar missions, minimizing or eliminating human-in-the-loop mission operations. • The optical communications technology also demonstrated in 2023 by the TeraByte InfraRed Delivery (TBIRD) payload that launched on Pathfinder Technology Demonstrator-3, achieved 200 gigabit per second (Gbps) throughput on a space-to-ground optical link between a satellite in orbit and Earth, the highest data rate ever achieved by optical communications technology. • The precision laser pointing performance of NASA’s CubeSat Infrared CrossLink A (CLICK) spacecraft’s fine steering mirror control system was successfully demonstrated. This element of the laser communications system will be used to demonstrate two-way crosslink communication in low-Earth orbit by CLICK B/C anticipated to launch in late 2024. Investments in subsystem technology development through funding to university, industry, and other government partners in a number of areas will be discussed. Among others, topic areas include propulsion, autonomous swarm technology, edge computing, and thermal control. Additionally, the status of the CubeSat-alternative platform, DiskSat, strategies for accelerating the demonstration of technology payloads via the Realizing Rapid, Reduced-cost high-Risk Research (R5) project, and the status of recently completed and upcoming on-orbit demonstrations will also be presented.

Roger C Hunter↗

Abnormally Malicious Autonomous Systems and their Internet Connectivity

While many attacks are distributed across botnets, investigators and network operators have recently targeted malicious networks through high profile autonomous system (AS) de-peerings and network shut-downs. In this paper, we explore whether some ASes indeed are safe havens for malicious activity. We look for ISPs and ASes that exhibit disproportionately high malicious behavior using ten popular blacklists, plus local spam data, and extensive DNS resolutions based on the contents of the blacklists. We find that some ASes have over 80% of their routable IP address space blacklisted. Yet others account for large fractions of blacklisted IP addresses. Several ASes regularly peer with ASes associated with significant malicious activity. We also find that malicious ASes as a whole differ from benign ones in other properties not obviously related to their malicious activities, such as more frequent connectivity changes with their BGP peers. Overall, we conclude that examining malicious activity at AS granularity can unearth networks with lax security or those that harbor cybercrime.

99 GENERAL AND MISCELLANEOUS↗

System and method for passive assay of holdup deposits in nuclear piping

Disclosed herein are a method, apparatus, and software for passive, non-destructive assay of holdup deposits in nuclear piping by in-pipe apparatus. A detector deployed within a pipe is collimated to observe radiation impinging radially inward from decay of deposits that lie on the pipe wall. A radiation detector is centered in the pipe and collimated by a pair of coaxial shielding discs disposed equidistant from the detector. This arrangement causes radiation from a truncated cylinder of pipe deposit within a field of regard to impinge on the detector, while precluding radiation emanating from pipe walls beyond the field of regard from reaching the detector. Hence, observations are unique to a known cylindrical length of pipe. The detector assembly is translated through pipes by an autonomous mobile robotic apparatus. Computer software controls the robotic apparatus, logs data, and post-processes to assay deposits.

Whittaker, William Lawrence↗

GAHLS: an optimized graph analytics based high level synthesis framework

The urgent need for low latency, high-compute and low power on-board intelligence in autonomous systems, cyber-physical systems, robotics, edge computing, evolvable computing, and complex data science calls for determining the optimal amount and type of specialized hardware together with reconfigurability capabilities. With these goals in mind, we propose a novel comprehensive graph analytics based high level synthesis (GAHLS) framework that efficiently analyzes complex high level programs through a combined compiler-based approach and graph theoretic optimization and synthesizes them into message passing domain-specific accelerators. This GAHLS framework first constructs a compiler-assisted dependency graph (CaDG) from low level virtual machine (LLVM) intermediate representation (IR) of high level programs and converts it into a hardware friendly description representation. Next, the GAHLS framework performs a memory design space exploration while account for the identified computational properties from the CaDG and optimizing the system performance for higher bandwidth. The GAHLS framework also performs a robust optimization to identify the CaDG subgraphs with similar computational structures and aggregate them into intelligent processing clusters in order to optimize the usage of underlying hardware resources. Finally, the GAHLS framework synthesizes this compressed specialized CaDG into processing elements while optimizing the system performance and area metrics. Evaluations of the GAHLS framework on several real-life applications (e.g., deep learning, brain machine interfaces) demonstrate that it provides 14.27× performance improvements compared to state-of-the-art approaches such as LegUp 6.2.

97 MATHEMATICS AND COMPUTING↗

A real time data acquisition system using the MIL-STD-1553B bus

A flight digital data acquisition system that uses the MIL-STD-1553B bus for transmission of data to a host computer for control law processing is described. The instrument, the Remote Interface Unit (RIU), can accommodate up to 16 input channels and eight output channels. The RIU employs a digital signal processor to perform local digital filtering before sending data to the host. The system allows flexible sensor and actuator data organization to facilitate quick control law computations on the host computer. The instrument can also run simple control laws autonomously without host intervention. The RIU and host computer together have replaced a similar larger, ground minicomputer system with favorable results.

Peri, Frank, Jr.↗

Autonomous Rule Creation for Intrusion Detection

Many computational intelligence techniques for anomaly based network intrusion detection can be found in literature. Translating a newly discovered intrusion recognition criteria into a distributable rule can be a human intensive effort. This paper explores a multi-modal genetic algorithm solution for autonomous rule creation. This algorithm focuses on the process of creating rules once an intrusion has been identified, rather than the evolution of rules to provide a solution for intrusion detection. The algorithm was demonstrated on anomalous ICMP network packets (input) and Snort rules (output of the algorithm). Output rules were sorted according to a fitness value and any duplicates were removed. The experimental results on ten test cases demonstrated a 100 percent rule alert rate. Out of 33,804 test packets 3 produced false positives. Each test case produced a minimum of three rule variations that could be used as candidates for a production system.

97 MATHEMATICS AND COMPUTING↗

Autonomous Electrochemistry Platform with Real-Time Normality Testing of Voltammetry Measurements Using ML

Electrochemistry workflows utilize various instruments and computing systems to execute workflows consisting of electrocatalyst synthesis, testing and evaluation tasks. The heterogeneity of the software and hardware of these ecosystems makes it challenging to orchestrate a complete workflow from production to characterization by automating its tasks. We propose an autonomous electrochemistry computing platform for a multi-site ecosystem that provides the services for remote experiment steering, real-time measurement transfer, and AI/ML-driven analytics. We describe the integration of a mobile robot and synthesis workstation into the ecosystem by developing custom hub-networks and software modules to support remote operations over the ecosystem’s wireless and wired networks. We describe a workflow task for generating I-V voltammetry measurements using a potentiostat, and a machine learning framework to ensure their normality by detecting abnormal conditions such as disconnected electrodes. We study a number of machine learning methods for the underlying detection problem, including smooth, non-smooth, structural and statistical methods, and their fusers. We present experimental results to illustrate the effectiveness of this platform, and also validate the proposed ML method by deriving its rigorous generalization equations.

Alnajjar, Anees↗

Autonomous landmark tracking orbit determination strategy

In this paper, an orbit determination strategy is described that is fully autonomous and relies on a computer-based crater detection and identification algorithm that is suitable for both automation of the ground based navigation system and autonomous spacecraft based navigation.

landmark tracking orbit determination↗

HCPerf: Driving Performance-Directed Hierarchical Coordination for Autonomous Vehicles

The rapid development of autonomous driving poses new research challenges to the on-vehicle computing system. In particular, the execution time of autonomous driving tasks highly depends on the specific driving environment. For instance, the execution time of configurable sensor fusion increases significantly as the scene becomes complex, which leads to end-to-end deadline misses from sensing to control and may cause accidents. Thus, a framework that can effectively utilize the system resources to guarantee the end-to-end deadlines of autonomous driving tasks as well as effectively prioritize the responsiveness and throughput of the control commands is crucial for autonomous driving. In this paper, we propose HCPerf, a performance-directed hierarchical coordination framework that intelligently coordinates the autonomous driving tasks with high execution time variation and complex dependencies according to the driving performance in real-time. Specifically, HCPerf mainly consists of two coordinators. The internal coordinator intelligently schedules the tasks according to the driving performance of the vehicle in order to help them meet the end-to-end deadlines while well prioritizing the responsiveness and throughput of the control commands. At the same time, the external coordinator dynamically tunes the rates of tasks according to the schedulability in order to efficiently utilize the system resource. We conduct extensive experiments on both simulation and hardware testbeds with the representative autonomous driving application. The results show that HCPerf can effectively improve the driving performance by 7.69%-45.94% in different driving scenarios.

Ma, Jialiang↗

Merged Vision and GPS Control of a Semi-Autonomous, Small Helicopter

This final report documents the activities performed during the research period from April 1, 1996 to September 30, 1997. It contains three papers: Carrier Phase GPS and Computer Vision for Control of an Autonomous Helicopter; A Contestant in the 1997 International Aerospace Robotics Laboratory Stanford University; and Combined CDGPS and Vision-Based Control of a Small Autonomous Helicopter.

Rock, Stephen M.↗

Toward Agent Programs with Circuit Semantics

New ideas are presented for computing and organizing actions for autonomous agents in dynamic environments-environments in which the agent's current situation cannot always be accurately discerned and in which the effects of actions cannot always be reliably predicted. The notion of 'circuit semantics' for programs based on 'teleo-reactive trees' is introduced. Program execution builds a combinational circuit which receives sensory inputs and controls actions. These formalisms embody a high degree of inherent conditionality and thus yield programs that are suitably reactive to their environments. At the same time, the actions computed by the programs are guided by the overall goals of the agent. The paper also speculates about how programs using these ideas could be automatically generated by artificial intelligence planning systems and adapted by learning methods.

ELECTRICAL CIRCUITS↗

Algorithm Plans Collision-Free Path for Robotic Manipulator

An algorithm has been developed to enable a computer aboard a robot to autonomously plan the path of the manipulator arm of the robot to avoid collisions between the arm and any obstacle, which could be another part of the robot or an external object in the vicinity of the robot. In simplified terms, the algorithm generates trial path segments and tests each segment for potential collisions in an iterative process that ends when a sequence of collision-free segments reaches from the starting point to the destination. The main advantage of this algorithm, relative to prior such algorithms, is computational efficiency: the algorithm is designed to make minimal demands upon the limited computational resources available aboard a robot. This path-planning algorithm utilizes a modified version of the collision-detection method described in "Improved Collision-Detection Method for Robotic Manipulator" (NPO-30356), NASA Tech Briefs, Vol. 27, No. 3 (June 2003), page 72. The method involves utilization of mathematical models of the robot constructed prior to operation and similar models of external objects constructed automatically from sensory data acquired during operation. This method incorporates a previously developed method, known in the art as the method of oriented bounding boxes (OBBs), in which an object is represented approximately, for computational purposes, by a box that encloses its outer boundary. Because many parts of a robotic manipulator are cylindrical, the OBB method has been extended in this method to enable the approximate representation of cylindrical parts by use of octagonal or other multiple-OBB assemblies denoted oriented bounding prisms (OBPs). A multiresolution OBB/OBP representation of the robot and its manipulator arm and a multiresolution OBB representation of external objects (including terrain) are constructed and used in a process in which collisions at successively finer resolutions are detected through computational detection of overlaps between the corresponding OBB and OBP models. For computational efficiency, the process is started at the coarsest resolution and stopped as soon as possible, preferably before reaching the finest resolution. At the coarsest resolution, there is a single OBB enclosing all relevant external objects and a single OBB enclosing the entire robot. At the next finer level of resolution, the coarsest-resolution OBB is divided into two OBBs, and so forth. If no collision is detected at the coarsest resolution, then there is no need for further computation to detect collisions. If a collision is detected at the coarsest resolution, then tests for collisions are performed at the next finer level of resolution. This process is continued to successively finer resolutions until either no more collisions are detected or the finest resolution is reached.

Backes, Paul↗

Navigation and control considerations for space based orbital maneuvering systems

Various design areas of concern in navigation and control of space-based orbital maneuvering systems such as those on the Orbiter are discussed, with note taken of approach maneuvers. Design problems occur in the areas of storage modes, sensing, activation methods, navigation, target/mission determination, rendezvous and docking schemes, reliability, and commonality between low- and high-energy maneuvering vehicles. Navigation may be in autonomous or nonautonomous modes and may include ground-baed computations and commands via the TDRSS or NORAD systems. Autonomous operations would interface with the GPS. All the concepts discussed are significant for the planned orbital transfer and orbital maneuvering vehicles, which would be used to place satellites in orbit and repair or retrieve them.

Brandon, L.↗

Evaluation of the Simple Safe Site Selection (S4) Hazard Detection Algorithm Using Helicopter Field Test Data

Small scale terrain hazards, such as rocks, slopes, and craters, can pose significant risk to landing spacecraft and rover or payload deployment. Onboard Hazard Detection and Avoidance (HDA) systems scan and analyze the landing area for these hazards in real time during descent, and divert the spacecraft to the safest touchdown site. The computationally efficient Simple Safe Site Selection (S4) algorithm combined with a flash LIDAR is an HDA system geared towards small robotic spacecraft. Rather than creating and analyzing a digital elevation map (DEM) from potentially many overlapping range images, S4 operates directly on a single flash LIDAR image. Extending prior work that has analyzed S4 performance for Mars landing using extensive simulations, this paper evaluates S4 performance using actual flash LIDAR images of an artificial hazard field acquired during a 2014 helicopter field test in Death Valley, CA. In particular, we describe LIDAR characterization and calibration, creation of ground truth elevation and safety maps, creation of ground truth sensor poses, actual S4 algorithm processing, and performance analysis. The results show that the safety cost images produced by S4 are remarkably close to the ground truth safety map (computed offline by an HDA algorithm developed under the Autonomous Landing and Hazard Avoidance (ALHAT) project) at significantly reduced computational cost, confirming S4 as a viable candidate algorithm for onboard spacecraft HDA.

Luna, Michael E.↗

Evolution of Autonomous Self-Righting Behaviors for Articulated Nanorovers

Miniature rovers with articulated mobility mechanisms are being developed for planetary surface exploration on Mars and small solar system bodies. These vehicles are designed to be capable of autonomous recovery from overturning during surface operations. This paper describes a computational means of developing motion behaviors that achieve the autonomous recovery function. It proposes a control software design approach aimed at reducing the effort involved in developing self-righting behaviors. The approach is based on the integration of evolutionary computing with a dynamics simulation environment for evolving and evaluating motion behaviors. The automated behavior design approach is outlined and its underlying genetic programming infrastructure is described.

Tunstel, Edward↗