Please use this identifier to cite or link to this item:
|Title:||Local voronoi decomposition for multi-agent task allocation|
Ang Jr., M.H.
|Source:||Fu, J.G.M.,Bandyopadhyay, T.,Ang Jr., M.H. (2009). Local voronoi decomposition for multi-agent task allocation. Proceedings - IEEE International Conference on Robotics and Automation : 1935-1940. ScholarBank@NUS Repository. https://doi.org/10.1109/ROBOT.2009.5152829|
|Abstract:||We propose a Local Voronoi Decomposition (LVD) Algorithm which is able to perform a robust and online task allocation for multiple agents based purely on local information. Because only local information is required in determining each agent's Voronoi region, each agent can then make its decision in a distributive fashion based on its allocated Voronoi region. These Voronoi regions eliminates the occurrence of agents executing instantaneous overlapping tasks. As our method does not require a pre-processing of the map, it is also able to work well in a dynamically changing map with changing number of agents. We will show our proof of concept in the problem of exploration in an unknown environment. In our experimental evaluation, we show that our method significantly outperforms the competing algorithms: Ants Algorithm and the Brick&Mortar Algorithm. Our results also show that ourmethod is near the theoretical best solution © 2009 IEEE.|
|Source Title:||Proceedings - IEEE International Conference on Robotics and Automation|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.