Abstract: AI planning has been the key research topic in artificial intelligence(AI) community. In recent years, AI planning technology has been applied to solve many real-world problems, which gives a challenge for AI planner both in handung power and efficiency. This paper studied a kind of expressive temporal planning paradigm-constraint based interval(CBI) planning. Based on the dynamic constraint satisfaction problem framework, the author designed a new CBI algorithm named LP-TPOP. hhe paper gave the proof of soundness and completeness for LP-TPOP, and algorithm demonstration for a CBI planning example.

Key words: AI planning, Expressive temporal planning, Dynamic constraint satisfaction problem, Algorithm