Search

As the deployment of artificial intelligence (AI) algorithms at edge devices becomes increasingly prevalent, enhancing the robustness and reliability of autonomous AI-based perception and decision systems is becoming as relevant as precision and performance, especially in applications areas considered safety-critical such as autonomous driving and aerospace. This paper delves into the robustness assessment in embedded Deep Neural Networks (DNNs), particularly focusing on the impact of parameter perturbations produced by single event upsets (SEUs) on convolutional neural networks (CNN) for image semantic segmentation. By scrutinizing the layer-by-layer and bit-by-bit sensitivity of various encoder–decoder models to soft errors, this study thoroughly investigates the vulnerability of segmentation DNNs to SEUs and evaluates the consequences of techniques like model pruning and parameter quantization on the robustness of compressed models aimed at embedded implementations. The findings offer valuable insights into the mechanisms underlying SEU-induced failures that allow for evaluating the robustness of DNNs once trained in advance. Moreover, based on the collected data, we propose a set of practical lightweight error mitigation techniques with no memory or computational cost suitable for resource-constrained deployments. The code used to perform the fault injection (FI) campaign is available at https://github.com/jonGuti13/TensorFI2 , while the code to implement proposed techniques is available at https://github.com/jonGuti13/parameterProtection. [ABSTRACT FROM AUTHOR]

Grid-interactive building control poses a critical challenge in the context of grid modernization and decarbonization. Recently, various artificial intelligence-based optimal control approaches have been proposed, providing innovative solutions to optimal building control problems. However, researchers and practitioners are now confronted with a dilemma when selecting appropriate control strategies, ranging from model-based (knowledge-incorporating) to learning-based (data-driven) approaches, and hybrid methods combining them. Although each algorithm in existing literature claims superiority over specific baselines, their performance has never been systematically compared and analyzed, owing to the absence of a unified platform for comprehensive evaluation. To fill this knowledge gap, we identify and implement all state-of-the-art approaches within a modular training and evaluation framework, assessing their efficacy in a grid-interactive building control problem. In this paper, we also introduce a streamlined hybrid method that complements existing hybrid approaches. Our comparative study reveals and quantifies the advantages of hybrid methods: on average, they achieve near-optimal control while requiring less than 14% of the online computation of traditional model-based methods. To achieve this performance, they need as few as 2% of the training samples of purely learning-based methods. Finally, we provide insights into the merits, limitations, and implementation of each method to help researchers better understand the state of the art and future directions. The software framework implemented in this study is open-sourced to facilitate future research. [ABSTRACT FROM AUTHOR]

Optimal path planning is a fundamental problem in artificial intelligence (AI) and has wide applications in areas such as robotics, transportation, and logistics. In this paper, we propose a novel approach for ordering algorithms in pathfinding problems using the concept of shell layers. Our approach aims to improve the computational efficiency and distance cost of ordering algorithms. To evaluate the effectiveness of our approach, we compare it with five state-of-the-art techniques commonly used in the field of ordering algorithms on eight different scenarios with varying configurations. Our results show that our proposed approach outperformed the state-of-the-art techniques in terms of time-computational complexity and distance cost in most of the scenarios, demonstrating its potential as a new state-of-the-art technique for ordering algorithms. Specifically, our approach outperformed the nearest neighbor, A*, branch and bound, Christofides, and genetics ordering algorithms. However, we also identified two specific situations where our approach was outperformed by two state-of-the-art algorithms due to the specific distribution of the goal nodes. These findings highlight the importance of evaluating and comparing ordering algorithms in various scenarios. Our approach has significant implications for AI research and development, as it has the potential to improve the performance of pathfinding algorithms in various applications. We also discuss the limitations of our approach and potential areas for further research, such as investigating the effectiveness of our approach in different types of graphs and exploring the potential use of machine learning techniques to optimize the shell layer construction. The code for this study is available at https://github.com/abdullah1aloush1/MuGONA. • Equally-spaced nodes formed over workspace with obstacles, optimizing search process. • Efficient neighboring graph built for equally-spaced nodes, reducing complexity. • Path optimization for navigation by ordering goal nodes, reducing time and distance. • Path smoothing for navigation via interpolation to yield a trajectory on path nodes. [ABSTRACT FROM AUTHOR]

In today's world of connectivity, various domains use different multi-sensor Internet of Things (IoT) and Intelligent Systems (IS) applications. These applications involve extensive interactions between thousands or millions of components in open environments, which challenges verifying their reliability and efficiency. This paper introduces the first investigation in verifying IoT applications and intelligent systems in multi-source data settings with multi-agent commitment protocols in uncertain or inconsistent environments. Specifically, we present original and efficient solutions for modeling and verifying these systems with conditional and unconditional commitment protocols under uncertain or inconsistent settings. We introduce 4v-CTL c and 4v-CTL c c , multi-valued logics of commitment for reasoning about inconsistency over these systems that expand 3v-CTL c and 3v-CTL c c for reasoning about uncertainty. Moreover, we introduce new reduction algorithms for reducing our multi-valued model checking problems to the two-valued ones. To implement these algorithms, we develop two new automatic verification tools. The first tool translates the multi-valued logics to CTL and automatically interacts with the NuSMV model checker. The second tool translates these logics to the two-valued versions, CTL c and CTL c c , and automatically interacts with the MCMAS+ model checker. We apply our verification approaches to a Smart Home, a Smart Hospital and a Smart Mortgage system with multi-source data as case studies using sets of properties, including safety, liveness and reachability. The experimental results obtained by the proposed multi-valued model checking techniques proved these techniques' high efficiency and applicability to modeling and verifying intelligent and autonomous multi-source data systems. • New multi-valued logics to reason about inconsistency in multi-source data settings. • Modeling IoT and IS applications using different multi-valued commitment logics. • New reduction-based model checking algorithms for multi-source data applications. • Implementing two new model checking tools: MCMAS-interactor and NuSMV-interactor. [ABSTRACT FROM AUTHOR]