To Örebro University

Behavior trees (BTs) are increasingly popular in the robotics community. Yet in the growing body of published work on this topic, there is a lack of consensus on what to measure and how to quantify BTs when reporting results. This is not only due to the lack of standardized measures, but due to the sometimes ambiguous use of definitions to describe BT properties. This work provides a comprehensive overview of BT properties the community is interested in, how they relate to each other, the metrics currently used to measure BTs, and whether the metrics appropriately quantify those properties of interest. Finally, we provide the practitioner with a set of metrics to measure, as well as insights into the properties that can be derived from those metrics. By providing this holistic view of properties and their corresponding evaluation metrics, we hope to improve clarity when using BTs in robotics. This more systematic approach will make reported results more consistent and comparable when evaluating BTs.

Gas Distribution Mapping (GDM) is essential in monitoring hazardous environments, where uneven sampling and spatial sparsity of data present significant challenges. Traditional methods for GDM often fall short in accuracy and expressiveness. Modern learning-based approaches employing Convolutional Neural Networks (CNNs) require regular-sized input data, limiting their adaptability to irregular and sparse datasets typically encountered in GDM. This study addresses these shortcomings by showcasing Graph Neural Networks (GNNs) for learningbased GDM on irregular and spatially sparse sensor data. Our Radius-Based, Bi-Directionally connected GNN (RABI-GNN) was trained on a synthetic gas distribution dataset on which it outperforms our previous CNN-based model while overcoming its constraints. We demonstrate the flexibility of RABI-GNN by applying it to real-world data obtained in an industrial steel factory, highlighting promising opportunities for more accurate GDM models.

In real-world scenarios, gas sensor responses to mixtures of different compositions can be costly to determine a-priori, posing difficulties in identifying the presence of target analytes. In this paper, we propose the use of graph convolutional networks (GCN) to handle gas mixtures with few labelled data. We transform sensor responses into a graph structure using manifold learning and clustering, and then apply GCN for semisupervised node classification. Our approach does not require extensive training data of gas mixtures like many competing approaches, but it outperforms classical semi-supervised learning methods and achieves classification accuracy exceeding 88.5% and over 0.85 Cohen's kappa score given only 5% labelled data for training. This result demonstrates the potential towards realistic gas identification when varied mixtures are present.

Mathematical solvers use parametrized Optimization Problems (OPs) as inputs to yield optimal decisions. In many real-world settings, some of these parameters are unknown or uncertain. Recent research focuses on predicting the value of these unknown parameters using available contextual features, aiming to decrease decision regret by adopting end-to-end learning approaches. However, these approaches disregard prediction uncertainty and therefore make the mathematical solver susceptible to provide erroneous decisions in case of low-confidence predictions. We propose a novel framework that models prediction uncertainty with Bayesian Neural Networks (BNNs) and propagates this uncertainty into the mathematical solver with a Stochastic Programming technique. The differentiable nature of BNNs and differentiable mathematical solvers allow for two different learning approaches: In the Decoupled learning approach, we update the BNN weights to increase the quality of the predictions' distribution of the OP parameters, while in the Combined learning approach, we update the weights aiming to directly minimize the expected OP's cost function in a stochastic end-to-end fashion. We do an extensive evaluation using synthetic data with various noise properties and a real dataset, showing that decisions regret are generally lower (better) with both proposed methods. The code is available at https://github.com/AlanLahoud/BNNSOP.

Gas Distribution Mapping (GDM) is a valuable tool for monitoring the distribution of gases in a wide range of applications, including environmental monitoring, emergency response, and industrial safety. While GDM is actively researched in the scope of gas-sensitive mobile robots (Mobile Robot Olfaction), there is a potential for broader applications utilizing sensor networks. This study aims to address the lack of deep learning approaches in GDM and explore their potential for improved mapping of gas distributions. In this paper, we introduce Gas Distribution Decoder (GDD), a learning-based GDM method. GDD is a deep neural network for spatial interpolation between sparsely distributed sensor measurements that was trained on an extensive data set of realistic-shaped synthetic gas plumes based on actual airflow measurements. As access to ground truth representations of gas distributions remains a challenge in GDM research, we make our data sets, along with our models, publicly available. We test and compare GDD with state-of-the-art models on synthetic and real- world data. Our findings demonstrate that GDD significantly outperforms existing models, demonstrating a 35% improvement in accuracy on synthetic data when measured using the Root Mean Squared Error over the entire distribution map. Notably, GDD appears to have superior capabilities in reconstructing the edges and characteristic shapes of gas plumes compared to traditional models. These potentials offer new possibilities for more accurate and efficient environmental monitoring, and we hope to inspire other researchers to explore learning-based GDM.

