A Survey of Underwater Multi-Robot Systems

As a cross-cutting field between ocean development and multi-robot system(MRS),the underwater multi-robot system(UMRS)has gained increasing attention from researchers and engineers in recent decades.In this paper,we present a comprehensive survey of cooperation issues,one of the key components of UMRS,from the perspective of the emergence of new functions.More specifically,we categorize the cooperation in terms of task-space,motion-space,measurement-space,as well as their combination.Further,we analyze the architecture of UMRS from three aspects,i.e.,the performance of the individual underwater robot,the new functions of underwater robots,and the technical approaches of MRS.To conclude,we have discussed related promising directions for future research.This survey provides valuable insight into the reasonable utilization of UMRS to attain diverse underwater tasks in complex ocean application scenarios.

Gini Coefficient-based Task Allocation for Multi-robot Systems With Limited Energy Resources

Nowadays, robots generally have a variety of capabilities, which often form a coalition replacing human to work in dangerous environment, such as rescue, exploration, etc. In these operating conditions, the energy supply of robots usually cannot be guaranteed. If the energy resources of some robots are consumed too fast, the number of the future tasks of the coalition will be affected. This paper will develop a novel task allocation method based on Gini coefficient to make full use of limited energy resources of multi-robot system to maximize the number of tasks. At the same time, considering resources consumption,we incorporate the market-based allocation mechanism into our Gini coefficient-based method and propose a hybrid method,which can flexibly optimize the task completion number and the resource consumption according to the application contexts.Experiments show that the multi-robot system with limited energy resources can accomplish more tasks by the proposed Gini coefficient-based method, and the hybrid method can be dynamically adaptive to changes of the work environment and realize the dual optimization goals.

Deadlock-free dynamic resource assignment in multi-robot systems with multiple missions:application in wireless sensor networks

In unstructured environments, dynamic resource assignment is required for effective cooperation of robot teams. In some scenarios, robots are in charge of executing multiple missions simultaneously. This creates risks of deadlock due to the presence of shared resources among various missions. The main contribution of this paper is the development of a novel approach that combines the one-step look-ahead deadlock avoidance policy with dynamic resource assignment. The dynamicresource assignment is achieved using greedy resource assignment for multi-mission robot teams in the framework of a matrix-based discrete event controller. Simulation results are presented in MATLAB to discuss in detail the proposed control strategy. The paper also discusses the toolkit developed in LabVIEW which is used to implement this control framework using a suitable example.

New coordination scheme for multi-robot systems based on state space models

A new coordination scheme for multi-robot systems is proposed. A state space model of the multi- robot system is defined and constructed in which the system＇s initial and goal states are included along with the task definition and the system＇s internal and external constraints. Task accomplishment is considered a transition of the system state in its state space （SS） under the system＇s constraints. Therefore, if there exists a connectable path within reachable area of the SS from the initial state to the goal state, the task is realizable. The optimal strategy for the task realization under constraints is investigated and reached by searching for the optimal state transition trajectory of the robot system in the SS. Moreover, if there is no connectable path, which means the task cannot be performed Successfully, the task could be transformed to be realizable by making the initial state and the goal state connectable and finding a path connecting them in the system＇s SS. This might be done via adjusting the system＇s configuration and/or task constraints. Experiments of multi-robot formation control with obstacles in the environment are conducted and simulation results show the validity of the proposed method.

COLLISION-FREE OF MULTI-ROBOT SYSTEMS IN VIRTUAL ENVIRONMENT

This paper described a new method to plan out welding paths for multiple robots in virtual manufacturing environment. We first distribute welding tasks and priority for multi robots, and then apply corresponding behavior rules to help to plan out welding paths for robots collision free, which is a base fixed problem. Finally, we testify the algorithm to be practical in virtual environment, and output robot programs to direct production process. This new way will help us to find a new development method for multiple robots path planning.

Flocking of multi-robot systems with connectivity maintenance on directed graphs

Analysis and design techniques for cooperative flocking of nonholonomic multi-robot systems with connectivity maintenance on directed graphs are presented. First, a set of bounded and smoothly distributed control protocols are devised via carefully designing a class of bounded artificial potential fields （APF） which could guarantee the connectivity maintenance, col ision avoidance and distance stabilization simultaneously during the system evolution. The connectivity of the underlying network can be preserved, and the desired stable flocking behavior can be achieved provided that the initial communication topology is strongly connected rather than undirected or balanced, which relaxes the constraints for group topology and extends the previous work to more generalized directed graphs. Furthermore, the proposed control algorithm is extended to solve the flocking problem with a virtual leader. In this case, it is shown that al robots can asymptotically move with the desired velocity and orientation even if there is only one informed robot in the team. Finally, nontrivial simulations and experiments are conducted to verify the effectiveness of the proposed algorithm.

