arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.15030cs.AIcs.LGcs.MAcs.ROcs.SYeess.SY
收藏

基于树搜索和图神经网络求解约束时基可控下的不确定性析取时态网络

Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability using Tree Search and Graph Neural Networks

NASA Ames Research Center(美国国家航空航天局艾姆斯研究中心);LAMSADE(巴黎多芬大学计算机科学与决策方法实验室);Paris-Dauphine University(巴黎多芬大学);CREC Saint-Cyr Coetquidan(圣西尔科埃基当作战研究中心);Safran(赛峰集团)

Kevin Osanlou, Jeremy Frank, Andrei Bursuc, Tristan Cazenave, Eric Jacopin, Christophe Guettier, J. Benton

摘要:

不确定性下的规划是人工智能的一个研究领域。我们提出了一种新的方法,基于树搜索和图机器学习的调度问题,被称为具有不确定性的分离时间网络(DTNU)。DTNU的动态可控性(DC)寻求一种反应式调度策略,以满足时间约束,以响应不可控的动作持续时间。我们介绍了新的语义反应调度:基于时间的动态可控性(TDC)和TDC的一个有限的子集,R-TDC。我们设计了一个树搜索算法来确定DTNU是否是R-TDC。此外,我们利用图神经网络作为启发式树搜索指导。最后,我们在一个已知的基准上进行实验,在这个基准上,我们表明R-TDC在DC方面保持了显着的完整性,同时证明速度更快。这导致树搜索在R-TDC中处理的DTNU问题比最先进的DC求解器在DC中以相同的时间预算处理的DTNU问题多50%。我们还观察到,图神经网络搜索指导导致更复杂的DTNU的基准上的性能大幅提高,解决的问题比基线树搜索多11倍。

英文摘要:

Planning under uncertainty is an area of interest in artificial intelligence. We present a novel approach based on tree search and graph machine learning for the scheduling problem known as Disjunctive Temporal Networks with Uncertainty (DTNU). Dynamic Controllability (DC) of DTNUs seeks a reactive scheduling strategy to satisfy temporal constraints in response to uncontrollable action durations. We introduce new semantics for reactive scheduling: Time-based Dynamic Controllability (TDC) and a restricted subset of TDC, R-TDC. We design a tree search algorithm to determine whether or not a DTNU is R-TDC. Moreover, we leverage a graph neural network as a heuristic for tree search guidance. Finally, we conduct experiments on a known benchmark on which we show R-TDC to retain significant completeness with regard to DC, while being faster to prove. This results in the tree search processing fifty percent more DTNU problems in R-TDC than the state-of-the-art DC solver does in DC with the same time budget. We also observe that graph neural network search guidance leads to substantial performance gains on benchmarks of more complex DTNUs, with up to eleven times more problems solved than the baseline tree search.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