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

第27届中国控制与决策会议

作者： Dawei Shi Tongwen Chen State Key Laboratory of Intelligent Control and Decision of Complex Systems School of AutomationBeijing Institute of Technology Department of Electrical and Computer Engineering University of Alberta

In this work,a finite-horizon optimal control problem for first-order plus time delay(FOPTD) processes is *** show that if the control horizon is greater than three and the prediction horizon is great than the control horizon plus the time delay in discrete time,the optimal controller is not affected by either of the two ***,under these conditions,the controller parameters are explicitly calculated,the closed-loop system is shown to be stable,and the controller is *** problem considered is related to the results on linear quadratic regulation of linear systems with time delays;however,the detailed parameterization of the state-space model introduced by the FOPTD process provides an additional opportunity to investigate the exact controller structure and properties(e.g.,the locations of the closed-loop poles),which are also the major difficulties encountered and overcome in this *** problem is motivated from phenomena experienced in designing industrial model predictive control(MPC) tuning algorithms,and extensive numerical examples indicate that the proposed results speed up the MPC autotuning algorithms by 70%.

关键词： Optimal control First-order plus time delay process Performance visualization MPC tuning

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017) of the Organization for Computational Neuroscience Antwerp, Belgium, July 15-20, 2017

引用

BMC NEUROSCIENCE 2017年第SUPPL 1期18卷 59-59页

作者： [Anonymous] Indiana University Purdue University Indianapolis Indianapolis IN 46032 USA Stark Neurosciences Research Institute Indiana University School of Medicine Indianapolis IN 46032 USA Department of Mathematics East Carolina University Greenville NC 27858 USA Jülich Supercomputing Centre Forschungszentrum Jülich 52425 Jülich Germany Future Systems Swiss National Supercomputing Centre 8092 Zurich Switzerland User Engagement and Support Swiss National Supercomputing Centre 6900 Lugano Switzerland Institut de Neurosciences des Systèmes Aix Marseille Univ 13005 Marseille France Simulation Lab Neuroscience Forschungszentrum Jülich Jülich Germany Department of Experimental Psychology Ghent University 9000 Ghent Belgium Donders Center for Cognitive Neuroimaging Radboud University 6525HR Nijmegen The Netherlands Department of Electrical Computer and Energy Engineering University of Colorado Boulder CO 80309 USA Department of Neurosurgery Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Neurology Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Otolaryngology Johns Hopkins School of Medicine Baltimore MD 21287 USA INSERM U968 Paris France Sorbonne Universités UPMC University Paris 06 UMR_S 968 Institut de la Vision Paris France CNRS UMR_7210 Paris France Department of Computer Architecture and Technology University of Granada (CITIC) Granada Spain Sorbonne Universités UPMC Univ Paris 06 INSERM CNRS Institut de la Vision Paris France Department of Adaptive Machine Systems Osaka University Osaka Japan Department of Computer Science University of Cergy-Pontoise Cergy-Pontoise France Department of Physics and Astronomy College of Charleston Charleston SC 29424 USA School of Physics Faculty of Science University of Sydney Sydney NSW 2006 Australia Center of Excellence for Integrative Brain Function Australian Research Council Sydney Australia Max Planck Institute for Human Cognitive and Brain Sciences Saxony Lei

来源：评论

学校读者我要写书评

暂无评论

Sparse sum-of-squares certificates on finite abelian groups

Sparse sum-of-squares certificates on finite abelian groups

引用

IEEE Annual Conference on decision and control

作者： Hamza Fawzi James Saunderson Pablo A. Parrilo Laboratory for Information and Decision Systems Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge MA 02139

ISBN: (纸本)9781479978878

Sums-of-squares techniques have played an important role in optimization and control. One question that has attracted a lot of attention is to exploit sparsity in order to reduce the size of sum-of-squares programs. In this paper we consider the problem of finding sparse sum-of-squares certificates for functions defined on a finite abelian group G. In this setting the natural basis over which to measure sparsity is the Fourier basis of G (also called the basis of characters of G). We establish combinatorial conditions on subsets S and T of Fourier basis elements under which nonnegative functions with Fourier support S are sums of squares of functions with Fourier support T. Our combinatorial condition involves constructing a chordal cover of a graph related to G and S with maximal cliques related to T. These techniques allow us to show that any nonnegative quadratic function in binary variables is a sum of squares of functions of degree at most [n/2], resolving a conjecture of Laurent [11]. They also allow us to show that any nonnegative function of degree d on G = Z_N has a sum-of-squares certificate supported on at most 3d log(N/d) Fourier basis elements. By duality this construction yields the first explicit family of polytopes in increasing dimensions that have a semidefinite programming description that is vanishingly smaller than any linear programming description.

