English
Related papers

Related papers: Safe Policy Synthesis in Multi-Agent POMDPs via Di…

200 papers

Partially observable Markov decision processes (POMDPs) are a natural model for planning problems where effects of actions are nondeterministic and the state of the world is not completely observable. It is difficult to solve POMDPs…

Artificial Intelligence · Computer Science 2009-09-25 N. L. Zhang , W. Liu

In this work, we consider a cooperative multi-agent Markov decision process (MDP) involving m agents. At each decision epoch, all the m agents independently select actions in order to maximize a common long-term objective. In the policy…

Machine Learning · Computer Science 2024-05-01 Lakshmi Mandal , Chandrashekar Lakshminarayanan , Shalabh Bhatnagar

Markov Decision Processes (MDPs) have been used to formulate many decision-making problems in science and engineering. The objective is to synthesize the best decision (action selection) policies to maximize expected rewards (minimize…

Optimization and Control · Mathematics 2015-07-08 Mahmoud El Chamie , Behcet Acikmese

Principled accountability for autonomous decision-making in uncertain environments requires distinguishing intentional outcomes from negligent designs from actual accidents. We propose analyzing the behavior of autonomous agents through a…

Partially observable Markov Decision Processes (POMDPs) are a standard model for agents making decisions in uncertain environments. Most work on POMDPs focuses on synthesizing strategies based on the available capabilities. However, system…

Artificial Intelligence · Computer Science 2024-07-12 Alyzia-Maria Konsta , Alberto Lluch Lafuente , Christoph Matheja

In a Shared Mobility on Demand Service (SMoDS), dynamic pricing plays an important role in the form of an incentive for the decision of the empowered passenger on the ride offer. Strategies for determining the dynamic tariff should be…

Optimization and Control · Mathematics 2020-07-06 Yue Guan , Anuradha M. Annaswamy , H. Eric Tseng

Missions for autonomous systems often require agents to visit multiple targets in complex operating conditions. This work considers the problem of visiting a set of targets in minimum time by a team of non-communicating agents in a Markov…

Optimization and Control · Mathematics 2023-06-21 Farhad Nawaz , Melkior Ornik

Dynamic obstacle avoidance is a challenging topic for optimal control and optimization-based trajectory planning problems. Many existing works use Control Barrier Functions (CBFs) to enforce safety constraints for control systems. CBFs are…

Robotics · Computer Science 2025-02-10 Shuo Liu , Yihui Mao , Calin A. Belta

Markov decision processes (MDPs) are a standard model for sequential decision-making problems and are widely used across many scientific areas, including formal methods and artificial intelligence (AI). MDPs do, however, come with the…

Artificial Intelligence · Computer Science 2024-12-11 Marnix Suilen , Thom Badings , Eline M. Bovy , David Parker , Nils Jansen

A large class of decision making under uncertainty problems can be described via Markov decision processes (MDPs) or partially observable MDPs (POMDPs), with application to artificial intelligence and operations research, among others.…

Artificial Intelligence · Computer Science 2021-09-10 Mohamadreza Ahmadi , Ugo Rosolia , Michel D. Ingham , Richard M. Murray , Aaron D. Ames

We consider a class of sequential decision-making problems under uncertainty that can encompass various types of supervised learning concepts. These problems have a completely observed state process and a partially observed modulation…

Optimization and Control · Mathematics 2021-08-24 R. Reid Bishop , Chelsea C. White

We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (\omega -regular or LTL) properties \varphi\_i, and probabilities…

Logic in Computer Science · Computer Science 2015-07-01 Kousha Etessami , Marta Kwiatkowska , Moshe Y. Vardi , Mihalis Yannakakis

Constrained Markov Decision Process (CMDP) is a natural framework for reinforcement learning tasks with safety constraints, where agents learn a policy that maximizes the long-term reward while satisfying the constraints on the long-term…

Artificial Intelligence · Computer Science 2018-02-20 Qingkai Liang , Fanyu Que , Eytan Modiano

In many practical applications, decision-making processes must balance the costs of acquiring information with the benefits it provides. Traditional control systems often assume full observability, an unrealistic assumption when…

Artificial Intelligence · Computer Science 2025-01-24 Taiyi Wang , Jianheng Liu , Bryan Lee , Zhihao Wu , Yu Wu

We study an approximation method for partially observed Markov decision processes (POMDPs) with continuous spaces. Belief MDP reduction, which has been the standard approach to study POMDPs requires rigorous approximation methods for…

Optimization and Control · Mathematics 2025-01-20 Ali Devran Kara , Erhan Bayraktar , Serdar Yuksel

For efficient and robust task accomplishment in multi-agent systems, an agent must be able to distinguish cooperative agents from non-cooperative agents, i.e., uncooperative and adversarial agents. Task descriptions capturing safety and…

Optimization and Control · Mathematics 2022-04-12 Hardik Parwana , Dimitra Panagou

Here, we explore the problem of error propagation mitigation in modular digital twins as a sequential decision process. Building on a companion study that used a Hidden Markov Model (HMM) to infer latent error regimes from surrogate-physics…

Machine Learning · Computer Science 2026-04-27 Annice Najafi , Shokoufeh Mirzaei

There is much interest in using partially observable Markov decision processes (POMDPs) as a formal model for planning in stochastic domains. This paper is concerned with finding optimal policies for POMDPs. We propose several improvements…

Artificial Intelligence · Computer Science 2013-02-01 Nevin Lianwen Zhang , Stephen S. Lee

Partially Observable Markov Decision Processes (POMDPs) provide a principled mathematical framework for decision-making under uncertainty. However, the exact solution to POMDPs is computationally intractable. In this paper, we address the…

Robotics · Computer Science 2026-04-03 Da Kong , Vadim Indelman

Monotonic Partially Observable Markov Decision Processes (POMDPs), where the system state progressively decreases until a restorative action is performed, can be used to model sequential repair problems effectively. This paper considers the…

Machine Learning · Computer Science 2025-09-17 Manav Vora , Jonas Liang , Michael N. Grussing , Melkior Ornik