Multivariate time series forecasting has drawn increasing attention due to its practical importance. Existing approaches typically adopt either channel-mixing (CM) or channel-independence (CI) strategies. CM strategy can capture inter-variable dependencies but fails to discern variable-specific temporal patterns. CI strategy improves this aspect but fails to fully exploit cross-variable dependencies like CM. Hybrid strategies based on feature fusion offer limited generalization and interpretability. To address these issues, we propose C3RL, a novel representation learning framework that jointly models both CM and CI strategies. Motivated by contrastive learning in computer vision, C3RL treats the inputs of the two strategies as transposed views and builds a siamese network architecture: one strategy serves as the backbone, while the other complements it. By jointly optimizing contrastive and prediction losses with adaptive weighting, C3RL balances representation and forecasting performance. Extensive experiments on seven models show that C3RL boosts the best-case performance rate to 81.4% for models based on CI strategy and to 76.3% for models based on CM strategy, demonstrating strong generalization and effectiveness.

Shared-control teleoperation systems, which combine human cognitive versatility and robotic precision, are essential for executing complex tasks in inaccessible environments. A critical challenge in such systems is accurately estimating the operator’s intent to ensure the robot’s assistive actions align with the operator’s goals. Traditional trajectory prediction methods estimate the robot’s future path as the operator’s intent. However, without accounting for communication delays, these methods predict the robot’s execution trajectory, which diverges from the operator’s intended trajectory due to the delays. To address this issue, we propose the delay-aware Robot Trajectron (DA-RT), which restores the causal relationship between observed commands and actions by leveraging temporally aligned data and a delay-conditioned attention pooling mechanism. This enables DA-RT to accurately estimate the operator’s intended trajectory under communication delays. Then, we integrate DA-RT with an artificial potential field based controller and a dynamic arbitration mechanism to form a delay-aware shared-control framework, which adjusts the level of assistance based on delay magnitude and the agreement between the operator’s command and the robot’s motion. In human-in-the-loop experiments with fifteen participants, our approach demonstrated significant improvements in both task success rate and efficiency, outperforming traditional methods.

As a typical application of the Internet of Things, mobile robot teleoperation systems play a crucial role in dangerous tasks or special scenarios. The passive takeover mechanism provides effective safety assurance for such systems, relying on a takeover request (TOR) generator to issue warnings and an authority transfer controller to manage control handover. However, variable communication delays can degrade the safety and smoothness of the passive takeover process. To address this issue, we propose a trajectory prediction-based adaptive takeover method that redesigns both the TOR generator and the authority transfer controller. The TOR generator issues early warnings based on the predicted robot trajectory in autonomous control mode. The authority transfer controller uses the control input that tracks the predicted human-intended trajectory as a reconstruction of the delayed human input, and adaptively adjusts the weights between the autonomous input and the reconstructed human input based on the risk indicator and the delay impact level. The effectiveness of the proposed method is validated through the human-in-the-loop simulation. The results show that our method ensures better safety and smoothness in the takeover process compared to other methods.

This article first proposes a discrete-time sliding flexible performance preset boundary (DT-SFPPB)-based control algorithm for input saturated discrete-time nonlinear systems (IS-DTNSs). Compared to the existing discrete-time prescribed performance control (DT-PPC) algorithms, the PPB of them present a “trumpet” shape, resulting in fundamental conservation of the transient performance, and whenever the initial error is altered, it is essential to recheck whether the new error meets the original constraint condition, if not, a new PPB with a larger measure has to be reselected. By designing a novel DT-SFPPB associated with the initial error, which can always envelope the initial error with an arbitrarily preset initial measure, indicating that the proposed approach can be utilized for IS-DTNSs with arbitrary initial error without compromising the initial transient performance. Furthermore, the coupling effect between performance preset and input saturation is also considered, by designing a novel equilibrium boundary related to saturation, so that the proposed approach can achieve the synergy between performance preset and input security, i.e., the designed DT-SFPPB can flexibly expand when input saturation occurs to avoid vulnerability, and when the control input is within the safe boundary, it rapidly reverts to the original PPB to guarantee the specified performance metrics. The findings demonstrate that the developed approach guarantees that the system output tracks the desired signal with the specified performance metrics, and all of the tracking errors are always enveloped within their corresponding DT-SFPPBs. The devised approach is exemplified by means of simulation examples.

