Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed consensus”

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

Distributed Consensus to Enable Merging and Spacing of UAS in an Urban Environment

This paper presents a novel approach to enable multiple Unmanned Aerial Systems approaching a common intersection to independently schedule their arrival time while maintaining a safe separation. Aircraft merging at a common intersection are grouped into a network and each aircraft broadcasts its arrival time interval to the network. A distributed consensus algorithm elects a leader among the aircraft approaching the intersection and helps synchronize the information received by each aircraft. The consensus algorithm ensures that each aircraft computes a schedule with the same input information. The elected leader also dictates when a schedule must be computed, which may be triggered when a new aircraft joins the network. Preliminary results illustrating the collaborative behavior of the vehicles are presented.

Balachandran, Swee↗

Biology-Inspired Distributed Consensus in Massively-Deployed Sensor Networks

Promises of ubiquitous control of the physical environment by large-scale wireless sensor networks open avenues for new applications that are expected to redefine the way we live and work. Most of recent research has concentrated on developing techniques for performing relatively simple tasks in small-scale sensor networks assuming some form of centralized control. The main contribution of this work is to propose a new way of looking at large-scale sensor networks, motivated by lessons learned from the way biological ecosystems are organized. Indeed, we believe that techniques used in small-scale sensor networks are not likely to scale to large networks; that such large-scale networks must be viewed as an ecosystem in which the sensors/effectors are organisms whose autonomous actions, based on local information, combine in a communal way to produce global results. As an example of a useful function, we demonstrate that fully distributed consensus can be attained in a scalable fashion in massively deployed sensor networks where individual motes operate based on local information, making local decisions that are aggregated across the network to achieve globally-meaningful effects.

Jones, Kennie H.↗

Time-Critical Coordination of UAS with Non-Ideal Autopilots under Lossy Communication Networks

In this presentation we will explore several distributed consensus algorithms developed to maintain coordination among a fleet of heterogeneous UAS subject to external disturbances. An overview of the network assumptions and autopilot performance bounds required to meet the coordination objective will be provided. In particular, we will leverage passivity-based stability conditions for bidirectional networks that require the communication graph to be connected in an integral sense, but may fail to connect pointwise in time during the entire mission. Non-ideal autopilots that can only track a desired speed profile with a prescribed precision induce an error in vehicle coordination. The autopilot performance bounds will be propagated through the coordination dynamics to understand the limits introduced by autopilots.

conensus↗

Decentralized Observer with a Consensus Filter for Distributed Discrete-Time Linear Systems

This paper presents a decentralized observer with a consensus filter for the state observation of a discrete-time linear distributed systems. In this setup, each agent in the distributed system has an observer with a model of the plant that utilizes the set of locally available measurements, which may not make the full plant state detectable. This lack of detectability is overcome by utilizing a consensus filter that blends the state estimate of each agent with its neighbors' estimates. We assume that the communication graph is connected for all times as well as the sensing graph. It is proven that the state estimates of the proposed observer asymptotically converge to the actual plant states under arbitrarily changing, but connected, communication and sensing topologies. As a byproduct of this research, we also obtained a result on the location of eigenvalues, the spectrum, of the Laplacian for a family of graphs with self-loops.

embedded consensus↗

A Proposed Clock Synchronization Method for the Solar System Internet

