Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Multi-Agent”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

“Multiagent” Screening Improves Directed Enzyme Evolution by Identifying Epistatic Mutations

Enzyme evolution has enabled numerous advances in biotechnology and synthetic biology, yet still requires many iterative rounds of screening to identify optimal mutant sequences. This is due to the sparsity of the fitness landscape, which is caused by epistatic mutations that only offer improvements when combined with other mutations. We report an approach that incorporates diverse substrate analogues in the screening process, where multiple substrates act like multiple agents navigating the fitness landscape, identifying epistatic mutant residues without a need for testing the entire combinatorial search space. We initially validate this approach by engineering a malonyl-CoA synthetase and identify numerous epistatic mutations improving activity for several diverse substrates. The majority of these mutations would have been missed upon screening for a single substrate alone. We expect that this approach can accelerate a wide array of enzyme engineering programs.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

The Cost of Scaling Up in Large-Format Additive Manufacturing

Additive manufacturing (AM) of large objects has, over the last decade, required the scaling of existing material extrusion processes. The current generation of large-scale printers are primarily gantry robots with high-throughput extrusion systems. With workspaces approaching 50 m 3 , these printers have pushed the boundaries of achievable print volume while allowing the utilization of low-cost feedstocks, such as cementitious materials and polymer pellets, like those used in injection molding. Continued workspace expansion requires an examination of the inherent trade-offs, which impact capital and operational costs. Here, in this work, the authors examine these trade-offs to determine fundamental scaling laws for existing system architectures, survey the state of the art for alternative system configurations, and pose recommendations for future system designers to continue the evolution of large-scale AM systems.

3D printing↗
DOE OSTI2021

Decentralized Voltage Control of Large-Scale Distribution System with PVs Based on MADRL

This paper proposes a model-free decentralized control framework for the voltage regulation of large-scale distribution systems through the coordinated control of PV inverters. This is achieved by developing a novel interaction mechanism between the surrogate model and the centralized training and decentralized execution multiagent deep reinforcement learning framework. Specifically, the sparse Gaussian processes regression method is first utilized to develop the surrogate model of the original distribution system for reward calculation during the training stage, where each agent represents a sub-region in the centralized fashion for coordination strategy learning. After that, the learned control rules are used to inform controllers within each sub-region for real-time decisions with only local measurements. Comparative tests among various methods on the EPRI Ckt5 test system demonstrate the effectiveness of the proposed method.

distribution system↗
DOE OSTI2023

Convex Decreasing Algorithms: Distributed Synthesis and Finite-Time Termination in Higher Dimension

Here we establish finite time termination algorithms for consensus algorithms based on geometric properties that yield finite-time guarantees, suited for use in high dimension and in the absence of a central authority. These pursuits motivate a new peer to peer convex hull algorithm which is utilized for one stopping algorithm. Further an alternative lightweight norm based stopping criteria is also developed. The practical utility of the algorithm is illustrated through MATLAB simulations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Privacy-Preserving Average Consensus With Beaver Triple and Communication Obfuscation

A privacy-preserving average consensus algorithm is proposed that synergizes the Beaver triple in secret sharing theory and noise obfuscation. The algorithm safeguards the initial values of agents against passive adversaries in a multiagent system. It is proved that the proposed algorithm can concurrently ensure average consensus and privacy, while also reducing the online computation and communication overhead compared to encryption-based ones. In addition, it imposes a less stringent condition for privacy preservation compared to certain noise-obfuscation techniques.

Beaver triple↗
DOE OSTI2022

Network-Level Traffic Signal Cooperation: A Higher-Order Conflict Graph Approach

Traffic signal control and cooperation are extremely important to alleviate traffic congestion in a large traffic network. This study develops a higher-order conflict graph approach for network-wide traffic signal control and cooperation. A conflict graph is applied to model the traffic signal configurations, which identifies the conflict and unconflicted movements for each intersection. In conflict graph, the node represents each movement. The weight of each node can be defined as traffic volume, queue length, fuel consumption, or any weighted combinations of these measurements. The calculation of the optimal green light duration and green light sequence (for different movements) is equivalent to sequentially finding the maximum weight independent set (MWIS) in the conflict graph. The conflict graph also provides a uniform and efficient way to connect traffic signal operations among nearby intersections spatially. Then, we introduced the concept of the k -th order neighborhood to model the degree of connectivity between each movement to the movements at upstream or downstream intersections. The weight of each node in the higher-order conflict graph not only represents its own congestion level, but also relates to the traffic conditions of nearby intersections. Through this approach, the cooperation of multiple intersections can be realized by incorporating their spatial connectivity into conflict graph and solving the MWIS problem. A simulation network is built in SUMO to test the effectiveness of the proposed method. Results suggested that the proposed model outperformed other state-of-the-art signal control methods. Also, the scheme maintains good performance under varying traffic demands.