This article first proposes a sliding flexible prescribed performance boundary-guided reinforcement learning (SFPPB-RL) control approach for input-constrained nonlinear systems (ICNSs). By designing a sliding flexible prescribed performance boundary, which not only can adaptively adjust the initial boundary according to the initial error, but also dynamically adjust the constraint relaxation according to the coupling correlation between the input constraint and the performance constraint, a novel prescribed performance control (PPC) approach is proposed. Compared with the existing "horn" shape performance boundary-based PPC methods, the limitation of having to repeatedly debug design parameters or sacrifice initial transient performance to meet different initial error requirements is eliminated. Meanwhile, the coupling effect between the input constraint and the performance constraint is also considered, and the balance between input safety and control performance is achieved by constructing an auxiliary system. Furthermore, combining identifier-critic-actor structure-based RL strategy and backstepping technique, a sliding flexible PPB-guided reinforcement learning (SFPPB-RL) optimal control algorithm is developed, which minimizes the cost function while ensuring input safety and prescribed performance indicators. The validity of the proposed algorithm is demonstrated via simulations.

Capturing document images using handheld mobile devices often results in geometric deformations, which adversely affect the accuracy of Optical Character Recognition (OCR) and document understanding. However, existing transformer-based methods face significant computational costs when processing document images on resource-constrained devices. This study proposes an enhanced Vision Mamba architecture to learn the structural information of document images, thereby rectifying deformed images while reducing computational resource consumption. Additionally, owing to the relative positioning between the document and the imaging device, captured images may exhibit incomplete boundaries. Conventional learning-based methods are primarily designed for images with complete boundaries, which can diminish correction effectiveness. To address this issue, mask consistency loss and preprocessing techniques are introduced to improve the rectification of document images with incomplete boundaries. Experimental results demonstrate the effectiveness and superiority of this method, highlighting its significant value for intelligent document processing.

Adversarial attacks on robotic grasping provide valuable insights into evaluating and improving the robustness of these systems. Unlike studies that focus solely on neural network predictions while overlooking the physical principles of grasping, this paper introduces AdvGrasp, a framework for adversarial attacks on robotic grasping from a physical perspective. Specifically, AdvGrasp targets two core aspects: lift capability, which evaluates the ability to lift objects against gravity, and grasp stability, which assesses resistance to external disturbances. By deforming the object's shape to increase gravitational torque and reduce stability margin in the wrench space, our method systematically degrades these two key grasping metrics, generating adversarial objects that compromise grasp performance. Extensive experiments across diverse scenarios validate the effectiveness of AdvGrasp, while real-world validations demonstrate its robustness and practical applicability.

Recently, deep learning based city flow prediction has been extensively used in the establishment of smart cities. These methods are data-hungry, making them unscalable to areas lacking data. Although transfer learning can use data-rich source domains to assist target domain cities in city flow prediction, the performance of existing methods cannot meet the needs of actual use, because the long-distance road network connectivity is ignored. To solve this problem, we propose a transfer learning method based on spatiotemporal graph convolution, in which we construct a co-occurrence space between the source and target domains, and then align the mapping of the source and target domains’ data in this space, to achieve the transfer learning of the source city flow prediction model on the target domain. Specifically, a dynamic spatiotemporal graph convolution module along with a temporal encoder is devised to simultaneously capture the concurrent spatiotemporal features, which implies the inherent relationship among the road network structures, human travel habits, and city bike flow. Then, these concurrent features are leveraged as cross-city invariant representations and nonlinearly spanned to a co-occurrence space. The target domain features are thereby aligned with the source domain features in the co-occurrence space by using a Mahalanobis distance loss, to achieve cross-city bike flow prediction. The proposed method is evaluated on the public bike flow datasets in Chicago, New York, and Washington in 2015, and significantly outperforms state-of-the-art techniques.