Networked communications in space are necessary to achieve scalability in terms of the number of communicating nodes but also in terms of the overall system complexity. A key component to such a system is the ability to synchronize clocks, which is the focus of this paper. The so-called Solar System Internet (SSI) will be built upon Delay Tolerant Networking (DTN), which, in analogy to the Internet Protocol (IP), can be considered a suite of protocols necessary for networking in the space domain. Therefore, our goal is to extend this suite to include a DTN clock synchronization capability, analogous to the Network Time Protocol (NTP) used in the Internet. A motivating example of a network in space is NASA’s LunaNet, a vision for a multi-hop multi-path network extending to the moon wherein not all nodes will have direct connections to an authoritative reference clock. In this paper, we propose a general clock synchronization methodology and algorithm that could be used for LunaNet as well as more elaborate time-varying networks. In recent years, DTN has benefited from modeling efforts founded on the mathematical tool of sheaves. Here we continue this work to provide an approach to clock synchronization. Due to the time-varying nature of space networks, absolute consensus is not possible. However, the sheaf Laplacian provides a practical, distributed approach to approximating consensus by allowing data to diffuse through the network. In particular, the sheaf Laplacian is readily computable, lending our approach to implementation. Our approach is well suited to handle the difficulties of space networks. For instance, differences in clock accuracy mean certain nodes are more authoritative than others; we can account for these differences through hierarchies in the network, generalizing the strata in NTP. Furthermore, just as error estimation is an integral part of NTP, we are able to give concrete error bounds for our approach. Indeed, different applications (e.g., communications schedules, pointing, navigation, distributed science) will have different requirements, hence it is necessary to maintain clocks within a given tolerance. We outline some of the necessary steps to turn our approach into a practical network protocol that could be used in DTN, and we conclude the paper with suggestions for future research.

Michael Moy↗

GEOS-5 Seasonal Forecast System

Ensembles of numerical forecasts based on perturbed initial conditions have long been used to improve estimates of both weather and climate forecasts. The Goddard Earth Observing System (GEOS) Atmosphere-Ocean General Circulation Model, Version 5 (GEOS-5 AOGCM) Seasonal-to-Interannual Forecast System has been used routinely by the GMAO since 2008, the current version since 2012. A coupled reanalysis starting in 1980 provides the initial conditions for the 9 month experimental forecasts. Once a month, sea surface temperature from a suite of 11 ensemble forecasts is contributed to the North American Multi-Model Ensemble (NMME) consensus project, which compares and distributes seasonal forecasts of ENSO events. Since June 2013, GEOS-5 forecasts of the Arctic sea-ice distribution were provided to the Sea-Ice Outlook project. The seasonal forecast output data includes surface fields, atmospheric and ocean fields, as well as sea ice thickness and area, and soil moisture variables. The current paper aims to document the characteristics of the GEOS-5 seasonal forecast system and to highlight forecast biases and skills of selected variables (sea surface temperature, air temperature at 2 m, precipitation and sea ice extent) to be used as a benchmark for the future GMAO seasonal forecast systems and to facilitate comparison with other global seasonal forecast systems.

GEOS-5↗

Coordinating Shared Activities

Shared Activity Coordination (ShAC) is a computer program for planning and scheduling the activities of an autonomous team of interacting spacecraft and exploratory robots. ShAC could also be adapted to such terrestrial uses as helping multiple factory managers work toward competing goals while sharing such common resources as floor space, raw materials, and transports. ShAC iteratively invokes the Continuous Activity Scheduling Planning Execution and Replanning (CASPER) program to replan and propagate changes to other planning programs in an effort to resolve conflicts. A domain-expert specifies which activities and parameters thereof are shared and reports the expected conditions and effects of these activities on the environment. By specifying these conditions and effects differently for each planning program, the domain-expert subprogram defines roles that each spacecraft plays in a coordinated activity. The domain-expert subprogram also specifies which planning program has scheduling control over each shared activity. ShAC enables sharing of information, consensus over the scheduling of collaborative activities, and distributed conflict resolution. As the other planning programs incorporate new goals and alter their schedules in the changing environment, ShAC continually coordinates to respond to unexpected events.

Clement, Bradley↗

Particle Size Distributions Obtained Through Unfolding 2D Sections: Towards Accurate Distributions of Nebular Solids in the Allende Meteorite

