Now showing 1 - 2 of 2
  • Publication
    Learning Petri net models from sensor data of conveying systems based on the merging of prefix and postfix trees
    Petri nets are a common modeling approach for parallel processes such as transport operations in conveying systems. In industrial applications, the Petri net models are usually created manually, which involves a lot of effort, especially if the modeled systems change frequently. This paper introduces a new learning method to automatically generate Petri nets from sensor data acquired in conveying systems. The underlying approach is to create prefix and postfix trees of possible event sequences and to merge them into a compact graph, which can be transformed into a deterministic Petri net model of the conveying system. Experimental results show that the proposed method produces realistic Petri net models even for conveying systems with ambiguous events.
  • Publication
    Model-based routing in flexible manufacturing systems
    ( 2019) ; ;
    Niggemann, Oliver
    In this paper, a model-based routing approach for flexible manufacturing systems (FMS) with alternative routes for the work pieces is proposed. For each work piece, an individual task has to be accomplished, which consists of several processing steps. Each processing step can be executed on alternative working stations of the FMS. The proposed routing method employs a model of the conveying system to find energy efficient and fast routes for the respective work pieces. The conveying system model is based on a directed graph, where the individual conveyors are modeled as weighted edges. It can be straightforwardly applied to several types of FMS by adjusting the application-dependent parameters. Efficient computation of the fastest route through the conveying system is accomplished by means of dynamic programming, i. e., by integration of Dijkstra's algorithm in a dynamic programming framework, which is based on the proposed conveying system model. Additional consideration of energy efficiency aspects leads to a Mixed Integer Quadratically Constraint Program (MIQCP), which is solved by substitution of Dijkstra's algorithm by a branch and bound method. Experimental results for an application scenario, where the energy efficient routing method is applied to route work pieces between the working stations of an FMS, lead to 20 % reduction of energy consumption on average.