A Brief Overview of ChatGPT:The History,Status Quo and Potential Future Development

ChatG PT,an artificial intelligence generated content (AIGC) model developed by OpenAI,has attracted worldwide attention for its capability of dealing with challenging language understanding and generation tasks in the form of conversations.This paper briefly provides an overview on the history,status quo and potential future development of ChatGPT,helping to provide an entry point to think about ChatGPT.Specifically,from the limited open-accessed resources,we conclude the core techniques of ChatGPT,mainly including large-scale language models,in-context learning,reinforcement learning from human feedback and the key technical steps for developing ChatGPT.We further analyze the pros and cons of ChatGPT and we rethink the duality of ChatGPT in various fields.Although it has been widely acknowledged that ChatGPT brings plenty of opportunities for various fields,mankind should still treat and use ChatG PT properly to avoid the potential threat,e.g.,academic integrity and safety challenge.Finally,we discuss several open problems as the potential development of ChatGPT.

Estimating the State of Health for Lithium-ion Batteries:A Particle Swarm Optimization-Assisted Deep Domain Adaptation Approach

The state of health(SOH)is a critical factor in evaluating the performance of the lithium-ion batteries(LIBs).Due to various end-user behaviors,the LIBs exhibit different degradation modes,which makes it challenging to estimate the SOHs in a personalized way.In this article,we present a novel particle swarm optimization-assisted deep domain adaptation(PSO-DDA)method to estimate the SOH of LIBs in a personalized manner,where a new domain adaptation strategy is put forward to reduce cross-domain distribution discrepancy.The standard PSO algorithm is exploited to automatically adjust the chosen hyperparameters of developed DDA-based method.The proposed PSODDA method is validated by extensive experiments on two LIB datasets with different battery chemistry materials,ambient temperatures and charge-discharge configurations.Experimental results indicate that the proposed PSO-DDA method surpasses the convolutional neural network-based method and the standard DDA-based method.The Py Torch implementation of the proposed PSO-DDA method is available at https://github.com/mxt0607/PSO-DDA.

Automated Silicon-Substrate Ultra-Microtome for Automating the Collection of Brain Sections in Array Tomography

Understanding the structure and working principle of brain neural networks requires three-dimensional reconstruction of brain tissue samples using array tomography method.In order to improve the reconstruction performance,the sequence of brain sections should be collected with silicon wafers for subsequent electron microscopic imaging.However,the current collection of brain sections based on silicon substrate involve mainly manual collection,which requires the involvement of automation techniques to increase collection efficiency.This paper presents the design of an automatic collection device for brain sections.First,a novel mechanism based on circular silicon substrates is proposed for collection of brain sections;second,an automatic collection system based on microscopic object detection and feedback control strategy is proposed.Experimental results verify the function of the proposed collection device.Three objects(brain section,left baffle,right baffle)can be detected from microscopic images by the proposed detection method.Collection efficiency can be further improved with position feedback of brain sections well.It has been experimentally verified that the proposed device can well fulfill the task of automatic collection of brain sections.With the help of the proposed automatic collection device,human operators can be partially liberated from the tedious manual collection process and collection efficiency can be improved.

Adaptive Sensor-Fault Tolerant Control of Unmanned Underwater Vehicles With Input Saturation

This paper investigates the tracking control problem for unmanned underwater vehicles(UUVs)systems with sensor faults,input saturation,and external disturbance caused by waves and ocean currents.An active sensor fault-tolerant control scheme is proposed.First,the developed method only requires the inertia matrix of the UUV,without other dynamic information,and can handle both additive and multiplicative sensor faults.Subsequently,an adaptive fault-tolerant controller is designed to achieve asymptotic tracking control of the UUV by employing robust integral of the sign of error feedback method.It is shown that the effect of sensor faults is online estimated and compensated by an adaptive estimator.With the proposed controller,the tracking error and estimation error can asymptotically converge to zero.Finally,simulation results are performed to demonstrate the effectiveness of the proposed method.

Discovering Latent Variables for the Tasks With Confounders in Multi-Agent Reinforcement Learning

Efficient exploration in complex coordination tasks has been considered a challenging problem in multi-agent reinforcement learning(MARL). It is significantly more difficult for those tasks with latent variables that agents cannot directly observe. However, most of the existing latent variable discovery methods lack a clear representation of latent variables and an effective evaluation of the influence of latent variables on the agent. In this paper, we propose a new MARL algorithm based on the soft actor-critic method for complex continuous control tasks with confounders. It is called the multi-agent soft actor-critic with latent variable(MASAC-LV) algorithm, which uses variational inference theory to infer the compact latent variables representation space from a large amount of offline experience.Besides, we derive the counterfactual policy whose input has no latent variables and quantify the difference between the actual policy and the counterfactual policy via a distance function. This quantified difference is considered an intrinsic motivation that gives additional rewards based on how much the latent variable affects each agent. The proposed algorithm is evaluated on two collaboration tasks with confounders, and the experimental results demonstrate the effectiveness of MASAC-LV compared to other baseline algorithms.

