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

16th APCA International Conference on automatic control and Soft Computing, controlO 2024

作者： Nicu, Theodor-Gabriel Stoican, Florin Ioan, Daniel Prodan, Ionela Department of Automatic Control and Systems Engineering Romania National University of Science and Technology "Politehnica" Bucharest 313 Splaiul Independenţei Bucharest060042 Romania Univ. Grenoble Alpes Grenoble INP Institute of Engineering and Management LCIS Valence26000 France

ISBN: (纸本)9783031817236

This work pertains to the generation of navigation functions for obstacle avoidance and target tracking. One initially defines a so-called spherical world which can be further mapped into many other different topologies using a series of diffeomorphic transformations. This specific configuration further allows one to exploit the main advantages of the sum function approach with respect to the obstacle collision avoidance capabilities of an agent, sum function which is used in order to induce an effective navigation function judging not only from computational perspective, but also from the local minima point of view. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

INCORPORATING THE COM-B MODEL FOR BEHAVIOR CHANGE INTO AN AGENT-BASED MODEL OF SMOKING BEHAVIORS: AN OBJECT-ORIENTED DESIGN

INCORPORATING THE COM-B MODEL FOR BEHAVIOR CHANGE INTO AN AG...

引用

2024 Winter Simulation Conference, WSC 2024

作者： Tian, David Squires, Hazel Y. Buckley, Charlotte Gillespie, Duncan Tattan-Birch, Harry Shahab, Lion West, Robert Brennan, Alan Brown, Jamie Purshouse, Robin C. Dept. of Automatic Control and Systems Engineering University of Sheffield S1 3JD United Kingdom Sheffield Centre for Health and Related Research School of Medicine and Population Health University of Sheffield S1 4DA United Kingdom Institute of Epidemiology and Health University College London WC1E 7HB United Kingdom

ISBN: (纸本)9798331534202

Modeling trajectories in cigarette smoking prevalence, initiation and quitting for populations and subgroups of populations is important for policy planning and evaluation. This paper proposes an agent-based model (ABM) design for simulating the smoking behaviors of a population using the Capability, Opportunity, Motivation - Behavior (COM-B) model. Capability, Opportunity and Motivation are modeled as latent composite attributes which are composed of observable factors associated with smoking behaviors. Three forms of the COM-B model are proposed to explain the transitions between smoking behaviors: initiating regular smoking uptake, making a quit attempt and quitting successfully. The ABM design follows object-oriented principles and extends an existing generic software architecture for mechanism-based modeling. The potential of the model to assess the impact of smoking policies is illustrated and discussed. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fatigue Life Analysis of Piezoelectric Actuating Mechanism with Micro-displacement Amplifier 18

Fatigue Life Analysis of Piezoelectric Actuating Mechanism w...

引用

18th IEEE Conference on Industrial Electronics and Applications, ICIEA 2023

作者： Zhang, Xinyuan Wang, Shaoping Wu, Xiao He, Siyuan Wang, Xingjian Niu, Yu Gavrilov, Alex I. Beihang University School of Automation Science and Electrical Engineering Beijing100191 China Tianmushan Laboratory Xixi Octagon City Yuhang District Hangzhou310023 China Beihang University Ningbo Institute of Technology Ningbo315800 China Beihang University Research Institute of Aero-Engine Beijing100191 China Bauman Moscow State Technical University Department of Automatic Control Systems Moscow105005 Russia

ISBN: (纸本)9798350312201

Since piezoelectric actuating mechanism generally operate in high frequency response state, fatigue life has become an important factor influencing the performance and reliability of the entire drive mechanism. In order to investigate whether the designed piezoelectric ceramic actuator meets the active control requirements of the aero-engine, the paper analyzes the fatigue characteristics and fatigue life of the piezoelectric ceramic materials and the micro displacement amplification mechanism with finite element analysis software and the optimal spacing value is obtained by studying the effect of the flexible hinge spacing on the fatigue characteristics of the displacement amplifier. And then, the fatigue life of the displacement amplifier is analyzed based on the drive load spectrum of the aircraft during simulated flight, whose result is 340.93 hours. Finally, the fatigue life of the piezoelectric actuating mechanism is 32 minutes when loaded with full power, which meets the design target initially. © 2023 IEEE.

关键词： Piezoelectric actuators

来源：评论

学校读者我要写书评

暂无评论

Consistent Event-Triggered Consensus on Complete Graphs

Consistent Event-Triggered Consensus on Complete Graphs

引用

IEEE Conference on Decision and control

