首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 109 毫秒
1.
并发约束程序设计在人工智能程序设计领域中占据越来越重要的位置,约束处理规则作为新一代的并发程序设计正倍受关注.对约束处理规则和流演算理论及其实现语言FLUX进行了研究,结合流演算和JCHR推理模型优点,设计了一种基于Java的流演算解释器JFLUX,同时提出了一个基于目标驱动的,在不完全可知的虚拟环境中通过感知到的有限信息进行自主行动推理能力的智能体模型,实现了办公室场景中智能体行动推理系统.  相似文献   

2.
基于流演算和FLUX的办公室机器人控制   总被引:1,自引:1,他引:0  
流演算是在经典情景演算的基础上发展起来的一种动作形式化描述理论,为人工智能领域的动作推理提供了强大的表示工具,在此基础上发展起来的逻辑程序设计语言FLUX,利用约束逻辑程序设计方法,具体地实现了动作推理.主要介绍流演算以及FLUX的基本知识,在此基础上对办公室机器人控制的实例进行了研究,并且利用FLUX语言实现了该实例,实验结果表明,流演算及其实现语言可以用来对机器人进行有效控制,具有良好的计算性能.  相似文献   

3.
基于流演算的智能虚拟人模型研究与实现*   总被引:2,自引:2,他引:0  
在研究流演算理论及其实现语言FLUX的基础上,将流演算与虚拟现实技术中的虚拟人相结合,提出了一个基于目标驱动的、有自主行动能力的虚拟人模型。设计了动作检测模块,同时使用了动作队列,根据动作检测的结果来决定是否执行下一个动作,使虚拟人可以针对动态变化的虚拟环境进行有效的行动规划。利用此模型可以快速构建出一个在不完全可知的虚拟环境中通过感知到的有限信息进行实时的、自主行动推理的智能虚拟人。最后,实现了办公室场景中智能虚拟人行动推理系统。  相似文献   

4.
一种基于流演算的动态规划程序设计语言*   总被引:1,自引:1,他引:0  
提出了一种基于流演算的动态规划程序设计语言DPPLFC(dynamic planning programming language based on fluent calculus)。通过定义动作表达式来描述顺序、并发、非确定选择等复杂动作,解决了FLUX不方便用户编程的问题。DPPLFC的动态规划算子是当在线执行的状态与前一次离线执行相对应的状态不同时才进行再次离线执行,改进了基于情景演算的动态规划算子。采用了一种新颖的离/在线执行方式,能够及时处理外部动作;并给出了DPPLFC语言的组成,程序语义及其  相似文献   

5.
自治服务是网络信息服务的新的需求,它使人机交互变得更加智能.为此提出了基于情景演算的自治型网络信息服务的建模方法.在标准的情景演算基础上,增加了对有效性约束常识的描述,建立了情景演算的分层知识库表示,将抽象的数学描述转化为较直观的描述模型;还设计了一种基于XML的情景演算建模语言ScML,以结构化文本脚本的形式描述了实际的应用需求并利用XML Schema实现了ScML的语法约束,利用XMLXSL卖现了从ScML脚本到Java代码的生成;最后给出日程管理服务的例子.  相似文献   

6.
为提高通用游戏系统的自动推理能力,提出了基于状态演算的通用游戏系统的自动推理方法,并将其作为推理模块构建了通用游戏系统模型.利用状态演算逻辑程序设计语言(state calculus executor,STEX)实现通用游戏的状态更新与动作推理,给出了基于状态演算的通用游戏系统模型的功能模块设计,最后利用prolog语言实现了各功能模块,调试系统并进行实例验证.实验结果表明,采用了基于状态演算的自动推理方法,得到较好的游戏成绩,提高了游戏系统的自动推理能力.  相似文献   

7.
以情景演算理论为基础来研究工作流管理系统,形式化地将LR的状态对象扩展为状态表集合对象。给出了情景演算的归结算法和算法分析,说明了如何将情景演算应用到工作流引擎中,给出了实际应用系统,并分析了基于情景演算的工作流引擎的优点。  相似文献   

8.
将规划系统Conformant Fast-Forward从单目标规划扩展到基于析取目标的不确定规划,设计并实现了新的规划系统Conformant-FF-d.Conformant-FF-d的新功能主要包括:目标状态判断、可达性分析和启发函数.提出一种利用SAT技术进行目标状态判断的高效方法;提出析取目标条件下信念状态的可达性分析方法,有效地删除无法到达目标的信念状态,进而缩小了搜索空间的规模;设计了适用于析取目标的启发函数,有效地指导搜索算法向更有希望到达目标的方向进行.在国际规划竞赛的问题域上对Conformant-FF-d和先进的规划系统POND进行测试和对比分析,实验结果表明:ConformantFF-d的求解效率高而且具有较好的可扩展性.  相似文献   

