What makes a temporal planning problem challenging? When can these problems be solved by classical planners, and when do they require special processing?
Our study attempts to answer these questions and investigate other fundamental properties of temporal planning. For example, we have divided the temporal planning domains and problems into two categories, temporally simple and temporally expressive, and identified automatic ways to test the temporal expressiveness of a domain.