42 ENGINEERING↗
DOE OSTI2022

Distributed Finite-Time Termination for Consensus Algorithm in Switching Topologies

Here, in this article, we present a finite-time stopping criterion for consensus algorithms in networks with dynamic communication topology. Prior state of the art has established convergence to the consensus value; however, the asymptotic convergence of these algorithms poses a challenge in practical settings where the response from agents is required in finite time. To this end, we propose a maximum-minimum protocol that propagates the global maximum and minimum values of agent states (while running the consensus algorithm) in the network. This article focuses on establishing that the global maximum and minimum values are strictly monotonic even for a dynamic topology, and they can be used to distributively ascertain the closeness to convergence in finite time. We rigorously show that each node can have access to the global maximum and minimum by running the proposed maximum-minimum protocol to realize a finite-time stopping criterion for the otherwise asymptotic consensus algorithm. The practical utility of the algorithm is illustrated through experiments where each agent is instantiated by a NodeJS socket.io server.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Minimal Energy Routing of a Leader and a Wingmate with Periodic Connectivity

We consider a route planning problem in which two unmanned vehicles are required to complete a set of tasks present at distinct locations, referred to as targets, with minimum energy consumption. The mission environment is hazardous, and to ensure a safe operation, the UVs are required to communicate with each other at every target they visit. The problem objective is to determine the allocation of the tasks to the UVs and plan tours for the UVs to visit the targets such that the weighted sum of the distances traveled by the UVs and the distances traveled by the communicating signals between them is minimized. We formulate this problem as an Integer program and show that naively solving the problem using commercially available off-the-shelf solvers is insufficient in determining scalable solutions efficiently. To address this computational challenge, we develop an approximation and a heuristic algorithm, and employ them to compute high-quality solutions to a special case of the problem where equal weights are assigned to the distances traveled by the vehicles and the communicating signals. For this special case, we show that the approximation algorithm has a fixed approximation ratio of 3.75. We also develop lower bounds to the optimal cost of the problem to evaluate the performance of these algorithms on large-scale instances. We demonstrate the performance of these algorithms on 500 randomly generated instances with the number of targets ranging from 6 to 100, and show that the algorithms provide high-quality solutions to the problem swiftly; the average computation time of the algorithmic solutions is within a fraction of a second for instances with at most 100 targets. Finally, we show that the approximation ratio has a variable ratio for the weighted case of the problem. Specifically, if ρ denotes the ratio of the weights assigned to the distances representing the communication and travel costs, the algorithm has an a posteriori ratio of $3 + \frac{3ρ}{4}$ when ρ ≥ 1, and $\frac{3}{ρ}$ + $\frac{3}{4}$ when ρ ≤ 1.

42 ENGINEERING↗
NASA NTRS2011

Compliant Task Execution and Learning for Safe Mixed-Initiative Human-Robot Operations

We introduce a novel task execution capability that enhances the ability of in-situ crew members to function independently from Earth by enabling safe and efficient interaction with automated systems. This task execution capability provides the ability to (1) map goal-directed commands from humans into safe, compliant, automated actions, (2) quickly and safely respond to human commands and actions during task execution, and (3) specify complex motions through teaching by demonstration. Our results are applicable to future surface robotic systems, and we have demonstrated these capabilities on JPL's All-Terrain Hex-Limbed Extra-Terrestrial Explorer (ATHLETE) robot.

multi-agent collaboration↗
NASA NTRS2013

Separation-Compliant, Optimal Routing and Control of Scheduled Arrivals in a Terminal Airspace

