Encoding HTN Planning as a Dynamic CSP

Abstract

The paper proposes encoding of HTN planning problems as constraint satisfaction problems.

Keywords

• Encoding
• Planning
• Dynamic
• CSP