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

PARAMETER-ROBUST CONTROL DESIGN USING A MINIMAX METHOD

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 1992年第5期15卷 1068-1075页

作者： MILLS, RA BRYSON, AE Stanford University Stanford California 94305

A controller design method is presented that gives the best linear-quadratic-Gaussian closed-loop performance over a set of worst plant parameter changes. The design algorithm combines a multiplant optimal design code, SANDY, with a new worst parameter algorithm that uses a quadratic norm on parameter changes. The minimax algorithm is unique in the way it weights worst plants to expand the stable region in the parameter space. The method is applied to a two-mass/spring American Control Conference "benchmark" problem. A minimax controller is first designed for the case where the spring constant alone is uncertain. Next, several minimax controllers, including a reduced-order design, are synthesized for the benchmark problem where both masses and the spring constant are uncertain. The results show that minimax control provides near-optimal nominal performance with significant robustness and parameter margin improvements.

关键词： Linear Quadratic Regulator Linear Quadratic Gaussian White Noise Multiple Input Multiple Output Resonant Frequencies Computer Programs branch and bound algorithm Nonlinear Programming Full State Feedback Spectral Density

来源：评论

学校读者我要写书评

暂无评论

Self-control of the time complexity of a constraint satisfaction problem solver program

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2012年第12期85卷 2697-2706页

作者： Eracar, Yoenet A. Kokar, Mieczyslaw M. Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA Northeastern Univ Dept Mech & Ind Engn Boston MA 02115 USA

This paper presents the self-controlling software paradigm and reports on its use to control the branch and bound based constraint satisfaction problem solving algorithm. In this paradigm, an algorithm is first conceptualized as a dynamical system and then a feedback control loop is added to control its behavior. The loop includes a Quality of Service component that assesses the performance of the algorithm during its run time and a controller that adjusts the parameters of the algorithm in order to achieve the control goal. Although other approaches - generally termed as "self-*" - make use of control loops, this use is limited to the structure of the software system, rather than to its behavior and its dynamics. This paper advocates the analysis of dynamics of any program with control loops. The self-controlling software paradigm is evaluated on two different NP-hard constraint satisfaction and optimization problems. The results of the evaluation show an improvement in the performance due to the added control loop for both of the tested constraint satisfaction problems. (C) 2012 Elsevier Inc. All rights reserved.

关键词： Self-controlling software Constraint satisfaction problem branch and bound algorithm PID controller Job scheduling problem Fixture design problem

来源：评论

学校读者我要写书评

暂无评论

Joint Metering and Conflict Resolution in Air Traffic Control

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2011年第5期34卷 1507-1518页

作者： Le Ny, Jerome Pappas, George J. Univ Penn Dept Elect & Syst Engn Philadelphia PA 19104 USA

This paper describes a novel optimization-based approach to conflict resolution in air traffic control, based on geometric programming. A key feature of this approach is its ability to also take into account various metering directives issued by the traffic flow management level, in contrast to most methods that focus purely on aircraft separation issues. Moreover, the proposed methodology can account for some of the nonlinearities present in the formulations of conflict resolution Problems, while incurring only a small penalty in computation time with respect to the fastest linear-programming-based approaches. Integer variables can be introduced to improve the quality of the solutions and to include combinatorial choices, for example, to optimize over aircraft sequences in merging streams. Simulation results demonstrate the efficiency of the approach on various aircraft separation problems, including miles-in-trail and minutes-in-trail restrictions through airspace fixes and boundaries.

关键词： Air Traffic Controller Traffic Flow Management Airspace Linear Programming Mixed Integer Linear Programming Conflict Detection and Resolution Path Planning Airborne Aircraft branch and bound algorithm Automated Decision Support

来源：评论

学校读者我要写书评

暂无评论

algorithms for Smart Grid management

引用

SUSTAINABLE CITIES AND SOCIETY 2018年 38卷 627-635页

作者： Marah, Rim El Hibaoui, Abdelaaziz FS Abdelmalek Essaadi Univ POB 2121 Mhannech 2 Tetouan 93030 Morocco

In this paper, we will consider a modelization of Smart Grid on three sub-components: local level, microgrid level and T&D level. Thus and on one hand, we will propose an algorithm that manages its local level. Our algorithm is paired with branch and bound algorithm to solve knapsack problem. The main goal of this algorithm is to regulate consumption peaks and manage the priority of domestic appliances, by spreading at best the energy depending on the priority and consumption without exceeding the total energy received. Furthermore, we will introduce an asynchronous distributed Max-Flow algorithm to resolve the routing problem in order to optimize the T&D level. This algorithm uses a local computation to compute max-flow. Nodes communicate only by exchanging messages and no global information is needed. Our algorithm uses more than one augmenting path at each iteration allowing optimization of the execution time required for computing the max-flow.

关键词： Smart Grid modelization Knapsack problem branch and bound algorithm Routing problem Distributed max-flow algorithm Optimization

来源：评论

学校读者我要写书评

暂无评论

Oracle-based algorithms for binary two-stage robust optimization

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2020年第2期77卷 539-569页

作者： Kaemmerling, Nicolas Kurtz, Jannis TU Dortmund Univ Inst Transport Logist Leonhard Euler Str 2 D-44227 Dortmund Germany Rhein Westfal TH Aachen Chair Math Informat Proc Pontdriesch 12-14 D-52062 Aachen Germany

