Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/120578
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorGrainger, Steven-
dc.contributor.authorSullivan, Nicholas David-
dc.date.issued2019-
dc.identifier.urihttp://hdl.handle.net/2440/120578-
dc.description.abstractTo utilise multiple robots, it is fundamental to know what they should do, called task allocation, and to know where the robots are, called localisation. The order that tasks are completed in is often important, and makes task allocation difficult to solve (40 tasks have 1047 different ways of completing them). Algorithms in literature range from fast methods that provide reasonable allocations, to slower methods that can provide optimal allocations. These algorithms work well for systems with identical robots, but do not utilise robot differences for superior allocations when robots are non-identical. They also can not be applied to robots that can use different tools, where they must consider which tools to use for each task. Robot localisation is performed using sensors which are often assumed to always be available. This is not the case in GPS-denied environments such as tunnels, or on long-range missions where replacement sensors are not readily available. A promising method to overcome this is collaborative localisation, where robots observe one another to improve their location estimates. There has been little research on what robot properties make collaborative localisation most effective, or how to tune systems to make it as accurate as possible. Most task allocation algorithms do not consider localisation as part of the allocation process. If task allocation algorithms limited inter-robot distance, collaborative localisation can be performed during task completion. Such an algorithm could equally be used to ensure robots are within communication distance, and to quickly detect when a robot fails. While some algorithms for this exist in literature, they provide a weak guarantee of inter-robot distance, which is undesirable when applied to real robots. The aim of this thesis is to improve upon task allocation algorithms by increasing task allocation speed and efficiency, and supporting robot tool changes. Collaborative localisation parameters are analysed, and a task allocation algorithm that enables collaborative localisation on real robots is developed. This thesis includes a compendium of journal articles written by the author. The four articles forming the main body of the thesis discuss the multi-robot task allocation and localisation research during the author’s candidature. Two appendices are included, representing conference articles written by the author that directly relate to the thesis.en
dc.language.isoenen
dc.subjectmulti-roboten
dc.subjectgenetic algorithmsen
dc.subjectlocalisationen
dc.titleTask Allocation and Collaborative Localisation in Multi-Robot Systemsen
dc.typeThesisen
dc.contributor.schoolSchool of Mechanical Engineeringen
dc.provenanceThis electronic version is made publicly available by the University of Adelaide in accordance with its open access policy for student theses. Copyright in this thesis remains with the author. This thesis may incorporate third party material which has been used by the author pursuant to Fair Dealing exceptions. If you are the owner of any included third party copyright material you wish to be removed from this electronic version, please complete the take down form located at: http://www.adelaide.edu.au/legalsen
dc.description.dissertationThesis (Ph.D.) -- University of Adelaide, School of Mechanical Engineering, 2019en
Appears in Collections:Research Theses

Files in This Item:
File Description SizeFormat 
Sullivan2019_PhD.pdf17.19 MBAdobe PDFView/Open


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