Affiliation:
1. Dartmouth College, Hanover, NH
Abstract
The problem of time-varying, multisource localization using robotic swarms has received relatively little attention when compared to single-source localization. It involves distinct challenges regarding how to partition the robots during search to ensure that all sources are located in minimal time, how to avoid obstacles and other robots, and how to proceed after each source is found. Unfortunately, no common set of validation problems and reference algorithms has evolved, and there are no general theoretical foundations that guarantee progress, convergence, and termination. This article surveys the current multisource literature from the viewpoint of these central questions.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献