Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “decentralized state estimation”

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.

23 records · Page 2

Masked Proportional Routing

Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an entity to visit the same node twice; and 6. Preferably can be modified so that separate entities moving from A to B do not arrive out of order.

Wolpert, David↗

Bi-Level Linear Programming Model for Automatic Load Shedding: A Distributed Wide-Area Measurement System-based Solution

Load shedding is currently implemented as a two-step based approach. In the first step, manual load shedding is taken place, were system operators, using estimates, inform distribution utilities of predicted stressful conditions. Information provided include the potential use of energy reserves, as well as load shedding amount. In a second step, automatic load shedding is done. The latter is realized using protection relays. While considering frequency variation, pre-defined values of load to be shed and correspondent number of stages for such to be realized are transformed into relay settings. Under-frequency protection relays use only local measurements towards decision making, thus operate in a decentralized architecture. Decision making is done in milliseconds plus breaker time. While this approach has provided much system reliability, considering the new smart grid paradigm, where system dynamics are much faster due to increasing renewable resources penetration, in some operating conditions it will generate sub-optimal solutions, such as islanding. Phasor measurement units provide a source of information which can be useful for this problem. Centralized architecture-based solutions for automatic load shedding, as present in the state-of-the-art, require though total processing times which are not acceptable for real-life implementation. In this work, considering the above, a bi-level linear programming model is presented. The model is implemented considering a distributed architecture while leveraging phasor measurement units data. The upper-level model estimates the current system state. Results of this model are embedded in a lower-level model, which decision variables are the location and load value to be shed. Easy-to-implement model, built-on the classic weighted least squares solution, highlight potential aspects towards real-life applications.

Bretas, Arturo Suman↗

End-To-End Decentralized Transmission Line Protection in IBR-Dominated Weak Grids Using Interpretable Data-Driven Methods

Traditional transmission line protection relies on predictable synchronous-based fault signatures, which frequently fail under the non-standard, current-limited fault characteristics of Inverter-Based Resources (IBRs). This study investigates how to achieve secure, communication-free fault isolation in IBR-dominated weak grids without relying on opaque, computationally heavy "black-box" machine learning algorithms. To address this, we propose a novel, standalone, and inherently interpretable data-driven protection framework. Unlike centralized methods requiring multi-terminal communication, this decentralized approach relies solely on local measurements using a hierarchical linear-kernel Support Vector Machine (SVM). The methodology decomposes the protection task into four sequential stages that mimic traditional protection elements: fault detection and fault direction identification, fault type classification, zone classification, and location estimation. This multi-stage architecture allows for specialized feature engineering at each stage, combining high computational efficiency with logic traceability. The framework's end-to-end performance was validated via C-code and PSCAD/EMTDC co-simulation, utilizing a real-world utility network and an OEM black-box IBR model. The proposed relay achieves 97.2% overall accuracy and provides a reliable trip decision within a 2.5-cycle window. The results confirm 100% accuracy in fundamental fault detection, reliable zone selectivity across low to moderate fault resistances, and robust security against non-fault transients, proving its immediate viability for integration into commercial numerical relays.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Signal Whisperers: Enhancing Wireless Reception Using DRL-Guided Reflector Arrays

This paper presents a multi-agent reinforcement learning (MARL) approach for controlling adjustable metallic reflector arrays to enhance wireless signal reception in non-line-of-sight (NLOS) scenarios. Unlike conventional reconfigurable intelligent surfaces (RIS) that require complex channel estimation, our system employs a centralized training with decentralized execution (CTDE) paradigm where individual agents corresponding to reflector segments autonomously optimize reflector element orientation in three-dimensional space using spatial intelligence based on user location information. Through extensive ray-tracing simulations with dynamic user mobility, the proposed multi-agent beam-focusing framework demonstrates substantial performance improvements over single-agent reinforcement learning baselines, while maintaining rapid adaptation to user movement within one simulation step. Comprehensive evaluation across varying user densities and reflector configurations validates system scalability and robustness. The results demonstrate the potential of learning-based approaches for adaptive wireless propagation control.

deep reinforcement learning↗

Dynamics and Control of a Disordered System in Space

