When Does Sora Show:The Beginning of TAO to Imaginative Intelligence and Scenarios Engineering

DURING our discussion at workshops for writing“What Does ChatGPT Say:The DAO from Algorithmic Intelligence to Linguistic Intelligence”[1],we had expected the next milestone for Artificial Intelligence(AI)would be in the direction of Imaginative Intelligence(II),i.e.,something similar to automatic wordsto-videos generation or intelligent digital movies/theater technology that could be used for conducting new“Artificiofactual Experiments”[2]to replace conventional“Counterfactual Experiments”in scientific research and technical development for both natural and social studies[2]-[6].Now we have OpenAI’s Sora,so soon,but this is not the final,actually far away,and it is just the beginning.

Communication Resource-Efficient Vehicle Platooning Control With Various Spacing Policies

Platooning represents one of the key features that connected automated vehicles may possess as it allows multiple automated vehicles to be maneuvered cooperatively with small headways on roads. However, a critical challenge in accomplishing automated vehicle platoons is to deal with the effects of intermittent and sporadic vehicle-to-vehicle data transmissions caused by limited wireless communication resources. This paper addresses the co-design problem of dynamic event-triggered communication scheduling and cooperative adaptive cruise control for a convoy of automated vehicles with diverse spacing policies. The central aim is to achieve automated vehicle platooning under various gap references with desired platoon stability and spacing performance requirements, while simultaneously improving communication efficiency. Toward this aim, a dynamic event-triggered scheduling mechanism is developed such that the intervehicle data transmissions are scheduled dynamically and efficiently over time. Then, a tractable co-design criterion on the existence of both the admissible event-driven cooperative adaptive cruise control law and the desired scheduling mechanism is derived. Finally, comparative simulation results are presented to substantiate the effectiveness and merits of the obtained results.

Distributed Nash Equilibrium Seeking Strategies Under Quantized Communication

This paper is concerned with distributed Nash equi librium seeking strategies under quantized communication. In the proposed seeking strategy, a projection operator is synthesized with a gradient search method to achieve the optimization o players' objective functions while restricting their actions within required non-empty, convex and compact domains. In addition, a leader-following consensus protocol, in which quantized informa tion flows are utilized, is employed for information sharing among players. More specifically, logarithmic quantizers and uniform quantizers are investigated under both undirected and connected communication graphs and strongly connected digraphs, respec tively. Through Lyapunov stability analysis, it is shown that play ers' actions can be steered to a neighborhood of the Nash equilib rium with logarithmic and uniform quantizers, and the quanti fied convergence error depends on the parameter of the quan tizer for both undirected and directed cases. A numerical exam ple is given to verify the theoretical results.

Visual Semantic Segmentation Based on Few/Zero-Shot Learning:An Overview

Visual semantic segmentation aims at separating a visual sample into diverse blocks with specific semantic attributes and identifying the category for each block,and it plays a crucial role in environmental perception.Conventional learning-based visual semantic segmentation approaches count heavily on largescale training data with dense annotations and consistently fail to estimate accurate semantic labels for unseen categories.This obstruction spurs a craze for studying visual semantic segmentation with the assistance of few/zero-shot learning.The emergence and rapid progress of few/zero-shot visual semantic segmentation make it possible to learn unseen categories from a few labeled or even zero-labeled samples,which advances the extension to practical applications.Therefore,this paper focuses on the recently published few/zero-shot visual semantic segmentation methods varying from 2D to 3D space and explores the commonalities and discrepancies of technical settlements under different segmentation circumstances.Specifically,the preliminaries on few/zeroshot visual semantic segmentation,including the problem definitions,typical datasets,and technical remedies,are briefly reviewed and discussed.Moreover,three typical instantiations are involved to uncover the interactions of few/zero-shot learning with visual semantic segmentation,including image semantic segmentation,video object segmentation,and 3D segmentation.Finally,the future challenges of few/zero-shot visual semantic segmentation are discussed.

Distributed Platooning Control of Automated Vehicles Subject to Replay Attacks Based on Proportional Integral Observers

Secure platooning control plays an important role in enhancing the cooperative driving safety of automated vehicles subject to various security vulnerabilities.This paper focuses on the distributed secure control issue of automated vehicles affected by replay attacks.A proportional-integral-observer(PIO)with predetermined forgetting parameters is first constructed to acquire the dynamical information of vehicles.Then,a time-varying parameter and two positive scalars are employed to describe the temporal behavior of replay attacks.In light of such a scheme and the common properties of Laplace matrices,the closed-loop system with PIO-based controllers is transformed into a switched and time-delayed one.Furthermore,some sufficient conditions are derived to achieve the desired platooning performance by the view of the Lyapunov stability theory.The controller gains are analytically determined by resorting to the solution of certain matrix inequalities only dependent on maximum and minimum eigenvalues of communication topologies.Finally,a simulation example is provided to illustrate the effectiveness of the proposed control strategy.