作者： Duarte J. Antunes David Meister Toru Namerikawa Frank Allgöwer W.P.M.H. Heemels Dep. of Mechanical Eng. Eindhoven Control Systems Technology Group University of Technology the Netherlands Institute for Systems Theory and Automatic Control University of Stuttgart Germany School of Integrated Design Engineering Graduate School of Science and Technology Keio University Japan

This paper starts by considering an optimal control formulation of the consensus problem on complete graphs with a cost capturing disagreement and agents modeled by integrators. An optimal control policy for this problem is shown to be the well-known consensus algorithm by which each agent resets its state to the average of its and other agents' state values received at every time step. The framework is extended to the case where agents can only exchange information periodically, with a period larger than one. Then an event-triggered control strategy is proposed that results in a better cost than that of the optimal periodic one with the same average transmission rate, that is, it is consistent. According to this strategy, each agent distributedly transmits its state if the error between its current state and a common consensus estimate based on previously transmitted agents' data exceeds a threshold. Simulation results are presented to illustrate the proposed strategy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Training robust and generalizable quantum models

arXiv

引用

arXiv 2023年

作者： Berberich, Julian Fink, Daniel Pranjić, Daniel Tutschku, Christian Holm, Christian University of Stuttgart Institute for Systems Theory and Automatic Control Stuttgart70569 Germany University of Stuttgart Institute for Computational Physics Stuttgart70569 Germany Fraunhofer IAO Fraunhofer Institute for Industrial Engineering Stuttgart70569 Germany

Adversarial robustness and generalization are both crucial properties of reliable machine learning models. In this paper, we study these properties in the context of quantum machine learning based on Lipschitz bounds. We derive parameter-dependent Lipschitz bounds for quantum models with trainable encoding, showing that the norm of the data encoding has a crucial impact on the robustness against data perturbations. Further, we derive a bound on the generalization error which explicitly involves the parameters of the data encoding. Our theoretical findings give rise to a practical strategy for training robust and generalizable quantum models by regularizing the Lipschitz bound in the cost. Further, we show that, for fixed and non-trainable encodings, as those frequently employed in quantum machine learning, the Lipschitz bound cannot be influenced by tuning the parameters. Thus, trainable encodings are crucial for systematically adapting robustness and generalization during training. The practical implications of our theoretical findings are illustrated with numerical results. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Casual Discovery for Complex Mission Planning with Subtask Dependencies 7

Casual Discovery for Complex Mission Planning with Subtask D...

引用

7th International Conference on Big Data and Information Analytics, BigDIA 2021

作者： Liang, Wenqian Zhang, Zhuxin Xiao, Wenhua Zhang, Dayu Niu, Liyuan Tao, Jingjing College of Systems Engineering National University of Defense Technology Changsha China North Automatic Control Technology Institute Taiyuan China Academy of Military Sciences Beijing China

ISBN: (纸本)9781665424660

Discovering causal structure among a set of previously-unseen subtasks which have inner dependencies is a fundamental problem in real-world environments. Unlike existing hierarchical multitask RL approaches that focus on task descriptions such as natural language or formal language that describe what the agent should do at a high level, we develop a Casual Inference Solver with Subtask Graph (CISG), which performs complex reasoning with subtasks, properties and relationships among them to find the optimal subtask to execute. To overcome the difficulty of efficient exploration, upper confidence bound (UCB) is adopted to produce the intrinsic reward. Meanwhile, a novel inductive logic programming (ILP), which utilizes the classification and regression tree (CART) to infer the precondition function for subtasks with Gini impurity, is utilized to pretrain our CISG agent to achieve the optimal subtask to execute. Our experimental results on StarCraft II domains show that our method is able to perform complex reasoning to accurately find the casual relationship among subtasks and make a mission planning more efficiently than existing hierarchical RL methods. © 2021 IEEE.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

Modified projected Gauss-Newton method for constrained nonlinear least-squares: application to power flow analysis

arXiv

引用

arXiv 2025年

作者： Nabou, Yassine Toma, Lucian Necoara, Ion Automatic Control and Systems Engineering Department University Politehnica Bucharest Bucharest060042 Romania Electrical Power Systems Department University Politehnica Bucharest Bucharest060042 Romania Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy Bucharest050711 Romania

