Abstract
SUMMARYWe consider a problem where robots are given a set of task locations to visit with coarsely known distances. The robots must find the task ordering that reduces the overall distance to visit the tasks. We propose an abstraction that models the uncertainty in the paths, and a Markov Decision Process-based algorithm that selects paths that reduces the expected distance to visit the tasks. We also describe a distributed coordination algorithm to resolve path conflicts. We have shown that our task selection is optimal, our coordination is deadlock-free, and have experimentally verified our approach in hardware and simulation.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,General Mathematics,Software,Control and Systems Engineering
Reference30 articles.
1. D. Claes , P. Robbel , F. A. Olihoek , K. Tuyls , D. Hennes and W. Hoek , “Effective Approximations for Multi-Robot Coordination in Spatially Distributed Tasks,” Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, Istanbul, Turkey (2015) pp 881–890.
2. Repeated auctions for robust task execution by a robot team
3. A comprehensive taxonomy for multi-robot task allocation
4. I. Sucan and L. Kavraki , “Accounting for Uncertainty in Simultaneous Task and Motion Planning Using Task Motion Multigraphs,” Proceedings of the IEEE International Conference on Robotics and Automation, St. Paul Minnesota (2012) pp. 4822–4828.
5. Collaborative coverage using a swarm of networked miniature robots
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献