Corpus ID: 18095404

A Decision-Theoretic Scheduling of Resource-Bounded Agents in Dynamic Environments

@inproceedings{Gloannec2005ADS,
  title={A Decision-Theoretic Scheduling of Resource-Bounded Agents in Dynamic Environments},
  author={Simon Le Gloannec and A. Mouaddib and F. Charpillet},
  year={2005}
}
Markov Decision processes have been widely used to control the execution of a static set of tasks with limited resources. But little attention has been paid to adapt these techniques to cope with changes in the environment. This is a problem of the dynamic optimisation of resource allocation to a changing set of tasks. We transform this problem into a dynamic composition of local policies (each of which controls a task) to approximate the optimal control policy. Our main claim in this paper is… Expand
A Cooperative Distributed Problem Solving Technique for Large Markov Decision Processes
TLDR
An approach is proposed which decomposes the large MDP into smaller ones each of which is solved on a unique processor and the obtained joint local policies derived from the small MDPs (subMDPs) behave in the same way of the policy of the initial MDP. Expand
Design and evaluation of norm-aware agents based on Normative Markov Decision Processes
TLDR
The Normative Markov Decision Process (NMDP) framework is put forward, an extension of MDPs, for representing the knowledge of norm-aware agents in stochastic environments and how it may be employed to study the impact of norms on agent behavior. Expand
Contrôle adaptatif d'un agent rationnel à ressources limitées dans un environnement dynamique et incertain
Cette these se situe dans le cadre de la decision pour un agent rationnel et autonome. Le travail consiste a elaborer un systeme de controle intelligent pour un agent evoluant dans un environnementExpand
Planification et ordonnancement probabilistes sous contraintes temporelles
Cette these est consacree au probleme de la planification et de l'ordonnancement des tâches sous contraintes temporelles et incertitude. Les contraintes temporelles que nous traitons sont de deuxExpand
Project-Team MAIA MAchine Intelligente Autonome Lorraine
  • 2003

References

SHOWING 1-6 OF 6 REFERENCES
Optimal Scheduling of Dynamic Progressive Processing
TLDR
A new approach to scheduling the process- ing units by constructing and solving a particular Markov decision problem and finding an optimal policy (or schedule) is introduced, offering a significant improvement over existing heuristic scheduling techniques. Expand
Solving Very Large Weakly Coupled Markov Decision Processes
TLDR
A technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPS) and describes heuristic techniques for dealing with several classes of constraints that use the solutions for individual MDPS to construct an approximate global solution. Expand
Quality and Utility - Towards a Generalization of Deadline and Anytime Scheduling
TLDR
This work introduces a paradigm which allows to separate the two aspects of time inherent in an application and problems under this paradigm are specified in a hierarchical task model. Expand
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
TLDR
Two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decouplings method are presented, which provide a framework for the efficient transfer of knowledge across problems that share similar structure. Expand
Prioritized Goal Decomposition of Markov Decision Processes: Toward a Synthesis of Classical and Decision Theoretic Planning
TLDR
An abstraction mechanism is used to generate abstract MDPs associated with different objectives, and several methods for merging the policies for these different objectives are considered. Expand
Dynamic Composition of Information Retrieval Techniques
This paper presents a new approach to information retrieval (IR) based on run-time selection of the best set of techniques to respond to a given query. A technique is selected based on its projectedExpand