Abstraction-based branch and bound approach to Q-learning for hybrid optimal control

Benoît Legat, Raphaël M. Jungers, Jean Bouchat

备注：: 13 pages, 1 figure, submitted to the 3rd Annual Learning for Dynamics & Control Conference (L4DC 2021)

英文摘要：

In this paper, we design a theoretical framework allowing to apply model predictive control on hybrid systems. For this, we develop a theory of approximate dynamic programming by leveraging the concept of alternating simulation. We show how to combine these notions in a branch and bound algorithm that can further refine the Q-functions using Lagrangian duality. We illustrate the approach on a numerical example.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

The Hybridization of Branch and Bound with Metaheuristics for Nonconvex Multiobjective Optimization

A hybrid framework combining the branch and bound method with multiobjective evolutionary algorithms is proposed for nonconvex multiobjective optimization. The hybridization exploits the complementary character of the two optimization strategies. A multiobjective evolutionary algorithm is intended for inducing tight lower and upper bounds during the branch and bound procedure. Tight bounds such as the ones derived in this way can reduce the number of subproblems that have to be solved. The branch and bound method guarantees the global convergence of the framework and improves the search capabi…

2022-12-09cs.NEmath.OC

Computing Optimal (R, s, S) Policy Parameters by a Hybrid of Branch-and-Bound and Stochastic Dynamic Programming

A well-know control policy in stochastic inventory control is the (R, s, S) policy, in which inventory is raised to an order-up-to-level S at a review instant R whenever it falls below reorder-level s. To date, little or no work has been devoted to developing approaches for computing (R, s, S) policy parameters. In this work, we introduce a hybrid approach that exploits tree search to compute optimal replenishment cycles, and stochastic dynamic programming to compute (s, S) levels for a given cycle. Up to 99.8% of the search tree is pruned by a branch-and-bound technique with bounds generated …

2020-12-28math.OC

求解二次无约束二值优化的混合量子分支定界方法

Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization

提出一种将Ising求解器集成到经典分支定界算法的混合框架，通过自定义分支规则和QUBO嵌入优化，在数百实例上比默认Gurobi减少11%求解时间和17%节点数，证明混合量子-经典策略对精确优化的增强价值。

2025-09-14math.OC

使用混合化和单纯形上的鲁棒控制器进行约束非线性系统的综合

Synthesis for Constrained Nonlinear Systems using Hybridization and Robust Controllers on Simplices

Laboratoire Jean Kuntzmann Universit\'e de Grenoble B.P. 53, 38041 Grenoble, France

提出一种基于混合化（非线性动力学的混合抽象）的方法，通过在状态空间三角剖分的每个单纯形上设计并协调局部鲁棒仿射控制器，实现对约束非线性系统的控制器综合。

2011-09-12cs.SYeess.SYmath.OC

Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction

University of Oxford（牛津大学）；J. P. Morgan AI Research（摩根大通AI研究院）

We consider a novel queuing problem where the decision-maker must choose to accept or reject randomly arriving tasks into a no buffer queue which are processed by $N$ identical servers. Each task has a price, which is a positive real number, and a class. Each class of task has a different price distribution and service rate, and arrives according to an inhomogenous Poisson process. The objective is to decide which tasks to accept so that the total price of tasks processed is maximised over a finite horizon. We formulate the problem as a discrete time Markov Decision Process (MDP) with a hybrid…

2022-03-14cs.AIcs.LGmath.OC

Integrated symbolic control design for nonlinear systems with infinite states specifications

Discrete abstractions of continuous and hybrid systems have recently been the topic of great interest from both the control systems and the computer science communities, because they provide a sound mathematical framework for analysing and controlling embedded systems. In this paper we give a further contribution to this research line, by addressing the problem of symbolic control design of nonlinear systems with infinite states specifications, modelled by differential equations. We first derive the symbolic controller solving the control design problem, given in terms of discrete abstractions…

2010-06-14math.OC

更多相关论文收起更多论文

通过局部可达集上界计算具有鲁棒性边界的有限抽象

Computing finite abstractions with robustness margins via local reachable set over-approximation

University of Sheffield（谢菲尔德大学）；University of Michigan（密歇根大学）

本文提出一种计算具有鲁棒性边界的有限抽象的方法，用于非线性系统的鲁棒混合控制策略合成。现有方法常使用全局分析函数提供可达集上界，但可能过于保守并导致抽象系统中虚假转移。本文通过局部可达集上界和线性化误差跟踪来缓解这一问题。

2015-07-22cs.SYeess.SYmath.OC

A Difference-of-Convex Programming Approach With Parallel Branch-and-Bound For Sentence Compression Via A Hybrid Extractive Model

Shanghai Jiao Tong University（上海交通大学）；Shanghai University of Engineering Science（上海工程技术大学）

Sentence compression is an important problem in natural language processing with wide applications in text summarization, search engine and human-AI interaction system etc. In this paper, we design a hybrid extractive sentence compression model combining a probability language model and a parse tree language model for compressing sentences by guaranteeing the syntax correctness of the compression results. Our compression model is formulated as an integer linear programming problem, which can be rewritten as a Difference-of-Convex (DC) programming problem based on the exact penalty technique. W…

2021-02-14cs.AImath.OC

Hybrid Models for Learning to Branch

University of Oxford（牛津大学）；The Alan Turing Institute（艾伦·图灵研究所）；Mila, Polytechnique Montréal（蒙特利尔综合理工学院Mila）；University of Toronto（多伦多大学）；CERC, Polytechnique Montréal（蒙特利尔综合理工学院CERC）；Mila, Université de Montréal（蒙特利尔大学Mila）

A recent Graph Neural Network (GNN) approach for learning to branch has been shown to successfully reduce the running time of branch-and-bound algorithms for Mixed Integer Linear Programming (MILP). While the GNN relies on a GPU for inference, MILP solvers are purely CPU-based. This severely limits its application as many practitioners may not have access to high-end GPUs. In this work, we ask two key questions. First, in a more realistic setting where only a CPU is available, is the GNN model still competitive? Second, can we devise an alternate computationally inexpensive model that retains …

2020-10-23cs.LGmath.OCstat.ML

The Observability Concept in a Class of Hybrid Control systems

In the discrete modeling approach for hybrid control systems, the continuous plant is reduced to a discrete event approximation, called the DES-plant, that is governed by a discrete event system, representing the controller. The observability of the DES-plant model is crucial for the synthesis of the controller and for the proper closed loop evolution of the hybrid control system. Based on a version of the framework for hybrid control systems proposed by Antsaklis, the paper analysis the relation between the properties of the cellular space of the continuous plant and a mechanism of plant-symb…

2017-07-23cs.DMmath.OC