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

European control Conference (ECC)

作者： Gehui Xu Guanpu Chen Yiguang Hong Baris Fidan Thomas Parisini Karl H. Johansson Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Control Science and Engineering Tongji University Shanghai China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai China Department of Mechanical and Mechatronics Engineering University of Waterloo Waterloo ON Canada Department of Electrical and Electronic Engineering Imperial College London London UK Department of Engineering and Architecture University of Trieste Trieste Italy

ISBN: (数字)9783907144107

ISBN: (纸本)9798331540920

Sensor network localization (SNL) problems require determining the physical coordinates of all sensors in a network. This process relies on the global coordinates of anchors and the available measurements between non-anchor and anchor nodes. Attributed to the intrinsic non-convexity, obtaining a globally optimal solution to SNL is challenging, as well as implementing corresponding algorithms. In this paper, we formulate a non-convex multi-player potential game for a generic SNL problem to investigate the identification condition of the global Nash equilibrium (NE) therein, where the global NE represents the global solution of SNL. We employ canonical duality theory to transform the non-convex game into a complementary dual problem. Then we develop a conjugation-based algorithm to compute the stationary points of the complementary dual problem. On this basis, we show an identification condition of the global NE: the stationary point of the proposed algorithm satisfies a duality relation. Finally, simulation results are provided to validate the effectiveness of the theoretical results.

关键词： Location awareness Coordinate measuring machines Simulation Current measurement Noise Europe Games

来源：评论

学校读者我要写书评

暂无评论

Green Routing Game: Strategic Logistical Planning using Mixed Fleets of ICEVs and EVs

Green Routing Game: Strategic Logistical Planning using Mixe...

引用

IEEE Conference on decision and control

作者： Hampei Sasahara György Dán Saurabh Amin Henrik Sandberg Department of Systems and Control Engineering School of Engineering Tokyo Institute of Technology Tokyo Japan Division of Network and Systems Engineering School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge MA USA Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper introduces a “green” routing game between multiple logistic operators (players), each owning a mixed fleet of internal combustion engine vehicle (ICEV) and electric vehicle (EV) trucks. Each player faces the cost of delayed delivery (due to charging requirements of EVs) and a pollution cost levied on the ICEVs. This cost structure models: 1) limited battery capacity of EVs and their charging requirement; 2) shared nature of charging facilities; 3) pollution cost levied by regulatory agency on the use of ICEVs. We characterize Nash equilibria of this game and derive a condition for its uniqueness. We also use the gradient projection method to compute this equilibrium in a distributed manner. Our equilibrium analysis is useful to analyze the trade-off faced by players in incurring higher delay due to congestion at charging locations when the share of EVs increases versus a higher pollution cost when the share of ICEVs increases. A numerical example suggests that to increase marginal pollution cost can reduce inefficiency of equilibria.

关键词： Costs Pollution Green products Internal combustion engines Games Routing Planning

来源：评论

学校读者我要写书评

暂无评论

Navigation in Time-Varying Densities: An Operator Theoretic Approach

Navigation in Time-Varying Densities: An Operator Theoretic ...

引用

European control Conference (ECC)

作者： Shankar A. Deka Umesh Vaidya Dimos V. Dimarogonas Department of Electrical Engineering Computer Science Decision and Control Systems division KTH Royal Institute of Technology Stockholm Sweden Department of Mechanical Engineering Clemson University Clemson South Carolina USA

This paper considers the problem of optimizing robot navigation with respect to a time-varying objective encoded into a navigation density function. We are interested in designing state feedback control laws that lead to an almost everywhere stabilization of the closed-loop system to an equilibrium point while navigating a region optimally and safely (that is, the transient leading to the final equilibrium point is optimal and satisfies safety constraints). Though this problem has been studied in literature within many different communities, it still remains a challenging non-convex control problem. In our approach, under certain assumptions on the time-varying navigation density, we use Koopman and Perron-Frobenius Operator theoretic tools to transform the problem into a convex one in infinite dimensional decision variables. In particular, the cost function and the safety constraints in the transformed formulation become linear in these functional variables. Finally, we present some numerical examples to illustrate our approach, as well as discuss the current limitations and future extensions of our framework to accommodate a wider range of robotics applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bayesian hypergame approach to equilibrium stability and robustness in moving target defense

Bayesian hypergame approach to equilibrium stability and rob...

引用

IEEE Conference on decision and control

作者： Hanzheng Zhang Zhaoyang Cheng Guanpu Chen Karl Henrik Johansson Shanghai Research Institute for Autonomous Intelligent Systems Tongji University Shanghai China Academy of Mathematics and System Science Chinese Academy of Science University of Chinese Academy of Science Beijing China Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology and the Digital Futures Stockholm Sweden

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

We investigate the equilibrium stability and robustness in a class of moving target defense problems, in which players have both incomplete information and asymmetric cognition. We first establish a Bayesian Stackelberg game model for incomplete information and then employ a hypergame reformulation to address asymmetric cognition. With the core concept of the hyper Bayesian Nash equilibrium (HBNE), a condition for achieving both the strategic and cognitive stability in equilibria can be realized by solving linear equations. Moreover, to deal with players’ underlying perturbed knowledge, we study the equilibrium robustness by presenting a condition of robust HBNE under the given configuration. Experiments evaluate our theoretical results.

关键词： Games Nash equilibrium Stability analysis Robustness Mathematical models Cognition Bayes methods

来源：评论

学校读者我要写书评

