Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Timelines are a formalism to model planning domains where the temporal aspects are predominant, and have been used in many real-world applications. Despite their practical success, a major limitation is the inability to model temporal uncertainty, i.e. the fact that the plan executor cannot decide the actual duration of some activities.#R##N##R##N#  make two key contributions. First,  propose a comprehensive, semantically ll founded framework that (conservatively) extends with temporal uncertainty the state of the art timeline approach.#R##N##R##N#Second,  focus on the problem of producing time-triggered plans that are robust with respect to temporal uncertainty, under a bounded horizon. In this setting,  present the first complete algorithm, and  show how it can be made practical by leveraging the por of Satisfiability Modulo Theories.
['Alessandro Cimatti', 'Andrea Micheli', 'Marco Roveri']
I am writing a research paper on a idea Timelines with temporal uncertainty
[{"from": "human", "value": "I am writing a research paper on a idea Timelines with temporal uncertainty"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Timelines are a formalism to model planning domains where the temporal aspects are predominant, and have been used in many real-world applications. Despite their practical success, a major limitation is the inability to model temporal uncertainty, i.e. the fact that the plan executor cannot decide the actual duration of some activities.#R##N##R##N#  make two key contributions. First,  propose a comprehensive, semantically ll founded framework that (conservatively) extends with temporal uncertainty the state of the art timeline approach.#R##N##R##N#Second,  focus on the problem of producing time-triggered plans that are robust with respect to temporal uncertainty, under a bounded horizon. In this setting,  present the first complete algorithm, and  show how it can be made practical by leveraging the por of Satisfiability Modulo Theories."}]