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

American Control Conference

作者： Schouwenaars, T How, J Feron, E MIT Dept Aeronaut & Astronaut Cambridge MA 02139 USA

ISBN: (纸本)0780383354

This paper extends a recently developed approach to optimal path planning of autonomous vehicles, based on mixed integer linear programming (MILP), to,account for safety. We consider the case of a single vehicle navigating through a cluttered environment which is only known within a certain detection radius around the vehicle. A receding horizon strategy is presented with hard terminal constraints that guarantee feasibility of the MILP problem at all future time steps. The trajectory computed at each iteration is constrained to end in a so called basis state, in which the vehicle can safely remain for an indefinite period of time. The principle is applied to the case of a UAV with limited turn rate and minimum speed requirements, for which safety conditions are derived in the form of loiter circles. The latter need not be known ahead of time and are implicitly computed online. An example scenario is presented that illustrates the necessity of these safety constraints when the knowledge of the environment is limited and/or hard real-time restrictions are given.

关键词： remotely operated vehicles air safety optimal control path planning integer programming linear programming iterative methods predictive control receding horizon path planning implicit safety guarantees optimal path planning autonomous vehicles mixed integer linear programming single vehicle navigation cluttered environment unmanned air vehicle loiter circles iteration methods

来源：评论

学校读者我要写书评

暂无评论

ORDERED WEIGHTED AVERAGING AGGREGATION METHOD FOR PORTFOLIO SELECTION

引用

Journal of Systems Science & Complexity 2004年第1期17卷 109-116页

作者： LIUShancun QIUWanhua SchoolofEconomicsandManagement BeijingUniversityofAeronauticsandAstronauticsBeijing100083China

Portfolio management is a typical decision making problem under incomplete,sometimes unknown, information. This paper considers the portfolio selection problemsunder a general setting of uncertain states without probability. The investor's preferenceis based on his optimum degree about the nature, and his attitude can be described by anOrdered Weighted Averaging Aggregation function. We construct the OWA portfolio selection model, which is a nonlinear programming problem. The problem can be equivalentlytransformed into a mixed integer linear programming. A numerical example is given andthe solutions imply that the investor's strategies depend not only on his optimum degreebut also on his preference weight vector. The general game-theoretical portfolio selectionmethod, max-min method and competitive ratio method are all the special settings of thismodel.

关键词： portfolio selection game-theoretical portfolio selection ordered weightedaveraging aggregation method mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Nonlinear control allocation using piecewise linear functions

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2004年第6期27卷 1017-1027页

作者： Bolender, MA Doman, DB USAF Res Lab Control Theory & Optimizat Branch Wright Patterson AFB OH 45433 USA

A novel method is presented for the solution of the control allocation problem where the control variable rates or moments are nonlinear functions of control position. Historically, control allocation has been performed under the assumption that a linear relationship exists between the control induced moments and the control effector displacements. However, aerodynamic databases are discrete valued and almost always stored in multidimensional lookup tables, where it is assumed that the data are connected by piecewise linear functions. The approach that is presented utilizes this piecewise linear assumption for the control effector moment data. This assumption allows the control allocation problem to be cast as a piecewise linear program that can account for nonlinearities in the moment/effector relationships, as well as to enforce position constraints on the effectors. The piecewise linear program is then recast as a mixed-integer linear program. It is shown that this formulation accurately solves the control allocation problem when compared to the aerodynamic model. It is shown that the control effector commands for a reentry vehicle by the use of the piecewise linear control allocation method are markedly improved when compared to the performance of more traditional control allocation approaches that use a linear relationship between the control moments and the effectors. The technique is also applied to determine those flight conditions (angle of attack and Mach number) at which the reentry vehicle can be trimmed for the purpose of providing constraint estimates to trajectory reshaping algorithms.

关键词： Nonlinear Control linear programming Angle of Attack Nonlinear Aerodynamic Databases mixed integer linear programming Reentry Vehicles Digital Flight Control System Control Surfaces Branch and Bound Algorithm Reusable Launch Vehicle

来源：评论

学校读者我要写书评

暂无评论

Experiences with mixed integer linear programming-Based Approaches in Short-Term Hydro Scheduling

引用

IEEE Power Engineering Review 2001年第9期21卷 63-63页

