Meta-level control under uncertainty for handling multiple consumable resources of robots

  title={Meta-level control under uncertainty for handling multiple consumable resources of robots},
  author={Simon Le Gloannec and A. Mouaddib and F. Charpillet},
  journal={2005 IEEE/RSJ International Conference on Intelligent Robots and Systems},
Most of works on planning under uncertainty in AI assumes rather simple action models, which do not consider multiple resources. This assumption is not reasonable for many applications such as planetary rovers or robotics which cope with much uncertainty about the duration of tasks, the energy, and the data storage. In this paper, we outline an approach to control the operation of an autonomous rover which operates under multiple resource constraints. We consider a directed acyclic graph of… Expand
Adaptive Multiple Resources Consumption Control for an Autonomous Rover
A new state space representation for multiple consumable resources, which is compact and has suitable access time is presented and obtained via a Markov decision process that is solved off-line. 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
Project-Team MAIA MAchine Intelligente Autonome Lorraine
  • 2003


Planning Under Continuous Time and Resource Uncertainty: A Challenge for AI
The rover problem is described, previous work on planning under uncertainty is discussed, and a detailed, but very small, example illustrating some of the difficulties of finding good plans is presented. Expand
Decomposition Techniques for Planning in Stochastic Domains
This paper presents algorithms that decompose planning problems into smaller problems given an arbitrary partition of the state space and shows how properties of a specified partition affect the time and storage required for these algorithms. Expand
Solving Very Large Weakly Coupled Markov Decision Processes
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
Adaptive Control of Acyclic Progressive Processing Task Structures
The progressive processing model is examined to control the operation of an autonomous rover which operates under tight resource constraints and it is shown that it provides a practical approach to building an adaptive controller for this application. Expand
Optimal Scheduling of Dynamic Progressive Processing
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
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
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
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