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

Co-Optimization of Control and Actuator Selection for Cyber-Physical Systems

IFAC-PapersOnLine 2018年第23期51卷 118-123页

作者： Chang, Chin-Yao Martínez, Sonia Cortés, Jorge Department of Mechanical and Aerospace Engineering University of California San Diego United States

This paper considers actuator selection problems which aim to maintain control performance of dynamical systems, and minimize operational costs or wear-and-tear of the actuators. The logical controls of actuators make the problem combinatorial, which make exhaustive search impractical. An actuator selection problem can be cast as a binary-integer programming with bilinear matrix inequalities (BIBMIs). In this paper, we first show that such non-convex optimization can be equivalently reformulated as an optimization problem with non-convexities restricted to binary decision variables. We next consider a continuous optimization which is equivalent to the BIBMIs, and leverage the continuous reformulation to derive a branch-and-bound method employing bound refinement. Numerical simulations demonstrate the effectiveness of the proposed approach. © 2018

关键词： integer programming Actuators Branch and bound method Convex optimization Cyber Physical System Dynamical systems Embedded systems Matrix algebra Actuator selections Bilinear matrix inequality binary integer programming Co optimization Continuous optimization Control performance Nonconvex optimization Optimization problems

来源：评论

学校读者我要写书评

暂无评论

Multi-Stage Optimal Placement of Branch PMU in Active Distribution Network

引用

INTERNATIONAL JOURNAL OF EMERGING ELECTRIC POWER SYSTEMS 2018年第4期19卷

作者： Wang Shu Kong Xiangrui Yan Zheng Xu Xiaoyuan Wang Han Shanghai Jiao Tong Univ Dept Elect Engn Key Lab Control Power Transmiss & Convers Minist EducSch Elect Informat & Elect Engn Shanghai 200240 Peoples R China

The penetration of distributed generation and electric vehicles requires advanced monitoring and control strategies to maintain the reliable operation of active distribution network (ADN). Phasor measurement unit (PMU), as an advanced measuring device, has been applied in the operation of transmission systems for decades. Recently, it is anticipated that PMUs can be adopted in the distribution network. In this paper, the optimal branch PMU (BPMU) placement is studied. First, an optimization model for the multi-stage BPMU placement is established considering the observability of ADN. Moreover, the weights of buses are designed to consider the influence of uncertain renewable energy generation and loads. Then, probabilistic load flow (PLF) is used to solve power flow with uncertainties, and weights of buses are obtained based on probability distributions of voltage magnitude. Finally, binary integer programming (BIP) is adopted to obtain the locations of BPMUs. The proposed method is tested on customized IEEE 33-bus and PG&E 69-bus distribution network, and the results are compared with those considering other methods.

关键词： active distribution network binary integer programming optimization branch phasor measurement unit probabilistic load flow

来源：评论

学校读者我要写书评

暂无评论

Approximating the stability region for binary mixed-integer programs

引用

OPERATIONS RESEARCH LETTERS 2009年第4期37卷 250-254页

作者： Kilinc-Karzan, Fatma Toriello, Alejandro Ahmed, Shabbir Nemhauser, George Savelsbergh, Martin Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA

The stability region of a solution is the polyhedral set of objective coefficients for which the solution is optimal. It provides valuable information for sensitivity analysis and re-optimization. An exact description of it may require an exponential number of inequalities. We develop polyhedral inner and outer approximations of linear size. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Real-time optimization Stability analysis Sensitivity analysis binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints

引用

TOP 2021年第1期29卷 248-265页

作者： Albornoz, Victor M. Zamora, Gabriel E. Univ Tecn Federico Santa Maria Dept Ind Campus Santiago VitacuraAv Santa Maria Santiago 6400 Chile

This paper tackles management zone delineation and crop planning problems in an integrated precision agriculture framework. The zoning problem defines relatively homogeneous management zones regarding their soil properties, and for which specific rates of agricultural inputs are necessary. From a sustainable point of view, the crop planning problem considers cropping of species from different botanic families in adjacent zones at the same time. With this in mind, we propose a novel linear binary integer program for an integrated zoning and crop planning problem with adjacency constraints. In this model, we maximize the incomes of the crop plan subject to zoning constraints and adjacency constraints on crop families. The proposed model has a column-based formulation, and as such, we develop a decomposition-based heuristic which make use of the column generation method with column-dependent rows. The decomposition strategy involves a master problem that deals with ensuring homogeneity of the selected management zones within the field partition and ensuring that the crop plan meets adjacency policies. On the other hand, the pricing problem generates rectangular management zones whose incorporation improves the objective value of the master problem. The algorithm is implemented in JuMP, a modeling language for mathematical optimization embedded in Julia. Results from a set of instances show the relevance of the decomposition-based heuristic.