In this paper, we present some ideas regarding the modeling, dynamics and control aspects of granular spacecraft. Granular spacecraft are complex multibody systems composed of a spatially disordered distribution of a large number of elements, for instance a cloud of N grains in orbit, with N greater than 10(exp 3). These grains can be large (Cubesat-size) or small (mm-size), and can be active, i.e., a fully equipped vehicle capable sensing their own position and attitude, and enabled with propulsion means, or entirely passive. The ultimate objective would be to study the behavior of the single grains and of large ensembles of grains in orbit and to identify ways to guide and control the shape of a cloud composed of these grains so that it can perform a useful function in space, for instance, as an element of an optical imaging system for astrophysical applications. This concept, in which the aperture does not need to be continuous and monolithic, would increase the aperture size several times compared to large NASA observatories such as ATLAST, allowing for a true Terrestrial Planet Imager that would be able to resolve exo-planet details and do meaningful spectroscopy on distant world. In the paper, we address the modeling and autonomous operation of a distributed assembly (the cloud) of large numbers of highly miniaturized space-borne elements (the grains). A multi-scale, multi-physics model is proposed of the dynamics of the cloud in orbit, as well as a control law for cloud shape maintenance, and preliminary simulation studies yield an estimate of the computational effort, indicating a scale factor of approximately N(exp 1.4) as a function of the number of grains. A granular spacecraft can be defined as a collection of a large number of space-borne elements (in the 1000s) designed and controlled such that a desirable collective behavior emerges, either from the interactions among neighboring grains, and/or between the grains and the environment. In this paper, each grain is considered to be a highly miniaturized spacecraft which has limited size and mass, hence it has limited actuation, limited propulsive capability, limited power, limited sensing, limited communication, limited computational resources, limited range of motion, limited lifetime, and may be expendable. The modeling and dynamics of clouds of vehicles is more challenging than with conventional vehicles because we are faced with a probabilistic vehicle composed of a large number of physically disconnected vehicles. First, different scales of motion occur simultaneously in a cloud: translations and rotations of the cloud as a whole (macro-dynamics), relative rotation and translation of one cloud member with respect to another (meso-dynamics), and individual cloud member dynamics (micro-dynamics). Second, the control design needs to be tolerant of the system complexity, of the system architecture (centralized vs. decentralized large scale system control) as well as robust to un-modeled dynamics and noise sources. Figure 1, top left, shows the kinematic parameters of a 1000 element cloud in orbit. The motion of the system is described with respect to a local vertical-local horizontal (LV-LH) orbiting reference frame (x,y,z)=F(sub ORF) of origin O(sub ORF) which rotates with mean motion omega and orbital semi-major axis R(sub 0). The orbital geometry at the initial time is defined in terms of its six orbital elements, and the orbital dynamics equation for point O(sub ORF) is propagated forward in time under the influence of the gravitational field of the primary and other external perturbations, described below. The origin of this frame coincides with the initial position of the center of mass of the system, and the coordinate axes are z along the local vertical, x toward the flight direction, and y in the orbit normal direction. The assumptions we used to model the dynamics are as follows: 1) The inertial frame is fixed at Earth's center. 2) The orbiting Frame ORF follows Keplerian orbit. 3) the cloud system dynamics is referred to ORF. 4) the attitude of each grain uses the principal body frame as body fixed frame. 5) the atmosphere is assumed to be rigidly rotating with the Earth. Regarding the grains forming the cloud: 1) each grain is modeled as a rigid body; 2) a simple attitude estimator provides attitude estimates, 3) a simple guidance logic commands the position and attitude of each grain, 4) a simple local feedback controller based on PD control of local states is used to stabilize the attitude of the vehicle. Regarding the cloud: 1) the cloud as a whole is modeled as an equivalent rigid body in orbit, and 2) an associated graph establishes agent connectivity and enables coupling between modes of motion at the micro and macro scales; 3) a simple guidance and estimation logic is modeled to estimate and command the attitude of this equivalent rigid body; 4) a cloud shape maintenance controller is based on the dynamics of a stable virtual truss in the orbiting frame. Regarding the environmental perturbations acting on the cloud: 1) a non-spherical gravity field including JO (Earth's spherical field) zonal component, J2 (Earth's oblateness) and J3 zonal components is implemented; 2) atmospheric drag is modeled with an exponential model; 3) solar pressure is modeled assuming the Sun is inertially fixed; and 4) the Earth's magnetic field is model using an equivalent dipole model. The equations of motion are written in a referential system with respect to the origin of the orbiting frame and the state is propagated forward in time using an incremental predictor-corrector scheme. A representative cloud with varying number of grains is simulated to identify the limitations in computation time as the number of grains grows. We derive a control law to track a desired surface in the ORF (equivalently to maintain a reference cloud shape) by defining an error from a desired surface shape, and designing a control law that is exponentially stable and reduces the tracking error to zero. Figure 1 (top right) shows a comparison of various requirements for simulation of single spacecraft vs. granular spacecraft, indicating the high degree of complexity that needs to be taken into consideration. The ORF components of control force required by one of the grains is, for this particular case, in the micro-Newton range. However, no attempt has been made yet to reconfigure (or re-orient) the cloud configuration internally, for which forces in the milli-Newton level are expected, depending on the time required to do the reconfiguration. Figure 1, bottom, shows the computation time as a function of the number of grains, indicating an order N(exp 1.43) scaling on a 8 Gb, 1067 MHz RAM MacOSX computer with a 3.06 GHz Intel Core 2 Duo processor. With this metric, the same simulation for a system of N=1000 grains would take 5.4 hours, and 146 hours (i.e., 6 days) for a system with N=10,000 grains. Therefore, efficient ways to simulate this complex system, where not only the time scales of natural system dynamics, but also the sampling times of the Guidance, Navigation, and Control are included, remain to be explored. Additional details on the cloud modeling, dynamics, and control will be described in the paper.

simulation↗