Y Wang, S Wu, Z Chen, X Gao, G Chen - Computer Networks, 2017 - Elsevier
The coverage problem, as a fundamental problem for almost all types of applications in wireless sensor networks (WSNs), has been studied for over a decade. Because of its …
We incorporate communication into the multi-UAV path planning problem for search and rescue missions to enable dynamic task allocation via information dissemination …
This paper is concerned with the collective behaviors of robots beyond the nearest neighbor rules, ie, dispersion and flocking, when robots interact with others by applying an acute …
Y Kantaros, MM Zavlanos - IEEE Transactions on Automatic …, 2016 - ieeexplore.ieee.org
In this paper we develop an intermittent communication framework for teams of mobile robots. Robots move along the edges of a mobility graph and communicate only when they …
J Chen, P Dames - … conference on robotics and automation (icra …, 2021 - ieeexplore.ieee.org
This paper introduces the normalized unused sensing capacity to measure the amount of information that a sensor is currently gathering relative to its theoretical maximum. This …
This paper addresses task planning problems for language-instructed robot teams. Tasks are expressed in natural language (NL), requiring the robots to apply their capabilities (eg …
In this paper, we develop a distributed intermittent communication and task planning framework for mobile robot teams. The goal of the robots is to accomplish complex tasks …
The coverage control problem for mobile sensor networks with limited communication ranges is addressed in this paper. The goal of the problem is to minimize a coverage cost …
X Luo, MM Zavlanos - IEEE Transactions on Robotics, 2022 - ieeexplore.ieee.org
We consider the problem of optimally allocating tasks, expressed as global linear temporal logic (LTL) specifications, to teams of heterogeneous mobile robots of different types. Each …