ログイン
言語:

WEKO3

  • トップ
  • ランキング
To

Field does not validate

To


インデックスリンク

インデックスツリー

  • RootNode

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 紀要
  2. 甲南大学紀要.理工学編
  3. Vol. 51 (2004)
  4. No. 2

Optimal Control for Resource Allocation in Discrete Event Systems

https://doi.org/10.14990/00000076
https://doi.org/10.14990/00000076
08bf2455-e279-449d-99d4-89927f6dacba
名前 / ファイル ライセンス アクション
K00039.pdf K00039 (995.3 kB)
Item type 紀要論文 / Departmental Bulletin Paper(1)
公開日 2015-03-24
タイトル
タイトル Optimal Control for Resource Allocation in Discrete Event Systems
タイトル
タイトル Optimal Control for Resource Allocation in Discrete Event Systems
言語 en
言語
言語 eng
キーワード
主題 Optimal control
キーワード
主題 discrete event systems
キーワード
主題 resource allocation system
キーワード
主題 Optimal control
キーワード
主題 discrete event systems
キーワード
主題 resource allocation system
資源タイプ
資源タイプ departmental bulletin paper
ID登録
ID登録 10.14990/00000076
ID登録タイプ JaLC
著者 Hu, Qiying

× Hu, Qiying

WEKO 322

Hu, Qiying

Search repository
岳, 五一

× 岳, 五一

WEKO 82
e-Rad 50234175

ja 岳, 五一
ISNI

ja-Kana ガク, ゴイチ

en Yue, Wuyi

Search repository
Hu, Qiying

× Hu, Qiying

WEKO 324

en Hu, Qiying

Search repository
抄録
内容記述タイプ Abstract
内容記述 Supervisory control for discrete event systems (DESs) belongs essentially to the logic level for control problems in DESs. Its corresponding control task is hard. In this paper, we study a new optimal control problem in DESs. The performance measure is to maximize the maximal discounted total reward among all possible strings (i. e., paths) of the controlled system. The condition we need for this is only that the performance measure is well defined. We then divide the problem into three sub-cases where the optimal values are respectively finite, positive infinite and negative infinite. We then show the optimality equation in the case with a finite optimal value. Also, we characterize the optimality equation together with its solutions and characterize the structure of the set of all optimal policies. When the reward function is stationary, we show that the optimality equation and its solution are also stationary. All the above results are still true when the performance measure is to maximize the minimal discounted total reward among all possible strings of the controlled system. Finally, we apply these equations and solutions to a resource allocation system. The system may be deadlocked and in order to avoid the deadlock we can either prohibit the occurrence of some events or resolve the deadlock. It is shown that from the view of the maximal discounted total cost, it is better to resolve the deadlock if and only if the cost for resolving the deadlock is less than the threshold value.
書誌情報 甲南大学紀要. 理工学編
en : Memoirs of Konan University. Science and engineering series

巻 51, 号 2, p. 121-139, 発行日 2004-12-25
出版者
出版者 甲南大学
ISSN
収録物識別子タイプ ISSN
収録物識別子 13480383
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA11561231
論文ID(NAID)
内容記述タイプ Other
内容記述 110004688292
フォーマット
内容記述タイプ Other
内容記述 application/pdf
著者版フラグ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
戻る
0
views
See details
Views

Versions

Ver.1 2023-05-15 15:29:52.652897
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

Hu, Qiying, 岳, 五一, Hu, Qiying, 2004, Optimal Control for Resource Allocation in Discrete Event Systems: 甲南大学, 121–139 p.

Loading...

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR 2.0
  • OAI-PMH JPCOAR 1.0
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3