Search NASA⌕ Search

SEARCH · Search NASA

Results for “agentic systems”

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 NTRS2022

Towards Run-Time Search for Real-World Multi-Agent Systems

Multi-agent systems (MAS) may encounter uncertainties in the form of unexpected environmental conditions, sub-optimal system configurations, and unplanned interactions between autonomous agents. The number of combinations of such uncertainties may be innumerable, however run-time testing may reduce the issues impacting such a system. We posit that search heuristics can augment a run-time testing process, in-situ, for a MAS. To support our position we discuss our in-progress experimental testbed to realize this goal and highlight challenges we anticipate for this domain.

Abigail C. Diller↗
NASA NTRS2020

Projection-Based Inter-Agent Collision Avoidance in Dual Agent Systems

Inter-agent collisions can occur in otherwise dynamically-stable (i.e., Lyapunov stable) dual-agent leaderfollower systems. These inter-agent collisions between the leader and the follower happen during the transient phase of the system’s evolution, although the steady-state behavior of the system is asymptotically/exponentially stable. Therefore, to avoid such inter-agent collisions, it is essential to control the relative error trajectory between the leader and the follower during the transient phase of the system’s evolution. In this paper, we introduce a novel projection operator based modelreference control architecture that can mitigate impending inter-agent collisions by modifying the transient dynamics of relative trajectories. This controller augments the follower’s baseline controller and consists of two essential components: a collision-free reference model based on the projection operator and a model reference tracking controller to guide the follower to follow the reference-model. This paper defines the concept of transient-instability in leader-follower systems, introduces collision mitigation controller architecture, and presents an illustrative example demonstrating its effectiveness.

Bayard, David S.↗
DOE OSTI2023

Control of multi-agent systems: Results, open problems, and applications

The purpose of this review article is to present some recent results on the modeling and control of large systems of agents. We focus on particular applications where the agents are capable of independent actions instead of simply reacting to external forces. In the literature, such agents were referred to as autonomous, intelligent, self-propelled, greedy, and others. The main applications we have in mind are social systems (as opinion dynamics), pedestrians’ movements (also called crowd dynamics), animal groups, and vehicular traffic. We note that the last three examples include physical constraints; however, the agents are able to inject energy into the system, thus preventing the typical conservation of momentum and energy. In addition, the control problems posed by such systems are new and require innovative methods. We illustrate some ideas developed recently, including the use of sparse controls, limiting the total variation of controls, and defining new control problems for measures. After reviewing various approaches, we discuss some future research directions of potential interest. The latter encompasses both new types of equations and new types of limiting procedures to connect several scales at which a system can be represented. We conclude by illustrating a recent real-life experiment using autonomous vehicles on an open highway to smooth traffic waves. This opens the door to a new era of interventions to control real-time multi-agent systems and to increase the societal impact of such interventions guided by control research.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Data-driven Distributed Learning of Multi-agent Systems: A Koopman Operator Approach

Koopman operator theory provides a model-free technique for studying nonlinear dynamical systems purely from data. Since the Koopman operator is infinite-dimensional, researchers have developed several methods that provide a finite-dimensional approximation of the Koopman operator so that it can be applied for practical use cases. One common thing with most of the methods is that their solutions are obtained by solving a centralized minimization problem. In this work, we treat the dynamical system to be a multi-agent system and propose an algorithm to compute the finite-dimensional approximation of the Koopman operator in a distributed manner using the knowledge of the topology of the underlying multi-agent system. The proposed distributed approach is shown to be equivalent to the centralized learning problem and results in a sparse Koopman whose block structure mimics the Laplacian of the multi-agent system. Extensive simulation studies illustrate the proposed framework on the network of oscillators and the IEEE 68 bus system.

Nandanoori, Sai Pushpak↗
NASA NTRS2005

Quicker Q-Learning in Multi-Agent Systems

Multi-agent learning in Markov Decisions Problems is challenging because of the presence ot two credit assignment problems: 1) How to credit an action taken at time step t for rewards received at t' greater than t; and 2) How to credit an action taken by agent i considering the system reward is a function of the actions of all the agents. The first credit assignment problem is typically addressed with temporal difference methods such as Q-learning OK TD(lambda) The second credit assi,onment problem is typically addressed either by hand-crafting reward functions that assign proper credit to an agent, or by making certain independence assumptions about an agent's state-space and reward function. To address both credit assignment problems simultaneously, we propose the Q Updates with Immediate Counterfactual Rewards-learning (QUICR-learning) designed to improve both the convergence properties and performance of Q-learning in large multi-agent problems. Instead of assuming that an agent s value function can be made independent of other agents, this method suppresses the impact of other agents using counterfactual rewards. Results on multi-agent grid-world problems over multiple topologies show that QUICR-learning can achieve up to thirty fold improvements in performance over both conventional and local Q-learning in the largest tested systems.

Agogino, Adrian K.↗
NASA NTRS2004

Massive Multi-Agent Systems Control

In order to build massive multi-agent systems, considered as complex and dynamic systems, one needs a method to analyze and control the system. We suggest an approach using morphology to represent and control the state of large organizations composed of a great number of light software agents. Morphology is understood as representing the state of the multi-agent system as shapes in an abstract geometrical space, this notion is close to the notion of phase space in physics.