关键词： Licence Fourier Abelian group Nonnegative Sum of squares Basis Polytopes

来源：评论

学校读者我要写书评

暂无评论

SDP-based Joint Sensor and controller Design for Information-regularized Optimal LQG control

SDP-based Joint Sensor and Controller Design for Information...

引用

IEEE Annual Conference on decision and control

作者： Takashi Tanaka Henrik Sandberg Laboratory for Information and Decision Systems Massachusetts Institute of Technology Department of Automatic Control School of Electrical Engineering KTH Royal Institute of Technology

ISBN: (纸本)9781479978878

We consider a joint sensor and controller design problem for linear Gaussian stochastic systems in which a weighted sum of quadratic control cost and the amount of information acquired by the sensor is minimized. This problem formulation is motivated by situations where a control law must be designed in the presence of sensing, communication, and privacy constraints. We show that an optimal linear joint sensor-controller policy is comprised of a linear sensor, Kalman filter, and a certainty equivalence controller, and can be synthesized by a numerically efficient algorithm based on semidefinite programming (SDP).

关键词： controller design Problem Formulation Sensors control law COST control linear quadratic Gaussian control weight sums design problems

来源：评论

学校读者我要写书评

暂无评论

Risk-aware planning in hybrid domains: An application to autonomous planetary rovers

Risk-aware planning in hybrid domains: An application to aut...

引用

AIAA Space and Astronautics Forum and Exposition, SPACE 2016

作者： Santana, Pedro Vaqueroy, Tiago Timmonsz, Eric Williams, Brian C. McGhan, Catharine L. R. Murray, Richard M. Toledo, Claudio Department of Aeronautics and Astronautics Massachusetts Institute of Technology 32 Vassar Street 32-224 CambridgeMA02139 United States Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology 32 Vassar Street 32-224 CambridgeMA02139 United States Electrical Engineering & Computer Science Massachusetts Institute of Technology 32 Vassar Street 32-224 CambridgeMA02139 United States Department of Aeronautics and Astronautics Massachusetts Institute of Technology 77 Massachusetts Avenue 33-330 CambridgeMA02139 United States Department of Control and Dynamical Systems California Institute of Technology 1200 E. California Blvd. Mail Code 305-16 PasadenaCA91125 United States Department of Control and Dynamical Systems California Institute of Technology 1200 E. California Blvd. Mail Code 107-81 PasadenaCA91125 United States Instituto de Ciências Matemáticas e de Computacão Avenida Trabalhador São-Carlense 400 AraraquaraSão Paulo Brazil Universidade de São Paulo SP13566-590 Brazil

ISBN: (数字)9781624104275

ISBN: (纸本)9781624104275

Expanding robotic space exploration beyond the immediate vicinity of Earth's orbit can only be achieved by increasingly autonomous agents, given the sometimes insurmountable challenges of teleoperation over great distances. Among the numerous requirements that a fully autonomous robotic space explorer must meet, here we focus on three key mission-enabling technologies: the ability to act under uncertainty and adapt to its environment;the ability to optimize performance while offering hard bounds on the risk of mission failure;and the ability to handle complex hybrid (discrete and continuous) mission planning problems in a provably correct and scalable fashion. In this paper, we show how CLARK, a planner capable of generating risk-bounded, dynamic temporal plans for autonomous agents operating under uncertainty, is able to efficiently generate temporal plans for a challenging planetary rover scenario featuring temporal uncertainty that could not be addressed by previous methods. © 2016, American Institute of Aeronautics and Astronautics Inc, AIAA. All rights reserved.

关键词： Orbits

来源：评论

学校读者我要写书评

暂无评论

Robust set invariance and contractivity of discrete-time systems: The generators approach

Robust set invariance and contractivity of discrete-time sys...

引用

Mediterranean Conference on control and Automation (MED)

作者： George Bitsoris Marina Vassilaki the Control Systems Laboratory of the Department of Electrical and Computer Engineering University of Patras Patras Greece the Department of Electrical and Electronic Engineering Educators ASPETE Athens Greece