Size distributions of nebular solids in chondrites suggest an efficient sorting of these early forming objects within the protoplanetary disk. The effect of this sorting has been documented by investigations of modal abundances of CAIs (e.g., [1-4]) and chondrules (e.g., [5-8]). Evidence for aerodynamic sorting in the disk is largely qualitative, and needs to be carefully assessed. It may be a way of concentrating these materials into planetesimal-mass clumps, perhaps 100 fs of ka after they formed. A key parameter is size/density distributions of particles (i.e., chondrules, CAIs, and metal grains), and in particular, whether the radius-density product (rxp) is a better metric for defining the distribution than r alone [9]. There is no consensus between r versus rxp based models. Here we report our initial tests and preliminary results, which when expanded will be used to test the accuracy of current dynamical disk models.

Christoffersen, P. A.↗

Continual coordination through shared activities

Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently reach consensus in real time. We briefly describe a largely unexplored class of realtime, distributed planning problems (inspired by interacting spacecraft missions), new challenges they pose, and a general approach to solving the problems. These problems involve self-interested agents that have infrequent communication but collaborate on joint activities. We describe a Shared Activity Coordination (SHAC) framework that provides a decentralized algorithm for negotiating the scheduling of shared activities over the lifetimes of separate missions, a soft, real-time approach to reaching consensus during execution with limited communication, and a foundation for customizing protocols for negotiating planner interactions. We apply SHAC to a realistic simulation of interacting Mars missions and illustrate the simplicity of protocol development.

planning↗

The Multi-Sensor Aerosol Products Sampling System (MAPSS) for Integrated Analysis of Satellite Retrieval Uncertainties

Among the known atmospheric constituents, aerosols represent the greatest uncertainty in climate research. Although satellite-based aerosol retrieval has practically become routine, especially during the last decade, there is often disagreement between similar aerosol parameters retrieved from different sensors, leaving users confused as to which sensors to trust for answering important science questions about the distribution, properties, and impacts of aerosols. As long as there is no consensus and the inconsistencies are not well characterized and understood ', there will be no way of developing reliable climate data records from satellite aerosol measurements. Fortunately, the most globally representative well-calibrated ground-based aerosol measurements corresponding to the satellite-retrieved products are available from the Aerosol Robotic Network (AERONET). To adequately utilize the advantages offered by this vital resource,., an online Multi-sensor Aerosol Products Sampling System (MAPSS) was recently developed. The aim of MAPSS is to facilitate detailed comparative analysis of satellite aerosol measurements from different sensors (Terra-MODIS, Aqua-MODIS, Terra-MISR, Aura-OMI, Parasol-POLDER, and Calipso-CALIOP) based on the collocation of these data products over AERONET stations. In this presentation, we will describe the strategy of the MAPSS system, its potential advantages for the aerosol community, and the preliminary results of an integrated comparative uncertainty analysis of aerosol products from multiple satellite sensors.

Ichoku, Charles↗

Toward a Coherent Detailed Evaluation of Aerosol Data Products from Multiple Satellite Sensors

Atmospheric aerosols represent one of the greatest uncertainties in climate research. Although satellite-based aerosol retrieval has practically become routine, especially during the last decade, there is often disagreement between similar aerosol parameters retrieved from different sensors, leaving users confused as to which sensors to trust for answering important science questions about the distribution, properties, and impacts of aerosols. As long as there is no consensus and the inconsistencies are not well characterized and understood, there will be no way of developing reliable climate data records from satellite aerosol measurements. Fortunately, the most globally representative well-calibrated ground-based aerosol measurements corresponding to the satellite-retrieved products are available from the Aerosol Robotic Network (AERONET). To adequately utilize the advantages offered by this vital resource, an online Multi-sensor Aerosol Products Sampling System (MAPSS) was recently developed. The aim of MAPSS is to facilitate detailed comparative analysis of satellite aerosol measurements from different sensors (Terra-MODIS, Aqua-MODIS, TerraMISR, Aura-OMI, Parasol-POLDER, and Calipso-CALIOP) based on the collocation of these data products over AERONET stations. In this presentation, we will describe the strategy of the MA~SS system, its potential advantages for the aerosol community, and the preliminary results of an integrated comparative uncertainly analysis of aerosol products from multiple satellite sensors.