Fuzzy Timed Agent Based Petri Nets for Modeling Cooperative Multi-Robot Systems

A cooperative multi-robot system (CMRS) modeling method called fuzzy timed agent based Petri nets (FTAPN) is proposed in this paper, which has been extended from fuzzy timed object-oriented Petri net (FTOPN). The proposed FTAPN can be used to model and illustrate both the structural and dynamic aspects of CMRS, which is a typical multi-agent system (MAS). At the same time, supervised learning is supported in FTAPN. As a special type of high-level object, agent is introduced into FTAPN, which is used as a common modeling object in its model. The proposed FTAPN can not only be used to model CMRS and represent system aging effect, but also be refined into the object-oriented implementation easily. At the same time, it can also be regarded as a conceptual and practical artificial intelligence (AI) tool for multi-agent systems (MAS) into the mainstream practice of the software development.

Distributed swarm control for multi-robot systems inspired by shepherding behaviors

Swarming behaviors play an eminent role in both biological and engineering research, and show great potential applications in many emerging fields. Traditional swarming models still lack integrity, uniformity, and stability in swarm forming processes,resulting in fragmentation and void phenomena. Inspired by the shepherding behaviors observed in nature, we propose an integrated negotiation-control scheme for distributed swarm control of massive robots. The core idea of this scheme is that the robots at the boundary of the group herd the internal robots to form an equilibrium swarm. For this purpose, we introduce a concept of virtual group center towards which boundary robots herd internal robots. Then, a distributed negotiation mechanism is designed to allow each robot to negotiate the virtual group center only through local interactions with its neighbors. After that, we propose a shepherding-inspired swarm control law to drive a group of robots to form an integrated, uniform, and stable configuration from any initial states. Both numerical and flight simulations are presented to verify the effectiveness of our proposed swarm control scheme.

Conventional Geothermal Systems and Unconventional Geothermal Developments: An Overview

This paper provides an overview of conventional geothermal systems and unconventional geothermal developments as a common reference is needed for discussions between energy professionals. Conventional geothermal systems have the heat, permeability and fluid, requiring only drilling down to °C, normal heat flow or decaying radiogenic granite as heat sources, and used in district heating. Medium-temperature (MT) 100°C - 190°C, and high-temperature (HT) 190°C - 374°C resources are mostly at plate boundaries, with volcanic intrusive heat source, used mostly for electricity generation. Single well capacities are °C - 500°C) and a range of depths (1 m to 20 Km), but lack permeability or fluid, thus requiring stimulations for heat extraction by conduction. HVAC is 1 - 2 m deep and shallow geothermal down to 500 m in wells, both capturing °C, with °C are either advanced by geothermal developers at <7 Km depth (Enhanced Geothermal Systems (EGS), drilling below brittle-ductile transition zones and under geothermal fields), or by the Oil & Gas industry (Advanced Geothermal Systems, heat recovery from hydrocarbon wells or reservoirs, Superhot Rock Geothermal, and millimeter-wave drilling down to 20 Km). Their primary aim is electricity generation, relying on closed-loops, but EGS uses fractures for heat exchange with earthquake risks during fracking. Unconventional approaches could be everywhere, with shallow geothermal already functional. The deeper and hotter unconventional alternatives are still experimental, overcoming costs and technological challenges to become fully commercial. Meanwhile, the conventional geothermal resources remain the most proven opportunities for investments and development.

Computational Experiments for Complex Social Systems:Experiment Design and Generative Explanation

Powered by advanced information technology,more and more complex systems are exhibiting characteristics of the cyber-physical-social systems(CPSS).In this context,computational experiments method has emerged as a novel approach for the design,analysis,management,control,and integration of CPSS,which can realize the causal analysis of complex systems by means of“algorithmization”of“counterfactuals”.However,because CPSS involve human and social factors(e.g.,autonomy,initiative,and sociality),it is difficult for traditional design of experiment(DOE)methods to achieve the generative explanation of system emergence.To address this challenge,this paper proposes an integrated approach to the design of computational experiments,incorporating three key modules:1)Descriptive module:Determining the influencing factors and response variables of the system by means of the modeling of an artificial society;2)Interpretative module:Selecting factorial experimental design solution to identify the relationship between influencing factors and macro phenomena;3)Predictive module:Building a meta-model that is equivalent to artificial society to explore its operating laws.Finally,a case study of crowd-sourcing platforms is presented to illustrate the application process and effectiveness of the proposed approach,which can reveal the social impact of algorithmic behavior on“rider race”.

