Model reformulation for conflict-free routing problems using Petri Net and Deterministic Finite Automaton

被引：5
|
作者：
Nakamura R. [1 ]
Sawada K. [1 ]
Shin S. [1 ]
Kumagai K. [1 ,2 ]
Yoneda H. [2 ]
机构：
[1] The University of Electro-Communications, Tokyo
[2] Murata Machinery, Ltd, Tokyo
来源：
Artificial Life and Robotics | 2015年 / 20卷 / 03期
基金：
日本学术振兴会;
关键词：
Deterministic Finite Automaton; Discrete event system; Petri Net; Routing;
D O I：
10.1007/s10015-015-0215-z
中图分类号：
学科分类号：
摘要：
It is well known that routing problems are recast as a binary integer linear programming in overhead hoist transport (OHT) vehicle systems. Two kinds of discrete-time state space models of the routing problem are proposed in this paper that simplifies the constraints and binary variables. First, a Petri Net (PN) method is used to simplify the constraints. Second, a Deterministic Finite (DF) Automaton method is used for reducing the binary inputs of the state space equation in OHT systems. Finally, some numerical examples are shown to verify the validity of the proposed methods. © 2015, ISAROB.
引用
收藏
页码：262 / 269
页数：7
相关论文
共 28 条
  • [1] Petri Net Decomposition Approach for Bi-objective Conflict-free Routing for AGV Systems
    Eda, Shuhei
    Nishi, Tatsushi
    Mariyama, Toshisada
    Kataoka, Satomi
    Shoda, Kazuya
    Matsumura, Katsuhiko
    2011 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2011, : 820 - 825
  • [2] Petri Net Decomposition Approach for Dispatching and Conflict-Free Routing of Bidirectional Automated Guided Vehicle Systems
    Nishi, Tatsushi
    Tanaka, Yuki
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2012, 42 (05): : 1230 - 1243
  • [3] Dynamic Optimization of Simultaneous Dispatching and Conflict-free Routing for Automated Guided Vehicles - Petri Net Decomposition Approach
    Tanaka, Yuki
    Nishi, Tatsushi
    Inuiguchi, Masahiro
    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2010, 4 (03): : 701 - 715
  • [4] Regular event structures and finite Petri nets: The conflict-free case
    Nielsen, M
    Thiagarajan, PS
    APPLICATIONS AND THEORY OF PETRI NETS 2002, 2002, 2360 : 335 - 351
  • [5] Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding
    Trinh, Van-Giang
    Benhamou, Belaid
    Soliman, Sylvain
    THEORETICAL COMPUTER SCIENCE, 2023, 971
  • [6] A design method of the conflict-free Petri net models for the manufacturing systems control
    Hrúz, B
    NEW TRENDS IN DESIGN OF CONTROL SYSTEMS 1997, 1998, : 303 - 308
  • [7] How to construct maximal conflict-free processes from Petri net simulations
    Freytag, T
    1998 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5, 1998, : 49 - 54
  • [8] PROBLEMS CONCERNING FAIRNESS AND TEMPORAL LOGIC FOR CONFLICT-FREE PETRI NETS
    HOWELL, RR
    ROSIER, LE
    THEORETICAL COMPUTER SCIENCE, 1989, 64 (03) : 305 - 329
  • [9] PERFORMANCE EVALUATION OF CONCURRENT SYSTEMS USING CONFLICT-FREE AND PERSISTENT PETRI NETS
    MAGOTT, J
    INFORMATION PROCESSING LETTERS, 1987, 26 (02) : 77 - 80
  • [10] Dispatching and Conflict-free Routing based on Model Predictive Control in Semiconductor Fab
    Nakamura, Ryosuke
    Sawada, Kenji
    Shin, Seiichi
    Kumagai, Kenji
    Yoneda, Hisato
    2014 CACS INTERNATIONAL AUTOMATIC CONTROL CONFERENCE (CACS 2014), 2014, : 254 - 259
123