2001, Volume 3, Issue 1
Strategic Study of CAE >> 2001, Volume 3, Issue 1
Evolutionary Decision Making Based on Candidates Ranking
Department of Computer Science, National University of Defense Technology, Changsha 410073, China
Next Previous
Abstract
Since the exact Expected Utility Functions (EUF) are not available in many circumstances, it is hard to make decision in environment characterized by incomplete information and uncertain decision results. Being aware of the defects of traditional decision analysis techniques, a new decision making method named Evolutionary Decision Making Based on Candidates Ranking is proposed. By selecting a set of indexes relevant to the expected utility of the candidates, the construction of decision rules can be reduced to finding the quantitative relationship between them. If all of the candidates are classified according to the indexes relevant to their expected utility, then Evolutionary Algorithms can be used to search for the expected utility ranking of the whole set of candidate classes, thus the optimal decision can be made based on the ranking. Some special considerations for Genetic Algorithms for ordering problem are also highlighted. The new method enjoys the advantages of weak dependence on expert knowledge, robustness in environment with random noise, no dependence on explicit EUF, effectively treating non-numerical, non-quantificational indexes and conflicts or correlation among indexes. The effectiveness of the proposed method is validated by its successful application in the controller design of certain simulated robot.
Keywords
evolutionary decision making ; evolutionary robotics ; genetic algorithms for ordering problem
Figures
图1
图2
图3
图4
图5
References
[ 1 ] 陈 .决策分析 [M ], 北京 :科学出版社 , 1987
[ 2 ] HollandJH .Adaptationinnaturalandartificialsys tem [M ], AnnArbor , MI:UniversityofMichiganPress, 1975
[ 3 ] RechenbergI.Cyberneticsolutionpathofanexperi mentalproblem [R].[Tech .Report], RoyAircraftEstablishment, LibraryTranslationNo 12 2 2 , Farn borough , Hants, UK , 196 5
[ 4 ] FogelLJ.Autonomousautomata [J].IndustryRe search , 196 2 , 4:14～ 19
[ 5 ] GomiT , GriffithA .Evolutionaryrobotics anoverview[A].InProceedingsof 1996IEEEInternationalCon ferenceonEvolutionaryComputation (ICEC , ’96 ) [C], Piscataway , NJ:IEEEPress, 1996 .40～ 49
[ 6 ] Welcomehomepagesofcongressonevolutionarycom putation 1999[DB/OL], InternetURL :http ://garage .cps.msu .edu/cec99/, 1999
[ 7 ] LiJianqi, ChenHuowang , WangBingshan .Evolu tionarylearningfunctionapproximatorasrobotcon troller [A ].EighthInternationalSymposiumonRoboticswithApplications, WorldAutomationCongress (WAC2 0 0 0 ) , tobepublishedinSeriesonIntelligentAutomationandSoftComputing [C], Al buquerque , NM :TSIPress, 2 0 0 0
[ 8 ] 荔建琦 , 陈火旺 , 王兵山 .多维函数的进化逼近[J].计算机学报 , 2 0 0 0 , 2 3 (6 ) :5 93～ 6 0 1 link1
[ 9 ] 潘正君 , 康立山 , 陈毓屏 .演化计算 [M], 北京 :清华大学出版社 , 南宁 :广西科学技术出版社 , 1998 link1
[10] RanaS , WhitleyD , CogswellR .Searchinginthepresenceofnoise [A].ParallelProblemSolvingfromNatureIV [C].VoigtHM , EbelingM , RechenbergI, etal.Heidelberg :SpringerVerlag , 1996 .2～ 11
[11] MichalewiczZ .Geneticalgorithms +datastructures=evolutionprograms [M ], Berlin :Springer Verlag , 1992
[12] TaneseR .Distributed geneticalgorithms [A].In :ProceedingoftheThirdInternationalConferenceonGeneticAlgorithms [C], LosAltos:MorganKauf mann , 1989.434～ 439
京公网安备 11010502051620号
