Skip to main content
Article thumbnail
Location of Repository

Concurrent Tree Traversals for Improved Mission Performance under Limited Communication Range

By Ro R. Mosteo and Luis Montano

Abstract

Abstract — In previous work we presented a multi-robot strategy for routing missions in large scenarios where network connectivity must be explicitly preserved. This strategy is founded on the traversal of path trees in such a way that connectivity to a static control center is always maintained, while ensuring that any target that is reachable by a chain consisting of all robots is eventually visited. In this work we improve the strategy performance by extending its sequential onetask-at-a-time execution approach with concurrent execution of tasks. We demonstrate that the general problem is NP-hard and offer several heuristic approaches to tackle it. We study the improvements that these heuristics can offer in regard to several important variables like network range and clustering of targets, and finally compare their performance over the optimal solutions for small problem instances. In summary, we offer a complete characterization of the new concurrent capabilities of the CONNECTTREE strategy. I

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.322.3577
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://urus.upc.es/files/artic... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.