Suitability of planning domains for OBDD-based planning

Investigate and characterize which classes of planning domains are suitable for OBDD-based universal planning, identifying domain properties that enable efficient symbolic search and those that cause computational difficulty for methods like UMOP.

Background

The authors observed that some domains, notably logistics, were unexpectedly hard for UMOP, prompting development of abstraction techniques to cope with complexity. This raises the broader question of what structural features (e.g., action interactions, state-space connectivity, or representation requirements) make domains amenable to OBDD-based approaches.

A clear characterization of domain suitability would guide practitioners in choosing planning frameworks and inform future improvements to symbolic encodings and algorithms.

References

Our research has drawn our attention to a number of open questions that we would like to address in the future. Another interesting question is to investigate which kind of planning domains is suitable for OBDD-based planning.

— OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains (1106.0229 - Jensen et al., 2011) in Section 8, Conclusion and Future Work