Precise and efficient performance in remote robotic teleoperation relies on intuitive interaction. This requires both accurate control actions and complete perception (vision, haptic, and other sensory feedback) of the remote environment. Especially in immersive remote teleoperation, the complete perception of remote environments in 3D allows operators to gain improved situational awareness. Color and Depth (RGB-D) cameras capture remote environments as dense 3D point clouds for real-time visualization. However, providing enough situational awareness needs fast, high-quality data transmission from acquisition to virtual reality rendering. Unfortunately, dense point-cloud data can suffer from network delays and limits, impacting the teleoperator’s situational awareness. Understanding how the human eye works can help mitigate these challenges. This paper introduces a solution by implementing foveation, mimicking the human eye’s focus by smartly sampling and rendering dense point clouds for an intuitive remote teleoperation interface. This provides high resolution in the user’s central field, which gradually reduces toward the edges. However, this systematic visualization approach in the peripheral vision may benefit or risk losing information and burdening the user’s cognitive load. This work investigates these advantages and drawbacks through an experimental study and describes the overall system, with its software, hardware, and communication framework. This will show significant enhancements in both latency and throughput, surpassing 60% and 40% improvements in both aspects when compared with state-of-the-art research works. A user study reveals that the framework has minimal impact on the user’s visual quality of experience while helping to reduce the error rate significantly. Further, a 50% reduction in task execution time highlights the benefits of the proposed framework in immersive remote telerobotics applications.

This paper deals with the optimization of a new redundant spherical parallel manipulator (New SPM). This manipulator consists of two spherical five-bar mechanisms connected by the end-effector, providing three degrees of freedom, and has an unlimited self-rotation capability. Three optimization procedures based on the genetic algorithm method were carried out to improve the dexterity of the New SPM. The first and the second optimizations were applied to a symmetric New SPM structure, while the third was applied to an asymmetric New SPM structure. In both cases, the optimization was performed using an objective function defined by the quadratic sum of link angles. In addition, certain criteria and constraints were implemented. The obtained results demonstrate significant improvements in the dexterity of the New SPM and its capability of an unlimited self-rotate in an extended workspace. A comparison of the self-rotation performances between the classical 3-RRR SPM (R for revolute joint) and the New SPM is also presented.

One of the goals of open science is to promote the transparency and accessibility of research. Sharing data and materials used in network research is critical to these goals. In this paper, we present recommendations for whether, what, when, and where network data and materials should be shared. We recommend that network data and materials should be shared, but access to or use of shared data and materials may be restricted if necessary to avoid harm or comply with regulations. Researchers should share the network data and materials necessary to reproduce reported results via a publicly accessible repository when an associated manuscript is published. To ensure the adoption of these recommendations, network journals should require sharing, and network associations and academic institutions should reward sharing.

In recent years, unmanned aerial vehicles (UAVs) have been applied in underground mine inspection and other similar works depending on their versatility and mobility. However, accurate localization of UAVs in perceptually degraded mines is full of challenges due to the harsh light conditions and similar roadway structures. Due to the unique characteristics of the underground mines, this paper proposes a semantic knowledge database-based localization method for UAVs. By minimizing the spatial point-to-edge distance and point-to-plane distance, the relative pose constraint factor between keyframes is designed for UAV continuous pose estimation. To reduce the accumulated localization errors during the long-distance flight in a perceptual-degraded mine, a semantic knowledge database is established by segmenting the intersection point cloud from the prior map of the mine. The topological feature of the current keyframe is detected in real time during the UAV flight. The intersection position constraint factor is constructed by comparing the similarity between the topological feature of the current keyframe and the intersections in the semantic knowledge database. Combining the relative pose constraint factor of LiDAR keyframes and the intersection position constraint factor, the optimization model of the UAV pose factor graph is established to estimate UAV flight pose and eliminate the cumulative error. Two UAV localization experiments conducted on the simulated large-scale Edgar Mine and a mine-like indoor corridor indicate that the proposed UAV localization method can realize accurate localization during long-distance flight in degraded mines.

