Planning and Scheduling in Hybrid Domains

摘要

In this paper we present an Action Language-Logic Programming based approach to solving planning and scheduling problems in hybrid domains - domains that exhibit both discrete and continuous behavior. We use action language H to represent the domain and then translate the resulting theory into a logic program. In this way, we reduce the problem of finding solutions to planning and scheduling problems to computing models of logic programs. We present the syntax of H and model a planning and scheduling example in H. We show how to translate the resulting H theory into an equivalent logic program. We compute the models of the resulting program using EZCSP, a solver which allows us to reason about constraints over reals and compute solutions to complex planning and scheduling problems. Results have shown that our approach can be applied to any planning and scheduling problem in hybrid domains.