中文
相关论文

相关论文: Iterative MILP Methods for Vehicle Control Problem…

200 篇论文

There has been growing interest in implementing massive MIMO systems by one-bit analog-to-digital converters (ADCs), which have the benefit of reducing the power consumption and hardware complexity. One-bit MIMO detection arises in such a…

信息论 · 计算机科学 2023-07-04 Cheng-Yang Yu , Mingjie Shao , Wei-Kun Chen , Ya-Feng Liu , Wing-Kin Ma

This paper proposes an optimization strategy to assist utility operators to recover power distribution systems after large outages. Specifically, a mixed-integer linear programming (MILP) model is developed for co-optimizing crews,…

最优化与控制 · 数学 2019-05-09 Anmar Arif , Zhaoyu Wang , Jianhui Wang , Chen Chen

Dynamic economic dispatch (DED) problem considering prohibited operating zones (POZ), ramp rate constraints, transmission losses and spinning reserve constraints is a complicated non-linear problem which is difficult to solve efficiently.…

最优化与控制 · 数学 2017-04-07 Shanshan Pan , Jinbao Jian , Linfeng Yang

Today, a competitive manufacturing environment imposes further production cost reduction on modern companies. Seeking proper recommendations in production and maintenance planning are the two essential cornerstones of effective production…

信号处理 · 电气工程与系统科学 2020-12-24 Mohammad Arani , Mousaalreza Dastmard , Zhila Dehdari Ebrahimi , Mohsen Momenitabar , Xian Liu

Cutting planes (cuts) play an important role in solving mixed-integer linear programs (MILPs), as they significantly tighten the dual bounds and improve the solving performance. A key problem for cuts is when to stop cuts generation, which…

人工智能 · 计算机科学 2024-02-05 Haotian Ling , Zhihai Wang , Jie Wang

Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear…

最优化与控制 · 数学 2022-02-04 Gregory Dexter , Agniva Chowdhury , Haim Avron , Petros Drineas

In this paper, we describe a novel unsupervised learning scheme for accelerating the solution of a family of mixed integer programming (MIP) problems. Distinct substantially from existing learning-to-optimize methods, our proposal seeks to…

最优化与控制 · 数学 2024-12-25 Shiyuan Qu , Fenglian Dong , Zhiwei Wei , Chao Shang

Binarized Neural Networks (BNNs) have recently attracted significant interest due to their computational efficiency. Concurrently, it has been shown that neural networks may be overly sensitive to "attacks" - tiny adversarial changes in the…

机器学习 · 计算机科学 2018-10-09 Elias B. Khalil , Amrita Gupta , Bistra Dilkina

A decision support system relies on frequent re-solving of similar problem instances. While the general structure remains the same in corresponding applications, the input parameters are updated on a regular basis. We propose a generative…

最优化与控制 · 数学 2021-02-04 Lovis Anderson , Mark Turner , Thorsten Koch

Inverse optimization is the problem of determining the values of missing input parameters for an associated forward problem that are closest to given estimates and that will make a given target vector optimal. This study is concerned with…

计算复杂性 · 计算机科学 2023-07-14 Aykut Bulut , Ted K. Ralphs

Optimal planning with respect to learned neural network (NN) models in continuous action and state spaces using mixed-integer linear programming (MILP) is a challenging task for branch-and-bound solvers due to the poor linear relaxation of…

人工智能 · 计算机科学 2019-07-29 Buser Say , Scott Sanner , Sylvie Thiébaux

In this paper, we present an analysis of the strength of sparse cutting-planes for mixed integer linear programs (MILP) with sparse formulations. We examine three kinds of problems: packing problems, covering problems, and more general…

最优化与控制 · 数学 2016-01-05 Santanu S. Dey , Marco Molinaro , Qianyi Wang

In the context of autonomous driving, the iterative linear quadratic regulator (iLQR) is known to be an efficient approach to deal with the nonlinear vehicle model in motion planning problems. Particularly, the constrained iLQR algorithm…

机器人学 · 计算机科学 2022-07-28 Jun Ma , Zilong Cheng , Xiaoxue Zhang , Masayoshi Tomizuka , Tong Heng Lee

This paper addresses the single-item single-stocking location stochastic lot sizing problem under the $(s, S) $ policy. We first present a mixed integer non-linear programming (MINLP) formulation for determining near-optimal $(s, S)$ policy…

最优化与控制 · 数学 2018-09-17 Mengyuan Xiang , Roberto Rossi , Belen Martin-Barragan , S. Armagan Tarim

Mixed Integer Programming (MIP) has been extensively applied in areas requiring mathematical solvers to address complex instances within tight time constraints. However, as the problem scale increases, the complexity of model formulation…

计算与语言 · 计算机科学 2024-09-19 Teng Wang , Wing-Yin Yu , Ruifeng She , Wenhan Yang , Taijie Chen , Jianping Zhang

This article describes the methodology for formulating and solving optimal pump scheduling problems with variable-speed pumps (VSPs) as mixed integer linear programs (MILPs) using piece-linear approximations of the network components. The…

最优化与控制 · 数学 2023-09-12 Tomasz Janus , Bogumil Ulanicki , Kegong Diao

Mixed-integer quadratic programs (MIQPs) are a versatile way of formulating vehicle decision making and motion planning problems, where the prediction model is a hybrid dynamical system that involves both discrete and continuous decision…

机器人学 · 计算机科学 2024-05-15 Rudolf Reiter , Rien Quirynen , Moritz Diehl , Stefano Di Cairano

The efficient allocation of human resources is a critical concern in software development and other industries. This paper introduces a rigorous mathematical methodology for task assignment, employing Mixed Integer Linear Programming (MILP)…

最优化与控制 · 数学 2025-12-16 Lokendra Kumar , Neelesh S. Upadhye , Kannan Piedy

The goal of survey design is often to minimize the errors associated with inference: the total of bias and variance. Random surveys are common because they allow the use of theoretically unbiased estimators. In practice however, such…

统计方法学 · 统计学 2023-02-14 Connie Okasaki , Sándor F. Tóth , Andrew M. Berdahl

Voting problems are central in the area of social choice. In this article, we investigate various voting systems and types of control of elections. We present integer linear programming (ILP) formulations for a wide range of NP-hard control…

计算机科学与博弈论 · 计算机科学 2015-09-03 Sergey Polyakovskiy , Rudolf Berghammer , Frank Neumann