Sciweavers

337 search results - page 27 / 68
» An Anytime Algorithm for Decision Making under Uncertainty
Sort
View
ICRA
2010
IEEE
133views Robotics» more  ICRA 2010»
13 years 7 months ago
Variable resolution decomposition for robotic navigation under a POMDP framework
— Partially Observable Markov Decision Processes (POMDPs) offer a powerful mathematical framework for making optimal action choices in noisy and/or uncertain environments, in par...
Robert Kaplow, Amin Atrash, Joelle Pineau
MANSCI
2010
92views more  MANSCI 2010»
13 years 7 months ago
A Quantitative Measurement of Regret Theory
This paper introduces a choice-based method that for the first time makes it possible to quantitatively measure regret theory, one of the most popular models of decision under unc...
Han Bleichrodt, Alessandra Cillo, Enrico Diecidue

Publication
273views
13 years 4 months ago
Monte Carlo Value Iteration for Continuous-State POMDPs
Partially observable Markov decision processes (POMDPs) have been successfully applied to various robot motion planning tasks under uncertainty. However, most existing POMDP algo...
Haoyu Bai, David Hsu, Wee Sun Lee, and Vien A. Ngo
KR
2004
Springer
14 years 2 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
ICTAI
1996
IEEE
14 years 29 days ago
Automatic Diagnoses for Properly Stratified Knowledge-Bases
We present a mechanism for recovering consistent data from inconsistent set of assertions. For a common family of knowledge-bases we also provide an efficient algorithm for doing ...
Ofer Arieli, Arnon Avron