In this work we study binary two-stage robust optimization problems with objective uncertainty. We present an algorithm to calculate efficiently lower bounds for the binary two-stage robust problem by solving alternately the underlying deterministic problem and an adversarial problem. For the deterministic problem any oracle can be used which returns an optimal solution for every possible scenario. We show that the latter lower bound can be implemented in a branch and bound procedure, where the branching is performed only over the first-stage decision variables. All results even hold for non-linear objective functions which are concave in the uncertain parameters. As an alternative solution method we apply a column-and-constraint generation algorithm to the binary two-stage robust problem with objective uncertainty. We test both algorithms on benchmark instances of the uncapacitated single-allocation hub-location problem and of the capital budgeting problem. Our results show that the branch and bound procedure outperforms the column-and-constraint generation algorithm.

关键词： Two-stage robust optimization Non-linear binary optimization branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Query Aware Determinization of Uncertain Objects

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2015年第1期27卷 207-221页

作者： Xu, Jie Kalashnikov, Dmitri V. Mehrotra, Sharad Univ Calif Irvine Dept Comp Sci Bren Sch Informat & Comp Sci Irvine CA 92617 USA

This paper considers the problem of determinizing probabilistic data to enable such data to be stored in legacy systems that accept only deterministic input. Probabilistic data may be generated by automated data analysis/enrichment techniques such as entity resolution, information extraction, and speech processing. The legacy system may correspond to pre-existing web applications such as Flickr, Picasa, etc. The goal is to generate a deterministic representation of probabilistic data that optimizes the quality of the end-application built on deterministic data. We explore such a determinization problem in the context of two different data processing tasks-triggers and selection queries. We show that approaches such as thresholding or top-1 selection traditionally used for determinization lead to suboptimal performance for such applications. Instead, we develop a query-aware strategy and show its advantages over existing solutions through a comprehensive empirical evaluation over real and synthetic datasets.

关键词： Determinzation uncertain data data quality query workload branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Workload smoothing in simple assembly line balancing

引用

COMPUTERS & OPERATIONS RESEARCH 2018年 89卷 51-57页

作者： Azizoglu, Meral Imat, Sadullah Middle East Tech Univ Dept Ind Engn TR-06800 Ankara Turkey Roketsan Ankara Turkey

This paper considers a simple assembly line balancing problem with fixed number of workstations and prespecified cycle time. Our objective is to minimize the sum of the squared deviations of the workstation loads around the cycle time, hence maintain workload smoothing. We develop several optimality properties and bounding mechanisms, and use them in our branch and bound algorithm. The results of our computational study reveal that our branch and bound algorithm is capable of solving medium sized problem instances in reasonable times. (C) 2017 Published by Elsevier Ltd.

关键词： Assembly lines Workload smoothing branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Nonlinear control allocation using piecewise linear functions: A linear programming approach

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2005年第3期28卷 558-562页

作者： Bolender, MA Doman, DB USAF Control Design & Anal Branch Wright Patterson AFB OH 45433 USA

The intent of this Note is to show that the piecewise linear control allocation problem can be solved fast enough to be implemented in a digital flight-control system. The approach taken here differs from the authors' initial paper on this subject in two ways. The first difference is a move away from the mixed-integer linear programming form of the optimization problem and to a linear programming formulation. The linear programming problem will be solved using a modified simplex algorithm where a rule-based approach is employed to enforce the necessary adjacency constraints on the interpolating coefficients. The second difference is that we solve a mixed optimization problem2 as opposed to the solution of the multibranch control allocation problem.' This allows us to achieve the same objective as before, but only having to solve one optimization problem instead of two. We will compare the performance of the simplex method with restricted basis entry rules to the mixed-integer formulation and show that the two approaches give equivalent solutions to the same set of control allocation problems. To perform this comparison, we will look at both closed-loop and open-loop control allocation problems. In the latter case, a set of control allocation problems are randomly selected and solved by each approach. For the former, we compare the algorithms in a digital simulation of a reentry vehicle on approach and landing.

关键词： Linear Programming Nonlinear Control Mixed Integer Linear Programming Digital Flight Control System Control Surfaces Digital Flight Control Computer branch and bound algorithm Closed Loop Aerodynamic Interference Linear Interpolation

来源：评论

学校读者我要写书评

暂无评论

Three-Dimensional Resonant Hopping Strategies and the Jupiter Magnetospheric Orbiter

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2012年第1期35卷 340-344页

作者： Campagnola, Stefano Kawakatsu, Yasuhiro Japan Aerosp Explorat Agcy Inst Space & Astronaut Sci Chuo Ku Sagamihara Kanagawa 2525210 Japan

This Note studies 3-D-resonant hopping, showing that the Tisserand constant is the main problem parameter. Some new analytical formulas and the 3-D Tisserand graph, which are the first main results, are developed to support the design of resonant hopping transfers. The formulas are implemented in a branch-and-bound algorithm for the computation of resonant hopping transfers. All the feasible solutions for a specific choice of boundary condition are computed in just a few minutes, despite the high dimensionality of the solution space, which grows exponentially with the number of gravity assists. The algorithm and the computation of the solution space are the second main results of the Note, and they are used for the trajectory design of JAXA's JMO.

关键词： Pericenter Callisto Jupiter Ganymede Orbiter Japan Aerospace Exploration Agency branch and bound algorithm Spacecraft Trajectories Gravity Assist Trajectories

来源：评论

学校读者我要写书评

暂无评论

Scheduling on parallel identical machines to minimize total tardiness

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2007年第1期177卷 135-146页

作者： Shim, Sang-Oh Kim, Yeong-Dae Korea Adv Inst Sci & Technol Dept Ind Engn Taejon 305701 South Korea

This paper focuses on the problem of scheduling n independent jobs on m identical parallel machines for the objective of minimizing total tardiness of the jobs. We develop dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as upper bounds obtained from a heuristic algorithm. Computational experiments are performed on randomly generated test problems and results show that the algorithm solves problems with moderate sizes in a reasonable amount of computation time. (c) 2005 Elsevier B.V. All rights reserved.

关键词： scheduling identical parallel machines total tardiness branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：