Automation 5.0: The Key to Systems Intelligence and Industry 5.0

AUTOMATION has come a long way since the early days of mechanization,i.e.,the process of working exclusively by hand or using animals to work with machinery.The rise of steam engines and water wheels represented the first generation of industry,which is now called Industry Citation:L.Vlacic,H.Huang,M.Dotoli,Y.Wang,P.Ioanno,L.Fan,X.Wang,R.Carli,C.Lv,L.Li,X.Na,Q.-L.Han,and F.-Y.Wang,“Automation 5.0:The key to systems intelligence and Industry 5.0,”IEEE/CAA J.Autom.Sinica,vol.11,no.8,pp.1723-1727,Aug.2024.

Nonlinear Filtering With Sample-Based Approximation Under Constrained Communication:Progress, Insights and Trends

The nonlinear filtering problem has enduringly been an active research topic in both academia and industry due to its ever-growing theoretical importance and practical significance.The main objective of nonlinear filtering is to infer the states of a nonlinear dynamical system of interest based on the available noisy measurements. In recent years, the advance of network communication technology has not only popularized the networked systems with apparent advantages in terms of installation,cost and maintenance, but also brought about a series of challenges to the design of nonlinear filtering algorithms, among which the communication constraint has been recognized as a dominating concern. In this context, a great number of investigations have been launched towards the networked nonlinear filtering problem with communication constraints, and many samplebased nonlinear filters have been developed to deal with the highly nonlinear and/or non-Gaussian scenarios. The aim of this paper is to provide a timely survey about the recent advances on the sample-based networked nonlinear filtering problem from the perspective of communication constraints. More specifically, we first review three important families of sample-based filtering methods known as the unscented Kalman filter, particle filter,and maximum correntropy filter. Then, the latest developments are surveyed with stress on the topics regarding incomplete/imperfect information, limited resources and cyber security.Finally, several challenges and open problems are highlighted to shed some lights on the possible trends of future research in this realm.

Designing Proportional-Integral Consensus Protocols for Second-Order Multi-Agent Systems Using Delayed and Memorized State Information

This paper is concerned with consensus of a secondorder linear time-invariant multi-agent system in the situation that there exists a communication delay among the agents in the network.A proportional-integral consensus protocol is designed by using delayed and memorized state information.Under the proportional-integral consensus protocol,the consensus problem of the multi-agent system is transformed into the problem of asymptotic stability of the corresponding linear time-invariant time-delay system.Note that the location of the eigenvalues of the corresponding characteristic function of the linear time-invariant time-delay system not only determines the stability of the system,but also plays a critical role in the dynamic performance of the system.In this paper,based on recent results on the distribution of roots of quasi-polynomials,several necessary conditions for Hurwitz stability for a class of quasi-polynomials are first derived.Then allowable regions of consensus protocol parameters are estimated.Some necessary and sufficient conditions for determining effective protocol parameters are provided.The designed protocol can achieve consensus and improve the dynamic performance of the second-order multi-agent system.Moreover,the effects of delays on consensus of systems of harmonic oscillators/double integrators under proportional-integral consensus protocols are investigated.Furthermore,some results on proportional-integral consensus are derived for a class of high-order linear time-invariant multi-agent systems.

Hyperbolic Tangent Function-Based Protocols for Global/Semi-Global Finite-Time Consensus of Multi-Agent Systems

This paper investigates the problem of global/semi-global finite-time consensus for integrator-type multi-agent sys-tems.New hyperbolic tangent function-based protocols are pro-posed to achieve global and semi-global finite-time consensus for both single-integrator and double-integrator multi-agent systems with leaderless undirected and leader-following directed commu-nication topologies.These new protocols not only provide an explicit upper-bound estimate for the settling time,but also have a user-prescribed bounded control level.In addition,compared to some existing results based on the saturation function,the pro-posed approach considerably simplifies the protocol design and the stability analysis.Illustrative examples and an application demonstrate the effectiveness of the proposed protocols.

Privacy Protection for Blockchain-Based Healthcare IoT Systems: A Survey