Prescribed Performance Tracking Control of Time-Delay Nonlinear Systems With Output Constraints

The problem of prescribed performance tracking control for unknown time-delay nonlinear systems subject to output constraints is dealt with in this paper. In contrast with related works, only the most fundamental requirements, i.e., boundedness and the local Lipschitz condition, are assumed for the allowable time delays. Moreover, we focus on the case where the reference is unknown beforehand, which renders the standard prescribed performance control designs under output constraints infeasible. To conquer these challenges, a novel robust prescribed performance control approach is put forward in this paper.Herein, a reverse tuning function is skillfully constructed and automatically generates a performance envelop for the tracking error. In addition, a unified performance analysis framework based on proof by contradiction and the barrier function is established to reveal the inherent robustness of the control system against the time delays. It turns out that the system output tracks the reference with a preassigned settling time and good accuracy,without constraint violations. A comparative simulation on a two-stage chemical reactor is carried out to illustrate the above theoretical findings.

Finite-time Prescribed Performance Time-Varying Formation Control for Second-Order Multi-Agent Systems With Non-Strict Feedback Based on a Neural Network Observer

This paper studies the problem of time-varying formation control with finite-time prescribed performance for nonstrict feedback second-order multi-agent systems with unmeasured states and unknown nonlinearities.To eliminate nonlinearities,neural networks are applied to approximate the inherent dynamics of the system.In addition,due to the limitations of the actual working conditions,each follower agent can only obtain the locally measurable partial state information of the leader agent.To address this problem,a neural network state observer based on the leader state information is designed.Then,a finite-time prescribed performance adaptive output feedback control strategy is proposed by restricting the sliding mode surface to a prescribed region,which ensures that the closed-loop system has practical finite-time stability and that formation errors of the multi-agent systems converge to the prescribed performance bound in finite time.Finally,a numerical simulation is provided to demonstrate the practicality and effectiveness of the developed algorithm.

Computation Tree Logic Model Checking of Multi-Agent Systems Based on Fuzzy Epistemic Interpreted Systems

Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as safety and liveness,there is still a lack of quantitative and uncertain property verifications for these systems.In uncertain environments,agents must make judicious decisions based on subjective epistemic.To verify epistemic and measurable properties in multi-agent systems,this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge(FCTLK).We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy epistemic interpreted systems.In addition,we provide a transformation algorithm from fuzzy epistemic interpreted systems to fuzzy Kripke structures,as well as transformation rules from FCTLK formulas to Fuzzy Computation Tree Logic(FCTL)formulas.Accordingly,we transform the FCTLK model checking problem into the FCTL model checking.This enables the verification of FCTLK formulas by using the fuzzy model checking algorithm of FCTL without additional computational overheads.Finally,we present correctness proofs and complexity analyses of the proposed algorithms.Additionally,we further illustrate the practical application of our approach through an example of a train control system.

Optimal Multi-Timescale Scheduling of Integrated Energy Systems with Hybrid Energy Storage System Based on Lyapunov Optimization

The economic operation of integrated energy system(IES)faces new challenges such as multi-timescale characteristics of heterogeneous energy sources,and cooperative operation of hybrid energy storage system(HESS).To this end,this paper investigates the multi-timescale rolling opti-mization problem for IES integrated with HESS.Firstly,the architecture of IES with HESS is established,a comparative analysis is conducted to evaluate the advantages of the HESS over a single energy storage system(SESS)in stabilizing power fluctuations.Secondly,the dayahead and real-time scheduling cost functions of IES are established,the day-ahead scheduling mainly depends on operation costs of the components in IES,the real-time optimal scheduling adopts the Lya-punov optimization method to schedule the battery and hydrogen energy storage in each time slot,so as to minimize the real-time average scheduling operation cost,and the problem of day-ahead and real-time scheduling error,which caused by the uncertainty of the energy storage is solved by online optimization.Finally,the proposed model is verified to reduce the scheduling operation cost and the dispatching error by performing an arithmetic example analysis of the IES in Shanghai,which provides a reference for the safe and stable operation of the IES.

Anomalous time-reversal symmetric non-Hermitian systems

The conditions for the emergence of the non-Hermitian skin effect, as a unique physical response of non-Hermitian systems, have now become one of the hot research topics. In this paper, we study the novel physical responses of nonHermitian systems with anomalous time-reversal symmetry, in both one dimension and two dimensions. Specifically, we focus on whether the systems will exhibit a non-Hermitian skin effect. We employ the theory of generalized Brillouin zone and also numerical methods to show that the anomalous time-reversal symmetry can prevent the skin effect in onedimensional non-Hermitian systems, but is unable to exert the same effectiveness in two-dimensional cases.