The autonomous navigation and obstacle avoidance capabilities of autonomous underwater vehicles (AUVs) are essential for ensuring their safe navigation and long-term, efficient operation. However, the complexity of the marine environment poses significant challenges to safe and effective obstacle avoidance. To address this issue, this study proposes an AUV obstacle avoidance control algorithm based on offline reinforcement learning. This method adopts the Conservative Q-learning (CQL) algorithm, which is based on the Soft Actor-Critic (SAC) framework. It learns from obtained historical obstacle avoidance data and ultimately achieves a favorable obstacle avoidance control strategy. In this method, PID and SAC control algorithms are utilized to generate expert obstacle avoidance data to construct a diversified offline database. Additionally, based on the line-of-sight (LOS) guidance method and artificial potential field (APF) method, information regarding the distance and orientation of targets and obstacles is incorporated into the state space, and heading and obstacle avoidance reward terms are integrated into the reward function design. The algorithm successfully guides the AUV in autonomous navigation and dynamic obstacle avoidance in three-dimensional space. Furthermore, the algorithm exhibits a certain degree of anti-interference capability against uncertain disturbances and ocean currents, enhancing the safety and robustness of the AUV system. Simulation results fully demonstrate the feasibility and effectiveness of the intelligent obstacle avoidance method based on offline reinforcement learning. This study highlights the profound significance of offline reinforcement learning in enabling robust and reliable control systems for AUVs, paving the way for enhanced operational capabilities in challenging marine environments.

The robots of tomorrow should be endowed with the ability to adapt to drastic and unpredicted changes in their environment and interactions with humans. Such adaptations, however, cannot be boundless: the robot must stay trustworthy. So, the adaptations should not be just a recovery into a degraded functionality. Instead, they must be true adaptations: the robot must change its behaviour while maintaining or even increasing its expected performance and staying at least as safe and robust as before. The RoboSAPIENS project will focus on autonomous robotic software adaptations and will lay the foundations for ensuring that they are carried out in an intrinsically trustworthy, safe and efficient manner, thereby reconciling open-ended self-adaptation with safety by design. RoboSAPIENS will transform these foundations into ‘first time right’-design tools and platforms and will validate and demonstrate them.

Catamorphisms are functions that are recursively defined on list and trees and, in general, on algebraic data types (ADTs), and are often used to compute suitable abstractions of programs that manipulate ADTs. Examples of catamorphisms include functions that compute size of lists, orderedness of lists, and height of trees. It is well known that program properties specified through catamorphisms can be proved by showing the satisfiability of suitable sets of constrained Horn clauses (CHCs). We address the problem of checking the satisfiability of those sets of CHCs, and we propose a method for transforming sets of CHCs into equisatisfiable sets where catamorphisms are no longer present. As a consequence, clauses with catamorphisms can be handled without extending the satisfiability algorithms used by existing CHC solvers. Through an experimental evaluation on a nontrivial benchmark consisting of many list and tree processing algorithms expressed as sets of CHCs, we show that our technique is indeed effective and significantly enhances the performance of state-of-the-art CHC solvers.

In recent years, dangerous gas leakage events occur frequently. Rapid and accurate location of gas leakage sources by mobile robots is the key to avoid the expansion of disasters. In order to solve the problem of discontinuous gas concentration gradient and sparse gas environment in three-dimensional space, particle filter, and whale swarm optimization algorithm are integrated to locate gas source. Firstly, the Z-shape search and comb search are used to locate the plume, and then, the particle filter algorithm is combined with the whale optimization method to guide the particle movement, and the random inertial disturbance term is designed to improve the convergence speed and search accuracy of the algorithm. Experimental results in three-dimensional environment show that the proposed information-driven particle filter whale optimization hybrid algorithm effectively guides the robot in localizing gas source within a certain range, significantly enhancing both the efficiency and accuracy of localization compared to other algorithms.

This article presents a comprehensive evaluation of two nuclear-rated bilateral telerobotic systems, Telbot and Dexter, focusing on critical performance metrics such as effort transparency, stiffness, and backdrivability. Despite the absence of standardized evaluation methodologies for these systems, this study identifies key gaps by experimentally assessing the quantitative performance of both systems under controlled conditions. The results reveal that Telbot exhibits higher stiffness, but at the cost of greater effort transmission, whereas Dexter offers smoother backdrivability. Furthermore, positional discrepancies were observed during the tests, particularly in nonlinear positional displacements. These findings highlight the need for standardized evaluation methods, contributing to the development, manufacturing, and procurement processes of future bilateral telerobotic systems.

