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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

208 篇 会议
133 篇 期刊文献
1 册 图书

馆藏范围

342 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

216 篇 工学
- 120 篇 控制科学与工程
- 76 篇 软件工程
- 59 篇 计算机科学与技术...
- 42 篇 机械工程
- 27 篇 电气工程
- 17 篇 电子科学与技术（可...
- 11 篇 信息与通信工程
- 10 篇 生物工程
- 6 篇 生物医学工程（可授...
- 5 篇 动力工程及工程热...
- 5 篇 交通运输工程
- 5 篇 安全科学与工程
- 4 篇 力学（可授工学、理...
- 4 篇 化学工程与技术
- 3 篇 材料科学与工程（可...
- 3 篇 航空宇航科学与技...
196 篇 理学
- 127 篇 系统科学
- 103 篇 数学
- 33 篇 统计学（可授理学、...
- 15 篇 生物学
- 6 篇 物理学
- 4 篇 化学
28 篇 管理学
- 23 篇 管理科学与工程(可...
- 13 篇 工商管理
- 6 篇 图书情报与档案管...
11 篇 法学
- 9 篇 社会学
- 2 篇 法学
4 篇 经济学
- 4 篇 应用经济学
3 篇 医学
- 3 篇 基础医学(可授医学...
- 3 篇 临床医学
1 篇 文学

主题

25 篇 control systems
16 篇 synchronization
16 篇 mathematical mod...
14 篇 equations
13 篇 stability analys...
10 篇 approximation al...
10 篇 convergence
10 篇 optimization
10 篇 optimal control
10 篇 controllers
9 篇 dynamical system...
9 篇 network topology
9 篇 game theory
9 篇 sufficient condi...
9 篇 robustness
8 篇 vehicle dynamics
8 篇 hybrid systems
8 篇 robust control
8 篇 vectors
8 篇 distributed algo...

机构

20 篇 center for contr...
18 篇 center for contr...
12 篇 center for contr...
11 篇 center for contr...
10 篇 center for contr...
9 篇 center for contr...
9 篇 center for contr...
8 篇 mechanical engin...
8 篇 center for contr...
7 篇 the center for c...
6 篇 center for contr...
6 篇 center for contr...
5 篇 center for contr...
5 篇 center for contr...
5 篇 department of el...
5 篇 center for contr...
5 篇 school of engine...
4 篇 center for contr...
4 篇 mechanical engin...
4 篇 center for contr...

作者

103 篇 bullo francesco
76 篇 francesco bullo
25 篇 joao p. hespanha
21 篇 davydov alexande...
19 篇 jafarpour saber
14 篇 joão p. hespanha
13 篇 valluru sudarsha...
11 篇 marden jason r.
11 篇 fabio pasqualett...
11 篇 florian dorfler
11 篇 duan xiaoming
10 篇 delabays robin
9 篇 proskurnikov ant...
9 篇 sudarshan k. val...
9 篇 ruggero carli
9 篇 mei wenjun
8 篇 mustafa khammash
8 篇 friedkin noah e.
8 篇 andrew r. teel
8 篇 stephen l. smith

语言

333 篇 英文
9 篇 其他

检索条件"机构=Center for Control Dynamical Systems and Computation"

共 342 条记录，以下是291-300 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

ℒ2-induced gain analysis for a class of switched systems

ℒ2-induced gain analysis for a class of switched systems

引用

IEEE Conference on Decision and control

作者： Kenji Hirata João P. Hespanha Department of Mechanical Engineering Nagaoka University of Technology Nagaoka Japan Center for Control Dynamical Systems and Computation and the Department of Electrical and Computer Engineering University of California Santa Barbara CA USA

This paper addresses the computation of the L 2 -induced gain for a class of switched systems. The main contribution of the paper is to completely characterize the induced gain of the switched system through a system of differential inequalities on a common storage function, one for each system being switched. The motivation for computing the induced gain of a switched system is the application of robust stability tools to the analysis of hybrid systems.

关键词： Switched systems Sufficient conditions Asymptotic stability Riccati equations Difference equations Linear systems control systems Observability Robust stability Logic

来源：评论

学校读者我要写书评

暂无评论

Quadratic indices for the analysis of consensus algorithms

Quadratic indices for the analysis of consensus algorithms

引用

Information Theory and Applications Workshop, ITA

作者： Ruggero Carli Federica Garin Sandro Zampieri Center of Control Dynamical Systems and Computation University of California슠Santa Barbara Santa Barbara CA USA DEI Department of Information Engineering Università di Padova Padova Italy

ISBN: (纸本)9781424439904

Average-consensus algorithms allow to compute the average of some agents' data in a distributed way, and they are used as a basic building block in algorithms for distributed estimation, load balancing, formation and distributed control. Traditional analysis of linear average-consensus algorithms studies, for a given communication graph, the convergence rate, given by the essential spectral radius of the transition matrix (i.e. the second largest eigenvalues' modulus). For many graph families, such analysis predicts a performance which degrades when the number of agents grows, basically because spreading information across a larger graph requires a longer time. However, if you consider other well-known quadratic performance indices (involving all the eigenvalues of the transition matrix), the scaling law with respect to the number of agents can be different. This is consistent with the fact that, in many applications, for example in estimation problems, it is natural to expect that a larger number of cooperating agents has a positive, not a negative effect on performance. In this paper, we consider two different quadratic indices, which arise naturally from some estimation and control problems in which the consensus algorithm is used. We provide analytical results on their asymptotic behavior when the communication network belongs to some families of Cayley graphs. This framework includes grids on toruses in arbitrary dimensions, which are conjectured to be a good approximation of random geometric graphs; indeed, we show simulation results supporting this conjecture.

关键词： Algorithm design and analysis Eigenvalues and eigenfunctions Distributed computing Load management Distributed control Convergence Information analysis Performance analysis Degradation Communication system control

来源：评论

学校读者我要写书评

暂无评论

Dynamic Multi-Vehicle Routing with Multiple Classes of Demands

Dynamic Multi-Vehicle Routing with Multiple Classes of Deman...

引用

2009 American control Conference (ACC 2009)

作者： Marco Pavone Stephen L. Smith Francesco Bullo Emilio Frazzoli Laboratory for Information and Decision Systems Aeronautics and Astronautics Department Massachusetts Institute of Technology Cambridge MA 02139 USA Center for Control Dynamical Systems and Computation Department of Mechanical Engineering University of California Santa Barbara CA 93106 USA

ISBN: (纸本)9781424445233

In this paper we study a dynamic vehicle routing problem in which there are multiple vehicles and multiple classes of demands. Demands of each class arrive in the environment randomly over time and require a random amount of on-site service that is characteristic of the class. To service a demand, one of the vehicles must travel to the demand location and remain there for the required on-site service time. The quality of service provided to each class is given by the expected delay between the arrival of a demand in the class, and that demand's service completion. The goal is to design a routing policy for the service vehicles which minimizes a convex combination of the delays for each class. First, we provide a lower bound on the achievable values of the convex combination of delays. Then, we propose a novel routing policy and analyze its performance under heavy load conditions (i.e., when the fraction of time the service vehicles spend performing on-site service approaches one). The policy performs within a constant factor of the lower bound (and thus the optimal), where the constant depends only on the number of classes, and is independent of the number of vehicles, the arrival rates of demands, the on-site service times, and the convex combination coefficients.

关键词： service vehicles Vehicle routing vehicle Network routing site and service arrival rate Heavy loads Convexity Classes Policies Lower bound Quality of service

来源：评论

学校读者我要写书评

暂无评论

Optimotaxis: A stochastic multi-agent optimization procedure with point measurements

引用

11th International Workshop on Hybrid systems: computation and control, HSCC 2008

作者： Mesquita, Alexandre R. Hespanha, João P. Åström, Karl Center for Control Dynamical Systems and Computation University of California Santa Barbara CA 93106 United States

ISBN: (纸本)3540789286

We consider the problem of seeking the maximum of a scalar signal using a swarm ofautonomous vehicles equipped with sensors that can take point measurements of the *** are not able to measure their current position or to communicate with each other. Ourapproach induces the vehicles to perform a biased random walk inspired by bacterial chemotaxisand controlled by a stochastic hybrid automaton. With such a controller, it is shown that thepositions of the vehicles evolve towards a probability density that is a specified function ofthe spatial profile of the measured signal, granting higher vehicle densities near the signalmaxima. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Dynamic Multi-Agent Team Forming: Asymptotic Results on Throughput Versus Delay

Dynamic Multi-Agent Team Forming: Asymptotic Results on Thro...

引用

2008 American control Conference (ACC), vol.4

作者： Stephen L. Smith Francesco Bullo Center for Control Dynamical Systems and Computation University of California Santa Barbara CA USA

In this paper we focus on problems in which tasks (demands for service) arrive in an environment sequentially over time. A task is completed when a robot (or team of robots) provides the required service, and the goal is to minimize the expected delay between a task's arrival, and its completion. We develop a general framework in which these problems can be described, and propose a set of scaling laws for studying the relationship between the number of robots, the expected task delay, and the task arrival rate. We describe two existing problems in our framework, namely the dynamic traveling repairperson problem, and the dynamic pickup delivery problem, and present their asymptotic performance. We then introduce the dynamic team forming problem, in which tasks require services that can be provided only through complex teams of heterogeneous robots. We determine a lower bound on the problem's achievable performance, and propose three policies for solving the problem. We show that for each policy, there is a broad class of tasks for which the policy's performance is within a constant factor the optimal.

关键词： Throughput Robots Wireless networks Delay effects Relays Dynamic scheduling Space exploration Queueing analysis

来源：评论

学校读者我要写书评

暂无评论

computation of Switch Time Distributions in Stochastic Gene Regulatory Networks

Computation of Switch Time Distributions in Stochastic Gene ...

引用

2008 American control Conference (ACC), vol.7

作者： Brian Munsky Mustafa Khammash Center for Control Dynamical Systems and Computation University of California Santa Barbara CA USA

Many gene regulatory networks are modeled at the mesoscopic scale, where chemical populations are assumed to change according a discrete state (jump) Markov process. The chemical master equation (CME) for such a process is typically infinite dimensional and is unlikely to be computationally tractable without further reduction. The recently proposed Finite State Projection (FSP) technique allows for a bulk reduction of the CME while explicitly keeping track of its own approximation error. In previous work, this error has been reduced in order to obtain more accurate CME solutions for many biological examples. In this paper, we show that this "error" has far more significance than simply the distance between the approximate and exact solutions of the CME. In particular, we show that apart from its use as a measure for the quality of approximation, this error term serves as an exact measure of the rate of first transition from one system region to another. We demonstrate how this term may be used to directly determine the statistical distributions for stochastic switch rates, escape times, trajectory periods, and trajectory bifurcations. We illustrate the benefits of this approach to analyze the switching behavior of a stochastic model of Gardner's genetic toggle switch.

关键词： Switches Computer networks Distributed computing Stochastic processes Chemical processes Particle measurements Markov processes Equations Biology computing Approximation error

来源：评论

学校读者我要写书评

暂无评论

Stochastic analysis of noisy gene expression

Stochastic analysis of noisy gene expression

引用

International Symposium on Communications control and Signal Processing (ISCCSP)

作者： Mustafa Khammash Center for Control Dynamical Systems and Computation University of California Santa Barbara CA USA

We give an overview of the numerical and analytical methods for modeling and analysis of cellular noise in gene regulatory networks.

关键词： Stochastic processes Gene expression Stochastic resonance Fluctuations Biological system modeling Working environment noise Kinetic theory Analytical models Chemicals Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

A pursuit game with range-only measurements

A pursuit game with range-only measurements

引用

IEEE Conference on Decision and control

作者： Shaunak D. Bopardikar Francesco Bullo Joao P. Hespanha Center for Control Dynamical Systems and Computation(CCDC) University of California슠Santa Barbara Santa Barbara CA USA

We address a discrete-time, pursuit-evasion game with alternate moves played between two kinds of players: the pursuer and the evader. The pursuer wishes to capture the evader while the evader¿s goal is to avoid capture. By capture, we mean that the distance between the players is no greater than 1 unit. We assume simple, first-order motion kinematics for the players. The pursuer can move with a step size of at most 1 unit while the evader can move with a maximum step size of ß ¿ 1 units. The pursuer is able to measure only its distance from the evader, before and after the evader¿s move. We propose a capture strategy and first show that for the game played in ¿ 2 , if ß ¿ 0.5, then a single pursuer captures the evader in finite time. Next, we show that if the game is played in ¿ 3 and if ß ¿ 0.5, then with a modified strategy, two identical cooperative pursuers capture the evader in finite time. Finally, we shed light on the performance of the capture strategy in the case of ß ¿ [0.5, 1] and the case of sensing errors via simulations. We also present a simulation study of a version of this game with simultaneous moves.

关键词： Target tracking Kinematics Surveillance Surges Pursuit algorithms Sufficient conditions Algorithm design and analysis Biological materials Collaborative work Biotechnology

来源：评论

学校读者我要写书评

暂无评论

Dynamic vehicle routing with heterogeneous demands

Dynamic vehicle routing with heterogeneous demands

引用

IEEE Conference on Decision and control

作者： Stephen L. Smith Marco Pavone Francesco Bullo Emilio Frazzoli Center for Control Dynamical Systems and Computation Department of Mechanical University of California Santa Barbara CA USA Aeronautics and Astronautics Department Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge MA USA

ISBN: (纸本)9781424431236

In this paper we study a variation of the Dynamic Traveling Repairperson Problem (DTRP) in which there are two classes of demands; high priority, and low priority. In the problem, demands arrive in the environment randomly over time and assume a random location and on-site service requirement. A service vehicle must travel to each demand location and provide the required on-site service. The quality of service provided to each class of demands is measured by the expected delay between a demand¿s arrival and its service completion. The goal is to design policies for the service vehicle which minimize a convex combination of the delays for each class. We provide a lower bound on the achievable delay for this problem, and propose a policy which performs within a known constant factor of the optimal in heavy load (i.e., when the fraction of time the service vehicle spends performing on-site service approaches one). The problem studied in this paper is analogous to the multi-class queuing problem in classical queuing theory.

关键词： Vehicle dynamics Vehicles Routing Queueing analysis Quality of service Delay effects Stability Customer service Optimal control control systems

来源：评论

学校读者我要写书评

暂无评论

Uniting a high performance, local controller with a global controller: the output feedback case for linear systems with input saturation

Uniting a high performance, local controller with a global c...

引用

2008 American control Conference (ACC), vol.7

作者： Christophe Prieur Andrew R. Teel LAAS-CNRS Université de Toulouse Toulouse France Center for Control Dynamical Systems & Computation (CCDC) Department of Electrical and Computer Engineering University of California Santa Barbara CA USA

We consider linear control systems with saturation in the input for which we know two stabilizing output feedback controllers. One is a nonlinear globally asymptotically stabilizing controller, while the other one is a linear only locally asymptotically stabilizing controller. We look for a composite output feedback control law that is equal to the linear controller for initial conditions in a neighborhood of the origin and that is globally asymptotically stabilizing. We suggest a constructive approach to solve this uniting problem and to modify the linear local controller into a nonlinear global controller. Moreover since we want some robustness with respect to measurement noise, actuator errors and external disturbances, we consider hybrid output feedback controllers, following recent developments in the literature on robustness in hybrid systems. We illustrate our main result by means of numerical examples.

关键词： Linear feedback control systems control systems Output feedback Linear systems Nonlinear control systems Noise robustness Robust control Noise measurement Optimal control State feedback

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共35页 << < 26 27 28 29 30 31 32 33 34 35 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：