Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/724
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChoudhury, B B-
dc.contributor.authorBiswal, B B-
dc.date.accessioned2008-10-05T14:27:49Z-
dc.date.available2008-10-05T14:27:49Z-
dc.date.issued2008-
dc.identifier.citationProceedings of the first International Conference on Emerging Trends in Engineering and Technology, 2008. ICETET '08, Nagpur, India P 320-325en
dc.identifier.urihttp://dx.doi.org/10.1109/ICETET.2008.111-
dc.identifier.urihttp://hdl.handle.net/2080/724-
dc.descriptionCopyright belongs to IEEEen
dc.description.abstractMultirobot systems (MRS) hold the promise of improved performance and increased fault tolerance for large-scale problems. One of the most important aspects in the design of MRS is the allocation of tasks among the robots in a productive and efficient manner. Optimal solutions to multirobot task allocation (MRTA) can be found through an exhaustive search. Since there are ways in which m tasks can be assigned to n robots, an exhaustive search is often not possible. Task allocation methodologies must ensure that not only the global mission is achieved, but also the tasks are well distributed among the robots. This paper presents task allocation methodologies for MRS by considering their capability in terms of time and space. A two-phase solution methodology is used to solve the MRTA problem wherein the task capacity of the robots is determined during the first phase and the task allocation optimization is done during the second phase using linear programming (LP).en
dc.format.extent431587 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherIEEEen
dc.subjectFault Toleranceen
dc.subjectLinear Programmingen
dc.subjectmulti-robot systemsen
dc.titleAn Optimized Multirobot Task Allocationen
dc.typeArticleen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
bbb.-2008.pdf421.47 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.