1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century
DOI: 10.1109/icsmc.1995.538192
|View full text |Cite
|
Sign up to set email alerts
|

Learning Petri network with route control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…The learning algorithm of the LPN is summarized in the following [7]: However, the distinctive feature of learn- ing in the LPN is not that all variable parameters of the network will be modified but rather that only the variable parameter related to the route in which the token has propagated is modified.…”
Section: Learning Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The learning algorithm of the LPN is summarized in the following [7]: However, the distinctive feature of learn- ing in the LPN is not that all variable parameters of the network will be modified but rather that only the variable parameter related to the route in which the token has propagated is modified.…”
Section: Learning Algorithmmentioning
confidence: 99%
“…The effectiveness of the LPN has been clarified by applying it to a pattern recognition problem [6,7] and a system identification problem [8]. The effectiveness of the LPN has been clarified by applying it to a pattern recognition problem [6,7] and a system identification problem [8].…”
Section: Introductionmentioning
confidence: 99%
“…However, the distinctive feature of learn- ing in the LPN is not that all variable parameters of the network will be modified but rather that only the variable parameter related to the route in which the token has propagated is modified. The learning algorithm of the LPN is summarized in the following [7]:…”
Section: Learning Algorithmmentioning
confidence: 99%
“…x Crane stand system In Eqs. (7) to (9), letting hT 1 , t x, hT 2 , t x , hT 3 , t T, hT 4 , t T , hT 5 , t l, hT 6 , t l , and discretizing with a sampling time 'T, the equations become those shown below.…”
Section: Controlled Systemmentioning
confidence: 99%
See 1 more Smart Citation