Symbolic heuristic search for factored Markov decision processes
Eighteenth national conference on Artificial intelligence
Planning under continuous time and resource uncertainty: a challenge for AI
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
On the complexity of minimizing the OBDD size for incompletely specified functions
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
As planning agents grow more sophisticated, plan representation issues arise. Planners work over increasingly large and difficult problems and output is often complex or unwieldy. Further, where planners must interact with human users 驴 either for plan verification and analysis, or in mixed-initiative settings 驴 plans must be represented so that the intended course of action is readily available. We propose automated techniques for simplification of, and conversion between, plan representations.