关键词： binary integer programming Column generation Column-dependent rows Management zones Crop planning

来源：评论

学校读者我要写书评

暂无评论

A binary integer Program to Maximize the Agreement Between Partitions

引用

JOURNAL OF CLASSIFICATION 2008年第2期25卷 185-193页

作者： Brusco, Michael J. Steinley, Douglas Florida State Univ Dept Mkt Tallahassee FL 32306 USA Univ Missouri Dept Psychol Sci Columbia MO 65211 USA

This research note focuses on a problem where the cluster sizes for two partitions of the same object set are assumed known;however, the actual assignments of objects to clusters are unknown for one or both partitions. The objective is to find a contingency table that produces maximum possible agreement between the two partitions, subject to constraints that the row and column marginal frequencies for the table correspond exactly to the cluster sizes for the partitions. This problem was described by H. Messatfa (Journal of Classification, 1992, pp. 5-15), who provided a heuristic procedure based on the linear transportation problem. We present an exact solution procedure using binary integer programming. We demonstrate that our proposed method efficiently obtains optimal solutions for problems of practical size.

关键词： Partition agreement Contingency table binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Approximation Algorithms for Discrete Polynomial Optimization

引用

Journal of the Operations Research Society of China 2013年第1期1卷 3-36页

作者： Simai He Zhening Li Shuzhong Zhang Department of Management Sciences City University of Hong KongKowloonHong Kong Department of Mathematics Shanghai UniversityShanghai 200444China Department of Industrial&Systems Engineering University of MinnesotaMinneapolisMN 55455USA

In this paper,we consider approximation algorithms for optimizing a generic multivariate polynomial function in discrete(typically binary)*** models have natural applications in graph theory,neural networks,error-correcting codes,among many *** particular,we focus on three types of optimization models:(1)maximizing a homogeneous polynomial function in binary variables;(2)maximizing a homogeneous polynomial function in binary variables,mixed with variables under spherical constraints;(3)maximizing an inhomogeneous polynomial function in binary *** propose polynomial-time randomized approximation algorithms for such polynomial optimizationmodels,and establish the approximation ratios(or relative approximation ratios whenever appropriate)for the proposed *** examples of applications for these models and algorithms are discussed as well.

关键词： Polynomial optimization problem binary integer programming Mixed integer programming Approximation algorithm Approximation ratio

来源：评论

学校读者我要写书评

暂无评论

An exact algorithm to extract the generalized physical contradiction

引用

INTERNATIONAL JOURNAL OF INTERACTIVE DESIGN AND MANUFACTURING - IJIDEM 2015年第3期9卷 185-191页

作者： Lin, Lei Dubois, Sebastien De Guio, Roland Rasovska, Ivana INSA Strasbourg 24 Bld Victoire F-67000 Strasbourg France ICube UMR 7357 Lab Sci Ingn Informat & Imagerie F-67412 Illkirch Graffenstaden France

Problem solving in design is one of the main studied topic of research, and especially methods for problem solving. Generally, two kinds of methods are differentiated, those dedicated to routine design, and those focused on inventive design. The authors aim at linking the two approaches and building a continuum between both. Thus they studied the link and direct extraction of contradictions out of experiments. To do so they built a generic model of contradictions, the generalized system of contradictions (GSC). This paper proposes an algorithm for identifying and extracting generalized physical contradictions (GPCs), a part of the GSC, from experiments. First, the authors' design methodology to build the continuum from optimization till invention is introduced. The notion of GSC is presented and the focus is made on the notion of GPC. This one is described through binary integer programming and an algorithm is proposed in order to identify and extract complete set of generalized technical contradictions from experiments concerning the inventive problem.

关键词： TRIZ Generalized system of contradictions binary integer programming

来源：评论

学校读者我要写书评

暂无评论

A counterexample to Beder's conjectures about Hadamard matrices

引用

