Deliberation scheduling for problem solving in time-constrained environments
Artificial Intelligence
Combinatorial optimization
Principles and applications of continual computation
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Automated resource-driven mission phasing techniques for constrained agents
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Managing online self-adaptation in real-time environments
IWSAS'01 Proceedings of the 2nd international conference on Self-adaptive software: applications
Solving large TÆMS problems efficiently by selective exploration and decomposition
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
| Hi-index | 0.00 |
Deliberation scheduling is the process of scheduling decision procedures to maximize overall performance. In this paper, we present novel mathematical programming algorithms for scheduling deliberations, and illustrate them through several increasingly complex classes of deliberation scheduling problems. In comparison to previous work, our algorithms are able to optimally or near-optimally solve deliberation scheduling problems for decision procedures that have more general performance profiles, and are applicable in complex domains with uncertainty. We also illustrate that, thanks to the mathematical programming form illation, our algorithms can be easily extended to model additional system aspects.