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

International Conference on Advances in Computer Science, Environment, Ecoinformatics, and Education

作者： Ding, Yingqiang Tian, Hua Yang, Shouyi Zhengzhou Univ Coll Informat Engn Zhengzhou 450001 Peoples R China

ISBN: (纸本)9783642233562

convex optimization techniques have been used to deal with the sensor localization problem in recent years by virtue of the high accuracy and ease of formulation. Two scenarios differ in distribution of the sensor nodes were implemented, and for each, two different deployments of anchors were executed. To calculate the unknown locations, semidefinite programs (SDPs) were used. Simulation results indicate that convex programming has nice performance in sensor positioning accuracy, which can satisfy the demand of WSN-based applications, and the deployment of anchors has certain effect on the localization precision.

关键词： Wireless sensor network (WSN) convex programming semidefinite programming (SDP) localization

来源：评论

学校读者我要写书评

暂无评论

Mismatched Filter Optimization via Quadratic convex programming for Radar Applications

Mismatched Filter Optimization via Quadratic Convex Programm...

引用

International Radar Conference

作者： Rabaste, Olivier Savy, Laurent Off Natl Etud & Rech Aerosp French Aerosp Lab BP 80100 F-91123 Palaiseau France

ISBN: (纸本)9781479941957

In this article, we consider the problem of computing the optimal mismatched filter with respect to the Peak-to-SideLobe Ratio (PSLR). We propose to solve this problem via a convex quadratically constrained quadratic program that permits to obtain an optimal solution of the problem. The solution is obtain numerically by interior point methods. We show that this convex program can be modified to take into account additional constraints, for instance on the loss in processing gain, the mainlobe or sidelobe shapes and the Integrated Sidelobe Level. This strategy is applied to solve the PSLR problem for phase codes in radar applications, and for antenna arrays with a non negligible number of defective antennas. The results obtained show an interesting improvement of the PSLR for a predefined acceptable loss in processing gain, for both applications.

关键词： Radar applications convex programming filter optimization processing gain side lobe level MISMATCH Antenna arrays Quadratic PROBLEM SOLUTION optimal solution

来源：评论

学校读者我要写书评

暂无评论

Application of convex programming to rescheduling of transactions in a deregulated power market

Application of convex programming to rescheduling of transac...

引用

39th IEEE Conference on Decision and Control

作者： Stankovic, AM Lesieutre, BC Megretski, A

ISBN: (纸本)0780366387

In this paper we address the issue of improving transmission security in a deregulated power market. We propose an optimization procedure that assures that transmission security is maintained, and generates minimal corrections in existing contractual transactions that are necessary to ensure security. Our procedure is based on a DC load flow, and as such it is intended as a screening tool, and a source of candidate control actions that will be later refined by a more accurate (AC) model. Our approach may also enable faster calculations of important operational quantities like Available Transfer Capability (ATC).

关键词： convex programming power systems linear matrix inequalities (LMI)

来源：评论

学校读者我要写书评

暂无评论

The static output feedback stabilization problem as a concave-convex programming problem

The static output feedback stabilization problem as a concav...

引用

American Control Conference

作者： Astolfi, A Colaneri, P Univ London Imperial Coll Sci Technol & Med Dept Elect Engn London SW7 2AZ England

ISBN: (纸本)0780383354

It is shown that the static output feedback stabilization problem for linear multi-input single-output (MISO) systems can be posed as a concave-convex programming problem. This allows the potential design of minimization algorithms yielding a stabilizing static output feedback gain, if it exists, or showing that the problem is not solvable at all.

关键词： feedback stability concave programming convex programming multivariable control systems minimisation static output feedback stabilization concave convex programming problem linear multiinput single output system minimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Design Optimization of a Hybrid Energy System Through Fast convex programming 5

Design Optimization of a Hybrid Energy System Through Fast C...

引用

5th International Conference on Intelligent Systems, Modelling and Simulation (ISMS)

作者： Clark, Ronald Cronje, Willem van Wyk, Michael Antonie Univ Witwatersrand Sch Elect & Informat Engn Johannesburg South Africa

ISBN: (纸本)9781479938575

In this paper, a methodology for the optimal economic design of a hybrid energy system is presented. The novelty of the proposed methodology lies in the fact that a convex optimization approach is used - allowing a solution to be found very efficiently compared to existing techniques. A simulation model for a grid-connected PV/wind/diesel hybrid system is implemented in Mathworks Simulink (TM). Using this simulation model, it is shown that the design problem under consideration is indeed convex. An interior-point convex solver is then used to design an optimal PV/wind/diesel system with lowest overall cost (capital+ running costs) for a small university campus using a 35 year project lifetime. The results agree with those obtained using the closed-source HOMER software package which is based on slow discrete combinatorial optimization.

