Hyper-Labeled Transition System and Its Application to Planning Under Linear Temporal Logic Constraints

Kinugawa, Takuma; Ushio, Toshimitsu

doi:https://doi.org/10.1109/LCSYS.2022.3162313

Hyper-Labeled Transition System and Its Application to Planning Under Linear Temporal Logic Constraints

Kinugawa, Takuma; Ushio, Toshimitsu

IEEE Control Systems Letters, 2022, 6, 2437-2442

アクセス数:85件（2025-07-03 17:54 集計）

固定URL: https://hdl.handle.net/11094/87645

閲覧可能ファイル

ファイル	フォーマット	利用条件	サイズ	閲覧回数	利用開始日	説明	information
IEEEControlSystLett_6_2437	pdf	なし	211 KB	232	2022.05.30

論文情報

ファイル出力 EndNote Basic出力 Mendeley出力

タイトル	Hyper-Labeled Transition System and Its Application to Planning Under Linear Temporal Logic Constraints
著者	著者名 Kinugawa, Takuma
著者	NRID 1000030184998 1000030184998 researchmap permalink Toshimtsu_Ushio Toshimtsu_Ushio Scopus Author ID 7005256747 7005256747 著者名 Ushio, Toshimitsu
キーワード等	Formal method
	optimal control
	modeling
	linear temporal logic
内容	Takuma Kinugawa and Toshimitsu Ushio. Hyper-Labeled Transition System and Its Application to Planning Under Linear Temporal Logic Constraints. IEEE Control Systems Letters, 6, pp. 2437-2442, 2022. https://doi.org/10.1109/LCSYS.2022.3162313.
抄録	Recently, formal methods have been paid much attention to in planning. We often leverage a labeled transition system (LTS) with a set of atomic propositions as a model of an environment. However, for example, in a flexible manufacturing system where an assembling machine has several functions that are performed exclusively, we need several states labeled by different sets of atomic propositions to discriminate the functions explicitly. This letter aims to reduce the number of the states. We introduce an extension of the LTS, called a hyperLTS, the labeling function of which assigns a set of sets of atomic propositions to each state. Then, we propose linear encodings for the hyperLTS to represent a sequence of pairs of a state and a selected set of atomic propositions. The hyperLTS-based modeling is consequently applied to a planning problem with one hard constraint and several soft constraints, thereby converting it into an integer linear programming problem. The effectiveness of the proposed modeling is illustrated through an example of a path planning problem of a mobile robot in a manufacturing system.
出版者	IEEE
収録物名	IEEE Control Systems Letters
巻(号)	6
ページ	2437-2442
刊行年月	2022-03-25
言語	英語
ハンドルURL	https://hdl.handle.net/11094/87645
eISSN	24751456
関連情報 (isVersionOf)	DOI (出版社版) https://doi.org/10.1109/LCSYS.2022.3162313
アクセス権	open access
権利情報	© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
出版タイプ	Accepted Manuscript
カテゴリ	学術雑誌論文 Journal Article

資源タイプ	学術雑誌論文
ローカル資源タイプ	学術雑誌論文
DCMI資源タイプ	text
DCTERMS.bibliographicCitation	IEEE Control Systems Letters. 2022, 6, p. 2437-2442
DC.title	Hyper-Labeled Transition System and Its Application to Planning Under Linear Temporal Logic Constraints
DC.creator	Kinugawa, Takuma
DC.creator	Ushio, Toshimitsu
DC.publisher	IEEE
DC.language' scheme='DCTERMS.RFC1766	英語
DC.type' scheme='DCTERMS.DCMIType	text
DCTERMS.issued' scheme='DCTERMS.W3CDTF	2022-03-25
DC.identifier	https://doi.org/10.1109/LCSYS.2022.3162313
DC.subject	Formal method
	optimal control
	modeling
	linear temporal logic
DC.description	Takuma Kinugawa and Toshimitsu Ushio. Hyper-Labeled Transition System and Its Application to Planning Under Linear Temporal Logic Constraints. IEEE Control Systems Letters, 6, pp. 2437-2442, 2022. https://doi.org/10.1109/LCSYS.2022.3162313.
DCTERMS.abstract	Recently, formal methods have been paid much attention to in planning. We often leverage a labeled transition system (LTS) with a set of atomic propositions as a model of an environment. However, for example, in a flexible manufacturing system where an assembling machine has several functions that are performed exclusively, we need several states labeled by different sets of atomic propositions to discriminate the functions explicitly. This letter aims to reduce the number of the states. We introduce an extension of the LTS, called a hyperLTS, the labeling function of which assigns a set of sets of atomic propositions to each state. Then, we propose linear encodings for the hyperLTS to represent a sequence of pairs of a state and a selected set of atomic propositions. The hyperLTS-based modeling is consequently applied to a planning problem with one hard constraint and several soft constraints, thereby converting it into an integer linear programming problem. The effectiveness of the proposed modeling is illustrated through an example of a path planning problem of a mobile robot in a manufacturing system.
DC.rights	© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
DC.format	87645
citation_title	Hyper-Labeled Transition System and Its Application to Planning Under Linear Temporal Logic Constraints
citation_author	Kinugawa, Takuma
citation_author	Ushio, Toshimitsu
citation_publisher	IEEE
citation_language	英語
citation_date	2022-03-25
citation_journal_title	IEEE Control Systems Letters
citation_volume	6
citation_firstpage	2437
citation_lastpage	2442
citation_doi	https://doi.org/10.1109/LCSYS.2022.3162313
citation_public_url	https://hdl.handle.net/11094/87645

Hyper-Labeled Transition System and Its Application to Planning Under Linear Temporal Logic Constraints

閲覧可能ファイル

論文情報

論文詳細を表示