Intelligent Internet of Things with Reliable Communication and Collaboration Technologies

The Internet of Things(IoT)connects objects to Internet through sensor devices,radio frequency identification devices and other information collection and processing devices to realize information interaction.IoT is widely used in many fields,including intelligent transportation,intelligent healthcare,intelligent home and industry.In these fields,IoT devices connected via high-speed internet for efficient and reliable communications and faster response times.

Consensus Control of Leader-Following Multi-Agent Systems in Directed Topology With Heterogeneous Disturbances

This paper investigates the consensus problem for linear multi-agent systems with the heterogeneous disturbances generated by the Brown motion.Its main contribution is that a control scheme is designed to achieve the dynamic consensus for the multi-agent systems in directed topology interfered by stochastic noise.In traditional ways,the coupling weights depending on the communication structure are static.A new distributed controller is designed based on Riccati inequalities,while updating the coupling weights associated with the gain matrix by state errors between adjacent agents.By introducing time-varying coupling weights into this novel control law,the state errors between leader and followers asymptotically converge to the minimum value utilizing the local interaction.Through the Lyapunov directed method and It?formula,the stability of the closed-loop system with the proposed control law is analyzed.Two simulation results conducted by the new and traditional schemes are presented to demonstrate the effectiveness and advantage of the developed control method.

Collective Entity Alignment for Knowledge Fusion of Power Grid Dispatching Knowledge Graphs

Knowledge graphs(KGs)have been widely accepted as powerful tools for modeling the complex relationships between concepts and developing knowledge-based services.In recent years,researchers in the field of power systems have explored KGs to develop intelligent dispatching systems for increasingly large power grids.With multiple power grid dispatching knowledge graphs(PDKGs)constructed by different agencies,the knowledge fusion of different PDKGs is useful for providing more accurate decision supports.To achieve this,entity alignment that aims at connecting different KGs by identifying equivalent entities is a critical step.Existing entity alignment methods cannot integrate useful structural,attribute,and relational information while calculating entities’similarities and are prone to making many-to-one alignments,thus can hardly achieve the best performance.To address these issues,this paper proposes a collective entity alignment model that integrates three kinds of available information and makes collective counterpart assignments.This model proposes a novel knowledge graph attention network(KGAT)to learn the embeddings of entities and relations explicitly and calculates entities’similarities by adaptively incorporating the structural,attribute,and relational similarities.Then,we formulate the counterpart assignment task as an integer programming(IP)problem to obtain one-to-one alignments.We not only conduct experiments on a pair of PDKGs but also evaluate o ur model on three commonly used cross-lingual KGs.Experimental comparisons indicate that our model outperforms other methods and provides an effective tool for the knowledge fusion of PDKGs.

Prescribed-Time Stabilization of Singularly Perturbed Systems

Dear Editor, This letter investigates the prescribed-time stabilization of linear singularly perturbed systems. Due to the numerical issues caused by the small perturbation parameter, the off-the-shelf control design techniques for the prescribed-time stabilization of regular linear systems are typically not suitable here. To solve the problem, the decoupling transformation techniques for time-varying singularly perturbed systems are combined with linear time-varying high gain feedback design techniques.

Development and Control of Underwater Gliding Robots:A Review

As one of the most effective vehicles for ocean development and exploration,underwater gliding robots(UGRs)have the unique characteristics of low energy consumption and strong endurance.Moreover,by borrowing the motion principles of current underwater robots,a variety of novel UGRs have emerged with improving their maneuverability,concealment,and environmental friendliness,which significantly broadens the ocean applications.In this paper,we provide a comprehensive review of underwater gliding robots,including prototype design and their key technologies.From the perspective of motion characteristics,we categorize the underwater gliding robots in terms of traditional underwater gliders(UGs),hybrid-driven UGs,bio-inspired UGs,thermal UGs,and others.Correspondingly,their buoyancy driven system,dynamic and energy model,and motion control are concluded with detailed analysis.Finally,we have discussed the current critical issues and future development.This review offers valuable insight into the development of next-generation underwater robots well-suited for various oceanic applications,and aims to gain more attention of researchers and engineers to this growing field.

