摘要
分析了“计划编制”问题的特点,指出在AI中,此问题可归结为一类多施主(multi-agent),并需对动作发生的时间、地点和动作的对象进行规划的复杂规划问题。据此,本文拓展了Allen和S.A,Vere的时间包(package)和时间推理的某些概念,提出了时间窗口的概念及以此来求解“计划编制”问题的分层规划方法。最后给出了一个实际问题的解法。
By examining the featuires of plan making, it is concluded in this paper that the problem can be classified into a class of complex planning for multi-agent with the occurence time, place and object of action. Some concepts of Allen and S. A. Vere's emporal logic are expanded, A new hierarchical planning method is proposed by using a new concept named temporal window', and a solution of a practical problem is given.
出处
《北方交通大学学报》
CSCD
北大核心
1995年第3期401-406,共6页
Journal of Northern Jiaotong University
基金
国家教委重点学科资助
关键词
人工智能
分层规划
计划编制
复杂规划
ss: artificial intelligence, problem solving, planning, hierearical planning