关键词： convex programming optimization hybrid energy design simulation

来源：评论

学校读者我要写书评

暂无评论

Improved Sequential convex programming Algorithms for Entry Trajectory Optimization

Improved Sequential Convex Programming Algorithms for Entry ...

引用

AIAA Science and Technology (SciTech) Forum and Exposition

作者： Wang, Zhenbo Grant, Michael J. Univ Tennessee Dept Mech Aerosp & Biomed Engn Knoxville TN 37996 USA Purdue Univ Sch Aeronaut & Astronaut W Lafayette IN 47907 USA

ISBN: (数字)9781624105784

ISBN: (纸本)9781624105784

Entry trajectory optimization for hypersonic vehicles has been formulated as highly constrained optimal control problems, which are difficult to solve because of the existing high nonlinearity and nonconvexity. In recent years, convex optimization has been found to be promising for onboard entry guidance applications due to the state-of-the-art interior-point methods. To fundamentally improve the performance of the sequential convex programming method for entry trajectory optimization, line-search and trust-region techniques from the traditional nonlinear programming algorithms are introduced in this paper, and two improved sequential convex programming algorithms are developed: line-search sequential convex programming and trust-region sequential convex programming. The convergence of the algorithms is expected to be improved. Numerical simulations of a maximum-terminal-velocity entry trajectory optimization problem, which is not well solved by the basic sequential convex programming algorithm, are provided to demonstrate the effectiveness and performance of the newly proposed algorithms. The results show that optimal solutions can be obtained in a few seconds in MATLAB under these two improved algorithms.

关键词： convex programming trajectory optimization algorithms Sequential hypersonic vehicles entry optimal solution MATLAB

来源：评论

学校读者我要写书评

暂无评论

convex programming and Bootstrap Sensitivity for Optimized Electricity Bill in Healthcare Buildings under a Time-Of-Use Pricing Scheme

引用

ENERGIES 2018年第6期11卷 1454页

作者： Gordillo-Orquera, Rodolfo Munoz-Romero, Sergio Arcos-Aviles, Diego Chillon, Rafael Lopez-Ramos, Luis M. Marques, Antonio G. Luis Rojo-Alvarez, Jose Univ Fuerzas Armadas ESPE Dept Elect & Elect WICOM Energy Res Grp 171-5-231B Sangolqui Ecuador Rey Juan Carlos Univ Dept Signal Theory & Commun Fuenlabrada 28943 Spain Univ Politecn Madrid Ctr Computat Simulat Madrid 28223 Spain Hosp Univ Fuenlabrada Fuenlabrada 28492 Spain Univ Agder Wisenet Signal Proc & Wireless Networks Lab N-4876 Grimstad Norway

Efficient energy management is strongly dependent on determining the adequate power contracts among the ones offered by different electricity suppliers. This topic takes special relevance in healthcare buildings, where noticeable amounts of energy are required to generate an adequate health environment for patients and staff. In this paper, a convex optimization method is scrutinized to give a straightforward analysis of the optimal power levels to be contracted while minimizing the electricity bill cost in a time-of-use pricing scheme. In addition, a sensitivity analysis is carried out on the constraints in the optimization problems, which are analyzed in terms of both their empirical distribution and their bootstrap-estimated statistical distributions to create a simple-to-use tool for this purpose, the so-called mosaic-distribution. The evaluation of the proposed method was carried out with five-year consumption data on two different kinds of healthcare buildings, a large one given by Hospital Universitario de Fuenlabrada, and a primary care center, Centro de Especialidades el Arroyo, both located at Fuenlabrada (Madrid, Spain). The analysis of the resulting optimization shows that the annual savings achieved vary moderately, ranging from -0.22 % to +27.39%, depending on the analyzed year profile and the healthcare building type. The analysis introducing mosaic-distribution to represent the sensitivity score also provides operative information to evaluate the convenience of implementing energy saving measures. All this information is useful for managers to determine the appropriate power levels for next year contract renewal and to consider whether to implement demand response mechanisms in healthcare buildings.

关键词： demand side management demand response optimization time-of-use healthcare building convex programming sensitivity analysis bootstrap resampling

来源：评论

学校读者我要写书评

暂无评论

A Mixed Integer convex programming Approach to Constrained Attitude Guidance

A Mixed Integer Convex Programming Approach to Constrained A...

