检索结果-内蒙古大学图书馆

作者： Ramasamy, Sivasamy Banjerdpongchai, David Park, PooGyeon Center of Excellence in Intelligent Control Automation of Process Systems Department of Electrical Engineering Faculty of Engineering Chulalongkorn University Bangkok Thailand Department of Electrical Engineering Pohang University of Science and Technology Pohang Korea Republic of

One of the most important goals of theoretical ecologists is to find a strategy for controlling the chaos in ecological models to maintain healthy ecosystems. We investigate the influence of fear and the supply of additional food to predators in a delayed tri-trophic food chain model, where interference among the species is determined by Holling type-II functional response. The proposed model incorporates the fact that the growth rates of prey and middle predators are decreased due to the fear of middle and special predators, respectively. The additional food is supplied to both predators by either nature or external agencies. Furthermore, the poisoned prey in the predator's environment is taken into account. In the proposed model, we use two time delays: one for the growth term of the middle predator and another for the gestation delay of the special predator. We determine the conditions for the existence of ecologically feasible equilibrium points and their local and global stability. In addition, we establish the conditions for the existence of Hopf bifurcation around interior equilibrium to seek periodic behavior in nondelayed and delayed models. Numerical investigations are performed to justify the proposed theoretical findings through phase portraits, time series of solutions, and bifurcation diagrams. We observe that the chaotic dynamics of a tri-trophic food chain model can be controlled by the proper choice of the fear effect and by supplying additional food parameters. As a result, our findings provide more ecological insights into the dynamics of the delayed tri-trophic food chain model with the fear effect and additional food supply. © 2023 John Wiley & Sons, Ltd.

关键词： Hopf bifurcation

来源：评论

学校读者我要写书评

暂无评论

Finite-Time Consensus of Second-Order Multiagent systems With Input Saturation via Hybrid Sliding-Mode control

引用

IEEE Transactions on automation Science and Engineering 2025年 22卷 14623-14632页

作者： Jiang, Xiaowei Jiao, Ranran Li, Bo Zhang, Xianhe Yan, Huaicheng China University of Geosciences School of Automation Wuhan430079 China Ministry of Education Hubei Key Laboratory of Advanced Control and Intelligent Automation of Complex Systems Engineering Research Center of Intelligent Geodetection Technology Wuhan430074 China Ministry of Education Key Laboratory of System Control and Information Processing Shanghai200240 China Anhui University of Finance and Economics School of Finance Bengbu233030 China Hubei Normal University School of Electrical Engineering and Automation Huangshi435002 China Ministry of Education East China University of Science and Technology Key Laboratory of Smart Manufacturing in Energy Chemical Process Shanghai200237 China

This paper addresses the finite-time consensus (FTC) issue for second-order multi-agent systems (MASs) with nonlinear disturbances. To tackle the challenges posed by increasingly complex communication environments, an innovative integral sliding-mode surface is designed using event-triggered control. Furthermore, the study explores communication constraints between the leader and followers, employing impulsive control to facilitate communication only at specific intervals. A novel hybrid integral sliding-mode control protocol is advanced for the second-order MASs, which effectively eliminates the "Zeno phenomenon" and notably reduces both communication frequency and energy consumption, thereby enhancing overall communication efficiency. Ultimately, the efficacy of the put forward protocol is verified through simulation examples including comparison experiment. © 2004-2012 IEEE.

关键词： Protocols Sliding mode control Event detection Multi-agent systems Costs Training Topology Switches Sufficient conditions Stability analysis

来源：评论

学校读者我要写书评

暂无评论

Optimizing portable gas sensor system for hepatocellular carcinoma detection via volatile organic compounds analysis

引用

Measurement: Journal of the International Measurement Confederation 2025年 253卷

作者： Viphavakit, Charusluk Sukaram, Thanikan Maung, Soe Thiha Rerknimitr, Rungsun Chaiteerakij, Roongruedee Center of Excellence in Intelligent Control Automation of Process Systems Faculty of Engineering Chulalongkorn University Bangkok Thailand Center of Excellence for Innovation and Endoscopy in Gastrointestinal Oncology Division of Gastroenterology Faculty of Medicine Chulalongkorn University Bangkok Thailand Ma Har Myaing Hospital Yangon Myanmar Integrated Innovation and Digital Technologies Affairs Faculty of Medicine Chulalongkorn University Bangkok Thailand