Campagne, Jean-Charles↗
NASA NTRS2004

Verifying Multi-Agent Systems via Unbounded Model Checking

We present an approach to the problem of verification of epistemic properties in multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend the technique of unbounded model checking from a purely temporal setting to a temporal-epistemic one. In order to achieve this, we base our discussion on interpreted systems semantics, a popular semantics used in multi-agent systems literature. We give details of the technique and show how it can be applied to the well known train, gate and controller problem. Keywords: model checking, unbounded model checking, multi-agent systems

Kacprzak, M.↗
NASA NTRS1998

Formal Modeling of Multi-Agent Systems using the Pi-Calculus and Epistemic Logic

Multi-agent systems have become important recently in computer science, especially in artificial intelligence (AI). We allow a broad sense of agent, but require at least that an agent has some measure of autonomy and interacts with other agents via some kind of agent communication language. We are concerned in this paper with formal modeling of multi-agent systems, with emphasis on communication. We propose for this purpose to use the pi-calculus, an extension of the process algebra CCS. Although the literature on the pi-calculus refers to agents, the term is used there in the sense of a process in general. It is our contention, however, that viewing agents in the AI sense as agents in the pi-calculus sense affords significant formal insight. One formalism that has been applied to agents in the AI sense is epistemic logic, the logic of knowledge. The success of epistemic logic in computer science in general has come in large part from its ability to handle concepts of knowledge that apply to groups. We maintain that the pi-calculus affords a natural yet rigorous means by which groups that are significant to epistemic logic may be identified, encapsulated, structured into hierarchies, and restructured in a principled way. This paper is organized as follows: Section 2 introduces the pi-calculus; Section 3 takes a scenario from the classical paper on agent-oriented programming [Sh93] and translates it into a very simple subset of the n-calculus; Section 4 then shows how more sophisticated features of the pi-calculus may bc brought into play; Section 5 discusses how the pi-calculus may be used to define groups for epistemic logic; and Section 6 is the conclusion.

Rorie, Toinette↗
DOE OSTI2020

Consensus Weighting of a Multi-Agent System for Load Shedding

An agent-based scheme is proposed for distributed underfrequency load shedding (UFLS). The key concept is a consensus weighting protocol (CWP) for agents to reach an agreement. Unlike the well adopted average-consensus protocol (ACP), the proposed CWP enables each agent to converge to its weighted portion of the sum of all initial values. Thus, the proposed CWP is more suitable for the UFLS application, as it allows load buses with a higher level of loading to shed more, rather than reducing by the same average value over all load buses as required by the ACP. Proof of convergence for the proposed CWP is derived and presented in this paper, together with the constraints. For implementation of the multi-agent system (MAS), the monitoring, estimation, and distribution steps are developed. Two study cases and the simulation results are provided to validate the performance of the proposed agent-based UFLS scheme.

Xie, Jing↗
NASA NTRS2004

Using Ontologies to Formalize Services Specifications in Multi-Agent Systems

One key issue in multi-agent systems (MAS) is their ability to interact and exchange information autonomously across applications. To secure agent interoperability, designers must rely on a communication protocol that allows software agents to exchange meaningful information. In this paper we propose using ontologies as such communication protocol. Ontologies capture the semantics of the operations and services provided by agents, allowing interoperability and information exchange in a MAS. Ontologies are a formal, machine processable, representation that allows to capture the semantics of a domain and, to derive meaningful information by way of logical inference. In our proposal we use a formal knowledge representation language (OWL) that translates into Description Logics (a subset of first order logic), thus eliminating ambiguities and providing a solid base for machine based inference. The main contribution of this approach is to make the requirements explicit, centralize the specification in a single document (the ontology itself), at the same that it provides a formal, unambiguous representation that can be processed by automated inference machines.

Breitman, Karin Koogan↗
NASA NTRS2021

Detection of Transient Instabilities in Multi-Agent Systems and Swarms

In this paper, we introduce the novel concept of transient instabilities in multi-agent systems and swarms, i.e., a small disturbance leads to increasing-amplitude oscillations throughout the swarm, which results in a large number of interagent collisions. This instability is dominant in the transient phase of the system and it does not appear in the steady-state behavior of the system, as each agent uses Lyapunov-stable feedback control laws. We present a rigorous definition of transient instability in swarms, and discuss its key properties. We also present a sufficient condition to check if a swarm will be transient stable. Using both theoretical techniques and numerical results, we show that a simple Proportional-Integral-Derivative (PID) feedback-tracking control law is not suitable for these applications. We also present a robust control law for Euler- Lagrangian systems that maintains transient stability across static swarms or time-varying reconfiguration in swarms. Both theoretical results and numerical simulations are presented to demonstrate the effectiveness of our proposed approach.

Quadrelli, Marco B.↗
DOE OSTI2022

Enhanced oxygen transfer agent systems for oxidative dehydrogenation of hydrocarbons