JOURNAL OF STATISTICAL PLANNING AND INFERENCE 2009年第9期139卷 3381-3383页

作者： Bulutoglu, Dursun A. Kaziska, David M. USAF Inst Technol Wright Patterson AFB OH 45433 USA

In this note we provide a counterexample which resolves conjectures about Hadamard matrices made in this journal. Beder [1998. Conjectures about Hadamard matrices. Journal of Statistical Planning and Inference 72, 7-14] conjectured that if H is a maximal m x n row-Hadamard matrix then m is a multiple of 4: and that if it is a power of 2 then every row-Hadamard matrix can be extended to a Hadamard matrix. Using binary integer programming we obtain a maximal 13 x 32 row-Hadamard matrix, which disproves both conjectures. Additionally for n being a multiple of 4 tip to 64, we tabulate values of m for which we have found a maximal row-Hadamard matrix. Based on the tabulated results we conjecture that a m x n row-Hadamard matrix with m >= n - 7 can be extended to a Hadamard matrix. Published by Elsevier B.V

关键词： Hadamard matrix Maximal row-Hadamard matrix binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Vehicle Tracking in Wide Area Motion Imagery via Stochastic Progressive Association Across Multiple Frames

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2018年第7期27卷 3644-3656页

作者： Elliethy, Ahmed Sharma, Gaurav Univ Rochester Dept Elect & Comp Engn 601 Elmwood Ave Rochester NY 14627 USA Univ Rochester Dept Comp Sci Rochester NY 14627 USA Univ Rochester Dept Biostat & Computat Biol 601 Elmwood Ave Rochester NY 14627 USA

Vehicle tracking in wide area motion imagery (WAMI) relies on associating vehicle detections across multiple WAMI frames to form tracks corresponding to individual vehicles. The temporal window length, i.e., the number M of sequential frames, over which associations are collectively estimated poses a tradeoff between accuracy and computational complexity. A larger M improves performance because the increased temporal context enables the use of motion models and allows occlusions and spurious detections to be handled better. The number of total hypotheses tracks, on the other hand, grows exponentially with increasing M, making larger values of M computationally challenging to tackle. In this paper, we introduce stochastic progressive association across multiple frames, an iterative approach that progressively grows M with each iteration to improve estimated tracks by exploiting the enlarged temporal context while keeping computation manageable through two novel approaches for pruning association hypotheses. First, guided by a road network, accurately co-registered to the WAMI frames, we disregard unlikely associations that do not agree with the road network. Second, as M is progressively enlarged at each iteration, the related increase in association hypotheses is limited by revisiting only the subset of association possibilities rendered open by stochastically determined dis-associations for the previous iteration. The stochastic dis-association at each iteration maintains each estimated association according to an estimated probability for confidence, obtained via a probabilistic model. Associations at each iteration are then estimated globally over the M frames by (approximately) solving a binary integer programming problem for selecting a set of compatible tracks. Vehicle tracking results obtained over test WAMI data sets indicate that our proposed approach provides significant performance improvements over the state-of-the-art alternatives.

关键词： Wide area motion imagery vehicle tracking association hypotheses pruning binary integer programming vector road network

来源：评论

学校读者我要写书评

暂无评论

Intelligent Group Formation in Computer Supported Collaborative Learning Scripts 17

Intelligent Group Formation in Computer Supported Collaborat...

引用

17th IEEE International Conference on Advanced Learning Technologies (ICALT)

作者： Amarasinghe, Ishari Hernandez-Leo, Davinia Jonsson, Anders Univ Pompeu Fabra Barcelona Spain

ISBN: (纸本)9781538638705

Well-structured collaborative learning groups scripted based on Collaborative Learning Flow Patterns (CLFPs) often result in successful collaborative learning outcomes. Formulation of such learner groups based on instructor defined criteria promises potentially effective performance of participating students. However, forming student groups manually based on multiple criteria often fails due to its complexity and the time limitations of practitioners. Hence, an intelligent assistance which supports adaptive collaboration scripting based on instructor defined criteria, while adhering to CLFPs is presented. Constraint Optimization techniques have been used for learner group formation and preliminary tests revealed that the proposed approach could be utilized when formulating student groups while satisfying team formation criteria.

关键词： Keywords Computer Supported Collaborative Learning (CSCL) Collaborative Learning Flow Patterns (CLFPs) Jigsaw binary integer programming Constraint Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：