9.
近年来,基于语义的Web服务组合,尤其是Web服务的自动组合方法已成为服务计算领域的一个研究热点.实现了从一个OWL-S过程模型到流演算概念的映射,并给出了相应的转换算法.在此基础上,提出了一个新颖的、基于流演算形式化体系的Web服务自动组合方法.该方法采用前推推理机制对状态和动作进行推理,有效地克服了以传统的情景演算为代表的人工智能规划算法执行效率较低的问题.设计实现了一个实验性的原型系统,结合一个旅游行程规划的实例说明了本文提出的方法的有效性.对提出的BCABFC(Backward-Chaining Algorithm Based On Fluent Calculus)算法与基于情景演算的同类算法进行性能比较,实验结果表明该算法具有较好的性能.  相似文献   

10.
本文将S.Lee.Hight的不完全指定的二值布氏函数的复杂析取分解的理论推广到不完全指定的三值逻辑函数的领域中。根据对三值逻辑函数输入变量集合的不同划分,可以求出三值逻辑函数列(行)向量的相容关系。对DON’TCARE(d)条件进行第一次指派,并要求第二次确定三值逻辑函数约束向量的相容关系和指派d条件,从而给出了对不完全指定的三值逻辑函数寻求简单析取分解,进而构成复杂析取分解的方法。  相似文献   

11.
The method is proposed to design the maximally permissive and efficient supervisor for enforcing linear constraints, in which the weights of places are not negative, on ordinary Petri nets with uncontrollable transitions. First, the weakly admissible linear constraint is introduced. Second, a method is proposed to design the monitor place for enforcing a weakly admissible linear constraint on Petri nets. Third, a theorem proving that a linear constraint can be equivalently transformed at an uncontrollable transition into a disjunction of new constraints is proposed. Fourth, using this theorem, an algorithm is presented to equivalently transform a linear constraint, each place weight of which is not negative, into a disjunction of weakly admissible ones. Lastly, the supervisor, which consists of the plant net and a set of monitor places, is designed for the weakly admissible linear constraints calculated by the above algorithm.  相似文献   

12.
Constraints provide a flexible and uniform way to represent diverse data capturing spatio-temporal behavior, complex modeling requirements, partial and incomplete information etc, and have been used in a wide variety of application domains. Constraint databases have recently emerged to deeply integrate data captured by constraints in databases. This paper reports on the development of the first constraint object-oriented database system, CCUBE, and describes its specification, design and implementation. The CCUBE system is designed to be used for the implementation and optimization of high-level constraint object-oriented query languages as well as for directly building software systems requiring extensible use of constraint database features. The CCUBE data manipulation language, Constraint Comprehension Calculus, is an integration of a constraint calculus for extensible constraint domains within monoid comprehensions, which serve as an optimization-level language for object-oriented queries. The data model for the constraint calculus is based on constraint spatio-temporal (CST) objects that may hold spatial, temporal or constraint data, conceptually represented by constraints. New CST objects are constructed, manipulated and queried by means of the constraint calculus. The model for the monoid comprehensions, in turn, is based on the notion of monoids, which is a generalization of collection and aggregation types. The focal point of our work is achieving the right balance between the expressiveness, complexity and representation usefulness, without which the practical use of the system would not be possible. To that end, CCUBE constraint calculus guarantees polynomial time data complexity, and, furthermore, is tightly integrated with the monoid comprehensions to allow deeply interleaved global optimization.  相似文献   

13.
On compliance checking for clausal constraints in annotated process models   总被引:1,自引:0,他引:1  
Compliance management is important in several industry sectors where there is a high incidence of regulatory control. It must be ensured that business practices, as reflected in business processes, comply with the rules. Such compliance checks are challenging due to (1) the different life cycles of rules and processes, and (2) their disparate representations. (1) requires retrospective checking of process models. To address (2), we herein devise a framework where processes are annotated to capture the semantics of task execution, and compliance is checked against a set of constraints posing restrictions on the desirable process states. Each constraint is a clause, i.e., a disjunction of literals. If a process can reach a state that falsifies all literals of one of the constraints, then that constraint is violated in that state, and indicates non-compliance. Naively, such compliance can be checked by enumerating all reachable states. Since long waiting times are undesirable, it is important to develop efficient (low-order polynomial time) algorithms that (a) perform exact compliance checking for restricted cases, or (b) perform approximate compliance checking for more general cases. Herein, we observe that methods of both kinds can be defined as a natural extension of our earlier work on semantic business process validation. We devise one method of type (a), and we devise two methods of type (b); both are based on similar restrictions to the processes, where the restrictions made by methods (b) are a subset of those made by method (a). The approximate methods each guarantee either of soundness (finding only non-compliances) or completeness (finding all non-compliances). We describe how one can trace the state evolution back to the process activities which caused the (potential) non-compliance, and hence provide the user with an error diagnosis.  相似文献   