In this paper, we consider a modified projected Gauss-Newton method for solving constrained nonlinear least-squares problems. We assume that the functional constraints are smooth and the the other constraints are represented by a simple closed convex set. We formulate the nonlinear least-squares problem as an optimization problem using the Euclidean norm as a merit function. In our method, at each iteration we linearize the functional constraints inside the merit function at the current point and add a quadratic regularization, yielding a strongly convex subproblem that is easy to solve, whose solution is the next iterate. We present global convergence guarantees for the proposed method under mild assumptions. In particular, we prove stationary point convergence guarantees and under Kurdyka-Lojasiewicz (KL) property for the objective function we derive convergence rates depending on the KL parameter. Finally, we show the efficiency of this method on the power flow analysis problem using several IEEE bus test cases. © 2025, CC BY.

关键词： Newton-Raphson method

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Stochastic Scheduling of a Multiproduct Pipeline System using Similarity Index Decomposition

引用

IFAC-PapersOnLine 2024年第14期58卷 43-48页

作者： Daniel Montes José Luis Pitarch César de Prada Department of Systems Engineering and Automatic Control Universidad de Valladolid Spain Institute of Sustainable Processes Universidad de Valladolid Spain Instituto U. de Automática e Informática Industrial (ai2) Universitat Politècnica de Valencia Spain

Multiproduct pipelines are crucial for delivering substantial quantities of refined oil products from major supply centers to clients within a nearby geographical area. Despite the significant infrastructure investment, the associated transportation costs are markedly lower than those incurred with traditional delivery trucks. However, the scheduling of these systems presents a formidable challenge, requiring meticulous planning of pumping runs well in advance to meet the anticipated demands of clients. In this work, we enhance an existing literature model of a multiproduct pipeline system by introducing uncertainty in the customer demand. The problem is then addressed via a two-stage stochastic formulation. The typical drawback with stochastic formulations is the high computational burden required. To address this challenge, we adapt the so-called Similarity Index decomposition, resulting in a 28-fold improvement in CPU time while achieving equivalent solutions compared to solving the full-space problem.

关键词： Decomposition MILP Uncertainty Planning Oil & Gas

来源：评论

学校读者我要写书评

暂无评论

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization

arXiv

引用

arXiv 2025年

作者： Tondji, Lionel Lorenz, Dirk A. Necoara, Ion Institute of Analysis and Algebra TU Braunschweig Braunschweig38092 Germany Automatic Control and Systems Engineering Department University Politehnica Bucharest Bucharest060042 Romania Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics The Romanian Academy Bucharest050711 Romania

In this paper, we propose a randomized accelerated method for the minimization of a strongly convex function under linear constraints. The method is of Kaczmarz-type, i.e. it only uses a single linear equation in each iteration. To obtain acceleration we build on the fact that the Kaczmarz method is dual to a coordinate descent method. We use a recently proposed acceleration method for the randomized coordinate descent and transfer it to the primal space. This method inherits many of the attractive features of the accelerated coordinate descent method, including its worst-case convergence rates. A theoretical analysis of the convergence of the proposed method is given. Numerical experiments show that the proposed method is more efficient and faster than the existing methods for solving the same *** Codes 65F10, 68W20, 90C25 © 2025, CC BY.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Analog, Programmable Switched Capacitor FIR Filter Based on Rotator Architecture Implemented in CMOS Technology

Analog, Programmable Switched Capacitor FIR Filter Based on ...

引用

Signal Processing Algorithms, Architectures, Arrangements and Applications (SPA)

作者： Paweł Pawłowski Rafał Długosz Marek Radkowski Mateusz Wątły Adam Dąbrowski Faculty of Control Robotics and Electrical Engineering Institute of Automatic Control and Robotics Division of Signal Processing and Electronic Systems Poznań University of Technology Poznań Poland Faculty of Telecommunication Computer Science and Electrical Engineering Bydgoszcz University of Science and Technology Bydgoszcz Poland

The paper presents project and its verification of a prototype integrated circuit containing an analog, programmable finite impulse response (FIR) filter, implemented in CMOS 350 nm technology. The structure of the filter is based on the switched capacitor technique. In circuits of this type, one of main challenges is an efficient implementation of filter coefficients, which result from several factors described in this work. When implementing such filters as programmable circuits, the values of their coefficients have to be limited to a selected range, i.e. a given resolution in bits. In the implemented prototype filter, the filter coefficients are represented by 6 bits in sign-magnitude notation, so they can take 63 different values only. In such filters, it is not possible to directly implement any frequency response of the filter. Each time, it is necessary to properly round the theoretical values of the coefficients so that they fit into the available range of discrete values resulting from the implementation. The authors of the work designed an algorithm that allows such matching. The paper also presents results of measurements of the prototype chip.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：