作者： G. Chang M. Aganagic J. Waight J. Medina T. Burton S. Reeves M. Christoforidis National Chung Cheng University Taiwan Oracle Utility Verticle Siemens Power Systems Control ECNZ Southern Generation Group Power Plant Department Swiss Rail (SBB)

This paper describes experiences with mixed integer linear programming (MILP)-based approaches on the short-term hydro scheduling (STHS) function. The STHS is used to determine the optimal or near-optimal schedules for the dispatchable hydro units in a hydro-dominant system for a user-definable study period at each time step while respecting all system and hydraulic constraints. The problem can be modeled in detail for a hydro system that contains both conventional and pumped-storage units. Discrete and dynamic constraints such as unit startup/shutdown and minimum-up/minimum-down time limits are also included in the model for hydro unit commitment (HUC). The STHS problem is solved with a state-ofthe-art package that includes an algebraic modeling language and an MILP solver. The usefulness of the proposed solution algorithm is illustrated by testing the problem with actual hydraulic system data. Numerical experiences show that the solution technique is computationally efficient, simple, and suitable for decision support of short-term hydro operations planning. In addition, the proposed approaches can be easily extended for scheduling applications in deregulated environments.

关键词： Power generation economics Environmental economics Fuel economy Power generation Search methods mixed integer linear programming Processor scheduling Convergence Intelligent sensors Power system control

来源：评论

学校读者我要写书评

暂无评论

Maximization of time-to-first-failure for multicasting in wireless networks: optimal solution

Maximization of time-to-first-failure for multicasting in wi...

引用

MILCOM, Military Communications Conference

作者： A.K. Das M. El-Sharkawi R.J. Marks P. Arabshahi A. Gray Department of Electrical Engineering University of Washington Seattle WA USA Baylor University Waco TX USA Jet Propulsion Laboratory Pasadena CA USA

We consider the problem of maximizing the time-to-first-failure (TTFF), defined as the time till the first node in the network runs out of battery energy, in energy constrained broadcast wireless networks. We show that the TTFF criterion, by itself, fails to provide the "ideally optimum" multicast tree and propose a composite weighted objective function which maximizes the TTFF and minimizes the sum of transmitter powers. We then develop a mixed integer linear programming (MILP) model for solving the joint optimization problem optimally. We also consider the case of prioritized nodes and show how the model can be modified to deal with such priorities.

关键词： Intelligent networks Wireless networks Broadcasting Batteries Transmitters mixed integer linear programming Unicast Computer science Propulsion Laboratories

来源：评论

学校读者我要写书评

暂无评论

Optimization methods for minimum power bidirectional topology construction in wireless networks with sectored antennas

Optimization methods for minimum power bidirectional topolog...

引用

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.

作者： A.K. Das R.J. Marks M. El-Sharkawi P. Arabshahi A. Gray Department of Electrical Engineering University of Washington Seattle WA USA School of Engineering and Computer Science Baylor University Waco TX USA Jet Propulsion Laboratory Pasadena CA USA

We consider the problem of minimum power bidirectional topology optimization in wireless networks with sectored antennas. We first develop a mixed integer linear programming model for optimal solution of the problem with sectored antennas. Subsequently, we discuss a centralized heuristic algorithm which is based on Kruskal's algorithm for the minimum spanning tree problem. However, unlike Kruskal's algorithm which chooses minimum cost edges from a set of edge weights, our algorithm uses an incremental cost mechanism to select edges. This incremental cost mechanism is motivated by the inherently broadcast nature of the wireless medium. We also discuss a simple branch exchange heuristic which can be used to improve the topology generated by the Kruskal-like algorithm. Simulation results indicate that reasonably good solutions can be obtained using the proposed heuristic algorithms.

关键词： Optimization methods Network topology Intelligent networks Wireless networks Costs Heuristic algorithms Transmitters mixed integer linear programming Broadcasting Spread spectrum communication

来源：评论

学校读者我要写书评

暂无评论

MILP design of frequency-response masking FIR filters with few SPT terms

MILP design of frequency-response masking FIR filters with f...

引用

International Symposium on Communications Control and Signal Processing (ISCCSP)

作者： O. Gustafsson H. Johansson L. Wanhammar Department of Electrical Engineering Linköping University Linköping SWEDEN

