CaltechAUTHORS
  A Caltech Library Service

Distance optimal target assignment in robotic networks under communication and sensing constraints

Yu, Jingjin and Chung, Soon-Jo and Voulgaris, Petros G. (2014) Distance optimal target assignment in robotic networks under communication and sensing constraints. In: IEEE International Conference on Robotics and Automation (ICRA), 2014. IEEE , Piscataway, NJ, pp. 1098-1105. ISBN 978-1-4799-3685-4. http://resolver.caltech.edu/CaltechAUTHORS:20161123-103752838

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20161123-103752838

Abstract

We study the problem of minimizing the total distance incurred in assigning a group of mobile robots to an equal number of static targets. Assuming that the robots have limited, range-based communication and target-sensing capabilities, we present a necessary and sufficient condition for ensuring distance optimality when robots and targets are uniformly randomly distributed. We then provide an explicit, non-asymptotic formula for computing the number of robots needed for guaranteeing optimality in terms of the robots' sensing and communication capabilities with arbitrarily high probabilities. The bound given in the formula is also asymptotically tight. Due to the large number of robots needed for high-probability optimality guarantee, we continue to investigate strategies for cases in which the number of robots cannot be freely chosen. We show that a properly designed strategy can be asymptotically optimal or suboptimal with constant approximation ratios.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/ICRA.2014.6906991DOIArticle
http://ieeexplore.ieee.org/document/6906991/PublisherArticle
ORCID:
AuthorORCID
Chung, Soon-Jo0000-0002-6657-3907
Additional Information:© 2014 IEEE. Date of Conference: 31 May-7 June 2014. Date Added to IEEE Xplore: 29 September 2014. This work was supported in part by AFOSR grant FA95501210193 and NSF grant IIS-1253758. This paper is intended as an early dissemination of results of an extended draft [32] which contains more complete proofs and significant generalizations. We thank the reviewers for their constructive comments.
Group:GALCIT
Funders:
Funding AgencyGrant Number
Air Force Office of Scientific Research (AFOSR)FA95501210193
NSFIIS-1253758
Record Number:CaltechAUTHORS:20161123-103752838
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20161123-103752838
Official Citation:J. Yu, S. J. Chung and P. G. Voulgaris, "Distance optimal target assignment in robotic networks under communication and sensing constraints," 2014 IEEE International Conference on Robotics and Automation (ICRA), Hong Kong, 2014, pp. 1098-1105. doi: 10.1109/ICRA.2014.6906991
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:72278
Collection:CaltechAUTHORS
Deposited By: Ruth Sustaita
Deposited On:23 Nov 2016 19:17
Last Modified:04 Jan 2017 19:31

Repository Staff Only: item control page