One of the difficulties of using AI planners in industrial applications pertains to the complexity of writing planning domain models. These models are typically constructed by domain planning experts and can become increasingly difficult to codify for large applications. In this paper, we describe our ongoing research on a novel approach to automatically learn planning domains from previously executed traces using Behavior Trees as an intermediate human-readable structure. By involving human planning experts in the learning phase, our approach can benefit from their validation. This paper outlines the initial steps we have taken in this research, and presents the challenges we face in the future.

The increased popularity of Behavior Trees (BTs) in different fields of robotics requires efficient methods for learning BTs from data instead of tediously handcrafting them. Recent research in learning from demonstration reported encouraging results that this letter extends, improves and generalizes to arbitrary planning domains. We propose BT-Factor as a new method for learning expert knowledge by representing it in a BT. Execution traces of previously manually designed plans are used to generate a BT employing a combination of decision tree learning and logic factorization techniques originating from circuit design. We test BT-Factor in an industrially-relevant simulation environment from a mining scenario and compare it against a state-of-the-art BT learning method. The results show that our method generates compact BTs easy to interpret, and capable to capture accurately the relations that are implicit in the training data.

Robotic mapping provides spatial information for autonomous agents. Depending on the tasks they seek to enable, the maps created range from simple 2D representations of the environment geometry to complex, multilayered semantic maps. This survey article is about maps of dynamics (MoDs), which store semantic information about typical motion patterns in a given environment. Some MoDs use trajectories as input, and some can be built from short, disconnected observations of motion. Robots can use MoDs, for example, for global motion planning, improved localization, or human motion prediction. Accounting for the increasing importance of maps of dynamics, we present a comprehensive survey that organizes the knowledge accumulated in the field and identifies promising directions for future work. Specifically, we introduce field-specific vocabulary, summarize existing work according to a novel taxonomy, and describe possible applications and open research problems. We conclude that the field is mature enough, and we expect that maps of dynamics will be increasingly used to improve robot performance in real-world use cases. At the same time, the field is still in a phase of rapid development where novel contributions could significantly impact this research area.

We present a system designed to monitor the well-being of older adults during their daily activities. To automatically detect and classify their emotional state, we collect physiological data through a wearable medical sensor. Ground truth data are obtained using a simple smartphone app that provides ecological momentary assessment (EMA), a method for repeatedly sampling people's current experiences in real time in their natural environments. We are making the resulting dataset publicly available as a benchmark for future comparisons and methods. We are evaluating two feature selection methods to improve classification performance and proposing a feature set that augments and contrasts domain expert knowledge based on time-analysis features. The results demonstrate an improvement in classification accuracy when using the proposed feature selection methods. Furthermore, the feature set we present is better suited for predicting emotional states in a leave-one-day-out experimental setup, as it identifies more patterns.

Stack-of-Tasks (SoT) control allows a robot to simultaneously fulfill a number of prioritized goals formulated in terms of (in)equality constraints in error space. Since this approach solves a sequence of Quadratic Programs (QP) at each time-step, without taking into account any temporal state evolution, it is suitable for dealing with local disturbances. However, its limitation lies in the handling of situations that require non-quadratic objectives to achieve a specific goal, as well as situations where countering the control disturbance would require a locally suboptimal action. Recent works address this shortcoming by exploiting Finite State Machines (FSMs) to compose the tasks in such a way that the robot does not get stuck in local minima. Nevertheless, the intrinsic trade-off between reactivity and modularity that characterizes FSMs makes them impractical for defining reactive behaviors in dynamic environments. In this letter, we combine the SoT control strategy with Behavior Trees (BTs), a task switching structure that addresses some of the limitations of the FSMs in terms of reactivity, modularity and re-usability. Experimental results on a Franka Emika Panda 7-DOF manipulator show the robustness of our framework, that allows the robot to benefit from the reactivity of both SoT and BTs.