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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

452 册 图书
379 篇 会议

馆藏范围

813 篇 电子文献
22 种 纸本馆藏

日期分布

学科分类号

448 篇 工学
- 402 篇 控制科学与工程
- 355 篇 计算机科学与技术...
- 35 篇 机械工程
- 26 篇 软件工程
- 19 篇 仪器科学与技术
- 11 篇 生物医学工程（可授...
- 7 篇 电气工程
- 5 篇 电子科学与技术（可...
- 3 篇 信息与通信工程
- 3 篇 化学工程与技术
- 3 篇 公安技术
- 2 篇 动力工程及工程热...
- 2 篇 兵器科学与技术
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 交通运输工程
- 1 篇 网络空间安全
116 篇 理学
- 92 篇 数学
- 50 篇 系统科学
- 8 篇 生物学
- 2 篇 物理学
- 2 篇 化学
- 2 篇 统计学（可授理学、...
58 篇 管理学
- 57 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
8 篇 农学
2 篇 经济学
- 2 篇 应用经济学
1 篇 军事学
- 1 篇 军队指挥学

主题

211 篇 control, robotic...
197 篇 systems theory, ...
99 篇 optimization
94 篇 calculus of vari...
90 篇 control and syst...
64 篇 mathematical and...
30 篇 vibration, dynam...
25 篇 complexity
24 篇 artificial intel...
18 篇 robotics and aut...
17 篇 automotive engin...
16 篇 model predictive...
15 篇 computational in...
15 篇 communications e...
14 篇 complex systems
14 篇 engineering, gen...
11 篇 statistical phys...
11 篇 computer science...
11 篇 software enginee...
11 篇 congresses.

机构

5 篇 shanghai jiao to...
4 篇 univ notre dame ...
4 篇 tsinghua univ de...
3 篇 univ politecn va...
3 篇 univ calif santa...
3 篇 concordia univer...
3 篇 poznan universit...
2 篇 catholic univ lo...
2 篇 engineering and ...
2 篇 grad univ chines...
2 篇 western universi...
2 篇 shanghai jiao to...
2 篇 yale university
2 篇 shanghai jiao to...
2 篇 univ padua dept ...
2 篇 eindhoven univer...
2 篇 institute of con...
2 篇 dartmouth coll t...
2 篇 the university o...
2 篇 university of zi...

作者

10 篇 chen s. b.
5 篇 ortega romeo
4 篇 dong du
4 篇 lin t.
4 篇 allgoewer frank
4 篇 zhou changjiu
3 篇 de-shuang huang
3 篇 liu d. k.
3 篇 krzysztof r. koz...
3 篇 peng shi
3 篇 khashayar khoras...
3 篇 wu l.
3 篇 mikael johansson
3 篇 hideaki ishii
3 篇 silviu-iulian ni...
3 篇 shorten robert
3 篇 stramigioli stef...
3 篇 krzysztof kozłow...
3 篇 a. bensoussan
3 篇 pardalos panos m...

语言

786 篇 英文
45 篇 中文

检索条件"丛书名=Lecture notes in control and information sciences,"

共 831 条记录，以下是261-270 订阅

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

详细简洁

排序：

A dissipation inequality for the minimum phase property of nonlinear control systems

引用

Meeting on Advances in control Theory and Applications

作者： Ebenbauer, Christian Allgoewer, Frank MIT Lab Informat & Decis Syst Cambridge MA 02139 USA Univ Stuttgart Inst Syst Theory & Automat Control Stuttgart Germany

ISBN: (纸本)9783540707004

The minimum phase property is an important notion in systems and control theory: In this paper, a characterization of the minimum phase property of nonlinear control systems in terms of a dissipation inequality is derived. It is shown that this dissipation inequality is equivalent to the classical definition of the minimum phase property in the sense of Byrnes and Isidori, if the control system is affine in the input and the so-called input-output normal form exists.

关键词： minimum phase property dissipation inequalities nonlinear control systems

来源：评论

学校读者我要写书评

暂无评论

Modeling and control of autonomous helicopters

引用

Meeting on Advances in control Theory and Applications

作者： Bejar, Manuel Ollero, Anibal Cuesta, Federico Univ Pablo Olavide Seville Spain Univ Seville Seville Spain

ISBN: (纸本)9783540707004

This chapter presents an overview on the modeling and model-based control of autonomous helicopters. Firstly it introduces some of the platforms and control architectures that has been developed in the last 15 years. Later, the Chapter considers the modeling of the helicopter and the identification techniques. Then, it overviews different linear and non-linear model-based control approaches. This section also includes experiments on the control of the helicopter vertical motion that illustrate the presented techniques and point out the interest of nonlinear analysis methods to study the dynamic behavior of the helicopter. Finally, the Chapter presents open research lines coming from two challenging applications: the autonomous landing in oscillating platforms and the lifting and transporting of a single load with several helicopters.

关键词： autonomous helicopter helicopter modeling and identification autonomous helicopter control autonomous landing

