时间的模糊区间段表示及其运算

介绍了Allen的区间代数及其扩展--INDU网络,将Heisenberg不确定性原理应用于INDU网络,将INDU的25种基本关系中两区间有端点相等的或区间段相等的这15种关系删除,这15种关系在现实世界中是不可能出现的,就产生了有10种基本关系的FINDU网络,给出了FINDU网络的复合运算表.FINDU网络在军事多自主体系统中可以得到很好的应用.     

一种基于TCBR与RBR融合推理的试飞支持信息系统

深入研究了基于文本案例的推理(TCBR)、基于规则的推理(RBR)及两者融合的人工智能技术,并首创性地运用于先进战机的试飞支持信息系统,由此构建了先进战机智能化试飞支持信息系统的整体框架。建立了其案例库、规则库和知识库的结构。采用Tomcat7、IK Analyzer、GWT、MySQL等运用软件进行开发。实现了理解问答、智能搜索和案例推理等功能,对于试飞工程师还增加了数据库维护及试飞文档编写助手等功能。运行结果表明:系统整体构架设计合理实用;特别是TCBR和RBR的融合运用使系统体现了接近人类思维特点的智能化特征。     

基于不完备模糊规则库的信息融合故障诊断方法

在基于模糊推理的故障诊断专家系统中,规则库的不完备常常会引起系统的某些输入产生的输出不确定。针对此问题,将模糊推理与证据理论相结合提出了一种新的融合诊断方法。首先根据证据的随机集表示及随机集扩展准则将模糊输入映射到输出,并聚合生成故障命题的基本概率赋值(BPA),以度量由规则库不完备和输入模糊性引起的输出不确定。然后利用Dempster组合规则将多个不完备规则库提供的BPA融合,用融合结果判决故障,并以电机转子故障诊断为例,验证了所提方法可以有效地提高故障确诊率。     

Approximate qualitative spatial reasoning

Qualitative relations between spatial regions play an importantrole in the representation and manipulation of spatial knowledge.The RCC5 and RCC8 systems of relations,used in the Region-Connection Calculus, are of fundamentalimportance. These two systems deal with ideal regions havingprecisely determined location. However,in many practical examples of spatial reasoning,regions are represented by finite approximations rather than known precisely.Approximations may be given by describing how a regionrelates to cells forming a partition of the space underconsideration. Although the RCC5 and RCC8 systems have beengeneralized to ``egg-yolk' regions, in order to modelcertain types of vagueness, their extension to regionsapproximated in this way has not been discussed before.This paper presents two methods, the syntactic and the semantic, by which the RCC5 and RCC8 systemsmay be defined for approximate regions. The syntactic uses algebraicoperations on approximate regions which generalize operations on preciseregions. The semantic method makes use of the set of preciseregions which could be the intended interpretation of anapproximate region. Relationships between these two methods arediscussed in detail.alternative to navigation training with a map.     

大规模定制设计的产品簇匹配研究

采用基于规则与基于实例相结合的推理方法，给出典型的基于实例推理的专家系统解决问题的一般过程，本文重点研究大规模定制设计的产品簇匹配问题，实施二级匹配策略，先采用规则推理的方法对产品簇大类属性进行匹配，缩小匹配范围，后采用基于实例推理的方法对产品簇小类具体属性进行定量精确匹配，优化了设计手段，效果良好。     

Zadeh模糊推理算法的直觉化扩展

对Zadeh模糊推理算法进行了直觉化扩展.将Zadeh定义的模糊关系Rm进行直觉化扩展,推出了其对应的直觉模糊取式推理算法和直觉模糊拒式推理算法.以具体算例叙述了推理计算过程中的细节,验证了方法的正确性和有效性,并依据直觉准则,对其性能进行了评价.     

采用等高线地图的CGF地域表示和推理

采用等高线地图作为分布交互仿真环境中计算机生成兵力的地域表示．介绍等高线电子地图下计算机生成兵力系统地域表示和推理的一种方法．通过对地域显示、通视性检测和地形检测等几个基本问题的分析，表明采用该方法是可行的．具有地域表示范围大、地域推理简单明了的特点，并且地域数据真实、修改方便．这种方法比多边形地域表示法更适用于海上和空中大范围训练作战环境的仿真．     

Tractable Fragments of Fuzzy Qualitative Algebra

Abstract

In this paper we study the computational complexity of Fuzzy Qualitative Temporal Algebra (QA ^fuz ), a framework that combines qualitative temporal constraints between points and intervals, and allows modelling vagueness and uncertainty. Its tractable fragments can be identified by generalizing the results obtained for crisp Constraint Satisfaction Problems (CSPs) to fuzzy CSPs (FCSPs); to do this, we apply a general methodology based on the notion of α-cut. In particular, the results concerning the tractability of Qualitative Algebra QA, obtained in a recent study by different authors, can be extended to identify the tractable algebras of the fuzzy Qualitative Algebra QA ^fuz in such a way that the obtained set is maximal, namely any maximal tractable fuzzy algebra belongs to this set.     

Localization,Exploration, and Navigation Based on Qualitative Angle Information

Abstract

Three of the major problems in building autonomous mobile robots are localization, exploration, and navigation. This paper investigates how well different qualitative methods based on angle information, most of them originally invented for representation of spatial knowledge, are suited for addressing these problems. It combines results from discrete and computational geometry with methods from qualitative spatial reasoning, gaining some new insights on the complexity of robot navigation. It turns out that essentially only with panoramas (special roundviews) the qualitative localization problem can be solved in a satisfactory manner. The exploration problem (qualitative map building), remains difficult for all considered approaches.