Predicting remaining useful life (RUL) of bearings under scarce labeled data is significant for intelligent manufacturing. Current approaches typically encounter the challenge that different degradation stages have similar behaviors in multisensor scenarios. Given that cross-sensor similarity improves the discrimination of degradation features, we propose a multisensor contrast method for RUL prediction under scarce RUL-labeled data, in which we use cross-sensor similarity to mine multisensor similar representations that indicate machine health condition from rich unlabeled sensor data in a co-occurrence space. Specifically, we use ResNet18 to span the features of different sensors into the co-occurrence space. We then obtain multisensor similar representations of abundant unlabeled data through alternate contrast based on cross-sensor similarity in the co-occurrence space. The multisensor similar representations indicate the machine degradation stage. Finally, we focus on finetuning these similar representations to achieve RUL prediction with limited labeled sensor data. The proposed method is evaluated on a publicly available bearing dataset, and the results show that the mean absolute percentage error is reduced by at least 0.058, and the score is improved by at least 0.122 compared with those of state-of-the-art methods.

This article first presents a dual flexible prescribed performance control (DFPPC) approach of input saturated high-order nonlinear systems (IS-HONSs). Compared to the existing PPC approaches of IS-HONSs, under which the performance constraint boundaries (PCBs) are usually fixed and bounded, resulting in a restriction of the initial error in the algorithm implementation; in addition, the coupling relationship between performance constraints and input saturation is usually ignored, resulting in the methods are very fragile when input saturation occurs. By designing the novel tensile model-based PCBs that depend on output and input constraints, the proposed DFPPC method provides sufficient resilience for both the initial conditions and the input saturation, so that the proposed DFPPC method can not only be suitable for multiple types of initial errors by adjusting the parameters, including , , and , where , and denote the initial PCBs; but also can achieve a good balance between input saturation and performance constraints, i.e., when the control input reaches or exceeds the saturation threshold, the PCBs can adaptively extend to avoid the singularity, and when the control input returns to the saturation threshold range, the PCBs are then adaptively restored to the original PCBs. The results show that the proposed DFPPC algorithm guarantees semi-global boundedness for all closed-loop signals, while ensuring that the system output accurately tracks the desired signal, and it consistently maintains the tracking error within the PCBs. The developed algorithm is illustrated by means of simulation instances.

The issue of sliding flexible prescribed performance control (SFPPC) of input saturated nonlinear systems (ISNSs) is first studied in this article. Compared to the traditional PPC and the finite-time PPC algorithms for ISNSs, under which the performance constraint boundaries (PCBs) present the symmetrical or asymmetric “horn” shape, which leads to a large jitter in the tracking error before the system reaches steady state; and once the parameters are selected, the PCBs are fixed, when the initial state (or reference signal) changes, it is necessary to reverify whether the initial error still satisfies the initial constraint condition. By designing a new pair of sliding flexible PCBs (SFPCBs) associated with the initial error, a novel SFPPC algorithm is presented in this article, which presents two main advantages: 1) the SFPCBs can slide adaptively with the initial tracking error without increasing the measure of the initial PCBs, implying that the proposed SFPPC algorithm can be applied to ISNSs with arbitrary initial errors without sacrificing the initial control performance; 2) the proposed SFPPC algorithm achieves a tradeoff between performance constraint and input saturation, i.e., the SFPCBs can adaptively increase when the control input exceeds the maximum allowable threshold, effectively avoiding singularity, and when the control input is within the saturation threshold range, the SFPCBs can adaptively revert back to the original PCBs. The results demonstrate that the proposed SFPPC approach can guarantee that the system output tracks the desired signal, and the tracking error always kept within the SFPCBs that depend on initial error, input, and output constraints. The developed algorithm is exemplified by means of simulation instances.

Abstract The swift advancement of convolutional neural networks (CNNs) in numerous real-world utilizations urges an elevation in computational cost along with the size of the model. In this context, many researchers steered their focus to eradicate these specific issues by compressing the original CNN models by pruning weights and filters, respectively. As filter pruning has an upper hand over the weight pruning method because filter pruning methods don’t impact sparse connectivity patterns. In this work, we suggested a Bayesian Convolutional Neural Network (BayesCNN) with Variational Inference, which prefaces probability distribution over weights. For the pruning task of Bayesian CNN, we utilized a combined version of L1-norm with capped L1-norm to help epitomize the amount of information that can be extracted through filter and control regularization. In this formation, we pruned unimportant filters directly without any test accuracy loss and achieved a slimmer model with comparative accuracy. The whole process of pruning is iterative and to validate the performance of our proposed work, we utilized several different CNN architectures on the standard classification dataset available. We have compared our results with non-Bayesian CNN models particularly, datasets such as CIFAR-10 on VGG-16, and pruned 75.8% parameters with float-point-operations (FLOPs) reduction of 51.3% without loss of accuracy and has achieved advancement in state-of-art.

