|
| Comparison of convergence between evolutionary algorithms and deterministic algorithms for optimal control problem |
| |
| View Full Text View/Add Comment Download reader |
| DOI：10.7511/jslx20043062 |
| KeyWord:evolutionary algorithms,conjugate gradient,Nash game,DDM,optimal control |
| Abstract |
|
| Hits: 1362 |
| Download times: 8 |
| Abstract: |
| The comparison for optimization efficiency between evolutionary algorithms (Genetic Algorithms, GAs) and deterministic algorithms (Conjugate Gradient, CG) is presented. Both two different methods are combined with Nash strategy-decentralized optimization strategy in Game Theory-and implemented into an optimal control problem using a technique DDM (Domain Decomposition Method). The problem consists in simulating the perfect potential flow field around a NACA0012 airfoil with the technique DDM, the global calculation domain is then split into sub-domains with overlaps, the accord of local solutions on interfaces is obtained using four different algorithms which permit the resolution of global problem via local sub-problems on sub-domains and their interfaces. Comparable numerical results are obtained by different algorithms and show that the property of independence of gradient makes GAs based algorithms serious and robust research tools for great dimension problems or non-linear problems. |
|
|
|