Domain-Independent Online Planning for STRIPS Domains

Author(s):  
Oscar Sapena ◽  
Eva Onaindía
2014 ◽  
Vol 24 (7) ◽  
pp. 1589-1600
Author(s):  
Zong-Zhang ZHANG ◽  
Xiao-Ping CHEN

2020 ◽  
Author(s):  
Wang Chi Cheung ◽  
Guodong Lyu ◽  
Chung-Piaw Teo ◽  
Hai Wang
Keyword(s):  

1998 ◽  
Vol 01 (02n03) ◽  
pp. 221-236 ◽  
Author(s):  
Diana Richards ◽  
Brendan D. McKay ◽  
Whitman A. Richards

The conditions under which the aggregation of information from interacting agents results in a stable or an unstable collective outcome is an important puzzle in the study of complex systems. We show that if a complex system of aggregated choice respects a mutual knowledge structure, then the prospects of a stable collective outcome are considerably improved. Our domain-independent results apply to collective choice ranging from perception, where an interpretation of sense data is made by a collection of perceptual modules, to social choice, where a group decision is made from a set of preferences held by individuals.


2014 ◽  
Vol 513-517 ◽  
pp. 1092-1095
Author(s):  
Bo Wu ◽  
Yan Peng Feng ◽  
Hong Yan Zheng

Bayesian reinforcement learning has turned out to be an effective solution to the optimal tradeoff between exploration and exploitation. However, in practical applications, the learning parameters with exponential growth are the main impediment for online planning and learning. To overcome this problem, we bring factored representations, model-based learning, and Bayesian reinforcement learning together in a new approach. Firstly, we exploit a factored representation to describe the states to reduce the size of learning parameters, and adopt Bayesian inference method to learn the unknown structure and parameters simultaneously. Then, we use an online point-based value iteration algorithm to plan and learn. The experimental results show that the proposed approach is an effective way for improving the learning efficiency in large-scale state spaces.


Sign in / Sign up

Export Citation Format

Share Document