This article presents a unified adaptive fuzzy control approach for high-order nonlinear systems (HONSs) with multitype state constraints. Existing methods always require the upper and lower constraint boundaries are strictly positive and negative functions (or constants), respectively, which is often inconsistent with the actual constraints. In this article, "multitype state constraint" means that the upper and lower constraint boundaries include multiple types, such as both being strictly positive (or negative), sometime be positive or negative, and so on (cases ①-⑥). By designing a unified mapping function (UMF), the multitype state constraints are processed under removal the feasibility conditions (FCs). Furthermore, a technical design makes the proposed method also applicable to unconstrained HONSs without changing the control structure. By means of a fuzzy-logic system (FLS) and fixed-time stability theory (FTST), the proposed algorithm can ensure that the tracking error converges to a zero-centered neighborhood within a fixed time, and the singularity which often appears in the existing fixed-time control (FTC) methods of HONSs is effectively avoided. Simulation results demonstrate the scheme developed.

This article presents a prescribed-time output feedback control (PTOFC) algorithm for cyber-physical systems (CPSs) under output constraint occurring in any finite time interval (OC-AFT) and malicious attacks. The OC-AFT meaning that the output constraint only occurs during a finite number of time periods while being absent in others, which is more general and complex than traditional infinite-time/deferred output constraints. A stretch model-based nonlinear mapping function is constructed to handle the OC-AFT, and a salient advantage is that the proposed algorithm is also suit for CPSs with infinite-time/deferred output (or funnel) constraints, as well as those that are constraint-free, without necessitating changes to the control structure. The uncertain terms (including system model uncertainties, malicious attacks, and external disturbances) are compensated by fuzzy logic systems. Furthermore, a novel practical prescribed-time stability criterion is proposed, under which a novel PTOFC scheme is given. The results demonstrate that the proposed scheme can ensure that both tracking error and observation error converge to a neighborhood centered on zero within a prescribed time, while accommodating the OC-AFT and malicious attacks. Additionally, the settling time remains unaffected by control parameters and initial states, and the limitations of excessive initial control inputs and singularity problems in existing prescribed-time control algorithms are eliminated. The developed algorithm is exemplified through simulation instances.

A flexible prescribed performance control (FPPC) approach for input saturated nonlinear systems (ISNSs) with unmeasurable states is first presented in this article. Compared to the standard prescribed performance control (SPPC) or funnel control methods for ISNSs, the “flexibility” of the proposed FPPC algorithm is reflected in two aspects: 1) the proposed FPPC algorithm simultaneously considers multiple key indicators (including the steady state accuracy, convergence time, and overshoot), which are widely demanded in industrial production; 2) the proposed FPPC algorithm achieves a tradeoff between performance constraint and input saturation, i.e., the performance boundary can adaptively increase when the control input exceeds the saturation threshold, effectively avoiding singularity; conversely, when the control input is within the saturation threshold range, the performance constraint boundary can adaptively revert back to the original performance boundary. In addition, the unmeasured states are observed by the state observer, and the unknown nonlinear functions are approximated by fuzzy logic systems. The results demonstrate that the proposed output feedback control algorithm can ensure that all closed-loop signals are semiglobally bounded, the system output can track the desired signal within a prescribed time, and the tracking error is consistently maintained within flexible performance boundaries that depend on input and output constraints. The developed algorithm is exemplified through simulation instances.

