基于时间约束网络的智能活动规划

Activity Planning Based on Temporal Constraint Network

老年人认知能力的下降导致其无法正常规划日常生活的问题已经越来越受到社会的关注。利用信息技术辅助老年人独立完成日常活动,已成为目前一个新的研究领域,其中对其活动的规划和提醒是该领域的一个研究热点。在传统基于时间的活动约束表示和冲突检测的基础上,提出一种更为宽松合理的时间约束,其使活动时间更为灵活,同时引入活动规划中新的活动时间冲突问题。通过时间约束网络的相关概念和理论,将活动规划中冲突检测问题转化为简单时间约束网络是否满足一致性的问题。给出时间约束一致性的一般性检测算法,分析得出活动数较大时其算法复杂度呈指数增长。针对一般性检测算法,提出新的检测时间约束一致性的算法,以降低算法复杂度,解决活动规划中的时间冲突问题。最后通过实验对两种算法的时间复杂度进行了比较。

Elders often have difficulties in daily activities because of declining cognitive ability.Assisting elders with information technology has become a new and challenging research area.It＇s a problem that how to pre-defining activities into a plan and prompting the elders if they fail to execute it in this area.We gave a more flexible way to present the time constraints of activities based on the traditional way,but as the same time how to resolve the conflicts between activities become a new troublesome problem.The concept and theory of ＂Simple Temporal Constraint Network＂（STCN） was then proposed,which will well handle the problem.We presented the time constraints of activities with STCN and checked the STCN＇s consistency.The ＂General Checking Algorithm＂（GCA） was adopt,but we found that the GCA＇s complexity will increase by exponentially if the number of activities increases.Then,we gave an improved algorithm to resolve the conflicts between activities and compared the two algorithms.The experiment result shows the ICA has better performance than GCA.