Ichoku, Charles↗

Coherent Evaluation of Aerosol Data Products from Multiple Satellite Sensors

Aerosol retrieval from satellite has practically become routine, especially during the last decade. However, there is often disagreement between similar aerosol parameters retrieved from different sensors, thereby leaving users confused as to which sensors to trust for answering important science questions about the distribution, properties, and impacts of aerosols. As long as there is no consensus, and the inconsistencies are not well characterized and understood, there will be no way of developing reliable model inputs and climate data records from satellite aerosol measurements. Fortunately, the Aerosol Robotic Network (AERONET) is providing well-calibrated globally representative ground-based aerosol measurements corresponding to the satellite-retrieved products. Through a recently developed web-based Multi-sensor Aerosol Products Sampling System (MAPSS), we are utilizing the advantages offered by collocated AERONET and satellite products to characterize and evaluate aerosol retrieval from multiple sensors. Indeed, MAPSS and its companion statistical tool AeroStat are facilitating detailed comparative uncertainty analysis of satellite aerosol measurements from Terra-MODIS, Aqua-MODIS, Terra-MISR, Aura-OMI, Parasol-POLDER, and Calipso-CALIOP. In this presentation, we will describe the strategy of the MAPSS system, its potential advantages for the aerosol community, and the preliminary results of an integrated comparative uncertainly analysis of aerosol products from multiple satellite sensors.

Ichoku, Charles↗

Shared Activity Coordination

Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently reach consensus in real time. We briefly describe a largely unexplored class of real-time, distributed planning problems (inspired by interacting spacecraft missions), new challenges they pose, and a general approach to solving the problems. These problems involve self-interested agents that have infrequent communication but collaborate on joint activities. We describe a Shared Activity Coordination (SHAC) framework that provides a decentralized algorithm for negotiating the scheduling of shared activities in a dynamic environment, a soft, real-time approach to reaching consensus during execution with limited communication, and a foundation for customizing protocols for negotiating planner interactions. We apply SHAC to a realistic simulation of interacting Mars missions and illustrate the simplicity of protocol development.

coordination↗

Collaborative Pose Estimation of An Unknown Target Using Multiple Spacecraft

A reliable method for pose estimation of an unknown and uncooperative space target using monocular vision remains an open problem. Vision-based pose determination can be challenging in case of unfavorable illumination, time-varying conditions due to rotational motion and relative orbit, and scale ambiguity resolution. To address these challenges, we propose a novel collaborative pose determination algorithm called Multi- Spacecraft Simultaneous Estimation of Pose and Shape algorithm or M-SEPS.Within M-SEPS, a team of chaser spacecraft, each equipped with a monocular camera, exchange information over a local network to jointly estimate the relative kinematic state of the target and its sparse shape landmarks. In this approach, each spacecraft processes its own images and observes particular target landmarks in parallel and in a distributed fashion. Then, the local network is exploited by the spacecraft to share their consensus proposals and aggregate them to achieve the joint estimate. We validate our algorithm using simulations of relative orbits and observations, captured by each chaser spacecraft. To the best of the authors’ knowledge, this is the first cooperative, vision-based algorithm for estimating the pose and shape of a space object for an arbitrary number of spacecraft.

Chung, Soon-Jo↗

A study of occurrence rates of Electromagnetic Interference (EMI) to aircraft with a focus on HIRF (external) High Intensity Radiated Fields

