Increasing Scalability in Algorithms for Centralized and Decentralized Partially Observable Markov Decision Processes: Efficient Decision-Making and Coordination in Uncertain Environments
نویسندگان
چکیده
INCREASING SCALABILITY IN ALGORITHMS FOR CENTRALIZED AND DECENTRALIZED PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES: EFFICIENT DECISION-MAKING AND COORDINATION IN UNCERTAIN ENVIRONMENTS
منابع مشابه
Producing efficient error-bounded solutions for transition independent decentralized mdps
There has been substantial progress on algorithms for single-agent sequential decision making using partially observable Markov decision processes (POMDPs). A number of efficient algorithms for solving POMDPs share two desirable properties: error-bounds and fast convergence rates. Despite significant efforts, no algorithms for solving decentralized POMDPs benefit from these properties, leading ...
متن کاملDecentralized control of multi-robot partially observable Markov decision processes using belief space macro-actions
This work focuses on solving general multi-robot planning problems in continuous spaces with partial observability given a high-level domain description. Decentralized Partially Observable Markov Decision Processes (DecPOMDPs) are general models for multi-robot coordination problems. However, representing and solving DecPOMDPs is often intractable for large problems. This work extends the Dec-P...
متن کاملMulti-Robot Coordinated Decision Making under Mixed Observability through Decentralized Data Fusion
Partially Observable Markov Decision Processes (POMDPs) provide a sound mathematical framework to deal with robotic planning when tasks outcomes and perception are uncertain, but their main problem is scalability. This paper deals with planning in multi-robot teams, where this problem is even more evident. The paper presents a novel combination of two methods to cope with this complexity. Mixed...
متن کاملCompact parametric models for efficient sequential decision making in high-dimensional, uncertain domains
Within artificial intelligence and robotics there is considerable interest in how a single agent can autonomously make sequential decisions in large, high-dimensional, uncertain domains. This thesis presents decision-making algorithms for maximizing the expcted sum of future rewards in two types of large, high-dimensional, uncertain situations: when the agent knows its current state but does no...
متن کاملExploiting Agent and Type Independence in Collaborative Graphical Bayesian Games
Efficient collaborative decision making is an important challenge for multiagent systems. Finding optimal joint actions is especially challenging when each agent has only imperfect information about the state of its environment. Such problems can be modeled as collaborative Bayesian games in which each agent receives private information in the form of its type. However, representing and solving...
متن کامل