Sharing information on extended reachability goals over propositionally constrained multi-agent state spaces

By exchanging propositional information, agents can implicitly reduce large domain state spaces, a feature that is particularly attractive for Reinforcement Learning approaches. This paper proposes a learning technique that combines a Reinforcement Learning algorithm and a planner for propositionall...

Full description

Saved in:
Bibliographic Details
Main Authors: de Araujo, Anderson V., Ribeiro, Carlos H. C.
Format: Conference Proceeding
Language:English
Subjects:
Convergence
Cooperative Agents
Extended Reachability Goals
Information exchange
Instruction sets
Learning (artificial intelligence)
Markov Decision Processes
Markov processes
Multi-Agent
Planning
Q-Learning
Reinforcement Learning
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:By exchanging propositional information, agents can implicitly reduce large domain state spaces, a feature that is particularly attractive for Reinforcement Learning approaches. This paper proposes a learning technique that combines a Reinforcement Learning algorithm and a planner for propositionally constrained state spaces, that autonomously help agents to implicitly reduce the state space towards possible plans that lead to a goal whilst avoiding irrelevant or inadequate states. State space constraints are communicated among the agents using a common constraint set based on extended reachability goals. A performance evaluation against standard Reinforcement Learning techniques showed that by extending autonomous learning with propositional constraints updated along the learning process can produce faster convergence to optimal policies due to early state space reduction caused by shared information on state space constraints.
ISSN:2161-4393
2161-4407
DOI:10.1109/IJCNN.2014.6889803