English
Related papers

Related papers: Cost Sensitive Reachability Heuristics for Handlin…

200 papers

Some recent works in conditional planning have proposed reachability heuristics to improve planner scalability, but many lack a formal description of the properties of their distance estimates. To place previous work in context and extend…

Artificial Intelligence · Computer Science 2011-05-13 D. Bryce , S. Kambhampati , D. E. Smith

Partially observable Markov decision processes (POMDP) are a useful model for decision-making under partial observability and stochastic actions. Partially Observable Monte-Carlo Planning is an online algorithm for deciding on the next…

Artificial Intelligence · Computer Science 2023-10-05 Oded Blumenthal , Guy Shani

Noisy observations coupled with nonlinear dynamics pose one of the biggest challenges in robot motion planning. By decomposing nonlinear dynamics into a discrete set of local dynamics models, hybrid dynamics provide a natural way to model…

Robotics · Computer Science 2018-10-10 Ajinkya Jain , Scott Niekum

Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in which states of the system are observable only indirectly, via a…

Artificial Intelligence · Computer Science 2011-06-02 M. Hauskrecht

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

Acting to complete tasks in stochastic partially observable domains is an important problem in artificial intelligence, and is often formulated as a goal-based POMDP. Goal-based POMDPs can be solved using the RTDP-BEL algorithm, that…

Artificial Intelligence · Computer Science 2024-10-10 Guy Shani

We consider the problem of finding the best memoryless stochastic policy for an infinite-horizon partially observable Markov decision process (POMDP) with finite state and action spaces with respect to either the discounted or mean reward…

Optimization and Control · Mathematics 2022-05-02 Johannes Müller , Guido Montúfar

This paper is concerned with planning in stochastic domains by means of partially observable Markov decision processes (POMDPs). POMDPs are difficult to solve. This paper identifies a subclass of POMDPs called region observable POMDPs,…

Artificial Intelligence · Computer Science 2013-02-08 Nevin Lianwen Zhang , Wenju Liu

Uncertainties in dynamic road environments pose significant challenges for behavior and trajectory planning in autonomous driving. This paper introduces Hi-Drive, a hierarchical planning algorithm addressing uncertainties at both behavior…

Robotics · Computer Science 2025-10-16 Xuanjin Jin , Chendong Zeng , Shengfa Zhu , Chunxiao Liu , Panpan Cai

Partially Observable Markov Decision Processes (POMDPs) are a powerful framework for planning under uncertainty. They allow to model state uncertainty as a belief probability distribution. Approximate solvers based on Monte Carlo sampling…

Artificial Intelligence · Computer Science 2024-03-01 Daniele Meli , Alberto Castellini , Alessandro Farinelli

Autonomous agents are limited in their ability to observe the world state. Partially observable Markov decision processes (POMDPs) formally model the problem of planning under world state uncertainty, but POMDPs with continuous actions and…

Robotics · Computer Science 2020-07-08 Dicong Qiu , Yibiao Zhao , Chris L. Baker

Potential heuristics for state-space search are defined as weighted sums over simple state features. Atomic features consider the value of a single state variable in a factored state representation, while binary features consider joint…

Artificial Intelligence · Computer Science 2019-09-27 Florian Pommerening , Malte Helmert , Blai Bonet

Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP is often intractable except for small problems due to their…

Artificial Intelligence · Computer Science 2014-01-16 Stéphane Ross , Joelle Pineau , Sébastien Paquet , Brahim Chaib-draa

The main goal in task planning is to build a sequence of actions that takes an agent from an initial state to a goal state. In robotics, this is particularly difficult because actions usually have several possible results, and sensors are…

Artificial Intelligence · Computer Science 2021-04-12 Sergio A. Serrano , Elizabeth Santiago , Jose Martinez-Carranza , Eduardo Morales , L. Enrique Sucar

Planning problems are hard, motion planning, for example, isPSPACE-hard. Such problems are even more difficult in the presence of uncertainty. Although, Markov Decision Processes (MDPs) provide a formal framework for such problems, finding…

Artificial Intelligence · Computer Science 2013-01-14 Carlos E. Guestrin , Dirk Ormoneit

Robots often face challenges in domestic environments where visual feedback is ineffective, such as retrieving objects obstructed by occlusions or finding a light switch in the dark. In these cases, utilizing contacts to localize the target…

Robotics · Computer Science 2024-09-30 Muhammad Suhail Saleem , Rishi Veerapaneni , Maxim Likhachev

Decision-making under uncertainty is a critical aspect of many practical autonomous systems due to incomplete information. Partially Observable Markov Decision Processes (POMDPs) offer a mathematically principled framework for formulating…

Artificial Intelligence · Computer Science 2025-10-28 Moran Barenboim , Vadim Indelman

Hierarchical clustering has been shown to be valuable in many scenarios. Despite its usefulness to many situations, there is no agreed methodology on how to properly evaluate the hierarchies produced from different techniques, particularly…

Machine Learning · Statistics 2020-12-09 Weipeng Huang , Guangyuan Piao , Raul Moreno , Neil J. Hurley

Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition…

Logic in Computer Science · Computer Science 2018-06-14 Sebastian Arming , Ezio Bartocci , Krishnendu Chatterjee , Joost-Pieter Katoen , Ana Sokolova

In this article we propose a qualitative (ordinal) counterpart for the Partially Observable Markov Decision Processes model (POMDP) in which the uncertainty, as well as the preferences of the agent, are modeled by possibility distributions.…

Artificial Intelligence · Computer Science 2013-01-30 Regis Sabbadin
‹ Prev 1 2 3 10 Next ›