Temporal planning with reference Event based Temporal Relations

A temporal network is a directed graph whose vertices are events and edges are labeled by subsets of Allen´s basic temporal relations. Temporal networks play an important role in many fields of AI applications like planning, scheduling, natural language processing etc. The temporal network when applied to planning and scheduling can perform efficiently if the Reference Event based Temporal Relations (RETR) are introduced in the network. Path consistency algorithm is used to determine the consistency of the network with Allen´s relations given as temporal constraint. In this paper the consistency of a temporal network is determined using path consistency algorithm where an extension of Allen´s relations, RETR is introduced as temporal constraint in the network. This has been applied to the AI applications such as planning theoretically and found that the planning is being carried out more efficiently and accurately.