14.
对于含有不可控变迁的Petri网监控问题,允许状态空间可能需要一组“或”的允许约束来描述,而库所不变量的监控方法[12]只将给定约束转换为单个的允许约束,其监控器将系统行为限制在允许标识状态空间的较小子集内,其限制性过于严格,且该方法无法解决某些监控问题.针对上述问题,给出了一种基于关联矩阵代数运算的约束转换方法,能够...  相似文献   

15.
This article addresses the problem of control design for strict-feedback systems with constraints on the states. To prevent the states from violating the constraints, we employ a barrier Lyapunov function (BLF), which grows to infinity whenever its arguments approaches some finite limits. Based on BLF-based backstepping, we show that asymptotic output tracking is achieved without violation of any constraint, provided that the initial states and control parameters are feasible. We also establish sufficient conditions to ensure feasibility, which can be checked offline without precise knowledge of the initial states. The feasibility conditions are relaxed when handling the partial state constraint problem as compared to the full state constraint problem. In the presence of parametric uncertainties, BLF-based adaptive backstepping is useful in preventing the states from transgressing the constrained region during the transient stages of online parameter adaptation. To relax the feasibility conditions, asymmetric error bounds are considered and asymmetric barrier functions are used for control design. The performance of the BLF-based control is illustrated with two simulated examples.  相似文献   

16.
针对未知但有界噪声离散时间状态空间系统,提出一种基于多胞体双重滤波的系统状态估计方法.首先,采用有界误差方法对测量噪声和状态预测过程进行分析,利用正多胞体预测状态集包裹后离散成初始约束条件;然后,根据更新最小边,全对称多胞体经过正多胞体紧致包裹后离散成约束条件,与测量方程约束条件组成3重约束;最后,通过求解线性规划问题得到全部状态的上下界,并获得包裹状态可行集的最紧致正多胞体.仿真示例验证了该方法估计离散状态空间系统状态的有效性和准确性.  相似文献   

17.
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language. We explore the solver architecture needed to propagate such combinations of constraints efficiently. In particular we describe two new features named satisfying sets and constraint trees. We also make use of movable triggers (Gent et al., 2006) [1], and with these three complementary features we are able to make considerable efficiency gains.A key reason for the success of Boolean Satisfiability (SAT) solvers is their ability to propagate Or constraints efficiently, making use of movable triggers. We successfully generalise this approach to an Or of an arbitrary set of constraints, maintaining the crucial property that at most two constraints are active at any time, and no computation at all is done on the others. We also give an And propagator within our framework, which may be embedded within the Or. Using this approach, we demonstrate speedups of over 10,000 times in some cases, compared to traditional constraint programming approaches. We also prove that the Or algorithm enforces generalised arc consistency (GAC) when all its child constraints have a GAC propagator, and no variables are shared between children. By extending the Or propagator, we present a propagator for AtLeastK, which expresses that at least k of its child constraints are satisfied in any solution.Some logical expressions (e.g. exclusive-or) cannot be compactly expressed using And, Or and AtLeastK. Therefore we investigate reification of constraints. We present a fast generic algorithm for reification using satisfying sets and movable triggers.  相似文献   

18.
This paper introduces active integrity constraints (AICs), an extension of integrity constraints for consistent database maintenance. An active integrity constraint is a special constraint whose body contains a conjunction of literals which must be false and whose head contains a disjunction of update actions representing actions (insertions and deletions of tuples) to be performed if the constraint is not satisfied (that is its body is true). The AICs work in a domino-like manner as the satisfaction of one AIC may trigger the violation and therefore the activation of another one. The paper also introduces founded repairs, which are minimal sets of update actions that make the database consistent, and are specified and “supported” by active integrity constraints. The paper presents: 1) a formal declarative semantics allowing the computation of founded repairs and 2) a characterization of this semantics obtained by rewriting active integrity constraints into disjunctive logic rules, so that founded repairs can be derived from the answer sets of the derived logic program. Finally, the paper studies the computational complexity of computing founded repairs.  相似文献   

19.
A new fuzzy adaptive control method is proposed for a class of strict feedback nonlinear systems with immeasurable states and full constraints. The fuzzy logic system is used to design the approximator, which deals with uncertain and continuous functions in the process of backstepping design. The use of an integral barrier Lyapunov function not only ensures that all states are within the bounds of the constraint, but also mixes the states and errors to directly constrain the state, reducing the conservativeness of the constraint satisfaction condition. Considering that the states in most nonlinear systems are immeasurable, a fuzzy adaptive states observer is constructed to estimate the unknown states. Combined with adaptive backstepping technique, an adaptive fuzzy output feedback control method is proposed. The proposed control method ensures that all signals in the closed-loop system are bounded, and that the tracking error converges to a bounded tight set without violating the full state constraint. The simulation results prove the effectiveness of the proposed control scheme.   相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号