共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
The use of robots in the aircraft structural assembly is a challenge. The presence of human operators, auxiliary systems and industrial robots makes hybrid the dynamic behavior of a robotic cell in this context. Here, the focus is on the automated synthesis of a model for the sequencing of the activities of a robotic cell in the aircraft industry. The cell model is obtained from a simple specification of resources and tasks, considered the main cell components, running the algorithm presented in this paper. The effectiveness of the model is shown using a case study defined by the ongoing European project LOCOMACHS (LOw COst Manufacturing and Assembly of Composite and Hybrid Structures, http://www.locomachs.eu/). 相似文献
3.
4.
5.
信息物理融合系统(Cyber-Physical System,CPS)是一个集计算系统、通信系统、感知系统、控制系统和物理系统于一体的复杂系统,其行为是一种由离散计算过程与连续物理过程深度融合并紧密交互的混成行为。针对这种特性,采用混成Petri网对CPS建模,并在此基础上添加时间约束,即对离散变迁关联一个延迟时间,对连续变迁关联一个激发速率函数,同时引入抑止弧和测试弧的概念以提高Petri网的表达能力,由此提出一种新的模型——扩展混成Petri网模型。然后,对CPS应用中无人驾驶车辆系统的躲避障碍物场景进行建模,将建立的模型按照一定的规则转化为与之对应的Simulink模型,并通过Matlab仿真对系统行为及属性进行分析。 相似文献
6.
7.
Based on the Petri net models of flexible manufacturing systems (FMSs), this paper focuses on deadlock-free scheduling problem with the objective of minimizing the makespan. Two hybrid heuristic search algorithms for solving such scheduling problems of FMSs are proposed. To avoid deadlocks, the deadlock control policy is embedded into heuristic search strategies. The proposed algorithms combine the heuristic best-first strategy with the controlled backtracking strategy based on the execution of the Petri nets. The scheduling problem is transformed into a heuristic search problem in the reachability graph of the Petri net, and a schedule is a transition sequence from the initial marking to the final marking in the reachability graph. By using the one-step look-ahead method in the deadlock control policy, the safety of a state in the reachability graph is checked, and hence, deadlock is avoided. Experimental results are provided and indicate the effectiveness of the proposed hybrid heuristic search algorithms in solving deadlock-free scheduling problems of FMSs. Especially, the comparison against previous work shows that both new algorithms are promising in terms of solution quality and computing times. 相似文献
8.
9.
Multi-agent systems for manufacturing systems appear to provide adequate response to abrupt disturbances on the shop floor. To date, most of the work has been focused on planning and scheduling but very little work has been done on issues pertaining to monitoring, diagnostics and error recovery. Our approach addresses the issue of combining the discipline of hierarchical systems with the agility of multi-agent systems. Within the context of a hierarchy, the focus is on the workstation level and, in particular, the construction of a re-configurable system having production agents, error recovery agents, and a mediator agent structure connecting production and recovery agent hierarchies. In addition, the relationship to a multi-level, multi-layer hierarchy control is established. This latter hierarchy, based on Petri Net constructs, serves, in one sense, as a retrieval based resource for process planning and generation of recovery plans for production and recovery agents within the proposed multi-agent system. An objective of this effort is to provide a test-bed for comparison of hierarchical systems, heterarchical, and a hybrid combination which is the focus of the investigation presented here. 相似文献
10.
A procedure is presented for the determination of a linear control law (for a system with one input) such that the resultant closed–loop System has specified eigenvalues. The design procedure is simpler than existing techniques. 相似文献
11.
工作流技术是计算机应用领域的一个新的研究热点。将Petri网引入工作流模型是一种常见的建模方法。但是,传统的PN不能直接用于描述比较复杂的工作流模型。本文根据C.A.Ellis定义的信息控制网、W.M.P.vanderAalst定义的工作流网,结合工作流本身的特点,对Petri网进行扩展,提出了一种描述工作流模型的新方法--信息控制Pettri网,并给出其表示工作流模型的正确性定义和验证。 相似文献
12.
Deadlock avoidance problems are investigated for automated manufacturing systems with flexible routings.Based on the Petri net models of the systems, this paper proposes, for the first time, the concept of perfect maximal resourcetransitioncircuits and their saturated states. The concept facilities the development of system liveness characterization anddeadlock avoidance Petri net supervisors. Deadlock is characterized as some perfect maximal resource-transition circuitsreach their saturated states. For a large class of manufacturing systems, which do not contain center resources, the optimaldeadlock avoidance Petri net supervisors are presented. For an general manufacturing system, a method is proposed forreducing the system Petri net model so that the reduced model does not contain center resources and, hence, has optimaldeadlock avoidance Petri net supervisor. The controlled reduced Petri net model can then be used as the liveness supervisorof the system. 相似文献
13.
Deadlock avoidance problems are investigated for automated manufacturing systems with flexible routings. Based on the Petri net models of the systems, this paper proposes, for the first time, the concept of perfect maximal resource-transition circuits and their saturated states. The concept facilitates the development of system liveness characterization and deadlock avoidance Petri net supervisors. Deadlock is characterized as some perfect maximal resource-transition circuits reaching their saturated states. For a large class of manufacturing systems, which do not contain center resources, the optimal deadlock avoidance Petri net supervisors are presented. For a general manufacturing system, a method is proposed for reducing the system Petri net model so that the reduced model does not contain center resources and, hence, has optimal deadlock avoidance Petri net supervisor. The controlled reduced Petri net model can then be used as the liveness supervisor of the system. 相似文献
14.
基于Petri网的工作流层次模型及结构分析 总被引:7,自引:0,他引:7
在对工作流网络理论研究的前提下,结合企业业务流程建模的应用特点,提出了几种将工作流网络分层的思想,并着重介绍了将继承特性用于Petri网建模的方法。 相似文献
15.
一种Petri网层次模型建模工具的设计与实现 总被引:1,自引:0,他引:1
为解决使用Petri网建模遇到的状态空间爆炸问题,提出使用层次模型,采用分层细化逐步求精的方法建立Petri网分层模型.设计并实现基于图形用户界面的普通边界为1的Petri网分层建模工具软件.用户在交互方式下建立Petri网层次模型,并可修改、删除、存储、分层平面化、简单功能模拟、导入和导出可复用Petri子网和将模型翻译为预定义的模型描述语言源程序. 相似文献
16.
The effects of small parameter variations on the performance index of optimal control systems with initial and final target manifolds, free end time, and bang-bang control are analysed in this paper. A new approach to the sensitivity equation is presented. This approach takes into account the pulse-shaped variation produced by the parameter change on the bang-bang control. An expression, that relates the variations of the performance index, the trajoctory, the final time, and the parameter, is derived. This expression extends to the class of optimal systems with bang-bang control, a result previously obtained by Courtin and Rootenberg (1971). 相似文献
17.
In this paper, we deal with the problem of allocating a given number of tokens in a cyclic timed event graph (CTEG) so as to maximize the firing rate of the net. We propose three different approaches. The first one is a “greedy” incremental procedure that is computationally very efficient. The only drawback is that the convergence to the optimum is guaranteed only when the set of places where tokens can be allocated satisfies given constraints. The other two procedures involve the solution of a mixed integer linear programming problem. The first one needs the knowledge of the elementary circuits, thus it is convenient only for those classes of CTEG whose number of elementary circuits is roughly equal to the number of places, such as some kanban-systems. On the contrary, the second one enables one to overcome this difficulty, thus providing an efficient tool for the solution of allocation problems in complex manufacturing systems like job-shop systems. 相似文献
18.
19.
20.
The incidence matrices—from places to transitions and vice versa—of an acyclic Petri net can obtain a block-triangular structure by reordering their rows and columns. This allows the efficient solution of some reachability problems for acyclic Petri nets. This result is further used in supervisory control of Petri nets; supervisors for Petri nets with uncontrollable transitions are constructed by extending the method of Yamalidou et al. (1996) to Petri nets where transitions can be executed simultaneously. A large class of Petri nets with uncontrollable transitions is given for which the maximally permissive supervisor can be realized by a Petri net. The original specification is algorithmically transformed—by using the results for acyclic Petri nets—into a new specification to take the presence of uncontrollable transitions into account. The supervisor is obtained by simple matrix multiplications and no linear integer programs need to be solved. Furthermore, a class of Petri nets is given for which the supervisor can be realized by extending the enabling rule with OR-logic. 相似文献