To enable precision medicine and remote patient monitoring,internet of healthcare things(IoHT)has gained significant interest as a promising technique.With the widespread use of IoHT,nonetheless,privacy infringements such as IoHT data leakage have raised serious public concerns.On the other side,blockchain and distributed ledger technologies have demonstrated great potential for enhancing trustworthiness and privacy protection for IoHT systems.In this survey,a holistic review of existing blockchain-based IoHT systems is conducted to indicate the feasibility of combining blockchain and IoHT in privacy protection.In addition,various types of privacy challenges in IoHT are identified by examining general data protection regulation(GDPR).More importantly,an associated study of cutting-edge privacy-preserving techniques for the identified IoHT privacy challenges is presented.Finally,several challenges in four promising research areas for blockchain-based IoHT systems are pointed out,with the intent of motivating researchers working in these fields to develop possible solutions.

Stochastic sampled-data multi-objective control of active suspension systems for in-wheel motor driven electric vehicles

This paper addresses the sampled-data multi-objective active suspension control problem for an in-wheel motor driven electric vehicle subject to stochastic sampling periods and asynchronous premise variables.The focus is placed on the scenario that the dynamical state of the half-vehicle active suspension system is transmitted over an in-vehicle controller area network that only permits the transmission of sampled data packets.For this purpose,a stochastic sampling mechanism is developed such that the sampling periods can randomly switch among different values with certain mathematical probabilities.Then,an asynchronous fuzzy sampled-data controller,featuring distinct premise variables from the active suspension system,is constructed to eliminate the stringent requirement that the sampled-data controller has to share the same grades of membership.Furthermore,novel criteria for both stability analysis and controller design are derived in order to guarantee that the resultant closed-loop active suspension system is stochastically stable with simultaneous𝐻2 and𝐻∞performance requirements.Finally,the effectiveness of the proposed stochastic sampled-data multi-objective control method is verified via several numerical cases studies in both time domain and frequency domain under various road disturbance profiles.

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.

Resilient and Safe Platooning Control of Connected Automated Vehicles Against Intermittent Denial-of-Service Attacks

Connected automated vehicles(CAVs)serve as a promising enabler for future intelligent transportation systems because of their capabilities in improving traffic efficiency and driving safety,and reducing fuel consumption and vehicle emissions.A fundamental issue in CAVs is platooning control that empowers a convoy of CAVs to be cooperatively maneuvered with desired longitudinal spacings and identical velocities on roads.This paper addresses the issue of resilient and safe platooning control of CAVs subject to intermittent denial-of-service(DoS)attacks that disrupt vehicle-to-vehicle communications.First,a heterogeneous and uncertain vehicle longitudinal dynamic model is presented to accommodate a variety of uncertainties,including diverse vehicle masses and engine inertial delays,unknown and nonlinear resistance forces,and a dynamic platoon leader.Then,a resilient and safe distributed longitudinal platooning control law is constructed with an aim to preserve simultaneous individual vehicle stability,attack resilience,platoon safety and scalability.Furthermore,a numerically efficient offline design algorithm for determining the desired platoon control law is developed,under which the platoon resilience against DoS attacks can be maximized but the anticipated stability,safety and scalability requirements remain preserved.Finally,extensive numerical experiments are provided to substantiate the efficacy of the proposed platooning method.

Chat with ChatGPT on Industry 5.0:Learning and Decision-Making for Intelligent Industries

THE current ChatGPT phenomenon has signaled a new era of Artificial Intelligence moving from Algorithmic Intelligence to Linguistic Intelligence where interactive activities between actual and artificial,real and virtual,human and machine play an active and important role online and in real-time.At IEEE/CAA JAS,we are interested in investigating the impact and significance of this new era on industrial development,especially control and automation for manufacturing and production.

Distributed Nash Equilibrium Seeking for General Networked Games With Bounded Disturbances

This paper is concerned with anti-disturbance Nash equilibrium seeking for games with partial information.First,reduced-order disturbance observer-based algorithms are proposed to achieve Nash equilibrium seeking for games with firstorder and second-order players,respectively.In the developed algorithms,the observed disturbance values are included in control signals to eliminate the influence of disturbances,based on which a gradient-like optimization method is implemented for each player.Second,a signum function based distributed algorithm is proposed to attenuate disturbances for games with secondorder integrator-type players.To be more specific,a signum function is involved in the proposed seeking strategy to dominate disturbances,based on which the feedback of the velocity-like states and the gradients of the functions associated with players achieves stabilization of system dynamics and optimization of players'objective functions.Through Lyapunov stability analysis,it is proven that the players'actions can approach a small region around the Nash equilibrium by utilizing disturbance observerbased strategies with appropriate control gains.Moreover,exponential(asymptotic)convergence can be achieved when the signum function based control strategy(with an adaptive control gain)is employed.The performance of the proposed algorithms is tested by utilizing an integrated simulation platform of virtual robot experimentation platform(V-REP)and MATLAB.

Cooperative Target Tracking of Multiple Autonomous Surface Vehicles Under Switching Interaction Topologies