In this work we formulate a mixed integer linear programming (MILP) problem that minimizes the number of signed-power-of- two (SPT) terms given a filter specification for linear-phase frequency-response masking (FRM) filters. The proposed method designs the filters in two steps. The model filter and the masking filters are designed separately, but subject to each other. Hence, it is not guaranteed that the global minimum is obtained. However, each solution is optimal given the other filter(s), and iteration may improve the overall solution. The filter design problems are formulated using normalized peak ripple magnitude (NPRM), which for FRM filters introduces some implications, which is also discussed in this work.

关键词： Finite impulse response filter Nonlinear filters Frequency response Arithmetic Hardware Electronic mail mixed integer linear programming Costs Delay Transfer functions

来源：评论

学校读者我要写书评

暂无评论

MINLP algorithms mixed with constraint programming

MINLP algorithms mixed with constraint programming

引用

World Congress on Intelligent Control and Automation (WCICA)

作者： Longhua Ma Liyan Zhang Jixin Qian National Laboratory of Industrial Control Technology Institute of Systems Engineering University of Zhejiang Hangzhou China

ISBN: (纸本)0780382730

This paper advanced mixed integer nonlinear programming (MINLP) algorithms mixed with constraint programming (CP) to solve industrial process hybrid model mixed with logical rule. CP methods have proved to be successful in solving highly constrained discrete optimization and feasibility problems. It can effectively solve hybrid model mixed with logical rule by integrating CP, nonlinear programming and mixed integer linear programming. Computational results demonstrated this algorithm.

关键词： Logic programming integer linear programming Industrial control Laboratories Systems engineering and theory Electrical equipment industry Constraint optimization mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Joint end-to-end scheduling, power control and rate control in multi-hop wireless networks

Joint end-to-end scheduling, power control and rate control ...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： G. Kulkarni V. Raghunathan M. Srivastava Electrical Engineering Department UCLA Los Angeles CA USA

This paper addresses the problem of joint scheduling, power control and rate control while maximizing end-to-end data rates in multi-hop wireless networks. Using a "physical layer" network model that explicitly takes into account interference due to spatial spectrum reuse, we formulate the throughput maximization problem as a mixed integer linear programming problem (MILP). While a MILP based approach yields an optimal solution, it does not scale well to large networks. To address this issue, we also present a computationally efficient water-filling based heuristic. Simulation results, obtained using our heuristic, highlight several capacity related tradeoffs that arise in wireless ad-hoc networks. Prior work only provides either asymptotic results on ad-hoc network capacity or, at best, techniques for computing loose upper bounds for throughput in specific instances of networks.

关键词： Power control Spread spectrum communication Wireless networks Throughput Ad hoc networks Physical layer Interference mixed integer linear programming Computational modeling Computer networks

来源：评论

学校读者我要写书评

暂无评论

A two-stage simulated annealing logical topology reconfiguration in IP over WDM networks

A two-stage simulated annealing logical topology reconfigura...

引用

NETWORKS International Telecommunications Network Strategy and Planning Symposium

作者： Sugang Xu K. Sezaki Y. Tanaka Global Information and Telecommunication Institute Waseda University of Japan Shinjuku Tokyo Japan Institute of Industrial Science University of Tokyo Meguro Tokyo Japan Advanced Research Institute for Science and Engineering W Waseda University of Japan Shinjuku Tokyo Japan

WDM optical networks represent the direction to the future high capacity wide-area network applications. By reconfiguring the logical topology, network resources utilization can be optimized corresponding to the traffic pattern changes. From the viewpoint of network operation, the complexity of reconfiguration should be minimized as well. We consider the logical topology reconfiguration in arbitrary topology IP over WDM networks with balance between network performance and operation complexity. The exact formulation of the logical topology reconfiguration problem is usually given as a mixed integer linear programming, but it grows intractable with increasing size of network. Here we propose a simulated annealing approach to determine the target topology with a smaller logical topology change and satisfy the performance requirement. A threshold on the congestion performance requirement is used to balance the optimal congestion requirement and operation complexity by tuning this threshold to a feasible value. For an effective solution discovery, a two-stage SA algorithm is developed for multiple objectives optimization.

关键词： Simulated annealing Network topology Intelligent networks WDM networks Telecommunication network topology Telecommunication traffic Wavelength division multiplexing Optical fiber devices Optical fiber networks mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：