Enhanced oxygen transfer agent systems and methods of use thereof are provided. According to one aspect, a method for producing olefins from a hydrocarbon feed includes the step of contacting a hydrocarbon feed comprised of one or more alkanes with an oxygen transfer agent at a temperature of 350° C. to 1000° C. The oxygen transfer agent includes an oxygen-donating chalcogen agent including at least one of S, Se, or Te and a reducible metal oxide. The chalcogen has an oxidation state greater than +2. A method for producing one or more olefins by partial combustion of a hydrocarbon feed is provided. The method includes partially combusting a hydrocarbon feed comprised of one or more alkanes by contacting the hydrocarbon feed with an oxygen transfer agent comprising CaSO 4 at a temperature of 350° C. to 1000° C. to produce one or more olefins comprising ethylene and coproducing water.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2004

Product Distribution Theory for Control of Multi-Agent Systems

Product Distribution (PD) theory is a new framework for controlling Multi-Agent Systems (MAS's). First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (probability distribution of) the joint stare of the agents. Accordingly we can consider a team game in which the shared utility is a performance measure of the behavior of the MAS. For such a scenario the game is at equilibrium - the Lagrangian is optimized - when the joint distribution of the agents optimizes the system's expected performance. One common way to find that equilibrium is to have each agent run a reinforcement learning algorithm. Here we investigate the alternative of exploiting PD theory to run gradient descent on the Lagrangian. We present computer experiments validating some of the predictions of PD theory for how best to do that gradient descent. We also demonstrate how PD theory can improve performance even when we are not allowed to rerun the MAS from different initial conditions, a requirement implicit in some previous work.

Lee, Chia Fan↗
NASA NTRS2005

Designing Agent Utilities for Coordinated, Scalable and Robust Multi-Agent Systems

Coordinating the behavior of a large number of agents to achieve a system level goal poses unique design challenges. In particular, problems of scaling (number of agents in the thousands to tens of thousands), observability (agents have limited sensing capabilities), and robustness (the agents are unreliable) make it impossible to simply apply methods developed for small multi-agent systems composed of reliable agents. To address these problems, we present an approach based on deriving agent goals that are aligned with the overall system goal, and can be computed using information readily available to the agents. Then, each agent uses a simple reinforcement learning algorithm to pursue its own goals. Because of the way in which those goals are derived, there is no need to use difficult to scale external mechanisms to force collaboration or coordination among the agents, or to ensure that agents actively attempt to appropriate the tasks of agents that suffered failures. To present these results in a concrete setting, we focus on the problem of finding the sub-set of a set of imperfect devices that results in the best aggregate device. This is a large distributed agent coordination problem where each agent (e.g., device) needs to determine whether to be part of the aggregate device. Our results show that the approach proposed in this work provides improvements of over an order of magnitude over both traditional search methods and traditional multi-agent methods. Furthermore, the results show that even in extreme cases of agent failures (i.e., half the agents failed midway through the simulation) the system's performance degrades gracefully and still outperforms a failure-free and centralized search algorithm. The results also show that the gains increase as the size of the system (e.g., number of agents) increases. This latter result is particularly encouraging and suggests that this method is ideally suited for domains where the number of agents is currently in the thousands and will reach tens or hundreds of thousands in the near future.

Tumer, Kagan↗
DOE OSTI2025

Enabling Real-Time Communication in Multi-Agent Systems: A Graph Neural Network Based Approach

Global connectivity enables effective coordination in Multi-Agent Systems (MAS). Solving these connection problems under hardware constraints is an NP-hard non-Euclidean Degree Constrained Minimum Spanning Tree (DCMST) problem. Prior MAS controllers coordinate team movement for task completion and collision avoidance; some considering Line-of-Sight (LOS) maintenance but prioritizing flexibility over guarantees. Evolutionary Algorithms (EA) have been shown to find good solutions for DCMST, but their performance degrades with larger populations required to support a large MAS. We present a method based on edge graph attention networks, trained offline to reduce online computation times. Empirical comparisons with greedy polynomial-time solvers and EA show that our method leverages latent graph information to consistently find constraint-satisfying solutions in less time.

connectivity maintenance↗
NASA NTRS2020

Detection and Mitigation of Transient Instabilities in Multi-Agent Systems and Swarms

We first introduce the novel concept of transient instabilities in multi-agent systems and swarms, i.e., a small disturbance leads to increasing-amplitude oscillations throughout the swarm, which results in a large number of inter-agent collisions. This instability is dominant in the transient phase of the system and it does not appear in the steady-state behavior of the system, as each agent uses Lyapunov-stable feedback control laws. We present a rigorous definition of transient instability in swarms, and discuss its key properties. We also present a sufficient condition to check if a swarm will be transient stable. We study the behaviour of different control laws under this condition. We also show how transient instability phenomenon could impact the dynamics of deployable structures. Next, we present a novel control architecture that augments the baseline formation maintenance controller to mitigate transient instabilities. At its heart, the proposed architecture consists of a projection operator based estimator disguised as a reference model that generates collision-free trajectories for the agents to follow. We present numerical simulation results to demonstrate the effectiveness of our proposed approaches.

Quadrelli, Marco B.↗