This paper is concerned with the cooperative target tracking of multiple autonomous surface vehicles(ASVs)under switching interaction topologies.For the target to be tracked,only its position can be measured/received by some of the ASVs,and its velocity is unavailable to all the ASVs.A distributed extended state observer taking into consideration switching topologies is designed to integrally estimate unknown target dynamics and neighboring ASVs'dynamics.Accordingly,a novel kinematic controller is designed,which takes full advantage of known information and avoids the approximation of some virtual control vectors.Moreover,a disturbance observer is presented to estimate unknown time-varying environmental disturbance.Furthermore,a distributed dynamic controller is designed to regulate the involved ASVs to cooperatively track the target.It enables each ASV to adjust its forces and moments according to the received information from its neighbors.The effectiveness of the derived results is demonstrated through cooperative target tracking performance analysis for a tracking system composed of five interacting ASVs.

Fully Distributed Nash Equilibrium Seeking for High-Order Players With Actuator Limitations

This paper explores the problem of distributed Nash equilibrium seeking in games, where players have limited knowledge on other players' actions. In particular, the involved players are considered to be high-order integrators with their control inputs constrained within a pre-specified region. A linear transformation for players' dynamics is firstly utilized to facilitate the design of bounded control inputs incorporating multiple saturation functions. By introducing consensus protocols with adaptive and time-varying gains, the unknown actions for players are distributively estimated. Then, a fully distributed Nash equilibrium seeking strategy is exploited, showcasing its remarkable properties: (1) ensuring the boundedness of control inputs;(2) avoiding any global information/parameters;and (3) allowing the graph to be directed. Based on Lyapunov stability analysis, it is theoretically proved that the proposed distributed control strategy can lead all the players' actions to the Nash equilibrium. Finally, an illustrative example is given to validate effectiveness of the proposed method.

Generalized-Extended-State-Observer and Equivalent-Input-Disturbance Methods for Active Disturbance Rejection: Deep Observation and Comparison

Active disturbance-rejection methods are effective in estimating and rejecting disturbances in both transient and steady-state responses.This paper presents a deep observation on and a comparison between two of those methods:the generalized extended-state observer(GESO)and the equivalent input disturbance(EID)from assumptions,system configurations,stability conditions,system design,disturbance-rejection performance,and extensibility.A time-domain index is introduced to assess the disturbance-rejection performance.A detailed observation of disturbance-suppression mechanisms reveals the superiority of the EID approach over the GESO method.A comparison between these two methods shows that assumptions on disturbances are more practical and the adjustment of disturbance-rejection performance is easier for the EID approach than for the GESO method.

Detecting Vulnerability on IoT Device Firmware: A Survey

Internet of things (IoT) devices make up 30%of all network-connected endpoints,introducing vulnerabilities and novel attacks that make many companies as primary targets for cybercriminals.To address this increasing threat surface,every organization deploying IoT devices needs to consider security risks to ensure those devices are secure and trusted.Among all the solutions for security risks,firmware security analysis is essential to fix software bugs,patch vulnerabilities,or add new security features to protect users of those vulnerable devices.However,firmware security analysis has never been an easy job due to the diversity of the execution environment and the close source of firmware.These two distinct features complicate the operations to unpack firmware samples for detailed analysis.They also make it difficult to create visual environments to emulate the running of device firmware.Although researchers have developed many novel methods to overcome various challenges in the past decade,critical barriers impede firmware security analysis in practice.Therefore,this survey is motivated to systematically review and analyze the research challenges and their solutions,considering both breadth and depth.Specifically,based on the analysis perspectives,various methods that perform security analysis on IoT devices are introduced and classified into four categories.The challenges in each category are discussed in detail,and potential solutions are proposed subsequently.We then discuss the flaws of these solutions and provide future directions for this research field.This survey can be utilized by a broad range of readers,including software developers,cyber security researchers,and software security engineers,to better understand firmware security analysis.

Practical bipartite consensus for multi-agent systems:A barrier function-based adaptive sliding-mode control approach

This paper is concerned with bipartite consensus tracking for multi-agent systems with unknown disturbances.A barrier function-based adaptive sliding-mode control(SMC)approach is proposed such that the bipartite steady-state error is converged to a predefined region of zero in finite time.Specifically,based on an error auxiliary taking neighboring antagonistic interactions into account,an SMC law is designed with an adaptive gain.The gain can switch to a positive semi-definite barrier function to ensure that the error auxiliary is constrained to a predefined neighborhood of zero,which in turn guarantees practical bipartite consensus tracking.A distinguished feature of the proposed controller is its independence on the bound of disturbances,while the input chattering phenomenon is alleviated.Finally,a numerical example is provided to verify the effectiveness of the proposed controller.