首页    期刊浏览 2024年11月27日 星期三
登录注册

文章基本信息

  • 标题:Conditional Simple Temporal Networks with Uncertainty and Resources
  • 本地全文:下载
  • 作者:Carlo Combi ; Roberto Posenato ; Luca Viganò
  • 期刊名称:Journal of Artificial Intelligence Research
  • 印刷版ISSN:1076-9757
  • 出版年度:2019
  • 卷号:64
  • 页码:931-985
  • DOI:10.1613/jair.1.11453
  • 出版社:American Association of Artificial
  • 摘要:Conditional simple temporal networks with uncertainty (CSTNUs) allow for the representation of temporal plans subject to both conditional constraints and uncertain durations. Dynamic controllability (DC) of CSTNUs ensures the existence of an execution strategy able to execute the network in real time (i.e., scheduling the time points under control) depending on how these two uncontrollable parts behave. However, CSTNUs do not deal with resources. In this paper, we define conditional simple temporal networks with uncertainty and resources (CSTNURs) by injecting resources and runtime resource constraints (RRCs) into the specification. Resources are mandatory for executing the time points and their availability is represented through temporal expressions, whereas RRCs restrict resource availability by further temporal constraints among resources. We provide a fully-automated encoding to translate any CSTNUR into an equivalent timed game automaton in polynomial time for a sound and complete DC-checking.
  • 其他摘要:Conditional simple temporal networks with uncertainty (CSTNUs) allow for the representation of temporal plans subject to both conditional constraints and uncertain durations. Dynamic controllability (DC) of CSTNUs ensures the existence of an execution strategy able to execute the network in real time (i.e., scheduling the time points under control) depending on how these two uncontrollable parts behave. However, CSTNUs do not deal with resources. In this paper, we define conditional simple temporal networks with uncertainty and resources (CSTNURs) by injecting resources and runtime resource constraints (RRCs) into the specification. Resources are mandatory for executing the time points and their availability is represented through temporal expressions, whereas RRCs restrict resource availability by further temporal constraints among resources. We provide a fully-automated encoding to translate any CSTNUR into an equivalent timed game automaton in polynomial time for a sound and complete DC-checking.
  • 关键词:resource-bounded reasoning;reasoning about actions and change;satisfiability;scheduling;temporal reasoning;uncertainty
  • 其他关键词:resource-bounded reasoning;reasoning about actions and change;satisfiability;scheduling;temporal reasoning;uncertainty
国家哲学社会科学文献中心版权所有