Reinforcement of the Performances of the Soft Computing Techniques & Utilization of the learning Automaton-Challenges Toward Nonstationary Environment
| Project/Area Number |
18500173
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Sensitivity informatics/Soft computing
|
|---|
| Research Institution | Osaka Kyoiku University |
|---|
Principal Investigator |
BABA Norio Osaka Kyoiku University, Education, Professor (30035654)
|
|---|
| Project Period (FY) |
2006 – 2007
|
| Project Status |
Completed (Fiscal Year 2007)
|
| Budget Amount *help |
¥2,370,000 (Direct Cost: ¥2,100,000、Indirect Cost: ¥270,000)
Fiscal Year 2007: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2006: ¥1,200,000 (Direct Cost: ¥1,200,000)
|
|---|
| Keywords | Nonstationary Multiteacher Environment / HSLA / Mobile Robot / Maze Passing / DGPA & SERI / COMMONS GAME / Evolutionary Computation / Prediction of Golden Cross and Dead Cross by Neura / 学習オートマトン / ニューラルネット / 非定常環境 / 融合技術 / 知能工学 / ソフトコンピューテイング / 学習と適応 |
|---|
| Research Abstract |
In the followings, we shall briefly touch upon our research results:
1) We have proposed a new learning algorithm of the HSLA operating in the nonstationary multiteacher environment. We have shown that the proposed algorithm ensures convergence to the optimal set of actions with probability 1 under the general NME.
2) We have generalized the DGPA algorithm to be used in the hierarchical structure learning automata model. We have shown that the generalized algorithm is ε optimal under the rather general condition. We have also presented several computer simulation results concerning the maze passing problem of the mobile robots that suggest the efficacy of the generalized algorithm.
3) We have carried out large numbers of computer simulations in order to compare the efficacy of our algorithm in the nonstationary multiteacher switching environment with those of the generalized DGPA algorithm & the generalized SE_<RI> algorithm. Almost all of the computer simulation results confirm the effectiveness of our algorithm.
4) We have tried to utilize two kinds of EAs, ie., the MOEA and the FEP for making the COMMONS GAME exciting. The MOEA has been used for generating various types of skilled players. Further the FEP has been introduced to find out appropriate combinations of the point of each card. We have succeeded in finding highly advanced rules compared with that of the original COMMONS GAME.
5) We have proposed a new derision support system (DSS) for dealing stocks which improves the traditional technical analysis by using neural networks. In the proposed system, neural networks are utilized in order to predict the "Golden Cross" ('Dead Cross") several weeks it occurs. Computer simulation results concerning the dealings of the TOPIX and Nikkei-225 have confirmed the effectiveness of our approach.
|
Report
(3 results)
Research Products
(30 results)