This report presents the methodology and results of a subjective study done by Polytechnic University to investigate Electromagnetic Interference (EMI) events on aircraft. The results cover various types of EMI from on-board aircraft systems, passenger carry-on devices, and externally generated disturbances. The focus of the study, however, was on externally generated EMI, termed High Intensity Radiated Fields (HIRF), from radars, radio and television transmitters, and other man-made emitters of electromagnetic energy. The study methodology used an anonymous questionnaire distributed to experts to gather the data. This method is known as the Delphi or Consensus Estimation technique. The questionnaire was sent to an expert population of 230 and there were 57 respondents. Details of the questionnaire, a few anecdotes, and the statistical results of the study are presented.

Shooman, Martin L.↗

Low-energy ion acceleration at quasi-perpendicular shocks: Transverse diffusion

The problem of ion injection and acceleration at quasi perpendicular shocks has been the subject of some debate over the past two decades. It is widely known that these shocks efficiently accelerate particles that are well in the high-energy tail of the distribution. However, the issue of injection, or the acceleration of low-energy ions, has yet to reach a consensus. The fundamental issue is whether there is enough diffusion normal to the magnetic field for the particles to remain near the shock. Since transverse diffusion is a physical process that is not well understood in space plasmas, this is an important, and difficult issue to address. In this report, we will investigate the ion injection problem by performing test particle orbit integrations using synthesized turbulent fields. These fields are fully three-dimensional so that transverse diffusion is possible (cross-field diffusion is not possible in geometries where the electromagnetic fields are less than three dimensional). The synthesized fields are produced by superimposing a three-dimensional wave field on a background field. For completeness, we will compare the results from this model with the more well-established theories, such as the diffusive approximation and scatter-free shock drift acceleration. We will also compare these results with other numerical simulation techniques such as the well known hybrid simulation, and other test-particle calculations in which the shock fields are specified to have less than three dimensions. We will also discuss some recent relevant observations and how these compare with our results.

Giacalone, J.↗

Formal Specification and Parametric Verification of the ICAROUS Distributed Merging Protocol for Autonomous Aircraft Systems

ICAROUS is a software architecture that provides highly assured core software modules for building safety-centric autonomous unmanned aircraft applications. One of its core components is the ICAROUS distributed merging (IDM) protocol, which allows for decentralized merging of autonomous aircrafts through a designated intersection. This report presents initial results on formal specification and parametric verification of the IDM protocol. We present the development of a formal, discrete-time specification of the ICAROUS distributed merging protocol in TLA+. The developed TLA+ specification includes an abstracted model of the physical aircraft dynamics, the consensus machinery for leader election and coordination, and the computation of merging schedules. In addition, we present details on a command line tool we developed verimerge, that utilizes the TLC model checker for doing bounded, parametric verification and allows for plotting of these results in 2D parameter spaces. The tool also provides functionality for visualization of concrete protocol behaviors, to aid debugging and understanding. We present preliminary, bounded time verification results for a finite number of aircraft. Limitations of the current techniques and possible future extensions of this work are also discussed.

ICAROUS↗

Statistical methods and neural network approaches for classification of data from multiple sources

Statistical methods for classification of data from multiple data sources are investigated and compared to neural network models. A problem with using conventional multivariate statistical approaches for classification of data of multiple types is in general that a multivariate distribution cannot be assumed for the classes in the data sources. Another common problem with statistical classification methods is that the data sources are not equally reliable. This means that the data sources need to be weighted according to their reliability but most statistical classification methods do not have a mechanism for this. This research focuses on statistical methods which can overcome these problems: a method of statistical multisource analysis and consensus theory. Reliability measures for weighting the data sources in these methods are suggested and investigated. Secondly, this research focuses on neural network models. The neural networks are distribution free since no prior knowledge of the statistical distribution of the data is needed. This is an obvious advantage over most statistical classification methods. The neural networks also automatically take care of the problem involving how much weight each data source should have. On the other hand, their training process is iterative and can take a very long time. Methods to speed up the training procedure are introduced and investigated. Experimental results of classification using both neural network models and statistical methods are given, and the approaches are compared based on these results.

Benediktsson, Jon Atli↗