Parallel Distance: A New Paradigm of Measurement for Parallel Driving

In this paper, a new paradigm named parallel distance is presented to measure the data information in parallel driving system. As an example, the core variables in the parallel driving system are measured and evaluated in the parallel distance framework. First, the parallel driving 3.0 system included control and management platform, intelligent vehicle platform and remote-control platform is introduced. Then,Markov chain(MC) is utilized to model the transition probability matrix of control commands in these systems. Furthermore, to distinguish the control variables in artificial and physical driving conditions, different distance calculation methods are enumerated to specify the differences between the virtual and real signals. By doing this, the real system can be guided and the virtual system can be im-proved. Finally, simulation results exhibit the merits and multiple applications of the proposed parallel distance framework.

Structured Sparse Coding With the Group Log-regularizer for Key Frame Extraction

Key frame extraction based on sparse coding can reduce the redundancy of continuous frames and concisely express the entire video.However,how to develop a key frame extraction algorithm that can automatically extract a few frames with a low reconstruction error remains a challenge.In this paper,we propose a novel model of structured sparse-codingbased key frame extraction,wherein a nonconvex group log-regularizer is used with strong sparsity and a low reconstruction error.To automatically extract key frames,a decomposition scheme is designed to separate the sparse coefficient matrix by rows.The rows enforced by the nonconvex group log-regularizer become zero or nonzero,leading to the learning of the structured sparse coefficient matrix.To solve the nonconvex problems due to the log-regularizer,the difference of convex algorithm(DCA)is employed to decompose the log-regularizer into the difference of two convex functions related to the l1 norm,which can be directly obtained through the proximal operator.Therefore,an efficient structured sparse coding algorithm with the group log-regularizer for key frame extraction is developed,which can automatically extract a few frames directly from the video to represent the entire video with a low reconstruction error.Experimental results demonstrate that the proposed algorithm can extract more accurate key frames from most Sum Me videos compared to the stateof-the-art methods.Furthermore,the proposed algorithm can obtain a higher compression with a nearly 18% increase compared to sparse modeling representation selection(SMRS)and an 8% increase compared to SC-det on the VSUMM dataset.

Point Cloud Classification Using Content-Based Transformer via Clustering in Feature Space

Recently, there have been some attempts of Transformer in 3D point cloud classification. In order to reduce computations, most existing methods focus on local spatial attention,but ignore their content and fail to establish relationships between distant but relevant points. To overcome the limitation of local spatial attention, we propose a point content-based Transformer architecture, called PointConT for short. It exploits the locality of points in the feature space(content-based), which clusters the sampled points with similar features into the same class and computes the self-attention within each class, thus enabling an effective trade-off between capturing long-range dependencies and computational complexity. We further introduce an inception feature aggregator for point cloud classification, which uses parallel structures to aggregate high-frequency and low-frequency information in each branch separately. Extensive experiments show that our PointConT model achieves a remarkable performance on point cloud shape classification. Especially, our method exhibits 90.3% Top-1 accuracy on the hardest setting of ScanObjectN N. Source code of this paper is available at https://github.com/yahuiliu99/PointC onT.

Orientation and Decision-Making for Soccer Based on Sports Analytics and AI:A Systematic Review

Due to ever-growing soccer data collection approaches and progressing artificial intelligence(AI) methods, soccer analysis, evaluation, and decision-making have received increasing interest from not only the professional sports analytics realm but also the academic AI research community. AI brings gamechanging approaches for soccer analytics where soccer has been a typical benchmark for AI research. The combination has been an emerging topic. In this paper, soccer match analytics are taken as a complete observation-orientation-decision-action(OODA) loop.In addition, as in AI frameworks such as that for reinforcement learning, interacting with a virtual environment enables an evolving model. Therefore, both soccer analytics in the real world and virtual domains are discussed. With the intersection of the OODA loop and the real-virtual domains, available soccer data, including event and tracking data, and diverse orientation and decisionmaking models for both real-world and virtual soccer matches are comprehensively reviewed. Finally, some promising directions in this interdisciplinary area are pointed out. It is claimed that paradigms for both professional sports analytics and AI research could be combined. Moreover, it is quite promising to bridge the gap between the real and virtual domains for soccer match analysis and decision-making.

Low-Rank Optimal Transport for Robust Domain Adaptation