A novel practical prescribed-time control (PPTC) approach for high-order nonlinear systems (HONSs) subject to state constraints is studied in this article. Different from the existing methods which always require the constraint boundaries to be continuous functions, the state constraints considered in this article are discontinuous (i.e., the state constraints occur only in some time periods and not in others), which can be found in many practical systems. By designing a novel stretch model-based nonlinear mapping function (NMF), the state constraints are dealt with directly, and the limitations that the virtual control function depends upon the feasibility condition (FC) and the tracking error depends upon the constraint boundaries in the conventional schemes are removed. Meanwhile, the proposed method is a unified one, which is also effective for HONSs with conventional continuous state constraints/ deferred state constraints/ funnel constraints or constraints-free without altering the control structure. Furthermore, by designing a newly time-varying scaling transformation function (STF), a more relaxed criterion for practical prescribed-time stable (PPTS) is given, based on which a newly PPTC algorithm is designed. The result shows that the proposed algorithm can preset the upper bound of the settling time, which does not depend upon the initial state of the system and control parameters, the limitations of singularity problem and excessive initial control input in existing methods are removed. Simulation examples verify the algorithm developed.

This article investigates the event-triggered distributed model predictive control (DMPC) for perturbed coupled nonlinear systems subject to state and control input constraints. A novel compound event-triggered DMPC strategy, including a compound triggering condition and a new constraint tightening approach, is developed. In this event-triggered strategy, two stability-related conditions are checked in a parallel manner, which relaxes the requirement of the decrease of the Lyapunov function. An open-loop prediction scheme to avoid periodic transmission is designed for the states in the terminal set. As a result, the number of triggering and transmission instants can be reduced significantly. Furthermore, the proposed constraint tightening approach solves the problem of the state constraint satisfaction, which is quite challenging due to the external disturbances and the mutual influences caused by dynamical coupling. Simulations are conducted at last to validate the effectiveness of the proposed algorithm.

Leader-following cluster consensus is investigated for multiagent systems with weighted cooperative–competitive networks and measurement noise. A stochastic approximation protocol is proposed for interactively balanced and sub-balanced networks, and pinning control is introduced to deal with the divergence phenomenon in interactively unbalanced networks. With these protocols, sufficient conditions for reaching a strong mean-square leader-following cluster consensus are established for all the three types of networks, which are also extended to the cases without measurement noise. Numerical examples illustrate the effectiveness of the proposed protocols and theoretical analysis.

The scheduling and control of wireless cloud control systems involving multiple independent control systems and a centralized cloud computing platform are investigated. For such systems, the scheduling of the data transmission as well as some particular design of the controller can be equally important. From this observation, we propose a dual channel-aware scheduling strategy under the packet-based model predictive control framework, which integrates a decentralized channel-aware access strategy for each sensor, a centralized access strategy for the controllers, and a packet-based predictive controller to stabilize each control system. First, the decentralized scheduling strategy for each sensor is set in a noncooperative game framework and is then designed with asymptotical convergence. Then, the central scheduler for the controllers takes advantage of a prioritized threshold strategy, which outperforms a random one neglecting the information of the channel gains. Finally, we prove the stability for each system by constructing a new Lyapunov function, and further reveal the dependence of the control system stability on the prediction horizon and successful access probabilities of each sensor and controller. These theoretical results are successfully verified by numerical simulation.

Functional corticomuscular coupling (FCMC) between the cerebral motor cortex and muscle activity reflects multi-layer and nonlinear interactions in the sensorimotor system. Considering the inherent multiscale characteristics of physiological signals, we proposed multiscale transfer spectral entropy (MSTSE) and introduced the unidirectionally coupled Hénon maps model to verify the effectiveness of MSTSE. We recorded electroencephalogram (EEG) and surface electromyography (sEMG) in steady-state grip tasks of 29 healthy participants and 27 patients. Then, we used MSTSE to analyze the FCMC base on EEG of the bilateral motor areas and the sEMG of the flexor digitorum superficialis (FDS). The results show that MSTSE is superior to transfer spectral entropy (TSE) method in restraining the spurious coupling and detecting the coupling more accurately. The coupling strength was higher in the β1, β2, and γ2 bands, among which, it was highest in the β1 band, and reached its maximum at the 22-30 scale. On the directional characteristics of FCMC, the coupling strength of EEG→sEMG is superior to the opposite direction in most cases. In addition, the coupling strength of the stroke-affected side was lower than that of healthy controls' right hand in the β1 and β2 bands and the stroke-unaffected side in the β1 band. The coupling strength of the stroke-affected side was higher than that of the stroke-unaffected side and the right hand of healthy controls in the sEMG→EEG direction of γ2 band. This study provides a new perspective and lays a foundation for analyzing FCMC and motor dysfunction.

