{"title":"CMo-IABA: Constrained Multi-Objective Invisible and Adaptive Backdoor Attack for Deep Neural Networks-Based SAR Image Classification","authors":"Guo-Qiang Zeng;Hai-Nan Wei;Kang-Di Lu;Guang-Gang Geng","doi":"10.1109/JAS.2025.125888","DOIUrl":"https://doi.org/10.1109/JAS.2025.125888","url":null,"abstract":"Deep neural networks (DNNs) have been widely applied in the field of synthetic aperture radar (SAR) image while they are facing more and more serious threats from a variety of malicious attacks. As one of the malicious attacks with strong destructiveness and stealth, backdoor attacks have severely affected DNNs, but there are no related research studies concerning the backdoor attacks against the DNNs-based SAR image classification models. In this work, we make the first attempt to automatically design a constrained multi-objective invisible and adaptive backdoor attack termed as CMo-IABA for DNNs-based SAR image classification. In the CMo-IABA, we firstly generate an initial trigger-based backdoor attack randomly by a random combination of pixels with random noise conforming to the Gaussian distribution. Then, we design multi-objective functions by considering the trade-off between maximizing the attack success rate and minimizing <tex>$L_{2}$</tex> distance-based invisibility. The classification error between the backdoor DNN and the clean model is considered as the constraint to maintain the original performance of the model. To solve the optimization problem, a discrete non-dominated sorting genetic algorithm-II is introduced as the search engine with the developed crossover operation and mutation operation. The superiority of the proposed CMo-IABA to five state-of-the-art backdoor attacks on six different types of DNNs-based SAR image classification models has been demonstrated by the experimental results on Fudan University SAR (FUSAR)-ship and moving and stationary target acquisition and recognition (MSTAR) datasets in terms of attack success rate and <tex>$L_{2}$</tex> distance-based invisibility.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 7","pages":"1731-1746"},"PeriodicalIF":18.3,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148661839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yiren Liu;Lishuai Li;Yang Zhao;Yining Dong;S. Joe Qin
{"title":"Multi-Time-Scale Modeling for Day-Ahead Forecasting of Passenger Travel-Time and Destinations Distribution","authors":"Yiren Liu;Lishuai Li;Yang Zhao;Yining Dong;S. Joe Qin","doi":"10.1109/JAS.2026.126170","DOIUrl":"https://doi.org/10.1109/JAS.2026.126170","url":null,"abstract":"It is crucial to forecast passenger flows for optimizing subway operations and improving travel experience for passengers. While traditional methods usually estimate the average travel time of passengers, this study delves into the modeling and prediction travel time distributions from all origin stations to all destinations. We construct a matrix that includes the travel time and destination for passengers originating from each station at a time slot. We propose a traveltime and destinations distribution modeling approach for one-day ahead predictions for each origin station. By quantifying the multi-time-scale similarities of week-to-week, day-to-day, and time-to-time, we unveil the underlying mechanisms of passengers' travel patterns, revealing predictable and repetitive mobility behaviors. We validate the proposed model using real subway passenger data sets and demonstrate its superior performance in predicting the passenger flows and the associated travel time.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 7","pages":"1610-1625"},"PeriodicalIF":18.3,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148661556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hongyu Lin;Jing Liang;Bo Jin;Caitong Yue;Yaonan Wang
{"title":"A Two-Step Iterative Local Search for the Harvester Scheduling Problem with Splittable Workloads","authors":"Hongyu Lin;Jing Liang;Bo Jin;Caitong Yue;Yaonan Wang","doi":"10.1109/JAS.2025.125768","DOIUrl":"https://doi.org/10.1109/JAS.2025.125768","url":null,"abstract":"With the growing emphasis on intelligent agriculture, scheduling problems involving multiple harvesters in large-scale croplands have attracted increasing attention. In these scenarios, harvesters collaboratively perform tasks in expansive croplands, with each harvester taking on a portion of the workload. This study defines such problems as the harvester scheduling problem with splittable workloads (HSPSW). Unlike most multi-robot task allocation problems, HSPSW requires collaboration among several harvesters and involves more harvesters than croplands. These features increase the complexity of har-vester-cropland interactions. To address these challenges, this paper proposes a novel two-step iterative local search (TSILS) algorithm. A greedy strategy that prioritizes croplands with higher workloads is proposed to generate initial solutions. Subsequently, a two-step iterative search strategy is employed to obtain high-quality solutions: the first step uses a predefined objective to facilitate rapid workload allocation for feasible solutions, and the second step integrates specific neighborhood operators and fine-grained local search to improve its search capability. Experimental results demonstrate that the proposed method TSILS significantly outperforms existing approaches in both algorithmic performance and computational efficiency.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 7","pages":"1584-1599"},"PeriodicalIF":18.3,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148661783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Causal Representation Learning for Trustworthy Industrial Process Modeling","authors":"Liang Cao;Fan Yang;Youqing Wang","doi":"10.1109/JAS.2025.125678","DOIUrl":"https://doi.org/10.1109/JAS.2025.125678","url":null,"abstract":"Industrial processes have become increasingly complex and dynamic, making robust and interpretable modeling techniques indispensable for safe and efficient operation. Although contemporary machine learning algorithms exhibit strong predictive capabilities [1], [2], it remains challenging to ensure trustworthy performance—i.e., models that reliably generalize to diverse operating regimes while offering intuitive explanations of their behavior. Achieving high accuracy with robust interpretability and stability (especially under process upsets or nonstationarities) stands as a pressing need in modern industrial environments [3], [4].","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 7","pages":"1758-1760"},"PeriodicalIF":18.3,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11639370","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148661565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-Agent Swarm Optimization Method with Contribution-Based Cooperation for Distributed Multi-Target Localization and Data Association","authors":"Taiyou Chen;Xiaomin Hu;Qiuzhen Lin;Weineng Chen","doi":"10.1109/JAS.2025.125150","DOIUrl":"https://doi.org/10.1109/JAS.2025.125150","url":null,"abstract":"With the development of communication and computation capabilities on terminal hardware, it is promising to apply distributed optimization methods to wireless sensor networks to improve the autonomous collaboration ability of sensors. In this work, we study distributed multi-target localization problem with measurement-to-measurement association (DM2M), where each sensor only accesses its own measurement data without the association of measurements from other sensors. We first reformulate DM2M into a distributed bilevel optimization problem to reduce the search space of negotiated variables caused by the data association among sensors. Then, we propose a multi-agent swarm optimization method with contribution-based cooperation (MASTER). In MASTER, each sensor maintains a particle swarm to represent candidate solutions of target positions. Sensors evolve their particle swarms through two phases of local optimization and neighbor cooperation to locate the target cooperatively. To address the bilevel local objective function, we combine the Kuhn-Munkres algorithm and the competitive swarm optimization for local optimization. To promote sensors to optimize the global objective, we design a contribution-based cooperation method to guide sensors to learn from their neighbors. Through localization experiments for different target numbers and localization dimensions, the proposed algorithm achieves smaller localization errors and more stable consensus than existing algorithms.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 7","pages":"1673-1688"},"PeriodicalIF":18.3,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148661862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Spatiotemporal Graph Neural Network-Incorporated Latent Factorization of Tensors for Dynamic QoS Estimation","authors":"Xin Luo;Fanghui Bi;Tiantian He","doi":"10.1109/JAS.2025.125750","DOIUrl":"https://doi.org/10.1109/JAS.2025.125750","url":null,"abstract":"Quality of service (QoS) data that characterize historical user-service invocations that vary over time are vital to discovering patterns of cloud services and understanding user behaviors. Though effective, prevalent approaches never consider higher-order spatiotemporal connectivity within QoS data, thus suffering from inferior performance. To address this critical issue, this paper presents spatiotemporal graph convolutional network (GCN) that is equipped with the functionality of latent factorization of tensors (SGLFT). It is achieved by introducing three key innovations: 1) Proposing a tensor graph convolution based on the generalized tensor product technique for uniformly modeling the temporal and spatial patterns within dynamic user-service graphs; 2) Incorporating the built layer-wise graph convolution into tensor factorization for efficiently capturing the implied spatiotemporal high-order connectivity; and 3) Developing a node-level attention pooling mechanism to perceive feature differences among neighbors and across time slots. Theoretical derivations are conducted to demonstrate that the expressivity of the graph neural network proposed in this paper is evidently higher than that of vanilla GCNs. Empirical studies on eight large-scale testing cases arising from two real-world dynamic QoS datasets show that SGLFT substantially outperforms state-of-the-art QoS estimators regarding estimation accuracy for missing dynamic QoS data.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 7","pages":"1642-1656"},"PeriodicalIF":18.3,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148661684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secure Control of Networked Control Systems Based on Multiplicative Watermarking-Based Detection and Data Compensation","authors":"Lang Wu;Dajun Du;Yang Xiao;Qing Sun;Minrui Fei","doi":"10.1109/JAS.2025.125753","DOIUrl":"https://doi.org/10.1109/JAS.2025.125753","url":null,"abstract":"The crafted generalized replay attacks (GRAs) can bypass traditional multiplicative watermarking (MW)-based active detection in networked control systems (NCSs), which will seriously destroy system stability or even crash. To address this problem, this letter proposes a novel secure control method by using MW-based detection and data compensation. First, the limitation of traditional MW-based detection method is analysed, and a novel MW-based active detection scheme is proposed by adding an irreversible watermarking detection unit. Then, according to the detection result, an online data compensation scheme based on cubic spline interpolation algorithm is provided, and the maximum allowed attack rate of GRAs is given to maintain the exponential stability of NCSs. Finally, experimental results confirm the effectiveness of the proposed method.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 7","pages":"1776-1778"},"PeriodicalIF":18.3,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11639363","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148661512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Zonotope-Based Distributed Fusion for 2-D Binary Sensor Systems Under FlexRay Protocols","authors":"Lan Lan;Guoliang Wei;Ying Sun","doi":"10.1109/JAS.2025.125744","DOIUrl":"https://doi.org/10.1109/JAS.2025.125744","url":null,"abstract":"In this paper, a zonotopic distributed fusion estimation problem is investigated for a class of 2-D nonlinear systems subject to unknown-but-bounded noises over a binary sensor network. An auxiliary innovation is constructed to reduce the influence of the less measured information, and FlexRay protocol is employed to schedule the innovation transmission between nodes. By resorting to the set-membership filtering, a variable-independent zonotope is achieved to constrain local estimation error, and gain parameters are obtained by minimizing the upper bound of zonotope in the F-radius sense. Subsequently, a zonotopic distributed fusion scheme is implemented through the matrix-weighted fusion criteria, and an optimized weighted matrix is obtained using the Lagrange Multiple method. Furthermore, the monotonicity of the local zonotope is analyzed with the gain-constraint parameter. Finally, a numerical example is considered to verify the effectiveness of the developed fusion algorithm.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 7","pages":"1600-1609"},"PeriodicalIF":18.3,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148661762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Discipline of Control Science and Engineering in the Intelligent Era: Challenges, Paradigm Transformation, and Future Directions","authors":"Chenghui Zhang","doi":"10.1109/JAS.2026.126254","DOIUrl":"https://doi.org/10.1109/JAS.2026.126254","url":null,"abstract":"AT present, the world is experiencing profound transformations unseen in a century, with a new round of scientific and technological revolution increasingly inter-twined with major-power competition. Against this backdrop, artificial intelligence (AI) has emerged as a key strategic technology that is profoundly reshaping global economic, social, and military systems. Through top-level policy design and national development planning, China has been continuously promoting the deep integration of AI with industry, energy, education, and other key domains. Therefore, the intelligent era should not be regarded as a future prospect, but rather as an ongoing transformation that is already reshaping technological development and social progress. Control Science and Engineering (CSE) is a foundational, interdisciplinary, and cross-cutting discipline concerned with system modeling, dynamic regulation, feedback optimization, collaborative decision-making, and autonomous operation. It provides a bridge between the physical world and the information world, and it has long served as an enabling discipline for industrial modernization and technological progress. In the intelligent era, its importance is further amplified: increasingly complex systems must become not only automated, but also adaptive, trustworthy, resilient, explainable, and controllable. This paper aims to clarify the historical position, current challenges, and strategic development path of CSE in the intelligent era. The central argument is that the discipline is entering a critical transition from automation to autonomy. This transition is not a simple extension of existing technologies, but a deeper reconstruction of disciplinary paradigms, knowledge systems, organizational mechanisms, and innovation ecosystems. Against this background, this article further emphasizes the foundational role of control principles in building trustworthy intelligence.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 7","pages":"1533-1535"},"PeriodicalIF":18.3,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11639379","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148661705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"$H_{infty}$ Optimal Output Regulation of Unknown Linear Systems via an Adaptive Dynamic Programming and Internal Model","authors":"Yong-Sheng Ma;Jian Sun;Yong Xu","doi":"10.1109/JAS.2026.125777","DOIUrl":"https://doi.org/10.1109/JAS.2026.125777","url":null,"abstract":"This paper delves into the <tex>$H_{infty}$</tex> optimal output regulation problem for continuous-time linear systems with an unknown system model. By integrating the internal model principle with optimal control, we derive an optimal control policy and a worst-case disturbance policy through the formulation and solution of a zero-sum game problem. Subsequently, leveraging adaptive dynamic programming, we propose a policy iteration learning algorithm capable of learning both the optimal control policy and the worst-case disturbance policy directly from system data. The existing algorithms necessitate an initial stabilizing policy, a full-rank condition, and the storage of historical data to guarantee algorithm convergence. In contrast, we design a dual policy iteration algorithm equipped with an online learning mechanism, thereby eliminating these additional prerequisites. Simulation results with an autonomous ground vehicle underscore the effectiveness of our proposed algorithm, and its superiority is further demonstrated through comparisons with existing methodologies.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 6","pages":"1314-1324"},"PeriodicalIF":18.3,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148518535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}