电子设计工程
電子設計工程
전자설계공정
ELECTRONIC DESIGN ENGINEERING
2012年
10期
31-33
,共3页
路径规划%最优路径%A＊算法%蚁群算法%评估值
路徑規劃%最優路徑%A＊算法%蟻群算法%評估值
로경규화%최우로경%A＊산법%의군산법%평고치
path-planning%optimal path%A-Star%Ant Colony Optimization%evaluation value
针对目前导航系统中重要的多约束条件下路径规划功能,结合A＊算法和蚁群算法提出一种新的不确定算法,该算法首先将多约束条件进行融合使其适合蚁群转移,并在基本蚁群算法基础上采用了A＊算法的评估指标,为蚁群转移时提供最优预测收敛点。通过实验证明该算法可以大幅度降低时间消耗,并且全局收敛性强,计算结果稳定。
針對目前導航繫統中重要的多約束條件下路徑規劃功能,結閤A＊算法和蟻群算法提齣一種新的不確定算法,該算法首先將多約束條件進行融閤使其適閤蟻群轉移,併在基本蟻群算法基礎上採用瞭A＊算法的評估指標,為蟻群轉移時提供最優預測收斂點。通過實驗證明該算法可以大幅度降低時間消耗,併且全跼收斂性彊,計算結果穩定。
침대목전도항계통중중요적다약속조건하로경규화공능,결합A＊산법화의군산법제출일충신적불학정산법,해산법수선장다약속조건진행융합사기괄합의군전이,병재기본의군산법기출상채용료A＊산법적평고지표,위의군전이시제공최우예측수렴점。통과실험증명해산법가이대폭도강저시간소모,병차전국수렴성강,계산결과은정。
In view of the important path planning function under multi-constraint conditions in current navigation systems,a new uncertainty algorithm is proposed which is the connection of A＊ algorithm and ant Colony algorithm.To adapt transfer of ant Colony algorithm,firstly,multiple constraints is integrated.Then,I took use of the concept of evaluation indicators in A＊ algorithm to get the optimal forecast convergence point for ant colony transfer.Basing on above operation,the results show that the algorithn has,strong global convergence,and substantially reduced time consumption.
