ダウンロード数: 281
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
TAC.2018.2885491.pdf | 2.07 MB | Adobe PDF | 見る/開く |
完全メタデータレコード
DCフィールド | 値 | 言語 |
---|---|---|
dc.contributor.author | Sakurama, Kazunori | en |
dc.contributor.author | Azuma, Shun-Ichi | en |
dc.contributor.author | Sugie, Toshiharu | en |
dc.contributor.alternative | 櫻間, 一徳 | ja |
dc.contributor.alternative | 杉江, 俊治 | ja |
dc.date.accessioned | 2019-09-06T07:43:34Z | - |
dc.date.available | 2019-09-06T07:43:34Z | - |
dc.date.issued | 2019-08 | - |
dc.identifier.issn | 0018-9286 | - |
dc.identifier.uri | http://hdl.handle.net/2433/243884 | - |
dc.description.abstract | This paper addresses a distributed formation control problem of multiple mobile agents using relative positions and local bearings. First, a formation control method via distributed pattern matching is proposed, which is executed over each clique (i.e., complete induced subgraph) of a network. It is shown that this method achieves the best control performance for a given desired formation and network topology in the following sense: The closest formation to the desired one is achieved among all formations achievable by distributed and relative control over the network. Next, a necessary and sufficient network condition is derived under which the desired formation can be obtained. It turns out that a new concept of connectivity, called clique rigidity, plays a crucial role. Finally, the effectiveness of the proposed method is illustrated through simulations in both two and three dimensional spaces. | en |
dc.format.mimetype | application/pdf | - |
dc.language.iso | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en |
dc.rights | © 2019 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. | en |
dc.rights | この論文は出版社版でありません。引用の際には出版社版をご確認ご利用ください。 | ja |
dc.rights | This is not the published version. Please cite only the published version. | en |
dc.title | Multi-agent coordination via distributed pattern matching | en |
dc.type | journal article | - |
dc.type.niitype | Journal Article | - |
dc.identifier.jtitle | IEEE Transactions on Automatic Control | en |
dc.identifier.volume | 64 | - |
dc.identifier.issue | 8 | - |
dc.identifier.spage | 3210 | - |
dc.identifier.epage | 3225 | - |
dc.relation.doi | 10.1109/TAC.2018.2885491 | - |
dc.textversion | author | - |
dc.address | Graduate School of Informatics, Kyoto University | en |
dc.address | Graduate School of Engineering, Nagoya University | en |
dc.address | Graduate School of Informatics, Kyoto University | en |
dcterms.accessRights | open access | - |
出現コレクション: | 学術雑誌掲載論文等 |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。