In this article, we propose a novel framework for approximating the MPC policy for linear parameter-varying systems using supervised learning. Our learning scheme guarantees feasibility and near-optimality of the appr...
详细信息
In this article, we propose a novel framework for approximating the MPC policy for linear parameter-varying systems using supervised learning. Our learning scheme guarantees feasibility and near-optimality of the approximated MPC policy with high probability. Furthermore, in contrast to most existing approaches that only learn the MPC policy, we also learn the "dual policy," which enables us to keep a check on the approximated MPC's optimality online during the control process. If the check deems the control input from the approximated MPC policy safe and near-optimal, then it is applied to the plant;otherwise, a backup controller is invoked, thus filtering out (severely) suboptimal control inputs. The backup controller is only invoked with a bounded (low) probability, where the exact probability level can be chosen by the user. Since our framework does not require solving any optimization problem during the control process, it enables the deployment of MPC on resource-constrained systems. Specifically, we illustrate the utility of the proposed framework on a vehicle dynamics control problem. Compared with online optimization methods, we demonstrate a speedup of up to 62x on a desktop computer and 10x on an automotive-grade electronic control unit, while maintaining high control performance.
作者:
Oishi, YasuakiUniv Tokyo
Grad Sch Informat Sci & Technol Dept Math Informat Bunkyo Ku Tokyo 1138656 Japan
A randomized approach is considered for a feasibility problem on a parameter-dependent linear matrix inequality (LMI). In particular, a gradient-based and an ellipsoid-based randomized algorithms are improved by intro...
详细信息
A randomized approach is considered for a feasibility problem on a parameter-dependent linear matrix inequality (LMI). In particular, a gradient-based and an ellipsoid-based randomized algorithms are improved by introduction of a stopping rule. The improved algorithms stop after a bounded number of iterations and this bound is of polynomial order in the problem size. When the algorithms stop, either of the following two events occurs: (i) they find with high confidence a probabilistic solution, which satisfies the given LMI for most of the parameter values;(ii) they detect in an approximate sense the non-existence of a deterministic solution, which satisfies the given LMI for all the parameter values. These results are important because the original randomized algorithms have issues to be settled on detection of convergence, on the speed of convergence, and on the assumption of feasibility. The improved algorithms can be adapted for an optimization problem constrained by a parameter-dependent LMI. A numerical example shows the efficacy of the proposed algorithms. (C) 2007 Elsevier Ltd. All rights reserved.
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP-rounding. The linear program that we use has a polynomial n...
详细信息
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP-rounding. The linear program that we use has a polynomial number of variables and constraints, thus being more efficient than the one commonly used in the approximation algorithms for these types of problems. (C) 2009 Elsevier B.V. All rights reserved.
Online matching problems have garnered significant attention in recent years due to numerous applications in e-commerce, online advertisements, ride-sharing, etc. Many of them capture the uncertainty in the real world...
详细信息
Online matching problems have garnered significant attention in recent years due to numerous applications in e-commerce, online advertisements, ride-sharing, etc. Many of them capture the uncertainty in the real world by including stochasticity in both the arrival and matching processes. The online stochastic matching with timeouts problem introduced by Bansal et al. (Algorithmica, 2012) models matching markets (e.g., E-Bay, Amazon). Buyers arrive from an independent and identically distributed (i.i.d.) known distribution on buyer profiles and can be shown a list of items one at a time. Each buyer has some probability of purchasing each item and a limit (timeout) on the number of items they can be shown. Bansal et al. (Algorithmica, 2012) gave a 0.12-competitive algorithm which was improved by Adamczyk et al. (ESA, 2015) to 0.24. We present several online attenuation frameworks that use an algorithm for offline stochastic matching as a black box. On the upper bound side, we show that one framework, combined with a black-box adapted from Bansal et al. (Algorithmica, 2012), yields an online algorithm which nearly doubles the ratio to 0.46. Additionally, our attenuation frameworks extend to the more general setting of fractional arrival rates for online vertices. On the lower bound side, we show that no algorithm can achieve a ratio better than 0.632 using the standard LP for this problem. This framework has a high potential for further improvements since new algorithms for offline stochastic matching can directly improve the ratio for the online problem. Our online frameworks also have the potential for a variety of extensions. For example, we introduce a natural generalization: online stochastic matching with two-sided timeouts in which both online and offline vertices have timeouts. Our frameworks provide the first algorithm for this problem achieving a ratio of 0.30. We once again use the algorithm of Bansal et al. (Algorithmica, 2012) as a black-box and plug it in
We introduce a new class of dynamic graph algorithms called quasi-fully dynamic algorithms, which are much more general than backtracking algorithms and are much simpler than fully dynamic algorithms. These algorithms...
详细信息
We introduce a new class of dynamic graph algorithms called quasi-fully dynamic algorithms, which are much more general than backtracking algorithms and are much simpler than fully dynamic algorithms. These algorithms are especially suitable for applications in which a certain core connected portion of the graph remains fixed, and fully dynamic updates occur on the remaining edges in the graph, We present very simple quasi-fully dynamic algorithms with O(log n) worst-case time per operation for edge connectivity and O(log n) amortized time per operation for cycle equivalence, The former is deterministic while the latter is Monte-Carlo-type randomized. For 2-vertex connectivity, we give a deterministic quasi-fully dynamic algorithm with O(log(3)n) amortized time per operation. The quasi-fully dynamic algorithm we present for cycle equivalence (which has several applications in optimizing compilers) is of special interest since the algorithm is quite simple, and no special-purpose incremental or backtracking algorithm is known for this problem.
The particle swarm optimization (PSO) algorithm is a popular evolutionary computation approach that has received an ever-increasing interest in the past decade owing to its wide application potential. Despite the many...
详细信息
The particle swarm optimization (PSO) algorithm is a popular evolutionary computation approach that has received an ever-increasing interest in the past decade owing to its wide application potential. Despite the many variants of the PSO algorithm with improved search ability by means of both the convergence rate and the population diversity, the local optima problem remains a major obstacle that hinders the global optima from being found. In this paper, a novel randomized particle swarm optimizer (RPSO) is proposed where the Gaussian white noise with adjustable intensity is utilized to randomly perturb the acceleration coefficients in order for the problem space to be explored more thoroughly. With this new strategy, the RPSO algorithm not only maintains the population diversity but also enhances the possibility of escaping the local optima trap. Experimental results demonstrate that the proposed RPSO algorithm outperforms some existing popular variants of PSO algorithms on a series of widely used optimization benchmark functions.
Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [ J. ACM, 45 (1998), pp. 653-750] and inspired by Rubinfeld and Sudan [SIAM J. Comput., 25 (1996), pp. 252-271], deals with the f...
详细信息
Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [ J. ACM, 45 (1998), pp. 653-750] and inspired by Rubinfeld and Sudan [SIAM J. Comput., 25 (1996), pp. 252-271], deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x has the property or is "far" from having the property. The main result here is that, if G = {g(n) : {0, 1}(n) --> {0, 1}} is a family of Boolean functions which have oblivious read-once branching programs of width w, then, for every n and epsilon > 0, there is a randomized algorithm that always accepts every x is an element of {0, 1}(n) if g(n) (x) = 1 and rejects it with high probability if at least epsilonn bits of x should be modified in order for it to be in g(n)(-1)(1). The algorithm makes (2(w)/epsilon)O-(w) queries. In particular, for constant epsilon and w, the query complexity is O(1). This generalizes the results of Alon et al. [Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, 1999, pp. 645 655] asserting that regular languages are epsilon-testable for every epsilon > 0.
A problem for many kernel-based methods is that the amount of computation required to find the solution scales as O(n(3)), where n is the number of training examples. We develop and analyze an algorithm to compute an ...
详细信息
A problem for many kernel-based methods is that the amount of computation required to find the solution scales as O(n(3)), where n is the number of training examples. We develop and analyze an algorithm to compute an easily-interpretable low-rank approximation to an n x n Gram matrix G such that computations of interest may be performed more rapidly. The approximation is of the form (G) over tilde (k) = CWk+ C-T, where C is a matrix consisting of a small number c of columns of G and W-k is the best rank-k approximation to W, the matrix formed by the intersection between those c columns of G and the corresponding c rows of G. An important aspect of the algorithm is the probability distribution used to randomly sample the columns;we will use a judiciously-chosen and data-dependent nonuniform probability distribution. Let parallel to(.)parallel to(2) and parallel to(.)parallel to(F) denote the spectral norm and the Frobenius norm, respectively, of a matrix, and let G(k) be the best rank-k approximation to G. We prove that by choosing O(k/epsilon(4)) columns parallel to G-(CWk+CT)parallel to(xi) <=parallel to G-G(k)parallel to(xi)+epsilon Sigma(n)(i=1) G(ii)(2) both in expectation and with high probability, for both xi = 2, F, and for all k : 0 <= k <= rank(W). This approximation can be computed using O(n) additional space and time, after making two passes over the data from external storage. The relationships between this algorithm, other related matrix decompositions, and the Nystrom method from integral equation theory are discussed.
This article studies the Minimum Spanning Tree Problem under Explorable Uncertainty as well as a related vertex uncertainty version of the problem. We particularly consider special instance types, including cactus gra...
详细信息
This article studies the Minimum Spanning Tree Problem under Explorable Uncertainty as well as a related vertex uncertainty version of the problem. We particularly consider special instance types, including cactus graphs, for which we provide randomized algorithms. We introduce the problem of finding a minimum weight spanning star under uncertainty for which we show that no algorithm can achieve constant competitive ratio.
The need for solving multivariate optimization problems is pervasive in engineering and the physical and social sciences. The simultaneous perturbation stochastic approximation (SPSA) algorithm has recently attracted ...
详细信息
The need for solving multivariate optimization problems is pervasive in engineering and the physical and social sciences. The simultaneous perturbation stochastic approximation (SPSA) algorithm has recently attracted considerable attention for challenging optimization problems where it is difficult or impossible to directly obtain a gradient of the objective function with respect to the parameters being optimized. SPSA is based on an easily implemented and highly efficient gradient approximation that relies on measurements of the objective function, not on measurements of the gradient of the objective function. The gradient approximation is based on only two function measurements (regardless of the dimension of the gradient vector). This contrasts with standard finite-difference approaches, which require a number of function measurements proportional to the dimension of the gradient vector. This paper presents a simple step-by-step guide to implementation of SPSA in generic optimization problems and offers some practical suggestions for choosing certain algorithm coefficients.
暂无评论