ICRA'09 Paper Abstract


Paper FrA13.2

Fu, James Guo Ming (National University of Singapore), Bandyopadhyay, Tirthankar (Singapore MIT Alliance for Research and Technology), Ang Jr, Marcelo H (National University of Singapore)

Local Voronoi Decomposition for Multi-Agent Task Allocation

Scheduled for presentation during the Regular Sessions "Distributed Robot Systems - I" (FrA13), Friday, May 15, 2009, 08:50−09:10, Room: 505

2009 IEEE International Conference on Robotics and Automation, May 12 - 17, 2009, Kobe, Japan

This information is tentative and subject to change. Compiled on January 24, 2022

Keywords Distributed Robot Systems, Autonomous Agents


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 our method is near the theoretical best solution.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2022 PaperCept, Inc.
Page generated 2022-01-24  05:05:03 PST  Terms of use