WEKO3
アイテム
Controlling the Diversive and Specific Exploration in Solving Disjunctive Linear Constraint Satisfaction Problem
http://hdl.handle.net/10228/6045
http://hdl.handle.net/10228/6045dbd54e1a-f409-4f11-af02-67e5d01e7aef
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
BSCHS13_35.pdf (659.8 kB)
|
|
| アイテムタイプ | 学術雑誌論文 = Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2017-02-21 | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
| 資源タイプ | journal article | |||||
| タイトル | ||||||
| タイトル | Controlling the Diversive and Specific Exploration in Solving Disjunctive Linear Constraint Satisfaction Problem | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 著者 |
永松, 正博
× 永松, 正博 |
|||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | A constrained optimization problem or a constraint satisfaction problem in which the constraint is a conjunction of disjunctions of linear inequalities is widely used in many fields, e.g. spatial layout and path planning of robots and vehicles. These problems are called DLP or DLCSP, respectively. In this paper we propose a neural network for the DLCSP. For a DLP/DLCSP, when a disjunct is chosen for each disjunction, the whole constraint becomes a conjunctive constraint, i.e. a linear programming (LP) or linear constraint satisfaction problem (LCSP), respectively. Hence algorithms for LP/LCSP can work as an underlying algorithm for the DLP/DLCSP. Because the computational intractability called combinatorial explosion is caused by the existence of disjunctions, the most important is how to cope with the disjunctions when the number of them is large. To do this we propose a mechanism of balancing diversive and specific explorations of the state space. We have already proposed a neural network called LPPH for the satisfiability problem (SAT). The LPPH does not trap by any point which is not a solution of the SAT, and when it comes near a solution, it converges to the solution. The proposed neural network LPPH-DLCSP inherits these properties from the LPPH. In this paper we also provide experimental results which show the effectiveness of the proposed mechanism of balancing diversive and specific explorations. | |||||
| 書誌情報 |
International Journal of Biomedical Soft Computing and Human Sciences 巻 13, 号 2, p. 35-41, 発行日 2008 |
|||||
| 出版社 | ||||||
| 出版者 | バイオメディカル・ファジィ・システム学会 | |||||
| NAID | ||||||
| 関連タイプ | isIdenticalTo | |||||
| 識別子タイプ | NAID | |||||
| 関連識別子 | 110006991260 | |||||
| NCID | ||||||
| 収録物識別子タイプ | NCID | |||||
| 収録物識別子 | AA11509989 | |||||
| ISSN | ||||||
| 収録物識別子タイプ | EISSN | |||||
| 収録物識別子 | 1345-1529 | |||||
| 著作権関連情報 | ||||||
| 権利情報 | バイオメディカル・ファジィ・システム学会. 本文データは学協会の許諾に基づきCiNiiから複製したものである | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | constraint satisfaction | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | disjunctive linear programming | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | neural network | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | diversive exploration | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | specific exploration | |||||
| 出版タイプ | ||||||
| 出版タイプ | VoR | |||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
| 査読の有無 | ||||||
| 値 | yes | |||||
| 連携ID | ||||||
| 値 | 650 | |||||