We address the problem of navigating a set (fleet) of aircraft in an aerial route network so as to bring each aircraft to its destination at a specified time and with minimal distance separation assured between all aircraft at all times. The speed range, initial position, required destination, and required time of arrival at destination for each aircraft are assumed provided. Each aircraft's movement is governed by a controlled differential equation (state equation). The problem consists in choosing for each aircraft a path in the route network and a control strategy so as to meet the constraints and reach the destination at the required time. The main contribution of the paper is a model that allows to recast this problem as a decoupled collection of problems in classical optimal control and is easily generalized to the case when inertia cannot be neglected. Some qualitative insight into solution behavior is obtained using the Pontryagin Maximum Principle. Sample numerical solutions are computed using a numerical optimal control solver. The proposed model is first step toward increasing the fidelity of continuous time control models of air traffic in a terminal airspace. The Pontryagin Maximum Principle implies the polygonal shape of those portions of the state trajectories away from those states in which one or more aircraft pair are at minimal separation. The model also confirms the intuition that, the narrower the allowed speed ranges of the aircraft, the smaller the space of optimal solutions, and that an instance of the optimal control problem may not have a solution at all (i.e., no control strategy that meets the separation requirement and other constraints).

transportation network↗
NASA NTRS2020

Assemblers: A Modular, Reconfigurable Manipulator for Autonomous in-Space Assembly

This paper presents a modular, reconfigurable robotic manipulator for autonomous in-space assembly. On-orbit and planetary surface assembly is a challenging domain that encompasses various technological thrusts to support human exploration, science, and technology demonstration missions. The system architecture presented here addresses the need for robotic assembly of structures in locations that prohibit constant human oversight and/or teleoperation. This system is capable of scheduling, reconfiguring itself, and executing structural assembly tasks with the ability to assess construction and correct errors during the assembly as needed. An example concept of operations is presented. Details of the mechanical and electrical design of the robotic modules as well as the dynamic modeling approach, control algorithms, and sensing and perception systems are also provided.

robotics↗
NASA NTRS2021

Inertial Transfer Concept for Autonomous In-Space Assembly

Rocket payload and fairing size have placed strict mass and volume limitations on single launch in-space structures. These limitations are what motivates In-Space Assembly (ISA) and where Inertial Transfer has potential to improve or augment ISA capabilities by utilizing a multiagent autonomous system to transport untethered payloads. The Inertial Transfer concept is presented including autonomy capabilities, potential risks, and three system configurations. These configurations are based on the autonomous system’s available sensor coverage that tracks the payload’s state. Participating agents have well-defined roles, expectations, and assumptions in their physical organization and coordination of actions depending the mode of operation. The sensor information available to participating agents is considered as it affects the uncertainty in the estimated state and the actions required to capture the payload.

Multi-Agent↗
NASA NTRSDate not supplied

APIS: Honeybee Foraging Task Assignment for Use in Uncertain and Unreliable Environments

Multiagent Cyber-Physical-Human (CPH) systems in realistic environments operate under uncertain conditions. Communication among agents, aimed at reducing the uncertainty, is itself subject to uncertainty. We propose to manage uncertainties in autonomous, long-duration operations of multiagent systems via a modified Honeybee Foraging (HBF) behavioral scheme. The resulting system, Autonomous Persistent Intelligent Swarm (APIS),incorporates two new behaviors to ameliorate informational uncertainty. When “scouting”, agents are tasked based on informational quality and reliability rather than solely on priorities. When “dancing”, agents are tasked to rendezvous with other dancing agents to exchange information at close range, where successful communication is guaranteed. When coupled with uncertainty-aware modeling across agents, these behaviors improve situational awareness and resilience of the system, enabling it to function under more uncertain conditions arising during long-duration missions.

Autonomous systems↗
NASA NTRSDate not supplied

APIS: Honeybee Foraging Task Assignment for Use in Uncertain and Unreliable Environments

Multiagent Cyber-Physical-Human (CPH) systems in realistic environments operate under uncertain conditions. Communication among agents, aimed at reducing the uncertainty, is itself subject to uncertainty. We propose to manage uncertainties in autonomous, long-duration operations of multiagent systems via a modified Honeybee Foraging (HBF) behavioral scheme. The resulting system, Autonomous Persistent Intelligent Swarm (APIS),incorporates two new behaviors to ameliorate informational uncertainty. When “scouting”, agents are tasked based on informational quality and reliability rather than solely on priorities. When “dancing”, agents are tasked to rendezvous with other dancing agents to exchange information at close range, where successful communication is guaranteed. When coupled with uncertainty-aware modeling across agents, these behaviors improve situational awareness and resilience of the system, enabling it to function under more uncertain conditions arising during long-duration missions.

Autonomous systems↗