| タイトル | Co-evolution for Problem Simplification |
| 本文（外部サイト） | http://hdl.handle.net/2060/20000070452 |
| 著者（英） | Cplombano, Silvano P.; Haith, Gary L.; Lohn, Jason D.; Stassinopoulos, Dimitris |
| 著者所属（英） | NASA Ames Research Center |
| 発行日 | 1999-01-01 |
| 言語 | eng |
| 内容記述 | This paper explores a co-evolutionary approach applicable to difficult problems with limited failure/success performance feedback. Like familiar "predator-prey" frameworks this algorithm evolves two populations of individuals - the solutions (predators) and the problems (prey). The approach extends previous work by rewarding only the problems that match their difficulty to the level of solut,ion competence. In complex problem domains with limited feedback, this "tractability constraint" helps provide an adaptive fitness gradient that, effectively differentiates the candidate solutions. The algorithm generates selective pressure toward the evolution of increasingly competent solutions by rewarding solution generality and uniqueness and problem tractability and difficulty. Relative (inverse-fitness) and absolute (static objective function) approaches to evaluating problem difficulty are explored and discussed. On a simple control task, this co-evolutionary algorithm was found to have significant advantages over a genetic algorithm with either a static fitness function or a fitness function that changes on a hand-tuned schedule. |
| NASA分類 | Computer Programming and Software |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/227058 |