In this paper, the problem of robust set invariance and contractivity with respect to discrete-time dynamical systems is investigated. In contrast to the usual approach consisting in describing regions of system's space by their border surfaces, a dual description of sets in terms of a generator matrix and a, generally nonlinear, generating function is proposed. This leads to the establishment of an associated generated system whose robust set invariance and/or contractivity properties imply corresponding properties for the initial system. This general result is then applied to the development of robust set invariance and/or robust contractivity conditions for linear systems.

关键词： Robustness Generators Linear systems Nonlinear systems Stability analysis Discrete-time systems Convergence

来源：评论

学校读者我要写书评

暂无评论

Robust set invariance and contractivity of continuous-time systems

Robust set invariance and contractivity of continuous-time s...

引用

IEEE Conference on Cybernetics and Intelligent systems

作者： George Bitsoris Marina Vassilaki Control Systems Laboratory of the Department of Electrical and Computer Engineering University of Patras Patras Greece Department of Electrical and Electronic Engineering Educators ASPETE Athens Greece

In this paper, the problem of set invariance and contractivity with respect to continuous-time dynamical systems is investigated. In contrast to the usual approach consisting in describing regions of system's state space by their border surfaces, a dual description of sets in terms of a generator matrix and a, generally nonlinear, generator function is proposed. This leads to the establishment of an associated generated system whose set invariance and/or contractivity properties imply corresponding properties for the initial system. This general result is then applied to the development of robust set invariance and/or contractivity conditions for linear and nonlinear systems.

关键词： Robustness Generators Linear systems Nonlinear systems Convergence Conferences Random access memory

来源：评论

学校读者我要写书评

暂无评论

Correction to “An Efficient Game Form for Unicast Service Provisioning” [Feb 12 392-404]

引用

IEEE Transactions on Automatic control 2015年第2期60卷 584-585页

作者： Ali Kakhbod Demosthenis Teneketzis Laboratory for Information and Decision Systems (LIDS) Massachusetts Institute of Technology Cambridge MA USA Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MA USA

This note corrects an error in the above paper (ibid., vol. 57, no. 2, pp. 392-404, Feb. 2012).

关键词： Nash equilibrium Game theory Unicast Bandwidth Network topology

来源：评论

学校读者我要写书评

暂无评论

A data-driven approach to predict daily risk of Clostridium difficile infection at two large academic health centers

引用

Open Forum Infectious Diseases 2017年第SUPPL_1期4卷 S403-S404页

作者： Makar, Maggie Oh, Jeeheh Fusco, Christopher Marchesani, Joseph McCaffrey, Robert Rao, Krishna Ryan, Erin E Washer, Laraine West, Lauren R Young, Vincent B Guttag, John Hooper, David C Shenoy, Erica S Wiens, Jenna Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge Massachusetts Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge Massachusetts Computer Science and Engineering University of Michigan Ann Arbor Michigan Information Systems Partners HealthCare Boston Massachusetts Department of Internal Medicine Division of Infectious Diseases University of Michigan Medical School Ann Arbor Michigan Division of Infectious Diseases Massachusetts General Hospital Boston Massachusetts Infection Control Unit Massachusetts General Hospital Boston Massachusetts Harvard Medical School Boston Massachusetts Department of Medicine Division of Infectious Diseases Massachusetts General Hospital Boston Massachusetts Medical Practice Evaluation Center Department of Medicine Massachusetts General Hospital Boston Massachusetts

来源：评论

学校读者我要写书评

暂无评论

μ-based Approaches to Determining Guaranteed Consistent and Inconsistent Parameter Sets

μ-based Approaches to Determining Guaranteed Consistent and...

引用

IEEE Annual Conference on decision and control

作者： Masako Kishida Rolf Findeisen Electrical and Computer Engineering department at University of Canterbury New Zealand Laboratory for Systems Theory and Control at the Otto-von-Guericke Universitat Magdeburg Germany

ISBN: (纸本)9781479978878

This paper considers the problem of characterizing the sets of consistent and inconsistent parameters for given constraints for linear fractional models. Based on previous results on the single box volume maximization problem using structured singular value, algorithms that express the (in)consistent parameter set as a union of multiple boxes are developed. Since no relaxation is involved in the proposed algorithms, the obtained sets are guaranteed to be (in)consistent with the given constraints even when the real set of (in)consistent parameters is nonconvex. A numerical example is included to illustrate the difference of the sets obtained by the proposed algorithms.

关键词： Inconsistent Difference sets SETTING numerical example Consistent

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：