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

Autor:	Seiichi Shin, Kenji Sawada, Kenji Kumagai, Ryosuke Nakamura, Hisato Yoneda
Rok vydání:	2015
Předmět:	Deterministic finite automaton Artificial Intelligence Deterministic automaton Stochastic Petri net Pushdown automaton Binary number Two-way deterministic finite automaton Petri net Algorithm General Biochemistry Genetics and Molecular Biology Mathematics Automaton
Zdroj:	Artificial Life and Robotics. 20:262-269
ISSN:	1614-7456 1433-5298
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::de5ad7e554a853b3f22ad00c2cdae099 https://doi.org/10.1007/s10015-015-0215-z Zobrazit plný text záznamu Full text from SpringerLink