来源：评论

学校读者我要写书评

暂无评论

A risk-based approach to sensor resource management

A risk-based approach to sensor resource management

引用

7th International Conference on Cooperative control and Optimization

作者： Papageorgiou, Dimitri Raykin, Maxim Raytheon Co Integrated Def Syst Woburn MA 01801 USA

ISBN: (纸本)9783540743545

We investigate the benefits of employing a suitable risk-based metric to determine in real-time the high level actions that an agile sensor should execute during a mission. Faced with a barrage of competing goals, a sensor resource manager must optimize system performance while simultaneously meeting all requirements. Numerous authors advocate the use of information-theoretic measures for driving sensor tasking algorithms, wherein the relative value of different sensing actions is calculated in terms of the expected gain in information. In this chapter, motivated by the sensor resource allocation problem in missile defense, we deviate from the information-based trend and propose an approach for determining sensor tasking decisions based on risk, or expected loss of defended assets. We present results of a missile defense simulation that illustrate the advantages of our risk-based objective function over its information-theoretic and rule-based counterparts.

关键词： sensor resource management risk missile defense

来源：评论

学校读者我要写书评

暂无评论

Cooperative control of multiple agents and search strategy

Cooperative control of multiple agents and search strategy

引用

7th International Conference on Cooperative control and Optimization

作者： Yatsenko, Vitaliy A. Hirsch, Michael J. Pardalos, Panos M. NASU & NSAU Space Res Inst UA-03022 Kiev Ukraine Raytheon Inc Net Ctr Syst St Petersburg FL 33733 USA Univ Florida Ctr Appl Opt Dept Ind & Syst Engn Gainesville FL 32611 USA

ISBN: (纸本)9783540743545

This chapter discusses problems dealing with cooperative control of multiple agents moving in a region. An appropriate search strategy for the whole system can be embodied: hierarchical, coordinated, or cooperative. Geometrical and computational aspects of many-target search problems axe considered. Nonlinear and bilinear processes of search for moving objects are proposed. Search problems of ecological danger objects and detection of biological and chemical agents using multi-spectral information are also considered. Multiagent coordination problems are studied in detail. This problem is addressed for a class of targets for which control Lyapunov functions can be derived. We describe such a multiagent system by a hierarchical structure, which can be simplified using a fiber bundle. Then, using geometrical techniques, we study controllability, observability, and optimality problems. In addition, we also consider a cooperative problem when the agents motions must satisfy a separation constraint throughout the encounter to be conflict-free. A classification of maneuvers based on different commutative diagrams is introduced using their fiber bundle representation. In the case of two agents, these optimality conditions allow us to construct optimal maneuvers geometrically.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Mini-transplants for chronic myelogenous leukemia: A Modeling perspective

引用

International Workshop on Biology and control Theory

作者： Kim, Peter S. Lee, Peter P. Levy, Doron Stanford Univ Dept Math Stanford CA 94305 USA Stanford Univ Dept Med Div Hematol Stanford CA 94305 USA

ISBN: (纸本)9783540719878

We model the immune dynamics between T cells and cancer cells in leukemia patients after a bone-marrow (or a stem-cell) transplant. We use a system of nine delay differential equations that incorporate time delays and account for the progression of cells through different stages. This model is an extension of our earlier model [3]. We conduct a sensitivity analysis of the model parameters with respect to the minimum cancer concentration attained during the first remission and the time until the first relapse. In addition, we examine the effects of varying the initial host cell concentration and the cancer cell concentration on the likelihood of a successful transplant. We observe that higher initial concentrations of general host blood cells increase the chance of success. Such higher initial concentrations can be obtained, e.g., by reducing the amount of chemotherapy that is administered prior to the transplant, a procedure known as a mini-transplant. Our results suggest that mini-transplants may be advantageous over full transplants. We identify the regions of the parameters for which mini-transplants are advantageous using statistical tools.

关键词： chronic myelogenous leukemia stem-cell transplant bone-marrow transplant non-myeloablative mini-transplant immune response delay differential equations.

来源：评论

学校读者我要写书评

暂无评论

A Lagrangian-based algorithm for a combinatorial motion planning problem

A Lagrangian-based algorithm for a combinatorial motion plan...

引用

7th International Conference on Cooperative control and Optimization

作者： Yadlapalli, Sai K. Malik, Waqar A. Darbha, Swaroop Rathinam, Siva Texas A&M Univ Dept Mech Engn College Stn TX 77843 USA Univ California Dept Civil & Envirom Engn Berkeley CA USA

ISBN: (纸本)9783540743545

We consider a combinatorial motion planning problem (CMP) that naturally arises in many applications involving unmanned aerial vehicles (UAVs) with fuel and motion constraints. The motion constraint we consider is the inability of a vehicle to turn at an arbitrary yaw rate. The CMP is a generalization of a single Travelling Salesman Problem and is NP-Hard. In this paper, we exploit the combinatorial structure of the problem and provide heuristics with computational results to address the same.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

