{"created":"2023-08-02T03:54:27.623926+00:00","id":3271,"links":{},"metadata":{"_buckets":{"deposit":"8ba6b10c-8839-4a00-bb02-b1b8f9366647"},"_deposit":{"created_by":10,"id":"3271","owners":[10],"pid":{"revision_id":0,"type":"depid","value":"3271"},"status":"published"},"_oai":{"id":"oai:repository.lib.tottori-u.ac.jp:00003271","sets":["1:10","2:14","23:39:683"]},"author_link":["34486","1408","34487"],"item_3_alternative_title_31":{"attribute_name":"タイトル（ヨミ）","attribute_value_mlt":[{"subitem_alternative_title":"イデン　アルゴリズム　ニヨル　セイヤク　ツキ　マルコフ　ケッテイ　カテイ　ノ　カイホウ","subitem_alternative_title_language":"ja-Kana"}]},"item_3_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1995-11","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"302","bibliographicPageStart":"295","bibliographicVolumeNumber":"26","bibliographic_titles":[{"bibliographic_title":"鳥取大学工学部研究報告","bibliographic_titleLang":"ja"},{"bibliographic_title":"Reports of the Faculty of Engineering, Tottori University","bibliographic_titleLang":"en"}]}]},"item_3_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"We consider discrete time Markov decision process (MDP) with finite state space, finite action space and two kinds of immediate reward The problem is to maximize time average reward generated by on reward stream, subject to that the other reward is not smaller than a prescribed value. The probelm is analyzed in the range of pure stationary policies MDP with one optimality criterion and no constraint can be solved by usual policy improvement method. MDP with one reward constraint can be solved by linear programming, in the range of mixed policies.  On the other hand, however, when we restrict the policies to pure polices the problem is some conbinatrial problem, for which any solving method has not been discovered. In this paper, we propose an approach applying Genetic Algorithm in order to carry on a search process effectively and to obtain a near optimal pure stationary policy. A numerical example is given to examine the effeciency of the approach proposed here.","subitem_description_type":"Other"}]},"item_3_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"鳥取大学工学部"}]},"item_3_relation_16":{"attribute_name":"情報源","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"鳥取大学工学部研究報告. 1995, 26(1), 295-302"}]}]},"item_3_rights_15":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"注があるものを除き、この著作物は日本国著作権法により保護されています。 / This work is protected under Japanese Copyright Law unless otherwise noted."}]},"item_3_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00174610","subitem_source_identifier_type":"NCID"}]},"item_3_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"03858596","subitem_source_identifier_type":"ISSN"}]},"item_3_text_32":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"社会開発工学専攻"},{"subitem_text_value":"社会開発システム学科"}]},"item_3_version_type_20":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"平山, 克己"},{"creatorName":"ヒラヤマ, カツミ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"34486","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"河合, 一"},{"creatorName":"カワイ, ハジメ","creatorNameLang":"ja-Kana"},{"creatorName":"Kawai, Hajime","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"1408","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"50026316","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=50026316"}]},{"creatorNames":[{"creatorName":"Hirayama, Katsumi","creatorNameLang":"en"},{"creatorName":"ヒラヤマ, カツミ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"34487","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2011-09-06"}],"displaytype":"detail","filename":"rfetu26(1)_295.pdf","filesize":[{"value":"425.0 kB"}],"format":"application/pdf","licensefree":"注があるものを除き、この著作物は日本国著作権法により保護されています。 / This work is protected under Japanese Copyright Law unless otherwise noted.","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"rfetu26(1)_295.pdf","url":"https://repository.lib.tottori-u.ac.jp/record/3271/files/rfetu26(1)_295.pdf"},"version_id":"a4d8c4f3-37fa-41e3-8356-21bb88168235"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"遺伝アルゴリズムによる制約付きマルコフ決定過程の解法","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"遺伝アルゴリズムによる制約付きマルコフ決定過程の解法","subitem_title_language":"ja"},{"subitem_title":"A Solving Method of a MDP with Constraint by Genetic Algorithm","subitem_title_language":"en"}]},"item_type_id":"3","owner":"10","path":["14","10","683"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2018-06-22"},"publish_date":"2018-06-22","publish_status":"0","recid":"3271","relation_version_is_last":true,"title":["遺伝アルゴリズムによる制約付きマルコフ決定過程の解法"],"weko_creator_id":"10","weko_shared_id":-1},"updated":"2023-09-27T02:53:27.628108+00:00"}