A new view on discrete event dynamic systems (DEDS) modelling and control synthesis is presented. The adjacency matrix of an oriented graph is successfully utilized in the DEDS control synthesis procedure. The state r...
详细信息
A new view on discrete event dynamic systems (DEDS) modelling and control synthesis is presented. The adjacency matrix of an oriented graph is successfully utilized in the DEDS control synthesis procedure. The state reachability tree in both the straight-line system dynamics development and the backtracking one are generated. To solve the DEDS control synthesis problem a suitable combination of both these kinds of model dynamics development is utilized, namely, the intersection of both the state reachability trees yields all feasible trajectories of the system dynamics development, i.e., all realizable possibilities of how to reach the prescribed terminal state from the given initial one, are automatically found. To choose the most suitable solution of the control synthesis problem, rule-based knowledge about the control task specifications is utilized.
The topic of the paper is the comparison of the scheduling problem solution in production system. The subject of the comparison are the method based on the heuristic approach and the method developed on the basis of m...
详细信息
The topic of the paper is the comparison of the scheduling problem solution in production system. The subject of the comparison are the method based on the heuristic approach and the method developed on the basis of multi agent system.
The topic of the paper is the scheduling problem of jobs in multi-machine multi-part manufacturing systems. In the paper the approach to the creation of the scheduling algorithm using the multi-agent rules is describe...
详细信息
The topic of the paper is the scheduling problem of jobs in multi-machine multi-part manufacturing systems. In the paper the approach to the creation of the scheduling algorithm using the multi-agent rules is described. In the simulation phase, graphical representation of the scheduling problem by the statecharts model is used to detect the conflict situations.
This paper considers job-shop-scheduling problem in multimachine multipart manufacturing systems. The purpose of the article is to contribute to the decision on scheduling rules for job-shop problems. The paper also d...
详细信息
A new view on manufacturing systems (MS) modelling and control synthesis is presented. MS are understood to be a kind of discrete event dynamic systems (DEDS). Petri nets (PN), frequently used for DEDS modelling, are ...
详细信息
A new view on manufacturing systems (MS) modelling and control synthesis is presented. MS are understood to be a kind of discrete event dynamic systems (DEDS). Petri nets (PN), frequently used for DEDS modelling, are replaced by corresponding oriented graphs (OG). The OG nodes are represented by the PN places and the OG edges involve the PN transitions. The adjacency matrix of such a graph is utilized in the DEDS control synthesis procedure. It makes possible to generate both the straight-lined systenl development (from an initial state to a prescribed terminal one) and the backtracking one (from the terminal state to the initial one). The combination both of kinds of the model development is used to find the sequence of the DEDS control vectors. Rule-based knowledge about the control task specification can be utilized in order to choose unique (the most suitable) solution.
作者：
František CapkovičInstitute of Control Theory and Robotics
Slovak Academy of Sciences 842 37 Bratislava Dúbravská cesta 9 Slovak Republic Phone: ++421-7-5941 2544 Fax: ++421-7-5477 6045 http://www.savba.sk/~utrrcapk/capkhome.htm
A new view on the DEDS control synthesis is presented. Petri nets (PN), frequently used for DEDS modelling, are understood here in a form of a corresponding oriented graphs (OG) where the nodes of the OG are represent...
详细信息
A new view on the DEDS control synthesis is presented. Petri nets (PN), frequently used for DEDS modelling, are understood here in a form of a corresponding oriented graphs (OG) where the nodes of the OG are represented by the PN positions and the OG edges involve the PN transitions. The adjacency matrix of such a graph is utilized in the DEDS control synthesis procedure. It is used for generating the state reachability tree in both the case of the straight-lined system development (from an initial state to a prescribed terminal one) and that of the backtracking one (from the prescribed terminal state to the initial one). A suitable combination of both the straight-lined development of the OG-based model and the backtracking one is used in this paper in order to perform the DEDS control synthesis. The coincidence both of the corresponding trees yields the possible trajectories of the system development. Satisfying sequences of the control discrete events are found by means of the OG adjacency matrix.
Petri nets (PN) and oriented graphs (OG) are used for modelling of discrete event dynamic systems (DEDS). Model-based analysing the behaviour of the system to be controlled with respect to knowledge about the control ...
详细信息
In the context of service robotics very often no model of the environment exists. The actual situation can partially be recognized by sensors as a snapshot, which is then used for planning an action; the optimal traje...
详细信息
In the context of service robotics very often no model of the environment exists. The actual situation can partially be recognized by sensors as a snapshot, which is then used for planning an action; the optimal trajectory, e.g., in manipulation tasks, to reach a desired destination is often very difficult to compute because not all aspects were captured by the sensors. Therefore, systems with rule based behavior can be used to autonomously plan the motion online using mainly tactile sensor information. For repeating the same or a similar task, it would be nice to have motion sequences allowing much faster motions with less collisions. The problem we address in this paper is the transition from rule based behavior towards motion sequences without losing the flexibility of the system, which is necessary to adapt a motion sequence to the actual situation and to deal with unforeseen events during execution.
In this paper we describe an abstract and (as we hope) a uniform frame for Petri net models, which enable to generalise algebra as well as enabling rule used in the dynamics of Petri nets. Our approach of such an abst...
详细信息
In this paper we describe an abstract and (as we hope) a uniform frame for Petri net models, which enable to generalise algebra as well as enabling rule used in the dynamics of Petri nets. Our approach of such an abst...
In this paper we describe an abstract and (as we hope) a uniform frame for Petri net models, which enable to generalise algebra as well as enabling rule used in the dynamics of Petri nets. Our approach of such an abstract frame is based on using partial groupoids in Petri nets. Further, we study properties of Petri nets constructed in this manner through related labelled transition systems. In particular, we investigate the relationships between properties of partial groupoids used in Petri nets and properties of labelled transition systems crucial for the existence of the state equation and linear algebraic techniques. We show that partial groupoids embeddable to Abelian groups play an important role in preserving these properties.
暂无评论