摘要
为了解决情景演算无法解决框架问题和生成动作序列效率底的问题,提出了一种基于情景演算推理规则的表示机器人规划的赋时有色网实现方法——BSCRP网(representation based on situation calculus for robot plan),并提出了一种基于双向搜索策略的BSCRP网系统的构造方法。实验结果表明了机器人规划的BSCRP网系统不仅能形式化地描述动作、状态以及动作和状态之间的关系,而且能动态地规划出实现目标的动作序列并计算执行动作序列所需时间。
To solve the difficulty of representation of the framework problem and the low efficiency of generating action sequence in situa-tion calculus,an implementation method BSCRP net（a representation based on situation calculus for robot plan） is introduced,then an algorism for constructing the BSCRP net system for obtaining the action sequence is advanced.The example proves not only the actions,states,and relations between the states and actions can be formalized,but also the action sequence can be dynamically planned and executing time for the action sequence can be obtained in BSCRP net system.
出处
《计算机工程与设计》
CSCD
北大核心
2011年第4期1449-1452,共4页
Computer Engineering and Design
基金
江苏省社会发展计划基金项目(BS2001046)
江苏省高校自然科学研究计划基金项目(03kjd520175)
关键词
有色网
规划
情景演算
动作序列
状态
colored Petri net
plan
situation calculus
action sequence
state
