Sciweavers

54 search results - page 4 / 11
» Planning with POMDPs Using a Compact, Logic-Based Representa...
Sort
View
JAIR
2010
115views more  JAIR 2010»
13 years 6 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
ATAL
2008
Springer
13 years 9 months ago
Value-based observation compression for DEC-POMDPs
Representing agent policies compactly is essential for improving the scalability of multi-agent planning algorithms. In this paper, we focus on developing a pruning technique that...
Alan Carlin, Shlomo Zilberstein
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
14 years 23 days ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...
AIPS
2008
13 years 9 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
CORR
2011
Springer
151views Education» more  CORR 2011»
12 years 11 months ago
A New Representation Theorem for Many-valued Modal Logics
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of ...
Zoran Majkic