IEEE Conference on Decision and Control and European Control Conference最新文献_第4页

A backwards error analysis approach for simulation and control of nonsmooth mechanical systems 非光滑机械系统仿真与控制的逆向误差分析方法

IEEE Conference on Decision and Control and European Control Conference Pub Date : 2011-12-01 DOI: 10.1109/CDC.2011.6160975

David Pekarek, T. Murphey

引用次数: 6

Synthesis of communicating controllers for distributed systems 分布式系统通信控制器的综合

IEEE Conference on Decision and Control and European Control Conference Pub Date : 2011-12-01 DOI: 10.1109/CDC.2011.6160584

G. Kalyon, Tristan Le Gall, H. Marchand, T. Massart

引用次数: 22

A liveliness analysis of a distributed constrained coordination strategy for multi-agent linear systems 多智能体线性系统分布式约束协调策略的活动性分析

IEEE Conference on Decision and Control and European Control Conference Pub Date : 2011-12-01 DOI: 10.1109/CDC.2011.6160821

A. Casavola, E. Garone, Francesco Saverio Tedesco

{"title":"A liveliness analysis of a distributed constrained coordination strategy for multi-agent linear systems","authors":"A. Casavola, E. Garone, Francesco Saverio Tedesco","doi":"10.1109/CDC.2011.6160821","DOIUrl":"https://doi.org/10.1109/CDC.2011.6160821","url":null,"abstract":"In this paper we present a complete liveliness analysis for a novel distributed supervision strategy for multi-agent systems connected via data links and subject to coordination constraints. A geometrical Constraints Qualification (CQ) condition on the prescribed constraints is proposed whose fulfilment avoid deadlock situations and ensure viable solutions. Such a coordination paradigm, referred to as coordination-by-constraint, is accomplished by solving on-line in a distributed manner a convex optimization problem involving the modification of the prescribed nominal set-point of each agent. A sequential strategy, where only one agent at the time is allowed to manipulate its own setpoint, is discussed and it is shown that the solvability at each time instant of the underlying optimization problem, unlike the centralized case, can be ensured only if the constraints satisfy such a (CQ) condition, which can be easily checked from the outset via a numerical procedure provided in the paper. An algorithm to compute Constraints Qualified (CD) arbitrarily accurate inner approximations of the original constraint set is also presented and exemplified in final example.","PeriodicalId":360068,"journal":{"name":"IEEE Conference on Decision and Control and European Control Conference","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124256998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 17

Multi-agent rigid formations: A study of robustness to the loss of multiple agents 多智能体刚性结构:对多智能体损失的鲁棒性研究

IEEE Conference on Decision and Control and European Control Conference Pub Date : 2011-12-01 DOI: 10.1109/CDC.2011.6161049

S. A. Motevallian, Changbin Yu, B. Anderson

{"title":"Multi-agent rigid formations: A study of robustness to the loss of multiple agents","authors":"S. A. Motevallian, Changbin Yu, B. Anderson","doi":"10.1109/CDC.2011.6161049","DOIUrl":"https://doi.org/10.1109/CDC.2011.6161049","url":null,"abstract":"In this paper we study the robustness of information architectures to control a formation of autonomous agents. If agents are expected to work in hazardous environments like battle-fields, the formations are prone to multiple agent/link loss. Due to the higher severity of agent loss than link loss, the main contribution of this paper is to propose information architectures for shape-controlled multi-agent formations, which are robust against the loss of multiple agents. A formation is said to be rigid if by actively maintaining a designated set of inter-agent distances, the formation preserves its shape. We will use the rigidity theory to formalize the robust architecture problem. In particular we study the properties of formation graphs which remain rigid after the loss of any set of up to k−1 vertices. Such a graph is called k-vertex rigid. We provide a set of distinct necessary and sufficient conditions for these graphs. We then show that 3-vertex rigidity is the highest possible robustness one can achieve by just adding a small number of edges to a minimally rigid graph, i.e. retention of rigidity given the loss of 3 or more agents of a formation requires many more inter-agent distances to be specified than when maintaining rigidity with no, one or two agent losses. Based on this result, we further focus on 3-vertex rigid graphs and characterize a class of information architectures (with minimum number of control links) which are robust against the loss of up to two agents.","PeriodicalId":360068,"journal":{"name":"IEEE Conference on Decision and Control and European Control Conference","volume":"134 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124257536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Local stability results for the collective behaviors of infinite populations of pulse-coupled oscillators 无限脉冲耦合振子群集体行为的局部稳定性结果

IEEE Conference on Decision and Control and European Control Conference Pub Date : 2011-12-01 DOI: 10.1109/CDC.2011.6160621

A. Mauroy, R. Sepulchre

引用次数: 0

Synthesis for optimal two-player decentralized control over TCP erasure channels with state feedback 带状态反馈的TCP擦除通道最优双玩家分散控制的综合

IEEE Conference on Decision and Control and European Control Conference Pub Date : 2011-12-01 DOI: 10.1109/CDC.2011.6160998

Chung-Ching Chang, S. Lall

引用次数: 5

An IIR Youla-Kucera parametrized adaptive feedforward compensator for active vibration control with mechanical coupling 一种用于机械耦合振动主动控制的IIR youla - kuucera参数化自适应前馈补偿器

IEEE Conference on Decision and Control and European Control Conference Pub Date : 2011-12-01 DOI: 10.1109/CDC.2011.6160221

I. Landau, T. Airimitoaie, M. Alma

引用次数: 4

A note on the deployment of kinematic agents by binary information 关于用二进制信息部署运动学代理的注释

IEEE Conference on Decision and Control and European Control Conference Pub Date : 2011-12-01 DOI: 10.1109/CDC.2011.6160576

C. D. Persis, M. Cao, F. Ceragioli

引用次数: 8

Steady state stability preserving nonlinear model reduction using sequential convex optimization 利用序贯凸优化方法保持稳态稳定的非线性模型约简

IEEE Conference on Decision and Control and European Control Conference Pub Date : 2011-12-01 DOI: 10.1109/CDC.2011.6161227

Martin Löhning, J. Hasenauer, F. Allgöwer

引用次数: 3

Convergence and stability analysis for iterative dynamics with application in balanced resource allocation: A trajectory distance based Lyapunov approach 资源均衡分配中迭代动力学的收敛性和稳定性分析:基于轨迹距离的Lyapunov方法

IEEE Conference on Decision and Control and European Control Conference Pub Date : 2011-12-01 DOI: 10.1109/CDC.2011.6160322

Qing Hui

{"title":"Convergence and stability analysis for iterative dynamics with application in balanced resource allocation: A trajectory distance based Lyapunov approach","authors":"Qing Hui","doi":"10.1109/CDC.2011.6160322","DOIUrl":"https://doi.org/10.1109/CDC.2011.6160322","url":null,"abstract":"This paper addresses the convergence and stability analysis for iterative processes such as numerical iterative algorithms by using a novel trajectory distance based approach. Iterative dynamics are widespread in distributed algorithms and numerical analysis. However, efficient analysis of convergence and sensitivity of iterative dynamics is quite challenging due to the lack of systematic tools. For instance, the trajectories of iterative dynamics are usually not continuous with respect to the initial condition. Hence, the classical dynamical systems theory cannot be applied directly. In this paper, a trajectory distance based Lyapunov approach is proposed as a means to tackling convergence and sensitivity to the initial condition of iterative processes. Technically the problem of convergence and sensitivity is converted into finiteness of trajectory distance and semistability analysis of discrete-time systems. A semidefinite Lyapunov function based trajectory distance approach is proposed to characterize convergence and semistability of iterative dynamics. Two examples are provided to elucidate the proposed method. Finally, the proposed framework is used to solve the convergence and stability of iterative algorithms developed for balanced resource allocation and damage mitigation problems under adversarial attacks.","PeriodicalId":360068,"journal":{"name":"IEEE Conference on Decision and Control and European Control Conference","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127288991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1