This article investigates the predictive control scheme and related stability issue for a class of discrete-time perturbed nonlinear system with state and input constraints. First, we propose a novel control framework, i.e., networked dual-mode adaptive horizon model predictive control (MPC), which consists of a local controller, a remote controller that is subject to packet losses, and a judger coordinating the switchings between them. The optimization procedure of MPC with variable prediction horizon is implemented in the remote controller while a simple state-feedback control law is in the local one. Second, to establish the stability condition, we propose a new Lyapunov function. By specifying the relation between the Lyapunov function and the optimal MPC value function, the input-to-state practical stability is established. Finally, simulation results show the effectiveness of our proposed control scheme.

Surface electromyography (sEMG) is an electrophysiological reflection of skeletal muscle contractile activity that can directly reflect neuromuscular activity. It has been a matter of research to investigate feature extraction methods of sEMG signals. In this letter, we propose a feature extraction method of sEMG signals based on the improved small-world leaky echo state network (ISWLESN). The reservoir of leaky echo state network (LESN) is connected by a random network. First, we improved the reservoir of the echo state network (ESN) by these networks and used edge-added probability to improve these networks. That idea enhances the adaptability of the reservoir, the generalization ability, and the stability of ESN. Then we obtained the output weight of the network through training and used it as features. We recorded the sEMG signals during different activities: falling, walking, sitting, squatting, going upstairs, and going downstairs. Afterward, we extracted corresponding features by ISWLESN and used principal component analysis for dimension reduction. At the end, scatter plot, the class separability index, and the Davies-Bouldin index were used to assess the performance of features. The results showed that the ISWLESN clustering performance was better than those of LESN and ESN. By support vector machine, it was also revealed that the performance of ISWLESN for classifying the activities was better than those of ESN and LESN.

Most video surveillance systems use both RGB and infrared cameras, making it a vital technique to re‐identify a person cross the RGB and infrared modalities. This task can be challenging due to both the cross‐modality variations caused by heterogeneous images in RGB and infrared, and the intra‐modality variations caused by the heterogeneous human poses, camera position, light brightness etc. To meet these challenges, a novel feature learning framework, hard pentaplet and identity loss network (HPILN), is proposed. In the framework existing single‐modality re‐identification models are modified to fit for the cross‐modality scenario, following which specifically designed hard pentaplet loss and identity loss are used to increase the accuracy of the modified cross‐modality re‐identification models. Based on the benchmark of the SYSU‐MM01 dataset, extensive experiments have been conducted, showing that the authors’ method outperforms all existing ones in terms of cumulative match characteristic curve and mean average precision.

The vehicle emission remote sensing system is one promising solution to monitor the emissions of on-road vehicles that contribute to the air pollution in urban areas. To implement such a system an effective location strategy to place the monitors is yet to be designed. To this purpose we formulate a novel location problem where the minimum subset of roads on which traffic emission monitors are located is to be found only using the topological structure and some other available information of the traffic network. We solve this problem by transforming it into a graph-theoretic problem and considering more characteristics such as the traffic regulations and limits. After modeling the real-world traffic network as a digraph, a two-step algorithm is developed. The first step is to find all directed circuits to establish hypergraph-based set of directed circuits using the depth first searching strategy. In the second step, an approximation algorithm is designed to find the greedy transversal which is a subset of roads to place vehicle emission monitors in order to cover all the traffic circuits. The performance of the location strategy is validated by both theoretical developments and illustrative examples.

In order to mitigate the air pollution caused by traffic, the monitoring of on-road vehicle emission is really an urgent issue. The Vehicle Emission Remote Sensing System (VERSS) is a promising technology to solve this problem. But there is scarcely any available location strategy for traffic emission monitors yet to our knowledge, which restraints the use of monitors on a large scale of traffic network. In this paper, we make some efforts to solve a novel location problem in the transportation domain, that is, we look for the minimum subset of roads on which traffic emission monitors should be located, thus we can detect as many on-road vehicles as possible. We explicate how to transform the location problem to some graph problems and give the problem formulation mathematically. Then a two-step algorithm is designed to find the set of roads to locate monitors. The simulation test verify its availability. And in the last section some problems that should be studied further are presented at the end of the paper.

