• DocumentCode
    2340032
  • Title

    Flocking task research for multiple mobile robots based on game theory

  • Author

    Cen, Yuwan ; Ye, Ye ; Xie, Nenggang ; Bao, Jiahan ; Song, Chongzhi

  • Author_Institution
    Sch. of Mech. Eng., Anhui Univ. of Technol., Maanshan
  • fYear
    2008
  • fDate
    3-5 June 2008
  • Firstpage
    46
  • Lastpage
    49
  • Abstract
    It established multi-objective optimal mathematic model and did research on solving methods based on game theory. First, n robots specified n players. Second, it decomposed the design variables set and took the design variables set of paths which belonged to each robot as strategy space of the corresponding players. Third, it established mapping relationships between payoff functions and objective functions of the game. Then each player took payoff function of its own as its objective and did single-objective optimization in its own strategy space .So this player obtained the best strategy versus other players. The best strategies of all players consisted of the strategy permutation of a round game. Finally, it obtains the final game solutions (the best non-collision coordinated paths of flocking task for multiple mobile robots) through multi-round games according to the convergence criterion.
  • Keywords
    convergence; game theory; mobile robots; multi-robot systems; best noncollision coordinated path; convergence criterion; flocking task research; game theory; mapping relationship; multiobjective optimal mathematic model; multiple mobile robots; multiround games; objective functions; payoff functions; single-objective optimization; strategy space; Game theory; Mathematical model; Mathematics; Mechanical engineering; Mobile robots; Motion planning; Nash equilibrium; Orbital robotics; Path planning; Robot kinematics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Industrial Electronics and Applications, 2008. ICIEA 2008. 3rd IEEE Conference on
  • Conference_Location
    Singapore
  • Print_ISBN
    978-1-4244-1717-9
  • Electronic_ISBN
    978-1-4244-1718-6
  • Type

    conf

  • DOI
    10.1109/ICIEA.2008.4582478
  • Filename
    4582478