English
Related papers

Related papers: Policy Synthesis for Interval MDPs via Polyhedral …

200 papers

We propose a principled kernel-based policy iteration algorithm to solve the continuous-state Markov Decision Processes (MDPs). In contrast to most decision-theoretic planning frameworks, which assume fully known state transition models, we…

Robotics · Computer Science 2020-06-04 Junhong Xu , Kai Yin , Lantao Liu

We study the distributed synthesis of policies for multi-agent systems to perform \emph{spatial-temporal} tasks. We formalize the synthesis problem as a \emph{factored} Markov decision process subject to \emph{graph temporal logic}…

Multiagent Systems · Computer Science 2021-06-02 Murat Cubuktepe , Zhe Xu , Ufuk Topcu

We consider controller synthesis for stochastic and partially unknown environments in which safety is essential. Specifically, we abstract the problem as a Markov decision process in which the expected performance is measured using a cost…

Software Engineering · Computer Science 2015-10-21 Sebastian Junges , Nils Jansen , Christian Dehnert , Ufuk Topcu , Joost-Pieter Katoen

This paper introduces the concept of parameter-dependent (PD) control Lyapunov functions (CLFs) for gain-scheduled stabilization of nonlinear parameter-varying (NPV) systems. It shows that given a PD-CLF, a min-norm control law can be…

Optimization and Control · Mathematics 2025-03-06 Pan Zhao

We consider large-scale Markov decision processes (MDPs) with a risk measure of variability in cost, under the risk-aware MDPs paradigm. Previous studies showed that risk-aware MDPs, based on a minimax approach to handling risk, can be…

Systems and Control · Computer Science 2017-05-17 Pengqian Yu , William B. Haskell , Huan Xu

We provide performance guarantees for a variant of simulation-based policy iteration for controlling Markov decision processes that involves the use of stochastic approximation algorithms along with state-of-the-art techniques that are…

Machine Learning · Computer Science 2022-10-17 Anna Winnicki , R. Srikant

Decision-making under uncertainty is a crucial ability for autonomous systems. In its most general form, this problem can be formulated as a Partially Observable Markov Decision Process (POMDP). The solution policy of a POMDP can be…

Robotics · Computer Science 2019-04-09 Sung-Kyun Kim , Rohan Thakker , Ali-akbar Agha-mohammadi

This work studies the problem of searching for homogeneous polynomial Lyapunov functions for stable switched linear systems. Specifically, we show an equivalence between polynomial Lyapunov functions for systems of this class and quadratic…

Systems and Control · Electrical Eng. & Systems 2020-02-20 Matthew Abate , Corbin Klett , Samuel Coogan , Eric Feron

This paper considers a wide class of smooth continuous dynamic nonlinear systems (control objects) with a measurable vector of state. The problem is to find a special function (Lyapunov function), which in the framework of the second…

Systems and Control · Electrical Eng. & Systems 2023-07-07 A. M. Zenkin , A. A. Peregudin , A. A. Bobtsov

In this paper, we develop a unified framework able to certify both exponential and subexponential convergence rates for a wide range of iterative first-order optimization algorithms. To this end, we construct a family of parameter-dependent…

Optimization and Control · Mathematics 2018-02-26 Mahyar Fazlyab , Alejandro Ribeiro , Manfred Morari , Victor M. Preciado

This article presents a novel numerically tractable technique for synthesizing Lyapunov functions for equilibria of nonlinear vector fields. In broad strokes, corresponding to an isolated equilibrium point of a given vector field, a…

Systems and Control · Electrical Eng. & Systems 2023-08-28 Raavi Gupta , Sameep Chattopadhyay , Pradyumna Paruchuri , Debasish Chatterjee

In this paper, we consider risk-sensitive Markov Decision Processes (MDPs) with Borel state and action spaces and unbounded cost under both finite and infinite planning horizons. Our optimality criterion is based on the recursive…

Optimization and Control · Mathematics 2025-10-16 Nicole Bäuerle , Alexander Glauner

In this work we show that given a nonlinear programming problem, it is possible to construct a family of dynamical systems defined on the feasible set of the given problem, so that: (a) the equilibrium points are the unknown critical points…

Optimization and Control · Mathematics 2012-11-07 Iasson Karafyllis

We propose a novel flexible-step model predictive control algorithm for unknown linear time-invariant discrete-time systems. The goal is to asymptotically stabilize the system without relying on a pre-collected dataset that describes its…

Optimization and Control · Mathematics 2025-10-02 Markus Pietschner , Christian Ebenbauer , Bahman Gharesifard , Raik Suttner

Reactive synthesis algorithms allow automatic construction of policies to control an environment modeled as a Markov Decision Process (MDP) that are optimal with respect to high-level temporal logic specifications. However, they assume that…

Formal Languages and Automata Theory · Computer Science 2022-05-31 Rajeev Alur , Suguman Bansal , Osbert Bastani , Kishor Jothimurugan

We describe a probabilistic framework for synthesizing control policies for general multi-robot systems, given environment and sensor models and a cost function. Decentralized, partially observable Markov decision processes (Dec-POMDPs) are…

Switched linear systems are time-varying nonlinear systems whose dynamics switch between different modes, where each mode corresponds to different linear dynamics. They arise naturally to model unexpected failures, environment uncertainties…

Optimization and Control · Mathematics 2019-04-26 Bo Wu , Murat Cubuktepe , Ufuk Topcu

This paper presents an automatic formal controller synthesis method for nonlinear sampled-data systems with safety and reachability specifications. Fundamentally, the presented method is not restricted to polynomial systems and controllers.…

Systems and Control · Computer Science 2018-12-07 Cees F. Verdier , Manuel Mazo

Value iteration is a commonly used and empirically competitive method in solving many Markov decision process problems. However, it is known that value iteration has only pseudo-polynomial complexity in general. We establish a somewhat…

Artificial Intelligence · Computer Science 2013-01-07 Omid Madani

Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which…

Logic in Computer Science · Computer Science 2011-04-15 Krishnendu Chatterjee , Thomas A. Henzinger , Barbara Jobstmann , Rohit Singh