This article addresses the localization problem in robotic autonomous luggage trolley collection at airports and provides a systematic evaluation of different methods to solve it. The robotic autonomous luggage trolley collection is a complex system that involves object detection, localization, motion planning and control, manipulation, etc. Among these components, effective localization is essential for the robot to employ subsequent motion planning and end-effector manipulation because it can provide a correct goal position. This article explores four popular and representative localization methods for object localization in luggage trolley collection: radio frequency identification (RFID), Keypoints, ultrawideband (UWB), and Reflectors. A qualitative evaluation framework is constructed to assess performance, encompassing Localization Accuracy, Mobile Power Supplies, Coverage Area, Cost, and Scalability. Furthermore, a series of quantitative experiments concerning Localization Accuracy and Success Rate have been conducted on a real-world robotic autonomous luggage trolley collection system. The performance of various localization methods is further analyzed based on experimental results, indicating that the Keypoints method is optimally suited for indoor environments to facilitate luggage trolley collection. Significantly, these experiment results provide a valuable reference point, extending the application of indoor localization methods across diverse scenarios. A website about this work is available at https://sites.google.com/view/localization-evaluation/.

Originating from a unique partnership between data scientists (datavaluepeople) and peacebuilders (Build Up), this commentary explores an innovative methodology to overcome key challenges in social media analysis by developing customized text classifiers through a participatory design approach, engaging both peace practitioners and data scientists. It advocates for researchers to focus on developing frameworks that prioritize being usable and participatory in field settings, rather than perfect in simulation. Focusing on a case study investigating the polarization within online Christian communities in the United States, we outline a testing process with a dataset consisting of 8954 tweets and 10,034 Facebook posts to experiment with active learning methodologies aimed at enhancing the efficiency and accuracy of text classification. This commentary demonstrates that the inclusion of domain expertise from peace practitioners significantly refines the design and performance of text classifiers, enabling a deeper comprehension of digital conflicts. This collaborative framework seeks to transition from a data-rich, analysis-poor scenario to one where data-driven insights robustly inform peacebuilding interventions.

Product engineering in general and advanced systems engineering in specific are highly complex and unique processes that strive to deliver innovations – successful new products. To reduce risk and time, product engineers refer to existing (socio-)technical systems or subsystems. These references are part of the reference system. A great variety of elements can be used as reference system elements in engineering projects, but the different types of reference system elements and their roles are not yet characterized. However, this is a necessary prerequisite to model and conduct product generation engineering effectively. Here, we show how reference system elements can be categorized into three types that differ regarding their intended application in the actual engineering project. Therefore, we introduce three subsystems: reference system of objectives, reference operation system, and reference system of objects. Furthermore, we provide definitions for all subsystems to specify the allocation. We believe these results will form the basis for a continuous description and continuous engineering of consecutive and parallel product generations based on model-based systems engineering. Furthermore, the results will be the starting point for the development of design supports to assist engineers in designing their specific reference systems and to make the reference system part of efficient engineering processes.

Alarm flood classification (AFC) methods are crucial in assisting human operators to identify and mitigate the overwhelming occurrences of alarm floods in industrial process plants, a challenge exacerbated by the complexity and data-intensive nature of modern process control systems. These alarm floods can significantly impair situational awareness and hinder decision-making. Existing AFC methods face difficulties in dealing with the inherent ambiguity in alarm sequences and the task of identifying novel, previously unobserved alarm floods. As a result, they often fail to accurately classify alarm floods. Addressing these significant limitations, this paper introduces a novel three-tier AFC method that uses alarm time series as input. In the transformation stage, alarm floods are subjected to an ensemble of convolutional kernel-based transformations (MultiRocket) to extract their characteristic dynamic properties, which are then fed into the classification stage, where a linear ridge regression classifier ensemble is used to identify recurring alarm floods. In the final novelty detection stage, the local outlier probability (LoOP) is used to determine a confidence measure of whether the classified alarm flood truly belongs to a known or previously unobserved class. Our method has been thoroughly validated using a publicly available dataset based on the Tennessee-Eastman process. The results show that our method outperforms two naive baselines and four existing AFC methods from the literature in terms of overall classification performance as well as the ability to optimize the balance between accurately identifying alarm floods from known classes and detecting alarm flood classes that have not been observed before.

In this paper, we use an information theoretic approach called cumulative residual extropy (CRJ) to compare mixed used systems. We establish mixture representations for the CRJ of mixed used systems and then explore the measure and comparison results among these systems. We compare the mixed used systems based on stochastic orders and stochastically ordered conditional coefficients vectors. Additionally, we derive bounds for the CRJ of mixed used systems with independent and identically distributed components. We also propose the Jensen-cumulative residual extropy (JCRJ) divergence to calculate the complexity of systems. To demonstrate the utility of these results, we calculate and compare the CRJ and JCRJ divergence of mixed used systems in the Exponential model. Furthermore, we determine the optimal system configuration based on signature under a criterion function derived from JCRJ in the exponential model.

We study the mixing time of the single-site update Markov chain, known as the Glauber dynamics, for generating a random independent set of a tree. Our focus is obtaining optimal convergence results for arbitrary trees. We consider the more general problem of sampling from the Gibbs distribution in the hard-core model where independent sets are weighted by a parameter $\lambda \gt 0$; the special case $\lambda =1$ corresponds to the uniform distribution over all independent sets. Previous work of Martinelli, Sinclair and Weitz (2004) obtained optimal mixing time bounds for the complete $\Delta$-regular tree for all $\lambda$. However, Restrepo, Stefankovic, Vera, Vigoda, and Yang (2014) showed that for sufficiently large $\lambda$ there are bounded-degree trees where optimal mixing does not hold. Recent work of Eppstein and Frishberg (2022) proved a polynomial mixing time bound for the Glauber dynamics for arbitrary trees, and more generally for graphs of bounded tree-width.

We establish an optimal bound on the relaxation time (i.e., inverse spectral gap) of $O(n)$ for the Glauber dynamics for unweighted independent sets on arbitrary trees. We stress that our results hold for arbitrary trees and there is no dependence on the maximum degree $\Delta$. Interestingly, our results extend (far) beyond the uniqueness threshold which is on the order $\lambda =O(1/\Delta )$. Our proof approach is inspired by recent work on spectral independence. In fact, we prove that spectral independence holds with a constant independent of the maximum degree for any tree, but this does not imply mixing for general trees as the optimal mixing results of Chen, Liu, and Vigoda (2021) only apply for bounded-degree graphs. We instead utilize the combinatorial nature of independent sets to directly prove approximate tensorization of variance via a non-trivial inductive proof.

Pipelines are used in many sectors to transport materials such as fluid from one place to another. These pipelines require regular inspection and maintenance to ensure proper operations and to avoid accidents. Many in-pipe navigation robots have been developed to perform the inspection. Soft in-pipe navigation robot is a special class of in-pipe robot, where the structure is made entirely of soft materials. The soft in-pipe robots are cheaper, lightweight, robust, and more adaptable to the environment inside pipelines as compared to the traditional rigid in-pipe navigation robot. This paper reviews the design of different types of soft in-pipe navigation in terms of the material, structure, locomotion strategy, and actuation techniques. These four different aspects of the design help researchers to narrow down their research and explore different opportunities within each of the design aspects. This paper also offers suggestions on the direction of research to improve the current soft in-pipe navigation robot design.