The analysis of volatile organic compounds (VOCs) in exhaled breath is a promising method for the early detection of hepatocellular carcinoma (HCC). However, the current technology suffers from a lack of portability, rendering it unsuitable for field-based screening applications. This study designed a compact sensor system operated in real-time, as detecting the 5 HCC biomarkers simultaneously was vital for accurate diagnosis due to cross-biomarkers for various diseases. The results showed that the optimized gas sensor system included injection volume of 3.0 mL, heating the Tedlar bag to 80 °C, and applying a 1-minute nitrogen purge, which achieved a rapid response time. The proposed gas sensor system has demonstrated excellent performance, with a concentration range of 10–1,000 ppb and strong linearity (R2 > 0.85). This portable analyzer is easy to use, delivers rapid results, and is suitable for point-of-care testing. Further studies are warranted to validate its performance with human breath samples before its implementation in clinical practice. © 2025

关键词： pH sensors

来源：评论

学校读者我要写书评

暂无评论

Stealthy Attacks on Sampled-Data control and Encryption-Based Countermeasures

引用

IEEE Transactions on Automatic control 2025年

作者： Shang, Jun Li, Yuzhe Chen, Tongwen Tongji University Department of Control Science and Engineering Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Shanghai200092 China Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110004 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 1H9 Canada

This paper investigates stealthy attacks on sampled-data control systems, where a continuous process is sampled periodically, and the resultant discrete output and control signals are transmitted through dual channels in wireless communication networks. Acknowledging the vulnerability of these transmitted data to cyber threats, we analyze two types of stealthy attacks that compromise either one or both channels. We explicitly present the necessary and sufficient conditions for the existence of stealthy single-channel attacks. To mitigate these security risks, we implement encryption-based countermeasures, including linear time-invariant and periodic encryption methods. We detail sufficient conditions under which these encryption strategies effectively thwart single- and dual-channel stealthy attacks. The effectiveness of these approaches and the theoretical findings are demonstrated through numerical simulations. © 1963-2012 IEEE.

关键词： Cyber attacks

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex Optimization With Time-Varying Constraints

引用

IEEE Transactions on control of Network systems 2025年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Ministry of Education Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Shanghai201210 China Southeast University School of Automation Nanjing210096 China University of Groningen Engineering and Technology Institute Groningen Faculty of Science and Engineering GroningenAG 9747 Netherlands KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm10044 Sweden KTH Royal Institute of Technology Digital Futures Stockholm10044 Sweden

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms solving this problem require that each agent broadcasts its decision to its neighbors at each iteration. However, communication resources are often limited. To better utilize communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. © 2014 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Distributed Constrained Online Nonconvex Optimization with Compressed Communication

arXiv

引用

arXiv 2025年

作者： Zhang, Kunpeng Xu, Lei Yi, Xinlei Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai201210 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online nonconvex optimization with time-varying inequality constraints over a network of agents. For a time-varying graph, we propose a distributed online primal–dual algorithm with compressed communication to efficiently utilize communication resources. We show that the proposed algorithm establishes an O(T max{1−θ1,θ1}) network regret bound and an O(T 1−θ1/2) network cumulative constraint violation bound, where T is the number of iterations and θ1 ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints at all iterations), the network cumulative constraint violation bound is reduced to O(T 1−θ1). These bounds are comparable to the state-of-the-art results established by existing distributed online algorithms with perfect communication for distributed online convex optimization with (time-varying) inequality constraints. Finally, a simulation example is presented to validate the theoretical results. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Design of Supervisory Model Predictive control for HVAC systems and Two Zones with Consideration of Energy Efficiency and Thermal Comfort 23

Design of Supervisory Model Predictive Control for HVAC Syst...

引用

23rd International Conference on control, automation and systems, ICCAS 2023

