Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Realistic propagation simulation of urban mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Unmanned ground vehicle radio relay deployment system for non-line-of-sight operations
RA '07 Proceedings of the 13th IASTED International Conference on Robotics and Applications
Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
| Hi-index | 0.00 |
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 one-task-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.