• DocumentCode
    2858224
  • Title

    Balancing multi-robot prioritized task allocation: A simulation approach

  • Author

    Elango, M. ; Nachiappan, S.P.

  • Author_Institution
    Dept. of Mech. Eng., Thiagarajar Coll. of Eng., Madurai, India
  • fYear
    2011
  • fDate
    6-9 Dec. 2011
  • Firstpage
    1725
  • Lastpage
    1729
  • Abstract
    Multi robot task allocation is a fundamental problem in robotics. Mostly multi robot task allocation (MRTA) problems concentrate on the minimization of the total distance travelled by the robots (Robot centered). Due attention is required for task centered allocation (task priority). A lot of real life application such as robotic search and rescue missions, environmental or hazardous clean-up missions emphasizes the priority of task allocation and balancing the utilization of robots. This paper develops a simulation model involving task priority and the utilization of robots and refers to it as a Balance multi-robot prioritized task allocation (BMRPTA) problem. The performance of the model is evaluated based on the minimum average waiting time and the completion time objective which ensures there would be a reasonable path balancing between the robots. Analysis has been carried out to study the effect of task priority on robot utilization.
  • Keywords
    mobile robots; multi-robot systems; BMRPTA; MRTA; balance multirobot prioritized task allocation problem; completion time objective; minimum average waiting time; robot centered; robot utilization balancing; robotic search-and-rescue missions; simulation model; task centered allocation; task priority; total distance minimization; Analytical models; Delay effects; Multirobot systems; Resource management; Robot kinematics; Robot sensing systems; Simulation; multi-robot system; prioritized task allocation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Industrial Engineering and Engineering Management (IEEM), 2011 IEEE International Conference on
  • Conference_Location
    Singapore
  • ISSN
    2157-3611
  • Print_ISBN
    978-1-4577-0740-7
  • Electronic_ISBN
    2157-3611
  • Type

    conf

  • DOI
    10.1109/IEEM.2011.6118211
  • Filename
    6118211