A Learning Strategy for Multi-robot Based on Probabilistic Evolutionary Algorithm

被引:0
|
作者
Fan, Jiancong [1 ]
Liang, Yongquan [1 ]
Ruan, Jiuhong [2 ]
机构
[1] Shandong Univ Sci & Technol, Coll Informat Sci & Engn, Qingdao, Shandong, Peoples R China
[2] Shandong Jiaotong Univ, Sci Res Dept, Jinan 250023, Peoples R China
来源
2010 8TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA) | 2010年
关键词
evolutionary computation; estimation of distribution algorithm; multi-robot competition; capture course; GRAPH;
D O I
10.1109/WCICA.2010.5555034
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Estimation of distribution algorithm (EDA) is a new evolutionary computation method based on probabilistic theory. EDA can select optimal individuals through estimating probability distribution function of a population. The capture problem among multi software robots can be solved by EDA. The capture problem involves that some pursuers pursue several evaders through part of trajectory. The trajectory was produced by the evaders during their two-dimensional random mobility. The pursuers estimate the evaders' mobility functions and adjust their pursuit models to capture the evaders as fast as possible. The probabilistic evolutionary courses of multi-robot experiencing some competitions are analyzed in performances. The analysis shows that capture problem of multi-robot solved by EDA is better than other methods in several aspects.
引用
收藏
页码:3275 / 3280
页数:6
相关论文
共 11 条
  • [1] [Anonymous], PARALLEL PROBLEM SOL, DOI DOI 10.1007/3-540-61723-X
  • [2] Fan JC, 2009, LECT NOTES ARTIF INT, V5855, P599
  • [3] Hespanha J. P., 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304), P2432, DOI 10.1109/CDC.1999.831290
  • [4] ISLER V, 2005, ROBOTICS SCI SYSTEMS, P257
  • [5] RECONTAMINATION DOES NOT HELP TO SEARCH A GRAPH
    LAPAUGH, AS
    [J]. JOURNAL OF THE ACM, 1993, 40 (02) : 224 - 245
  • [6] THE COMPLEXITY OF SEARCHING A GRAPH
    MEGIDDO, N
    HAKIMI, SL
    GAREY, MR
    JOHNSON, DS
    PAPADIMITRIOU, CH
    [J]. JOURNAL OF THE ACM, 1988, 35 (01) : 18 - 44
  • [7] PARSONS TD, 1976, PURSUIT EVASION GRAP, P426
  • [8] PELIKAN M, 1999, 99018 U ILL URB CHAM
  • [9] SEARCHING FOR A MOBILE INTRUDER IN A POLYGONAL REGION
    SUZUKI, I
    YAMASHITA, M
    [J]. SIAM JOURNAL ON COMPUTING, 1992, 21 (05) : 863 - 888
  • [10] Thrun S, 1998, MACHINE LEARNING AUT, V31, P1