BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
DTSTART:19451014T230000
TZOFFSETFROM:+0630
TZOFFSETTO:+0530
TZNAME:IST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20250120T105233Z
UID:F5B0DAF5-495B-419E-BADF-38A6C53319F5
DTSTART;TZID=Asia/Kolkata:20250115T160000
DTEND;TZID=Asia/Kolkata:20250115T180000
DESCRIPTION:Abstract of the talk: Task allocation in a multi-robot system i
 s required to determine which robots should execute which tasks\, in order
  to achieve the overall system goals. Task allocation is an important aspe
 ct of many multi-robot systems\, which ensures coordinated team behaviour.
  In this talk\, we describe the features and complexity of multi-robot tas
 k allocation (MRTA) problems\, which are determined by the requirements of
  the particular domain. We illustrate how to classify these problems in a 
 systematic manner and show some real-life applications. We show a very gen
 eral formulation of the task allocation problem that generalizes several v
 ersions that are well-studied in the existing literature. Our formulation 
 includes the states of robots\, tasks\, and the surrounding environment in
  which they operate. We describe how the problem can be varied depending o
 n the feasibility constraints\, objective functions\, and the level of dyn
 amically changing information. We illustrate an algorithm to solve a parti
 cular variant of the MRTA problem and show how this algorithm performs bet
 ter than current state-of-the-art algorithms on real datasets. We conclude
  the talk with some directions for future research.\n\nCo-sponsored by: CS
 E Department\, Jadavpur University\n\nSpeaker(s): Arindam Pal\n\nBldg: Com
 puter Science and Engineering\, Amitava Dey Memorial Hall\, Jadavpur Unive
 rsity\, KOLKATA\, West Bengal\, India\, 700032
LOCATION:Bldg: Computer Science and Engineering\, Amitava Dey Memorial Hall
 \, Jadavpur University\, KOLKATA\, West Bengal\, India\, 700032
ORGANIZER:a_sudip@yahoo.com
SEQUENCE:34
SUMMARY:Technical Lecture Program on Task Allocation using a Team of Robots
URL;VALUE=URI:https://events.vtools.ieee.org/m/461397
X-ALT-DESC:Description: &lt;br /&gt;&lt;p&gt;&lt;strong&gt;Abstract of the talk:&lt;/strong&gt; Tas
 k allocation in a multi-robot system is required to determine which robots
  should execute which tasks\, in order to achieve the overall system goals
 . Task allocation is an important aspect of many multi-robot systems\, whi
 ch ensures coordinated team behaviour. In this talk\, we describe the feat
 ures and complexity of multi-robot task allocation (MRTA) problems\, which
  are determined by the requirements of the particular domain. We illustrat
 e how to classify these problems in a systematic manner and show some real
 -life applications. We show a very general formulation of the task allocat
 ion problem that generalizes several versions that are well-studied in the
  existing literature. Our formulation includes the states of robots\, task
 s\, and the surrounding environment in which they operate. We describe how
  the problem can be varied depending on the feasibility constraints\, obje
 ctive functions\, and the level of dynamically changing information. We il
 lustrate an algorithm to solve a particular variant of the MRTA problem an
 d show how this algorithm performs better than current state-of-the-art al
 gorithms on real datasets. We conclude the talk with some directions for f
 uture research.&lt;/p&gt;
END:VEVENT
END:VCALENDAR