When encountering the distribution shift between the source(training) and target(test) domains, domain adaptation attempts to adjust the classifiers to be capable of dealing with different domains. Previous domain adaptation research has achieved a lot of success both in theory and practice under the assumption that all the examples in the source domain are welllabeled and of high quality. However, the methods consistently lose robustness in noisy settings where data from the source domain have corrupted labels or features which is common in reality. Therefore, robust domain adaptation has been introduced to deal with such problems. In this paper, we attempt to solve two interrelated problems with robust domain adaptation:distribution shift across domains and sample noises of the source domain. To disentangle these challenges, an optimal transport approach with low-rank constraints is applied to guide the domain adaptation model training process to avoid noisy information influence. For the domain shift problem, the optimal transport mechanism can learn the joint data representations between the source and target domains using a measurement of discrepancy and preserve the discriminative information. The rank constraint on the transport matrix can help recover the corrupted subspace structures and eliminate the noise to some extent when dealing with corrupted source data. The solution to this relaxed and regularized optimal transport framework is a convex optimization problem that can be solved using the Augmented Lagrange Multiplier method, whose convergence can be mathematically proved. The effectiveness of the proposed method is evaluated through extensive experiments on both synthetic and real-world datasets.

Reinforcement Learning-Based MAS Interception in Antagonistic Environments

Dear Editor, As a promising multi-agent systems(MASs) operation, autonomous interception has attracted more and more attentions in these years, where defenders prevent intruders from reaching destinations.So far, most of the relevant methods are applied in ideal environments without agent damages. As a remedy, this letter proposes a more realistic interception method for MASs suffered by damages.

Privacy-Preserving Average Consensus Algorithm Under Round-Robin Scheduling Protocol

Dear Editor,Over the past decades,cooperative control and distributed optimization have gained significant research attention due to their broad applications such as signal processing,robotics,and social networks[1],[2].As a fundamental component of distributed control and optimization,the issue of average consensus has become a recurring topic of interest[3],[4].

Fixed-Time Consensus-Based Nash Equilibrium Seeking

Dear Editor,This letter examines the fixed-time stability of the Nash equilibrium(NE)in non-cooperative games.We propose a consensus-based NE seeking algorithm for situations where players do not have perfect information and communicate via a topology graph.The proposed algorithm can achieve NE in a fixed time that does not depend on initial conditions and can be adjusted in advance.

Parallel Reinforcement Learning-Based Energy Efficiency Improvement for a Cyber-Physical System

As a complex and critical cyber-physical system(CPS),the hybrid electric powertrain is significant to mitigate air pollution and improve fuel economy.Energy management strategy(EMS)is playing a key role to improve the energy efficiency of this CPS.This paper presents a novel bidirectional long shortterm memory(LSTM)network based parallel reinforcement learning(PRL)approach to construct EMS for a hybrid tracked vehicle(HTV).This method contains two levels.The high-level establishes a parallel system first,which includes a real powertrain system and an artificial system.Then,the synthesized data from this parallel system is trained by a bidirectional LSTM network.The lower-level determines the optimal EMS using the trained action state function in the model-free reinforcement learning(RL)framework.PRL is a fully data-driven and learning-enabled approach that does not depend on any prediction and predefined rules.Finally,real vehicle testing is implemented and relevant experiment data is collected and calibrated.Experimental results validate that the proposed EMS can achieve considerable energy efficiency improvement by comparing with the conventional RL approach and deep RL.

Multi-Blockchain Based Data Trading Markets With Novel Pricing Mechanisms

In the era of big data,there is an urgent need to establish data trading markets for effectively releasing the tremendous value of the drastically explosive data.Data security and data pricing,however,are still widely regarded as major challenges in this respect,which motivate this research on the novel multi-blockchain based framework for data trading markets and their associated pricing mechanisms.In this context,data recording and trading are conducted separately within two separate blockchains:the data blockchain(DChain) and the value blockchain(VChain).This enables the establishment of two-layer data trading markets to manage initial data trading in the primary market and subsequent data resales in the secondary market.Moreover,pricing mechanisms are then proposed to protect these markets against strategic trading behaviors and balance the payoffs of both suppliers and users.Specifically,in regular data trading on VChain-S2D,two auction models are employed according to the demand scale,for dealing with users’ strategic bidding.The incentive-compatible Vickrey-Clarke-Groves(VCG)model is deployed to the low-demand trading scenario,while the nearly incentive-compatible monopolistic price(MP) model is utilized for the high-demand trading scenario.With temporary data trading on VChain-D2S,a reverse auction mechanism namely two-stage obscure selection(TSOS) is designed to regulate both suppliers’ quoting and users’ valuation strategies.Furthermore,experiments are carried out to demonstrate the strength of this research in enhancing data security and trading efficiency.