引用

European Control Conference (ECC)

作者： Eren, Utku Acikmese, Behcet Scharf, Daniel P. Univ Texas Austin Dept Aerosp Engn & Engn Mech Austin TX 78712 USA CALTECH Jet Prop Lab Pasadena CA 91109 USA

ISBN: (纸本)9783952426937

This paper introduces a new algorithm for attitude motion planning, Constrained Attitude Guidance (CAG) problem, in the presence of angular rate constraints and conic exclusion regions (pointing constraints). The CAG problem is solved by considering only the quaternion kinematics in the formulation and using constraints on quaternions and its time derivatives to indirectly apply bounds on the angular rates and accelerations. The CAG formulation makes use of Mixed Integer convex programming (MICP) in order to impose, approximately, the unity constraint on the quaternion magnitude, where the approximation accuracy can be set to a desired accuracy. The solution complexity of the MICP formulation increases exponentially with the number of binary variables that are used to impose the unit norm constraint on the quaternion. Since this number is independent of the number of exclusion pointing constraints, the solution approach has favorable complexity in terms of the number of pointing constraints. The paper also provides a numerical example that incorporates both angular rate and pointing constraints.

关键词： attitude control convex programming integer programming matrix algebra path planning CAG problem MICP formulation acceleration angular rate constraint attitude motion planning binary variables conic exclusion region constrained attitude guidance exclusion pointing constraint mixed integer convex programming approach quaternion kinematics quaternion magnitude solution complexity unit norm constraint unity constraint Acceleration Angular velocity Attitude control Kinematics programming Quaternions Trajectory

来源：评论

学校读者我要写书评

暂无评论

Camera Motion Estimation by convex programming

Camera Motion Estimation by Convex Programming

引用

作者： Ozyesil, Onur Princeton University

学位级别：Ph.D.

This thesis studies two inverse problems closely related two each other: The first problem is the estimation of n locations t1, t2, . . . , t n (up to global scale, translation and negation) in R d from noisy measurements of a subset of the pairwise lines that connect them, that is, from noisy measurements of ± (ti - t j)/||ti - t j|| for some pairs (i,j), where the signs are unknown. For the second problem, we assume the availability of (measurements of) the signs, i.e., we consider the estimation of the locations ti (up to global scale and translation) from measurements of the pairwise directions (ti - tj)/||ti - tj|| for some pairs (i,j ). These inverse problems are at the core of the structure from motion (SfM) problem in computer vision, where the ti's represent camera locations in R3. After introducing the inverse problems and providing a discussion of previous related works in Chapter 1, we continue with the characterization of well-posed problem instances in Chapter 2. The contents of Chapter 2 are based on the existing results of parallel rigidity theory, the significance of which was not previously recognized in the context of the camera location estimation problem. Basically, parallel rigidity theory studies the conditions of unique realizability of locations from exact (i.e., noiseless) pairwise lines and directions. We reiterate these results to identify a complete com- binatorial characterization of well-posed instances for the two inverse problems, and provide efficient algorithms to decide in the well-posedness of a given instance. In the absence of these conditions, we discuss how to identify maximal subsets of the pairwise measurements inducing well-posed sub-problems. In Chapter 3, we study the inverse problem of location estimation from noisy pairwise line measurements. We firstly present a fundamental difficulty observed for the existing methods, that is, the tendency to produce spurious solutions that are clustered around a few locations. This

关键词： Computer vision convex programming Parallel rigidity Semidefinite relaxation Structure from motion Applied mathematics Computer science

来源：评论

学校读者我要写书评

暂无评论

Entry Trajectory Optimization via hp Pseudospectral convex programming 16

Entry Trajectory Optimization via hp Pseudospectral Convex P...

引用

16th International Conference on Informatics in Control, Automation and Robotics (ICINCO)

作者： Wang, Xiao Wang, Yulin Tang, Shengjing Guo, Jie Beijing Inst Technol Sch Aerosp & Engn Beijing Peoples R China

ISBN: (纸本)9789897583803

In this paper, a hp pseudospectral sequential convex programming (hp-PSCP) method is proposed to solve the entry trajectory optimization problem. The hp flipped Radau pseudospectral method (FRPM) is utilized to discretize the nonlinear dynamics. By successive linearization technology and introducing new variables, the optimization problem is converted into a series of convex problems and solved by primal-dual interior-point method. Numerical results show that the proposed method provides a good compromise between computational accuracy and speed compared to existing convex methods.

关键词： Entry Guidance Trajectory Optimization convex programming Pseudospectral Method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：