Descriptions of various subsets of $\mathbb{SO}(3)$ are encountered frequently in robotics, for example, in the context of specifying the orientation workspaces of manipulators. Often, the Cartesian concept of a cuboid is extended into the domain of Euler angles, notwithstanding the fact that the physical implications of this practice are not documented. Motivated by this lacuna in the existing literature, this article focuses on studying sets of rotations described by such cuboids by mapping them to the space of Rodrigues parameters, where a physically meaningful measure of distance from the origin is available and the spherical geometry is intrinsically pertinent. It is established that the planar faces of the said cuboid transform into hyperboloids of one sheet and hence, the cuboid itself maps into a solid of complicated non-convex shape. To quantify the extents of these solids, the largest spheres contained within them are computed analytically. It is expected that this study would help in the process of design and path planning of spatial robots, especially those of parallel architecture, due to a better and quantitative understanding of their orientation workspaces.

Hybrid MKNF Knowledge Bases (HMKNF-KBs) constitute a formalism for tightly integrated reasoning over closed-world rules and open-world ontologies. This approach allows for accurate modeling of real-world systems, which often rely on both categorical and normative reasoning. Conflict-driven solving is the leading approach for computationally hard problems, such as satisfiability (SAT) and answer set programming (ASP), in which MKNF is rooted. This paper investigates the theoretical underpinnings required for a conflict-driven solver of HMKNF-KBs. The approach defines a set of completion and loop formulas, whose satisfaction characterizes MKNF models. This forms the basis for a set of nogoods, which in turn can be used as the backbone for a conflict-driven solver.

FOLD-RM is an explainable machine learning classification algorithm that uses training data to create a set of classification rules. In this paper, we introduce CON-FOLD which extends FOLD-RM in several ways. CON-FOLD assigns probability-based confidence scores to rules learned for a classification task. This allows users to know how confident they should be in a prediction made by the model. We present a confidence-based pruning algorithm that uses the unique structure of FOLD-RM rules to efficiently prune rules and prevent overfitting. Furthermore, CON-FOLD enables the user to provide preexisting knowledge in the form of logic program rules that are either (fixed) background knowledge or (modifiable) initial rule candidates. The paper describes our method in detail and reports on practical experiments. We demonstrate the performance of the algorithm on benchmark datasets from the UCI Machine Learning Repository. For that, we introduce a new metric, Inverse Brier Score, to evaluate the accuracy of the produced confidence scores. Finally, we apply this extension to a real-world example that requires explainability: marking of student responses to a short answer question from the Australian Physics Olympiad.

There is an unavoidable time offset between the camera stream and the inertial measurement unit (IMU) data due to the sensor triggering and transmission delays, which will seriously affect the accuracy of visual-inertial odometry (VIO). A novel online time calibration framework via double-stage EKF for VIO is proposed in this paper. First, the first-stage complementary Kalman filter is constructed by adapting the complementary characteristics between the accelerometer and the gyroscope in the IMU, where the rotation result predicted by the gyroscope is corrected through the measurement of the accelerometer so that the IMU can output a more accurate initial pose. Second, the unknown time offset is added to the state vector of the VIO system. The estimated pose of IMU is used as the prediction information, and the reprojection error of multiple cameras on the same feature point is used as the constraint information. During the operation of the VIO system, the time offset is continuously calculated and superimposed on the IMU timestamp to obtain the data synchronized by the IMU and the camera. The Schur complement model is used to marginalize the camera state that carries less information in the system state, avoiding the loss of prior information between images, and improving the accuracy of camera pose estimation. Finally, the effectiveness of proposed algorithm is verified using the EuRoC dataset and the real experimental data.

Informal digital learning of English (IDLE) is a promising way of learning English that has received growing attention in recent years. It has positive effects on English as a foreign language (EFL) learners and also creates valuable opportunities for EFL teachers to improve their teaching skills. However, there has been a lack of a valid and reliable scale to measure IDLE among teachers in EFL contexts. To address this lacuna, this study aims to develop and validate a scale to measure IDLE for EFL teachers in Iran. For this purpose, a nine-step rigorous validation procedure was undertaken: administering pilot interviews; creating the first item pool; running expert judgment; running interviews and think-aloud protocol; running the pilot study; performing exploratory factor analysis, Cronbach’s alpha, and confirmatory factor analysis; creating the second item pool; conducting expert reviews; and performing translation and translation quality check. Findings yielded a 41-item scale with six subscales: IDLE-enhanced benefits (12 items), IDLE practice (five items), support from others (nine items), authentic L2 experience (three items), resources and cognition (four items), and frequency and device (eight items). The scale demonstrated satisfactory psychometric properties such that it can be used for research and educational purposes in future.

