this paper we address the second real-time aspect of deliberation scheduling, i.e., the time cost of the meta-level decision itself, by developing computationally feasible heuristics that make deliberation scheduling decisions "greedily" but quickly. To assess the performance of these greedy heuristics, we are building somewhat simplified Markov Decision Process (MDP) models of the AMP's deliberation scheduling problem and assessing both the optimal and greedy solution policies. Our preliminary ...