蟻群導(dǎo)航優(yōu)化算法分析與其在MINIGUI上的實現(xiàn)

蟻群導(dǎo)航優(yōu)化算法分析與其在MINIGUI上的實現(xiàn)

ID:39137838

大小:4.74 MB

頁數(shù):66頁

時間:2019-06-25

蟻群導(dǎo)航優(yōu)化算法分析與其在MINIGUI上的實現(xiàn)_第1頁
蟻群導(dǎo)航優(yōu)化算法分析與其在MINIGUI上的實現(xiàn)_第2頁
蟻群導(dǎo)航優(yōu)化算法分析與其在MINIGUI上的實現(xiàn)_第3頁
蟻群導(dǎo)航優(yōu)化算法分析與其在MINIGUI上的實現(xiàn)_第4頁
蟻群導(dǎo)航優(yōu)化算法分析與其在MINIGUI上的實現(xiàn)_第5頁
資源描述:

《蟻群導(dǎo)航優(yōu)化算法分析與其在MINIGUI上的實現(xiàn)》由會員上傳分享,免費在線閱讀,更多相關(guān)內(nèi)容在學(xué)術(shù)論文-天天文庫

1、ResearchonnavigationsystemofAntAlgorithmandachieveonMINIGUIAbstractFirstofall,theintroductionofvehiclenavigationsystemsdevelopmentanalysisofthedomesticcarnavigationresearch.Andcomprehensiveanalysisandcomparisonofthecurrentlyusedpathplanningandnavigationandpositioningtechnology,combiningthe

2、designneedsanavigationsystemandamorereasonablepathplanningtheoveralldesignprogram.Apopulation—basedsimulatedevolutionaryalgorithmcalledantcolonyoptimization(ACOforshort)wasproposedin1992byItalianresearchersDorigoM.,ManiezzoV.a(chǎn)ndColorniA.Manyscholarsareappliedtothefieldsofcombinatorialoptim

3、ization,networkrouting,functionaloptimization,datamining,andpathplanningofrobotetc,andgoodeffectsofapplicationaregained.Antcolonyoptimization(ACO)asanovelnature—inspiredmetaheuristicbasedonthephenomenonofrealantsforagingbehavior.ACObelongstOtheswarmintelligence,whichobtainedencouragingresu

4、ltsforthesolvingofNP—hardcombinatorialoptimizationproblems.Now,ACOhasbecomeanindependentbranchofintelligentcomputationandhasbeendiscussedasaspecialsessioninmanyinternationalconferences.MoreandmoreresearchershavepaidattentiontoACO.Inrecent15years,ACOhasdevelopedquicklyanditsapplicationfield

5、sextendmuchwiderfromtravelingsalesmanproblem(TSP)toschedulingproblems,assignmentproblems,andvehicleroutingproblems,etc.Incontrast,theresearchonACOtheorydevelopsslowly,especiallyintheaspectofparameterssettingandtheproofofconvergence.Basedontheabovequestions,startfromthestartwiththebasicantc

6、olonyalgorithm,introducethebasicconceptofantcolonyalgorithmandtheory,followedbyintroductionofthebasicantcolonyalgorithmtOimprovetheantcolonyalgorithm,theantcolonyalgorithmbasedontime,andbasedontimealgorithmofantcolonyalgorithmforthesetypesofTSPproblem,whichtheantcolonyalgorithmbasedonIIIti

7、mearethemselvesbasedonantcolonyalgorithmbasedontheforanumberofsmallimprovements,andgiveaconvergenceproof,inmathematicsreasoningprocess,wecanseethattheantcolonyalgorithmbasedontheoftheimprovedalgorithmhasaverygoodconvergence.Parametersandselectionoftextalsogive

當前文檔最多預(yù)覽五頁,下載文檔查看全文

此文檔下載收益歸作者所有

當前文檔最多預(yù)覽五頁,下載文檔查看全文
溫馨提示:
1. 部分包含數(shù)學(xué)公式或PPT動畫的文件,查看預(yù)覽時可能會顯示錯亂或異常,文件下載后無此問題,請放心下載。
2. 本文檔由用戶上傳,版權(quán)歸屬用戶,天天文庫負責(zé)整理代發(fā)布。如果您對本文檔版權(quán)有爭議請及時聯(lián)系客服。
3. 下載前請仔細閱讀文檔內(nèi)容,確認文檔內(nèi)容符合您的需求后進行下載,若出現(xiàn)內(nèi)容與標題不符可向本站投訴處理。
4. 下載文檔時可能由于網(wǎng)絡(luò)波動等原因無法下載或下載錯誤,付費完成后未能成功下載的用戶請聯(lián)系客服處理。