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

Formation control and path planning of multi-robot systems via large language models

Science China(Information Sciences) 2025年第5期68卷 72-88页

作者： Dong XUE Xuanjie ZHOU Ming WANG Fangzhou LIU Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of EducationEast China University of Science and Technology Research Institute of Intelligent Control and Systems School of Astronautics Harbin Institute of Technology

Existing path planning and coordination control methods for multi-robot systems(MRS) typically rely on predefined rules and rudimentary algorithms. However, these methods often struggle to adapt flexibly to complex environments and to adjust motion targets appropriately. To address this challenge, this study presents a large language model(LLM)-assisted framework. By integrating textual descriptions of complex motion constraints, robot information, and local environmental data as inputs, LLMs generate motion objectives and translate them into executable control commands for the robots, thereby achieving coordinated control and path planning. This framework facilitates the generation, maintenance, and reshaping of formations in MRSs during path planning, applicable to both obstacle-free and obstacle-avoidance environments. Simulation results demonstrate that LLM-based control strategies enhance the autonomy, adaptability, flexibility, and robustness of MRS by processing complex information, making intelligent decisions, adapting to environmental changes, and handling disturbances and uncertainties.

关键词： multi-robot systems formation control path planning obstacle avoidance large language models

来源：评论

学校读者我要写书评

暂无评论

Stability and bifurcation analysis of delayed tri-trophic food chain model in poisoned environment with fear effect and additional food

Stability and bifurcation analysis of delayed tri-trophic fo...

引用

作者： 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

来源：评论

学校读者我要写书评

暂无评论

APPLICATION OF NEURAL NETWORKS TO WATER AND WASTE-WATER TREATMENT-PLANT OPERATION

引用

ISA TRANSACTIONS 1992年第1期31卷 25-33页

作者： BOGER, Z Intelligent Process Control Systems Israel

The application of artificial intelligence techniques to the operation of water and wastewater treatment plants in recent years is reviewed. The expert system approach is the most prevalent, but difficulties in acquiring and representing knowledge of the complex phenomena in these plants have led to the search for additional approaches. Fuzzy logic and statistical process control are used for formulating expert rules from plant historical operating data, but artificial neural networks, which can learn from examples, are believed to be a better solution for this task and for many additional problems encountered in the operation of the plants. Basic concepts of neural network organization and training are given as well as recent advances in learning speed improvement that have paved the way for easy application of this technique in large industrial plants. Current and future utilization of neural networks in areas of water and wastewater plant modelling, expert rule extraction, fault detection and diagnosis, plant and instrument monitoring, dynamic forecasting, and robust control are discussed. Examples are given from the application of neural networks to the operation of the Shafdan wastewater treatment plant in Israel. Some limitations of the neural network approach, together with ways of overcoming these limitations, are described. The overall conclusion is that we will soon see neural network techniques applied to achieve better plant operation.

关键词： Water Treatment

来源：评论

学校读者我要写书评

暂无评论

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 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 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 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

来源：评论

学校读者我要写书评

暂无评论

Knowledge extraction from artificial neural networks models

Knowledge extraction from artificial neural networks models

引用

1997 IEEE International Conference on systems, Man, and Cybernetics - Computational Cybernetics and Simulation (SMC 97)

作者： Boger, Z Guterman, H Intelligent Process Control Systems Be'er-Sheva Israel

ISBN: (纸本)078034054X

The paper describes the development and application of several techniques for knowledge extraction from trained ANN models, such as the identification of redundant inputs and hidden neurons, deriving of causal relationships between inputs and outputs, and analysis of the hidden neuron behavior in classification ANN. Example of the application of these techniques is given of the faulty LED display benchmark. References of the application of these techniques are given of diverse large scale ANN models of industrial processes.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak–Lojasiewicz Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Xu, Lei Yi, Xinlei Sun, Jiayue Shi, Yang Johansson, Karl H. Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China University of Victoria Department of Mechanical Engineering VictoriaBCV8W 2Y2 Canada Tongji University Shanghai Institute of Intelligent Science and Technology Shanghai201804 China KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden

This paper considers distributed optimization for minimizing the average of local nonconvex cost functions, by using local information exchange over undirected communication networks. To reduce the required communication capacity, we introduce an encoder–decoder scheme. By integrating it with distributed gradient tracking and proportional integral algorithms, respectively, we then propose two quantized distributed nonconvex optimization algorithms. Assuming the global cost function satisfies the Polyak–Lojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that our proposed algorithms linearly converge to a global optimal point. Moreover, we show that a low data rate is sufficient to guarantee linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical examples. © 1963-2012 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：