作者： Srisurapanon, Panithan Banjerdpongchai, David Chulalongkorn University Center of Excellence in Intelligent Control Automation for Process Systems Faculty of Engineering Department of Electrical Engineering Pathumwan Bangkok10330 Thailand

ISBN: (纸本)9788993215274

This paper presents the design of supervisory model predictive control for HVAC systems and two zones. The supervisory control (SC) is designed to find the optimal reference temperature of each zone. The design criteria consist of the total operating cost (TOC) and the thermal comfort cost (TCC). Then, the model predictive control (MPC) is designed to track the optimal reference signals. When SC and MPC are designed for two zones simultaneously, they are referred to centralized SC and centralized MPC. On the other hand, when SC and MPC are designed for two zones separately, they referred to decentralized SC and decentralized MPC. We then compare the results between the decentralized control and the centralized control. The trade-off curve shows that the performance of centralized control is better than that of decentralized control. In particular, centralized MPC improves the performance in tracking reference signals. Furthermore, TOC of centralized control is lower than that of decentralized control. It can be concluded that the centralized control is appropriate for two zones in terms of the tracking of reference and the electrical charge. © 2023 ICROS.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Unscented Kalman Filter for State of Charge Estimation of Lithium Titanate Battery 20

Unscented Kalman Filter for State of Charge Estimation of Li...

引用

20th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, ECTI-CON 2023

作者： Dardchuntuk, Joshua Chun-Ken Banjerdpongchai, David Faculty of Engineering Chulalongkorn University Center of Excellence in Intelligent Control Automation of Process Systems Department of Electrical Engineering Pathumwan 254 Phayathai Road Bangkok10330 Thailand

ISBN: (纸本)9798350310467

An accurate estimation of the state of charge (SoC) of lithium titanate (LTO) batteries is required for their effective operation and management. In this study, we propose an unscented Kalman filter (UKF) approach for estimating the SoC of LTO batteries, which are challenging to assess due to the nonlinear voltage-SoC relationship and aging impact. Our approach uses a state and measurement model based on LTO's electrochemical characteristics and employs sigma points and weights to address nonlinearities. According to the findings of our research, the UKF-based methodology has high accuracy, rapid convergence, and resilience to discharge rate, outperforming or matching the capabilities of existing state-of-the-art approaches. This work provides a novel and effective solution for LTO battery SoC estimation, useful for applications in electric vehicles, energy storage, and smart grid energy systems. © 2023 IEEE.

关键词： Battery management systems

来源：评论

学校读者我要写书评

暂无评论

Performance Comparison of Lightweight CNN Models for Drone Collision Avoidance Dataset 20

Performance Comparison of Lightweight CNN Models for Drone C...

引用

20th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, ECTI-CON 2023

作者： Zufar, Rifqi Nabila Banjerdpongchai, David Chulalongkorn University Center of Excellence in Intelligent Control Automation of Process Systems Department of Electrical Engineering Faculty of Engineering 254 Phayathai Road Bangkok Pathumwan10330 Thailand

ISBN: (纸本)9798350310467

Collision Avoidance System (CAS) is important for drone safety. CAS consists of three steps e.g., obstacle sensing, collision prediction, and collision avoidance. Collision prediction enables drones to gain information, process information, and estimate whether the object has a risk of collision. Convolution Neural Network (CNN) is one of the methods that can be employed for collision prediction. However, CNN is a method that needs a large data in the training. Dario Pedro et al. provided a dataset called the CoLANet dataset that consists of VDOs of collision drones. Subsequently, they proposed a new algorithm called Neural Network Pipeline which has a Convolution Neural Network (CNN) part to extract the feature from a couple of images. CNN extracts images by using MobileNetV2 as a pre-trained model. They chose MobileNetV2 due to training performance from another dataset. This paper aims to assess the performance of lightweight CNN models using the CoLANet dataset. The models will be trained on the Keras library with parameters of fewer than ten million. The models will be validated by Confusion Matrix and Receiver Operating Characteristics. In conclusion, we examine which pre-trained CNN model has the best performance and suggest ongoing work. © 2023 IEEE.

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：