Particle Swarm Optimizationによる結像光学系の最適化
全文
(2) ᒻࠍቯߔࠆ㧚ߎߩᲑ㓏ߢߪ⚿ᕈ⢻ࠃࠅ߽㧘. Ꮕ㕙ḧᦛᱡᦛߩ 5 ⒳ߦಽ㘃ߐࠇࠆ㧚. 㓸శߐࠇࠆߴ߈శ✢߇శቇ♽ߩㅜਛߢో. Ꮕߩ⊒↢㊂ࠍⷞⷡ⊛ߦߔࠆ႐ว㧘࿑㧝. ᢔߔࠆߎߣߥߊ㕙߹ߢ㆐ߢ߈ࠆ߆߇. ߩࠃ߁ߥࠬࡐ࠶࠻࠳ࠗࠕࠣࡓ߇↪ࠄࠇࠆ㧚. ㊀ⷞߐࠇࠆ㧚╙ 2 Ბ㓏ߢߪ㧘╙ 1 Ბ㓏ߢ↢ᚑ. ࠬࡐ࠶࠻࠳ࠗࠕࠣࡓߪ㧘శቇ♽ߦછᗧߩⷺᐲ. ߐࠇߚశቇ♽ߦኻߒߡᦨㆡൻ߇ⴕߥࠊࠇࠆ㧚ߎ. ߆ࠄశ✢⟲ࠍߐߖߚ႐วߦ㧘ฦశ✢߇㕙. ߩ╙ 2 Ბ㓏ߢߩᦨㆡൻߢߪ㧘శቇ♽ߩ᭽ࠍḩ. ߩߤߩ⟎ߦ㆐ߒߚ߆ࠍࠪࡒࡘ࠻ߒߚ. ߚߒߟߟ㧘ߩࡏࠤߦߓߺࠁ߇ߺࠍ㒰ߔ. ߽ߩߢࠆ㧚. ࠆߦኾᔨߐࠇࠆ㧚╙ 3 Ბ㓏ߢߪ㧘ታ⊛ߥ↪. (+'.& 215+6+10. ㅜࠍ⠨߃ߚߢశቇ♽ߩዪᚲ⊛ߥᦨㆡൻ߇ⴕ ߥࠊࠇࠆ㧚╙ 3 Ბ㓏ߢߩᦨㆡൻߢߪ㧘╙ 2 Ბ &). 㓏ߢะߐࠇߚ⚿ᕈ⢻ߪߢ߈ࠆߛߌ⛽ᜬߒ ߥ߇ࠄ߽㧘ߘߩઁߩታ⊛ߥ᧦ઙߦᴪ߁ࠃ߁ߥ శቇ♽߳ߣᦨㆡൻߐࠇࠆ㧚ౕ⊛ߦߪ㧘߃߫ ⚿ᕈ⢻߇ૐਅߔࠆߣߒߡ߽㧘ࠟࠬߩ✚⾰㊂ ࠍᷫዋߐߖࠆߎߣ߇ߢ߈ࠇ߫㧘శቇ♽ߩ㊀㊂ߣ. &). ㅧࠦࠬ࠻ߩ㕙ߢߪᦨㆡߦߥࠆ㧚ߎߩࠃ߁ߥ࠻ ࠼ࠝࡈߪᄙ᭽ߦሽߒᓧࠆ߇㧘ᦨ⚳⊛ߦߪ ⸳⸘⠪߇್ᢿߒᦨ⚳⊛ߥశቇ♽߇⸳⸘ߐࠇࠆ㧚 ᧄ⎇ⓥߢߪ㧘శቇ♽⸳⸘ߩోᎿ⒟ࠍ⥄േ ⸳⸘ࠍᦨ⚳⊛ߥ⋡ᮡߣቯ㧘ోᎿ⒟ࠍᰴߩࠃ߁. &). ߦಽഀߔࠆ㧚߹ߕ㧘╙ 1 Ბ㓏ߪశቇ♽ߩᒻࠍ ቯߒ㧘ߘߩᒻߩ▸࿐ౝߢߩⶄᢙߩᄙ᭽ߥశ. '. ቇ♽⟲ߩ↢ᚑࠍⴕ߁ೋᦼ⸃↢ᚑᲑ㓏ߣߒ㧘╙ 2. &'(1%75+0). //. . Ბ㓏ߪ╙ 1 Ბ㓏ߢ↢ᚑߐࠇߚೋᦼ⸃⟲ࠍ↪. %QQMG6TKRNGVH. ߚᦨㆡൻᲑ㓏ߣߔࠆ㧚╙ 2 Ბ㓏ߢߪⶄᢙߩశቇ. ࿑ 1㧦ࠬࡐ࠶࠻࠳ࠗࠕࠣࡓ. ♽߆ࠄ㧘᭽ࠍḩߚߒߟߟ⾰ࠍะߐߖߚ 1 ߟߩశቇ♽ࠍ↢ᚑߔࠆ㧚╙ 3 Ბ㓏ߪ㧘ᧄ᧪ߩ╙. 㧠 㗴⸳ቯ 㗴⸳ቯ. 3 Ბ㓏ߣห᭽ߢࠆ㧚. ᧄ⎇ⓥߢߪ㧘㗴ࠍ◲නߦߔࠆߚ㧘ߊࠄ. ᧄⓂߢߪ㧘ߎߩቯ⟵ߒߚ⸳⸘Ꮏ⒟ਛ߆ࠄ㧘╙ 2 Ბ㓏ߦߚࠆᦨㆡൻࠍᛒ߁㧚. ߆ߩ㗴⸳ቯࠍⴕߞߡࠆ㧚߹ߕ㧘ዋߥᨎᢙ ߢᏅࠍ㒰ߔࠆ㕖㕙ࡦ࠭ߪᛒࠊߥ㧚㕖 㕙ߩࡦ࠭ࠍᛒ߁႐ว㧘ࡄࡔ࠲ߩᢙ߇⊒. 㧟 శቇ♽ߩ⹏ଔ శቇ♽ߩ⹏ଔ. ⊛ߦჇ߃ߡߒ߹߁ߎߣ߆ࠄ㧘ࡦ࠭㕙ߪ㕙ߩ. శቇ♽ߩ↪ㅜ߿᳞ࠄࠇࠆᕈ⢻ߩࡌ࡞ߦ. ߺࠍᛒ߁߽ߩߣߒߚ㧚. ࠃߞߡ㧘శቇ♽ߦߪ᭽⹏ߥޘଔၮḰ߇ࠆ㧚ߘ. ᰴߦ㧘ᧄ⎇ⓥߦ߅ߌࠆ⹏ଔ㑐ᢙߪ㕙ߢߩ. ߩၮᧄߣߥࠆ⹏ଔၮḰߪ㧘ℂᗐ⊛ߥ⚿⟎ߣ. ฦశ✢ߩ⚿ὐߣℂᗐὐߩ࠭ߩ✚ߢ. ታ㓙ߩ⚿⟎ߣߩ࠭ߢ㧘ߎࠇߪޟᏅߣޠ. ߒߚ㧚ߎࠇࠍᦨዊൻߔࠆߎߣߢ㧘5 ⒳ߩᏅߩ. ߫ࠇࠆ㧚Ꮕߪ㕙ᏅࠦࡑᏅ㕖ὐ. ߁ߜ 4 ⒳ߩᏅࠍᛥ߃ࠆߎߣ߇น⢻ߢࠆ㧚ߎ. −24− 2.
(3) ߩ 4 ⒳ߪ㧘 ޟߩࡏࠤ⋧ߦޠᒰߔࠆᏅߢࠅ㧘. ⸃ᖱႎ㧔Global Best㧕ࠍㅦᐲࡌࠢ࠻࡞ߦട. ߩ⾰ࠍ⠨߃ߚ႐วߦߪ߽ߞߣ߽ᩮᧄ⊛ߥⷐ. ߔࠆߎߣߢ⸃ߩᦝᣂࠍⴕ㧘Best Solution ࠍ. ⚛ߢࠆ㧚ᱷࠆ 1 ⒳ߪᱡᦛᏅߢࠆ߇㧘ߎࠇ. ⊒ߔࠆᚻᴺߢࠆ㧚PSO ߩ⸃ߩᦝᣂᑼࠍએ. ߪޟߩࠁ߇ߺ⋧ߦޠᒰߔࠆᏅߢࠆ㧚ᧄ᧪. ਅߦ␜ߔ㧚. v ′ = wv + c1 r1 (PL − x) + c 2 r2 (PG − x) x′ = x + v ′. ߪࠁ߇ߺ߽ᛥ߃ࠆߴ߈ߛ߇㧘5 ⒳ߩᏅࠍ৻ᐲ ߦᛥ߃ࠆߎߣߪ࿎㔍ߢࠆߚ㧘߹ߕߪࡏࠤߩ ߺࠍኻ⽎ߣߒߡ⎇ⓥࠍⴕ߁ߎߣߦߒߚ㧚 ⎇ⓥߩߚ ߩశ ቇ♽ߩ⋡ᮡ᭽ࠍ. F୯. ߎߎߢ㧘x ߪ⸃ࡌࠢ࠻࡞ࠍ␜ߒ㧘v ߪㅦᐲࡌࠢ ࠻࡞ࠍ␜ߔ㧚PL ߪߏߣߩᥳቯ⸃ᖱႎࠍ. : 4.5. ᜬߔࠆࡌࠢ࠻࡞ߢࠅ㧘PG ߪ⸃㓸࿅ోߢߩ. ὶὐ〒㔌: 50mm. ฝߩࠃ߁ߦቯߚ㧚 ↹ⷺ ᧄ⎇ⓥߢߪ㧘᳢↪⊛. ᥳቯ⸃ᖱႎࠍᜬߔࠆࡌࠢ࠻࡞ߢࠆ㧚r1㧘r2. : 46q. ߪ[0,1]ߩੂᢙ㧘w㧘c1㧘c2 ߪត⚝ߩㅦᐲࠍ⺞ᢛ. ߥశቇ♽ߩᦨㆡൻࠍ⋡ᮡߣߒߡࠆߚ㧘᭽. ߔࠆߚߩࡄࡔ࠲ߢࠆ㧚. ߪ৻⥸⊛ߥࠞࡔࡦ࠭ߩ᭽ߣ߶߷ห᭽ߥ. න⚐ߥ GA ߩࠝࡍ࠲ߪࡦ࠳ࡓᕈ߇ᒝ. ߽ߩߣቯߚ㧚ߥ߅㧘F ୯ߪߩࠆߐࠍߔ. ߊ㧘శቇ♽ߩ⸳⸘㗴ߦ߅ߡߪታⴕਇน⢻ߥ. ᢙ୯ߢ㧘F ୯߇ዊߐ߶ߤ߇ࠆߎߣࠍ␜. ⸃߇↢ᚑߐࠇ߿ߔ㧚৻ᣇߢ PSO ߪ㧘Global. ߔ㧚↹ⷺߣߪ㧘శቇ♽ߦߔࠆశ✢⟲ߩⷺᐲ. ߥត⚝ⓨ㑆ߦ߅ߌࠆጊ⊓ࠅᴺߣߺߥߖࠆ㧚ߚߛ. ߩ▸࿐ࠍ␜ߔᢙ୯ߢࠆ㧚. ߒ㧘ᘠᕈࠍ⠨ᘦߔࠆߩߢ෩ኒߦหߓߢߪߥ㧚 ߎࠇߪ㧘ㆡಾߥࡄࡔ࠲ࠍਈ߃ࠆߎߣ߇᧪ࠇ. 㧡 ᦨㆡൻᚻᴺ ᦨㆡൻᚻᴺ. ߫㧘ฦೋᦼ⸃ߩㄝࠍត⚝ߒߟߟࠃࠅఝ⦟ߥೋ. శቇ♽ߩ⸳⸘ߢߪ㧘ฎౖ⊛ߦߪ㧘ᷫᦨዊ⥄. ᦼ⸃ߩᣇะ߳᧤ߒߡߊߎߣ߇น⢻ߢࠆ. ਸ਼ᴺ㧔DLS : Damped Least Square㧕߇↪. ߣ⠨߃ࠄࠇࠆ㧚ߘߎߢ㧘ᧄ⎇ⓥߢߪ PSO ߦࠃ. ࠄࠇߡ߈ߚ㧚ߒ߆ߒ㧘ㄭᐕ㧘ࡔ࠲ࡅࡘࠬ࠹. ࠆᦨㆡൻࠍ⹜ߺߚ㧚 . ࠖ࠶ࠢࠬߩㆡ↪߽Ⴧ߃ߡࠆ㧚߃߫㧘ᢥ₂ [4]ߢߪ㧘ᄢၞ⊛ᦨㆡൻߣߒߡታᢙ୯ GA㧔ㆮવ. 㧢 ታ㛎߅ࠃ߮⠨ኤ ታ㛎߅ࠃ߮⠨ኤ. ⊛ࠕ࡞ࠧ࠭ࡓ㧕ࠍ↪ߡࠆ㧚߹ߚᢥ₂[5]. శቇ♽⸳⸘ߩ╙ 1 Ბ㓏ߦߚࠆೋᦼ⸃⟲ߩ. ߪ㧘GP㧔Genetic Programming㧕ߦࠃࠆᦨㆡ. ↢ᚑߦ㑐ߒߡߪ㧘ᥳቯ⊛ߦࡦ࠳ࡓߦ⸃ࠍ↢ᚑ. ൻࠍⴕ㧘᧼ࡦ࠭⟲߆ࠄ․⸵ߣߥߞߡࠆశ. ߒߚ㧚PSO ߢߪᦨㆡൻਛߢࡦ࠭ᨎᢙ߇ᄌൻ. ቇ♽ߣห╬ᕈ⢻ߩశቇ♽ߩ↢ᚑߦᚑഞߒߚߣ. ߔࠆߪήߊ㧘ࡦ࠭ 3 ᨎߩࡦ࠳ࡓߦ↢ᚑߐ. ႎ๔ߒߡࠆ㧚. ࠇߚೋᦼ⸃⟲ߢᦨㆡൻࠍⴕ߁႐ว㧘ᦨ⚳⊛ߥ⸃. ᧄ⎇ⓥߢߪ㧘ᦨ ㆡൻᚻᴺߣߒ ߡ Particle. ߽ࡦ࠭ 3 ᨎߣߥࠆ㧚ᢙ୯ታ㛎ߪࡦ࠭ 3 ᨎ㧘. Swarm Optimization(PSO㧕[6]ࠍណ↪ߒߚ㧚. 4 ᨎ㧘5 ᨎߩߘࠇߙࠇߩ႐วߦ߅ߡታ㛎ߒߚ㧚. PSO ߣߪ㧘㠽߿㝼ߩ⟲ࠇ߇ⴕേߔࠆ᭽ሶࠍᮨ. ೋᦼ⸃⟲ߩᢙߪ 100 ߣߒߚ㧚. ୮ߒߚㅴൻ⊛ࠕ࡞ࠧ࠭ࡓߩ৻⒳ߢࠆ㧚ⶄᢙ. PSO ࠍㆡᔕߒߚ⚿ᨐߪ㧘⚕㕙ߩㇺวࡦ. ߩ㧔Particle㧕ࠍ↪ߡ⸃㓸࿅ࠍ↢ᚑߒ㧘. ࠭ 5 ᨎߩ႐วߦߩߺ࿑ 2 ߦ␜ߔ㧚. ฦߪㅦᐲࡌࠢ࠻࡞ࠍᜬߟ㧚ߏߣߩᥳቯ ⸃ᖱႎ㧔Local Best㧕ߣ㧘⸃㓸࿅ోߢߩᥳቯ. −25− 3.
(4) ㆡൻߦኻߒߡ PSO ߦࠃࠆᦨㆡൻࠍ⹜ߺߚ㧚ᧄⓂ. 㪧㪪㪦. ߢ␜ߒߚታ㛎ߢߪ㧘ࡦ࠳ࡓߦ↢ᚑߒߚೋᦼ⸃ࠍ ↪ߚ㧚ߒ߆ߒ㧘╙㧝Ბ㓏ߦ߅ߡ㧘ㆡᒰߥᄙ᭽ ⹏ଔ㑐ᢙ୯. ᕈࠍ߽ߞߚ⸃㓸࿅ߩ↢ᚑ߇ታߢ߈ࠇ߫㧘ߘࠇࠄ ࠍᧄⓂߢ␜ߒߚ PSO ߩೋᦼ⸃ߣߒߡਈ߃ࠆߎߣ ߢ㧘ᦝߥࠆലᨐࠍߍࠄࠇࠆ߽ߩߣ⠨߃ࠆ㧚 ᓟߩ⺖㗴ߪ㧘ᄙ᭽ᕈࠍᜬߞߚೋᦼ⸃㓸࿅↢ᚑ 㪇. 㪈㪇㪇. 㪉㪇㪇 㪊㪇㪇 䉟䊁䊧䊷䉲䊢䊮࿁ᢙ. 㪋㪇㪇. ࠕ࡞ࠧ࠭ࡓߩ㐿⊒ߣ㧘ߘࠇࠄߦኻߔࠆ PSO ߢ. 㪌㪇㪇. ߩᦨㆡൻߩലᨐᬌ⸽ߢࠆ㧚߹ߚ㧘PSO ߣ߁ᚻ ᴺߪᲧセ⊛ᣂߒᚻᴺߢࠅ㧘߽ᣣޘᣂߒ. ࿑㧞㧦PSO ታⴕߩ᭽ሶ㧔ࡦ࠭ 5 ᨎ㧕. ⹜ߺ߇ߥߐࠇߡࠆ㧚ᰴ⊒ߣޘ᩺ߐࠇࠆᡷ⦟ဳ ᧄታ㛎ߢߪ㧘⚳ੌ᧦ઙࠍ 500 ࠗ࠹࡚ࠪࡦ. PSO ߩㆡ↪ߦࠃࠆലᨐᬌ⸽߽ᔅⷐߢࠆ㧚. ߣߒߡ⸳ቯߒߚ㧚࿑ 2 ߢߪ㧘ᡷༀߩᄙߊߪ 100 ࠗ ࠹࡚ࠪࡦએౝߦ↢ߓߡࠆ㧚ߘࠇએᓟ߽ࠊߕ. ෳ⠨ᢥ₂ ෳ⠨ᢥ₂. ߆ߦᡷༀߪ↢ߓߡࠆߎߣ߇ࠊ߆ࠆ㧚. [1] Gregory Hallock Smith : “LENS Design”㧘 Willmann-Bell, Inc.㧘Virginia㧘1998 [2] 㜞ᯅಷ : “ࡦ࠭⸳⸘”㧘᧲ᶏᄢቇ ␠㧘᧲ ੩㧘1994 [3] ᧻ศ : “ࡦ࠭⸳⸘ᴺ”㧘 ┙ ᩣᑼળ␠㧘 ᧲੩㧘1972 [4] I. Ono, S. Kobayashi, K. Yoshida, ”Optimal lens design by real-coded genetic algorithms. //. . 5ECNG. . using UNDX”, Computer methods in applied. -O(GD. ࿑㧟㧦PSO ታⴕ⚿ᨐ㧔ࡦ࠭ 5 ᨎ㧕. mechanics and engineering, , 2000, pp.483-497, [5] Koza, John R., Al-Sakran, Sameer H., and. ࿑ 3 ߩశቇ♽ߪ㧘ᧄታ㛎ߦ߅ߡᦨ߽⹏ଔ㑐ᢙ. Jones, Lee W., “Automated re-invention of six. ୯ߩ⦟߆ߞߚశቇ♽ࠍឬ↹ߒߚ߽ߩߢࠆ㧚ࡦ. patented optical lens systems using genetic. ࠳ࡓߦ↢ᚑߐࠇߚೋᦼ⸃߆ࠄᲧߴࠆߣᄢ߈ߊᡷༀ. programming”,. ߐࠇߡࠆ㧚 ᭽ߥޘᓟߩ⺖㗴ߪࠆ߇㧘ᧄታ㛎. Computation. ߢߪ㧘╙ 2 ࠬ࠹࠶ࡊߦኻߔࠆࠕ࡞ࠧ࠭ࡓߩലᨐ. Washington DC, USA, June 25 - 29, 2005.. ߣߒߡ PSO ߇ᦸߥశቇ♽ߩᦨㆡൻᚻᴺߣߥࠆ. Proceedings, pp.25-29.. น⢻ᕈࠍ␜ߒߚ㧚. [6]Kennedy, J. and Eberhart, R., “Particle. Genetic Conference. And. Evolutionary. (GECCO. 2005),. Swarm Optimization.” Proceedings of IEEE 㧣 ߅ࠊࠅߦ ߅ࠊࠅߦ. Conference. ᧄⓂߢߪ㧘శቇ♽ߩ⸳⸘ߦኻߒߡᦨㆡൻᚻᴺࠍ. Australia, 1995, pp. 1942-1948.. ㆡ↪ߔࠆߚߩ⸳⸘Ꮏ⒟ࠍቯ⟵ߒߚ㧚߹ߚ㧘ቯ⟵ ߒߚ⸳⸘Ꮏ⒟ߦ߅ߌࠆ 3 Ბ㓏ߩਛߢ╙ 2 Ბ㓏ߩᦨ. −26− 4E. on. Neural. Networks,. Perth,.
(5)
関連したドキュメント
It can be shown that cubic graphs with arbitrarily large girth exist (see Theorem 3.2) and so there is a well-defined integer µ 0 (g), the smallest number of vertices for which a
This technique allows us to obtain the space regularity of the unique strict solution for our problem.. Little H¨ older space; sum of linear operators;
He thereby extended his method to the investigation of boundary value problems of couple-stress elasticity, thermoelasticity and other generalized models of an elastic
Keywords: continuous time random walk, Brownian motion, collision time, skew Young tableaux, tandem queue.. AMS 2000 Subject Classification: Primary:
Kilbas; Conditions of the existence of a classical solution of a Cauchy type problem for the diffusion equation with the Riemann-Liouville partial derivative, Differential Equations,
It turns out that the symbol which is defined in a probabilistic way coincides with the analytic (in the sense of pseudo-differential operators) symbol for the class of Feller
Then it follows immediately from a suitable version of “Hensel’s Lemma” [cf., e.g., the argument of [4], Lemma 2.1] that S may be obtained, as the notation suggests, as the m A
In order to be able to apply the Cartan–K¨ ahler theorem to prove existence of solutions in the real-analytic category, one needs a stronger result than Proposition 2.3; one needs