A computationally efficient scheduled model predictive control algorithm for control of a class of constrained nonlinear systems

A computationally efficient scheduled model predictive contr...

引用

International Workshop on Assessment and Future Directions of Nonlinear Model Predictive control

作者： Kothare, Mayuresh V. Wan, Zhaoyang Lehigh Univ Dept Chem Engn 111 Res Dr Bethlehem PA 18017 USA GE Water & Process Technol Trevose 19503 PA USA

ISBN: (纸本)9783540726982

We present an overview of our results on stabilizing scheduled output feedback Model Predictive control (MPC) algorithm for constrained nonlinear systems based on our previous publications [19, 20]. Scheduled MPC provides an important alternative to conventional nonlinear MPC formulations and this paper addresses the issues involved in its implementation and analysis, within the context of the NMPC05 workshop. The basic formulation involves the design of a set of local output feedback predictive controllers with their estimated regions of stability covering the desired operating region, and implement them as a single scheduled output feedback MPC which on-line switches between the set of local controllers and achieves nonlinear transitions with guaranteed stability. This algorithm provides a general framework for scheduled output feedback MPC design.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Robust model predictive control for obstacle avoidance: Discrete time case

Robust model predictive control for obstacle avoidance: Disc...

引用

International Workshop on Assessment and Future Directions of Nonlinear Model Predictive control

作者： Rakovic, Sasa V. Mayne, David Q. Univ London Imperial Coll Sci Technol & Med London SW7 2BT England

ISBN: (纸本)9783540726982

The importance of the obstacle avoidance problem is stressed in [4]. Computation of reachability sets for the obstacle avoidance problem is addressed, for continuous-time systems in [4, 5] and for discrete-time systems in [12];further results appear in, for instance [2, 17, 18]. The obstacle avoidance problem is inherently non-convex. Most existing results are developed for the deterministic case when external disturbances are not present. The main purpose of this paper is to demonstrate that the obstacle avoidance problem in the discrete time setup has considerable structure even when disturbances are present. We extend the robust model predictive schemes using tubes (sequences of sets of states) [9, 11, 14] to address the robust obstacle avoidance problem and provide a mixed integer programming algorithm for robust control of constrained linear systems that are required to avoid specified obstacles. The resultant robust optimal control problem that is solved on-line has marginally increased complexity compared with that required for model predictive control for obstacle avoidance in the deterministic case. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

A random keys based genetic algorithm for the target visitation problem

A random keys based genetic algorithm for the target visitat...

引用

7th International Conference on Cooperative control and Optimization

作者： Arulselvan, Ashwin Commander, Clayton W. Pardalos, Panos M. Univ Florida Ctr Appl Optimizat Gainesville FL 32611 USA Eglin Air Force Base Air Force Res Lab Eglin AFB FL USA

ISBN: (纸本)9783540743545

The objective of the TARGET VISITATION PROBLEM is to determine a path for an unmanned aerial vehicle that begins at a point of origin and needs to visit several targets before returning to its starting point. An optimal visitation sequence is one which minimizes the total distance traveled and maximizes the utility of the visitation order. This utility measure is defined for each pair of targets and represents the relative value of visiting a particular target before another. In this chapter, we present the results of a preliminary study investigating the effectiveness of a genetic algorithm for the TARGET VISITATION PROBLEM. The encoding scheme is based on random keys. Numerical results are presented for a set of randomly generated test problems and compared with the optimal solutions as computed by a commercial integer programming package.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Real-time optimal time-critical target assignment for UAVs

Real-time optimal time-critical target assignment for UAVs

引用

7th International Conference on Cooperative control and Optimization

作者： Kim, Yoonsoo Gu, Da-Wei Postlethwaite, Ian Univ Leicester Dept Engn Leicester LE1 7RH Leics England

ISBN: (纸本)9783540743545

In the literature, e.g. [10], one can find the so-called basic UAV mission target assignment in which m UAVs each with a capacity limit q visit n targets in a cooperative manner (and return to their departure points) such that the cost incurred by each UAV's travel is minimized. In [10], we proposed a mixed integer linear program (MILP) formulation which exactly solves the problem, as well as four alternative MILP formulations which are computationally less intensive (and therefore suited for real-time purposes) yet yield a theoretically guaranteed sub-optimal solution. In this chapter, we further consider timing constraints imposed on some p of the targets, so-called prime targets. This consideration is often required for scenarios in which prime targets must be visited in a pre-defined time interval, and mathematically results in the addition of several integer linear constraints to the previous MILP formulation making the problem computationally intractable. We propose a novel procedure of adding these cumbersome timing constraints to the previous MILP formulation, in order to avoid increasing too much computational cost under practically valid assumptions. We first show that the proposed procedure still guarantees the previously claimed theoretical solution quality associated with the basic mission. We then show through extensive numerical simulations that under certain conditions, our algorithms return solutions which are still computationally manageable.

关键词： unmanned aerial vehicles (UAV) target assignment mixed integer linear program timing constraints

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：