Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 19 of 19
Full-Text Articles in Engineering
Software And System Health Management For Autonomous Robotics Missions, Johann Schumann, Timmy Mbaya, Ole J. Mengshoel
Software And System Health Management For Autonomous Robotics Missions, Johann Schumann, Timmy Mbaya, Ole J. Mengshoel
Ole J Mengshoel
Advanced autonomous robotics space missions rely heavily on the flawless interaction of complex hardware, multiple sensors, and a mission-critical software system. This software system consists of an operating system, device drivers, controllers, and executives; recently highly complex AI-based autonomy software have also been introduced. Prior to launch, this software has to undergo rigorous verification and validation (V&V). Nevertheless, dormant software bugs, failing sensors, unexpected hardware-software interactions, and unanticipated environmental conditions—likely on a space exploration mission—can cause major software faults that can endanger the entire mission.
Our Integrated Software Health Management (ISWHM) system continuously monitors the hardware sensors and the software …
Reactive Bayesian Network Computation Using Feedback Control: An Empirical Study, Ole J. Mengshoel, Abe Ishihara, Erik Reed
Reactive Bayesian Network Computation Using Feedback Control: An Empirical Study, Ole J. Mengshoel, Abe Ishihara, Erik Reed
Ole J Mengshoel
Accelerating Bayesian Network Parameter Learning Using Hadoop And Mapreduce, Aniruddha Basak, Irina Brinster, Xianheng Ma, Ole J. Mengshoel
Accelerating Bayesian Network Parameter Learning Using Hadoop And Mapreduce, Aniruddha Basak, Irina Brinster, Xianheng Ma, Ole J. Mengshoel
Ole J Mengshoel
Age-Layered Expectation Maximization For Parameter Learning In Bayesian Networks, Avneesh Saluja, Priya Sundararajan, Ole J. Mengshoel
Age-Layered Expectation Maximization For Parameter Learning In Bayesian Networks, Avneesh Saluja, Priya Sundararajan, Ole J. Mengshoel
Ole J Mengshoel
Bayesian Software Health Management For Aircraft Guidance, Navigation, And Control, Johann M. Schumann, Timmy Mbaya, Ole J. Mengshoel
Bayesian Software Health Management For Aircraft Guidance, Navigation, And Control, Johann M. Schumann, Timmy Mbaya, Ole J. Mengshoel
Ole J Mengshoel
Modern aircraft — both piloted fly-by-wire commercial aircraft as well as UAVs — more and more depend on highly complex safety critical software systems with many sensors and computer-controlled actuators. Despite careful design and V&V of the software, severe incidents have happened due to malfunctioning software.
In this paper, we discuss the use of Bayesian networks to monitor the health of the on-board software and sensor system, and to perform advanced on-board diagnostic reasoning. We focus on the development of reliable and robust health models for combined software and sensor systems, with application to guidance, navigation, and control (GN&C). Our …
Integrating Probabilistic Reasoning And Statistical Quality Control Techniques For Fault Diagnosis In Hybrid Domains, Brian Ricks, Craig Harrison, Ole J. Mengshoel
Integrating Probabilistic Reasoning And Statistical Quality Control Techniques For Fault Diagnosis In Hybrid Domains, Brian Ricks, Craig Harrison, Ole J. Mengshoel
Ole J Mengshoel
Integrated Software And Sensor Health Management For Small Spacecraft, Johann Schumann, Ole J. Mengshoel, Timmy Mbaya
Integrated Software And Sensor Health Management For Small Spacecraft, Johann Schumann, Ole J. Mengshoel, Timmy Mbaya
Ole J Mengshoel
Despite their size, small spacecraft have highly complex architectures with many sensors and computer-controlled actuators. At the same time, size, weight, and budget constraints often dictate that small spacecraft are designed as single-string systems, which means that there are no or few redundant systems. Thus, all components, including software, must operate as reliably. Faults, if present, must be detected as early as possible to enable (usually limited) forms of mitigation. Telemetry bandwidth for such spacecraft is usually very limited. Therefore, fault detection and diagnosis must be performed on-board. Further restrictions include low computational power and small memory.
In this paper, …
Belief Propagation By Message Passing In Junction Trees: Computing Each Message Faster Using Gpu Parallelization, Lu Zheng, Ole J. Mengshoel, Jike Chong
Belief Propagation By Message Passing In Junction Trees: Computing Each Message Faster Using Gpu Parallelization, Lu Zheng, Ole J. Mengshoel, Jike Chong
Ole J Mengshoel
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, belief propagation over junction tree is known to be computationally intensive in the general case. Its complexity may increase dramatically with the connectivity and state space cardinality of Bayesian network nodes. In this paper, we address this computational challenge using GPU parallelization. We develop data structures and algorithms that extend existing junction tree techniques, and specifically develop a novel approach to computing each belief propagation message in parallel. We implement our approach on an NVIDIA …
Verification And Validation Of System Health Management Models Using Parametric Testing, Erik Reed, Johann Schumann, Ole J. Mengshoel
Verification And Validation Of System Health Management Models Using Parametric Testing, Erik Reed, Johann Schumann, Ole J. Mengshoel
Ole J Mengshoel
System Health Management (SHM) systems have found their way into many safety-critical aerospace and industrial applications. A SHM system processes readings from sensors throughout the system and uses a Health Management (HM) model to detect and identify potential faults (diagnosis) and to predict possible failures in the near future (prognosis). It is essential that a SHM system, which monitors a safety-critical component, must be at least as reliable and safe as the component itself—false alarms or missed adverse events can potentially result in catastrophic failures. The SHM system including the HM model, a piece of software, must therefore undergo rigorous …
Initialization And Restart In Stochastic Local Search: Computing A Most Probable Explanation In Bayesian Networks, Ole J. Mengshoel, David C. Wilkins, Dan Roth
Initialization And Restart In Stochastic Local Search: Computing A Most Probable Explanation In Bayesian Networks, Ole J. Mengshoel, David C. Wilkins, Dan Roth
Ole J Mengshoel
For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work, we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary …
Towards Software Health Management With Bayesian Networks, Johann Schumann, Ole J. Mengshoel, Ashok Srivastava, Adnan Darwiche
Towards Software Health Management With Bayesian Networks, Johann Schumann, Ole J. Mengshoel, Ashok Srivastava, Adnan Darwiche
Ole J Mengshoel
More and more systems (e.g., aircraft, machinery, cars) rely heavily on software, which performs safety-critical operations. Assuring software safety though traditional V&V has become a tremendous, if not impossible task, given the growing size and complexity of the software. We propose that iSWHM (Integrated SoftWare Health Management) can increase safety and reliability of high-assurance software systems. iSWHM uses advanced techniques from the area of system health management in order to continuously monitor the behavior of the software during operation, quickly detect anomalies and perform automatic and reliable root-cause analysis, while not replacing traditional V&V. Information provided by the iSWHM system …
Generalized Crowding For Genetic Algorithms, Ole J. Mengshoel, Severino F. Galan
Generalized Crowding For Genetic Algorithms, Ole J. Mengshoel, Severino F. Galan
Ole J Mengshoel
Understanding The Scalability Of Bayesian Network Inference Using Clique Tree Growth Curves, Ole J. Mengshoel
Understanding The Scalability Of Bayesian Network Inference Using Clique Tree Growth Curves, Ole J. Mengshoel
Ole J Mengshoel
One of the main approaches to performing computation in Bayesian networks (BNs) is clique tree clustering and propagation. The clique tree approach consists of propagation in a clique tree compiled from a BN, and while it was introduced in the 1980s, there is still a lack of understanding of how clique tree computation time depends on variations in BN size and structure. In this article, we improve this understanding by developing an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of …
Portfolios In Stochastic Local Search: Efficiently Computing Most Probable Explanations In Bayesian Networks, Ole J. Mengshoel, D Roth, D Wilkins
Portfolios In Stochastic Local Search: Efficiently Computing Most Probable Explanations In Bayesian Networks, Ole J. Mengshoel, D Roth, D Wilkins
Ole J Mengshoel
Portfolio methods support the combination of different algorithms and heuristics, including stochastic local search (SLS) heuristics, and have been identified as a promising approach to solve computationally hard problems. While successful in experiments, theoretical foundations and analytical results for portfolio-based SLS heuristics are less developed. This article aims to improve the understanding of the role of portfolios of heuristics in SLS. We emphasize the problem of computing most probable explanations (MPEs) in Bayesian networks (BNs). Algorithmically, we discuss a portfolio-based SLS algorithm for MPE computation, Stochastic Greedy Search (SGS). SGS supports the integration of different initialization operators (or initialization heuristics) …
Constraint Handling Using Tournament Selection: Abductive Inference In Partly Deterministic Bayesian Network, Severino F. Galan, Ole J. Mengshoel
Constraint Handling Using Tournament Selection: Abductive Inference In Partly Deterministic Bayesian Network, Severino F. Galan, Ole J. Mengshoel
Ole J Mengshoel
Constraints occur in many application areas of interest to evolutionary computation. The area considered here is Bayesian networks (BNs), which is a probability-based method for representing and reasoning with uncertain knowledge. This work deals with constraints in BNs and investigates how tournament selection can be adapted to better process such constraints in the context of abductive inference. Abductive inference in BNs consists of finding the most probable explanation given some evidence. Since exact abductive inference is NP-hard, several approximate approaches to this inference task have been developed. One of them applies evolutionary techniques in order to find optimal or close-to-optimal …
Methods For Probabilistic Fault Diagnosis: An Electrical Power System Case Study, Brian Ricks, Ole J. Mengshoel
Methods For Probabilistic Fault Diagnosis: An Electrical Power System Case Study, Brian Ricks, Ole J. Mengshoel
Ole J Mengshoel
Health management systems that more accurately and quickly diagnose faults that may occur in different technical systems on-board a vehicle will play a key role in the success of future NASA missions. We discuss in this paper the diagnosis of abrupt continuous (or parametric) faults within the context of probabilistic graphical models, more specifically Bayesian networks that are compiled to arithmetic circuits. This paper extends our previous research, within the same probabilistic setting, on diagnosis of abrupt discrete faults. Our approach and diagnostic algorithm ProDiagnose are domain-independent; however we use an electrical power system testbed called ADAPT as a case …
Sensor Validation Using Bayesian Networks, Ole J. Mengshoel, Adnan Darwiche, Serdar Uckun
Sensor Validation Using Bayesian Networks, Ole J. Mengshoel, Adnan Darwiche, Serdar Uckun
Ole J Mengshoel
One of NASA’s key mission requirements is robust state estimation. Sensing, using a wide range of sensors and sensor fusion approaches, plays a central role in robust state estimation, and there is a need to diagnose sensor failure as well as component failure. Sensor validation techniques address this problem: given a vector of sensor readings, decide whether sensors have failed, therefore producing bad data. We take in this paper a probabilistic approach, using Bayesian networks, to diagnosis and sensor validation, and investigate several relevant but slightly different Bayesian network queries. We emphasize that onboard inference can be performed on a …
Designing Resource-Bounded Reasoners Using Bayesian Networks: System Health Monitoring And Diagnosis, Ole J. Mengshoel
Designing Resource-Bounded Reasoners Using Bayesian Networks: System Health Monitoring And Diagnosis, Ole J. Mengshoel
Ole J Mengshoel
In this work we are concerned with the conceptual design of large-scale diagnostic and health management systems that use Bayesian networks. While they are potentially powerful, improperly designed Bayesian networks can result in too high memory requirements or too long inference times, to they point where they may not be acceptable for real-time diagnosis and health management in resource-bounded systems such as NASA’s aerospace vehicles. We investigate the clique tree clustering approach to Bayesian network inference, where increasing the size and connectivity of a Bayesian network typically also increases clique tree size. This paper combines techniques for analytically characterizing clique …
Controlled Generation Of Hard And Easy Bayesian Networks: Impact On Maximal Clique Size In Tree Clustering, Ole J. Mengshoel, David C. Wilkins, Dan Roth
Controlled Generation Of Hard And Easy Bayesian Networks: Impact On Maximal Clique Size In Tree Clustering, Ole J. Mengshoel, David C. Wilkins, Dan Roth
Ole J Mengshoel
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. The results are relevant to research on efficient Bayesian network inference, such as computing a most probable explanation or belief updating, since they allow controlled experimentation to determine the impact of improvements to inference algorithms. The results are also relevant to research on machine learning of Bayesian networks, since they support controlled generation of a large number of data sets at a given difficulty level. Our generation algorithms, called BPART and MPART, support controlled but random construction …