暂无评论

Multiplier analysis of Lurye systems with power signals 63

Multiplier analysis of Lurye systems with power signals

引用

63rd IEEE Conference on decision and control, CDC 2024

作者： Heath, William P. Carrasco, Joaquin Bangor University School of Computer Science and Engineering Dean St LL57 1UT United Kingdom Nancy Rothwell Building University of Manchester Control Systems and Robotics Group Department of Electrical and Electronic Engineering M13 9PL United Kingdom

ISBN: (纸本)9798350316339

Multipliers can be used to guarantee both the Lyapunov stability and input-output stability of Lurye systems with time-invariant memoryless slope-restricted nonlinearities. If a dynamic multiplier is used there is no guarantee the closedloop system has finite incremental gain. It has been suggested in the literature that without this guarantee such a system may be critically sensitive to time-varying exogenous signals including noise. We show that multipliers guarantee the power gain of the system to be bounded and quantifiable. Furthermore power may be measured about an appropriate steady state bias term, provided the multiplier does not require the nonlinearity to be odd. Hence dynamic multipliers can be used to guarantee Lurye systems have low sensitivity to noise, provided other exogenous systems have constant steady state. We illustrate the analysis with an example where the exogenous signal is a power signal with non-zero mean. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bayesian hypergame approach to equilibrium stability and robustness in moving target defense

arXiv

引用

arXiv 2024年

作者： Zhang, Hanzheng Cheng, Zhaoyang Chen, Guanpu Johansson, Karl Henrik Shanghai Research Institute for Autonomous Intelligent Systems Tongji University Shanghai China Academy of Mathematics and System Science Chinese Academy of Science University of Chinese Academy of Science Beijing China The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology The Digital Futures Stockholm Sweden

关键词： Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Convergence Analysis of the Best Response Algorithm for Time-Varying Games

Convergence Analysis of the Best Response Algorithm for Time...

引用

IEEE Conference on decision and control

作者： Zifan Wang Yi Shen Michael M. Zavlanos Karl H. Johansson Division of Decision and Control Systems School of Electrical Enginnering and Computer Science KTH Royal Institute of Technology and also with Digital Futures Stockholm Sweden Department of Mechanical Engineering and Materials Science Duke University Durham NC USA

This paper studies a class of strongly monotone games involving non-cooperative agents that optimize their own time-varying cost functions. We assume that the agents can observe other agents' historical actions and choose actions that best respond to other agents' previous actions; we call this a best response scheme. We start by analyzing the convergence rate of this best response scheme for standard time-invariant games. Specifically, we provide a sufficient condition on the strong monotonicity parameter of the time-invariant games under which the proposed best response algorithm achieves exponential convergence to the static Nash equilibrium. We further illustrate that this best response algorithm may oscillate when the proposed sufficient condition fails to hold, which indicates that this condition is tight. Next, we analyze this best response algorithm for time-varying games where the cost functions of each agent change over time. Under similar conditions as for time-invariant games, we show that the proposed best response algorithm stays asymptotically close to the evolving equilibrium. We do so by analyzing both the equilibrium tracking error and the dynamic regret. Numerical experiments on economic market problems are presented to validate our analysis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

control of Nonlinear systems Under Multiple Time-Varying Output Constraints: A Single Funnel Approach

arXiv

引用

arXiv 2023年

作者： Mehdifar, Farhad Lindemann, Lars Bechlioulis, Charalampos P. Dimarogonas, Dimos V. The Division of Decision and Control Systems KTH Royal Institute of Technology Stockholm Sweden Thomas Lord Department of Computer Science University of Southern California Los AngelesCA United States The Division of Systems and Control The Department of Electrical and Computer Engineering University of Patras Patra Greece

This paper proposes a novel control framework for handling (potentially coupled) multiple time-varying output constraints for uncertain nonlinear systems. First, it is shown that the satisfaction of multiple output constraints boils down to ensuring the positiveness of a scalar variable (the signed distance from the time-varying output-constrained set’s boundary). Next, a single funnel constraint is designed properly, whose satisfaction ensures convergence to and invariance of the time-varying output-constrained set. Then a robust and low-complexity funnel-based feedback controller is designed employing the prescribed performance control method. Finally, a simulation example clarifies and verifies the proposed approach. Copyright © 2023, The Authors. All rights reserved.

关键词： Time varying control systems

来源：评论

学校读者我要写书评

暂无评论

A Multi-Player Potential Game Approach for Sensor Network Localization with Noisy Measurements

arXiv

引用

arXiv 2024年

作者： Xu, Gehui Chen, Guanpu Fidan, Baris Hong, Yiguang Qi, Hongsheng Parisini, Thomas Johansson, Karl H. The Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden The Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing China The Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom The Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. We formulate a non-convex SNL problem as a multi-player non-convex potential game and investigate the existence and uniqueness of a Nash equilibrium (NE) in both the ideal setting without measurement noise and the practical setting with measurement noise. We first show that the NE exists and is unique in the noiseless case, and corresponds to the precise network localization. Then, we study the SNL for the case with errors affecting the anchor node position and the inter-node distance measurements. Specifically, we establish that in case these errors are sufficiently small, the NE exists and is unique. It is shown that the NE is an approximate solution to the SNL problem, and that the position errors can be quantified accordingly. Based on these findings, we apply the results to case studies involving only inter-node distance measurement errors and only anchor position information inaccuracies. Copyright © 2024, The Authors. All rights reserved.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：