Numerical simulation for the initial state of avalanche in polydisperse particle systems

Numerical simulation is employed to investigate the initial state of avalanche in polydisperse particle systems.Nucleation and propagation processes are illustrated for pentadisperse and triadisperse particle systems,respectively.In these processes,particles involved in the avalanche grow slowly in the early stage and explosively in the later stage,which is clearly different from the continuous and steady growth trend in the monodisperse system.By examining the avalanche propagation,the number growth of particles involved in the avalanche and the slope of the number growth,the initial state can be divided into three stages:T1(nucleation stage),T2(propagation stage),T3(overall avalanche stage).We focus on the characteristics of the avalanche in the T2 stage,and find that propagation distances increase almost linearly in both axial and radial directions in polydisperse systems.We also consider the distribution characteristics of the average coordination number and average velocity for the moving particles.The results support that the polydisperse particle systems are more stable in the T2 stage.

Quantum discord and its dynamics for multipartite systems

Quantum discord, one of the famous quantum correlations, has been recently generalized to multipartite systems by Radhakrishnan et al. Here we give analytical solutions of the quantum discord for a family of N-qubit quantum states. For the bipartite system, we derive a zero quantum discord which will remain unchanged under the phase damping channel. For multiparitite systems, it is found that the quantum discord can be classified into three categories and the quantum discord for odd-partite systems can exhibit freezing under the phase damping channel, while the freezing does not exist in the even-partite systems.

Bipartite consensus problems of Lurie multi-agent systems over signed graphs: A contraction approach

This paper examines the bipartite consensus problems for the nonlinear multi-agent systems in Lurie dynamics form with cooperative and competitive communication between different agents. Based on the contraction theory, some new conditions for the nonlinear Lurie multi-agent systems reaching bipartite leaderless consensus and bipartite tracking consensus are presented. Compared with the traditional methods, this approach degrades the dimensions of the conditions, eliminates some restrictions of the system matrix, and extends the range of the nonlinear function. Finally, two numerical examples are provided to illustrate the efficiency of our results.

Enhancing Security and Privacy in Distributed Face Recognition Systems through Blockchain and GAN Technologies

The use of privacy-enhanced facial recognition has increased in response to growing concerns about data securityand privacy in the digital age. This trend is spurred by rising demand for face recognition technology in a varietyof industries, including access control, law enforcement, surveillance, and internet communication. However,the growing usage of face recognition technology has created serious concerns about data monitoring and userprivacy preferences, especially in context-aware systems. In response to these problems, this study provides a novelframework that integrates sophisticated approaches such as Generative Adversarial Networks (GANs), Blockchain,and distributed computing to solve privacy concerns while maintaining exact face recognition. The framework’spainstaking design and execution strive to strike a compromise between precise face recognition and protectingpersonal data integrity in an increasingly interconnected environment. Using cutting-edge tools like Dlib for faceanalysis,Ray Cluster for distributed computing, and Blockchain for decentralized identity verification, the proposedsystem provides scalable and secure facial analysis while protecting user privacy. The study’s contributions includethe creation of a sustainable and scalable solution for privacy-aware face recognition, the implementation of flexibleprivacy computing approaches based on Blockchain networks, and the demonstration of higher performanceover previous methods. Specifically, the proposed StyleGAN model has an outstanding accuracy rate of 93.84%while processing high-resolution images from the CelebA-HQ dataset, beating other evaluated models such asProgressive GAN 90.27%, CycleGAN 89.80%, and MGAN 80.80%. With improvements in accuracy, speed, andprivacy protection, the framework has great promise for practical use in a variety of fields that need face recognitiontechnology. This study paves the way for future research in privacy-enhanced face recognition systems, emphasizingthe significance of using cutting-edge technology to meet rising privacy issues in digital identity.

Analysis and Design of Time-Delay Impulsive Systems Subject to Actuator Saturation

This paper investigates the exponential stability and performance analysis of nonlinear time-delay impulsive systems subject to actuator saturation. When continuous dynamics is unstable, under some conditions, it is shown that the system can be stabilized by a class of saturated delayed-impulses regardless of the length of input delays. Conversely, when the system is originally stable, it is shown that under some conditions, the system is robust with respect to sufficient small delayed-impulses. Moreover, the design problem of the controller with the goal of obtaining a maximized estimate of the domain of attraction is formulated via a convex optimization problem. Three examples are provided to demonstrate the validity of the main results.