Answer set programming (ASP) has demonstrated its potential as an effective tool for concisely representing and reasoning about real-world problems. In this paper, we present an application in which ASP has been successfully used in the context of dynamic traffic distribution for urban networks, within a more general framework devised for solving such a real-world problem. In particular, ASP has been employed for the computation of the “optimal” routes for all the vehicles in the network. We also provide an empirical analysis of the performance of the whole framework, and of its part in which ASP is employed, on two European urban areas, which shows the viability of the framework and the contribution ASP can give.

This article presents a domain-specific language for writing highly structured multilevel system specifications. The language effectively bridges the gap between requirements engineering and systems architecting by enabling the direct derivation of a dependency graph from the system specifications. The dependency graph allows for the easy manipulation, visualization and analysis of the system architecture, ensuring the consistency among written system specifications and visual system architecture models. The system architecture models provide direct feedback on the completeness of the system specifications. The language and associated tooling has been made publicly available and has been applied in several industrial case studies. In this article, the fundamental concepts and way of working of the language are explained using an illustrative example.

DatalogMTL is an extension of Datalog with metric temporal operators that has found an increasing number of applications in recent years. Reasoning in DatalogMTL is, however, of high computational complexity, which makes reasoning in modern data-intensive applications challenging. In this paper we present a practical reasoning algorithm for the full DatalogMTL language, which we have implemented in a system called MeTeoR. Our approach effectively combines an optimised (but generally non-terminating) materialisation (a.k.a. forward chaining) procedure, which provides scalable behaviour, with an automata-based component that guarantees termination and completeness. To ensure favourable scalability of the materialisation component, we propose a novel seminaïve materialisation procedure for DatalogMTL enjoying the non-repetition property, which ensures that each rule instance will be applied at most once throughout its entire execution. Moreover, our materialisation procedure is enhanced with additional optimisations which further reduce the number of redundant computations performed during materialisation by disregarding rules as soon as it is certain that they cannot derive new facts in subsequent materialisation steps. Our extensive evaluation supports the practicality of our approach.

We investigate the number of maximal cliques, that is, cliques that are not contained in any larger clique, in three network models: Erdős–Rényi random graphs, inhomogeneous random graphs (IRGs) (also called Chung–Lu graphs), and geometric inhomogeneous random graphs (GIRGs). For sparse and not-too-dense Erdős–Rényi graphs, we give linear and polynomial upper bounds on the number of maximal cliques. For the dense regime, we give super-polynomial and even exponential lower bounds. Although (G)IRGs are sparse, we give super-polynomial lower bounds for these models. This comes from the fact that these graphs have a power-law degree distribution, which leads to a dense subgraph in which we find many maximal cliques. These lower bounds seem to contradict previous empirical evidence that (G)IRGs have only few maximal cliques. We resolve this contradiction by providing experiments indicating that, even for large networks, the linear lower-order terms dominate, before the super-polynomial asymptotic behavior kicks in only for networks of extreme size.

This study explores the integration of generative artificial intelligence (GenAI) in informal digital learning of English (IDLE) practices, focusing on its potential to enhance language learning outcomes and addressing the technological challenges language teachers face in utilising AI-based tools to facilitate second language acquisition. Based on the research context of IDLE and holistic learning ecology and drawing on the theoretical frameworks of technological pedagogical and content knowledge and social cognitive theory, we performed a mixed-methods investigation with an empirical experiment to assess the effectiveness of GenAI followed by semi-structured interviews. The results suggest that the GenAI-mediated IDLE practices effectively improve college students’ oral proficiency in English from both technological and humanistic perspectives. However, results also indicate that the GenAI conversational partner alone is not adequate to provoke continuous extramural GenAI-mediated IDLE practices. We discuss the theoretical and pragmatic significance of GenAI-mediated IDLE in educational equity and reformation.