摘要
本文提出一种有效的求解时间规划问题中Ｒ－时刻表的综合算法．它通过逐级调用基于三角形的约束传递算法对时间约束关系进行筛选的办法，迅速地缩小搜索范围。然后，将精简的关系矩阵法应用于完全解，得到一致满足所有时间关系约束的Ｒ－时刻表。
An efficient synthetic algorithm for solving R-time table of temporalplanning problem is presented. The search space can be rapidly reduced by means ofinvoking step -by- step the triangle- based constraint propagation algorithm to filterthe temporal constraint relations. The simplified relational matrix method is then applied to the resulting complete solution and the R-time table is obtained.
出处
《华南理工大学学报（自然科学版）》
EI
CAS
CSCD
1995年第9期43-48,共6页
Journal of South China University of Technology(Natural Science Edition)
基金
国家自然科学基金
关键词
过滤算法
时间规划
R-时刻表
人工智能
算法
s: constraint problem
planning, filter algorithms/temporal planning
constraint propagation
relational matrix
R_-time table