The real-time mapping of street atmospheric pollution concentration does play an important role because its knowledge is crucial for strategy-makers to make more effective control strategies to decrease urban atmospheric pollution and improving urban atmospheric environment. Combining the conventional methods (e.g. the dispersion model prediction and neural network prediction) and mobile measurement technology (e.g. the GMAP vehicle) which their characteristics are complementary, a linear model is proposed and then a fusion approach called weighting filter derived from the concept of Kalman filter. Moreover, a self-tuning regulator is introduced to adjust the parameters of filter for the changing noise statistical characteristics over time which mainly caused by season switch. The performances of asymptotic stability and asymptotic optimality are both mathematically proven. Finally a simulation test is conducted to verify this approach.

mRNA translation is a complex process involving the progression of ribosomes on the mRNA, resulting in the synthesis of proteins, and is subject to multiple layers of regulation. This process has been modelled using different formalisms, both stochastic and deterministic. Recently, we introduced a Probabilistic Boolean modelling framework for mRNA translation, which possesses the advantage of tools for numerically exact computation of steady state probability distribution, without requiring simulation. Here, we extend this model to incorporate both random sequential and parallel update rules, and demonstrate its effectiveness in various settings, including its flexibility in accommodating additional static and dynamic biological complexities and its role in parameter sensitivity analysis. In these applications, the results from the model analysis match those of TASEP model simulations. Importantly, the proposed modelling framework maintains the stochastic aspects of mRNA translation and provides a way to exactly calculate probability distributions, providing additional tools of analysis in this context. Finally, the proposed modelling methodology provides an alternative approach to the understanding of the mRNA translation process, by bridging the gap between existing approaches, providing new analysis tools, and contributing to a more robust platform for modelling and understanding translation.

An extended asynchronous switching model is investigated for a class of switched stochastic nonlinear retarded systems in the presence of both detection delay and false alarm, where the extended asynchronous switching is described by two independent and exponentially distributed stochastic processes, and further simplified as Markovian. Based on the Razumikhin-type theorem incorporated with average dwell-time approach, the sufficient criteria for global asymptotic stability in probability and stochastic input-to-state stability are given, whose importance and effectiveness are finally verified by numerical examples.

A packet-based deadband control approach is proposed for Networked Control Systems (NCSs). Within the packet-based control framework for NCSs, the proposed deadband control strategy takes full advantage of the packet-based data transmission in NCSs, and thus considerably reduces the use of the communication resources in NCSs whilst maintaining the system performance at a satisfactory level. The stability conditions of the closed-loop system are obtained and a numerical example illustrating the effectiveness of the proposed approach is presented.

In this paper, the packet-based control approach to networked control systems (NCSs) is extended to the continuous-time case with the use of a discretization technique for continuous network-induced delay. The derived approach can effectively simultaneously deal with network-induced delay, data packet dropout, and data packet disorder and leads to a novel model for NCSs. This model offers the designer the freedom of designing different controllers with respect to specific network conditions, which is distinct from previous results and ensues better system performance. By applying switched system theory, the stability criterion for the derived model is obtained, which is then used to obtain an linear matrix inequality-based stabilized controller design method for the packet-based control approach. A numerical example is also presented, which illustrates the effectiveness of the proposed packet-based control approach by comparison.

In this paper, the packet-based control approach to networked control systems is extended to the continuous time case, with the use of a discretization technique for the continuous network-induced delay. The derived approach can effectively deal with network-induced delay, data packet dropout and data packet disorder simultaneously, and also leads to a novel model for networked control systems. This model offers the designer the freedom of designing different controllers with respect to specific network conditions, which is distinct from previous results and is expected to result in better performance. By applying switched system theory, the stability criterion for the closed-loop system is obtained. A numerical example to illustrate the effectiveness of the proposed approach is also presented.

In this paper, a predictive control-based approach is proposed for a Hammerstein-type system which is closed through some form of network. The approach uses a two-step predictive controller to deal with the static input nonlinearity of the Hammerstein system and a delay and dropout compensation scheme to compensate for the communication constraints in a networked control environment. Theoretical results are presented for the closed-loop stability of the system. Simulation examples illustrating the validity of the approach are also presented.