The constraint of limited buffer size is of practical importance especially for time-critical data-gathering applications and for local temporal tasks that require an infinite sequence of data-gathering actions.
The work in [1]} considers a single robot transferring data between locations. The proposed approach minimizes the time interval between two consecutive data-uploading time instants. But it does not explicitly model the evolution of the robot's buffer or the inter-robot communication.
Similar buffer constraints are considered in [2]} for multi-robot frontier-based exploration. However locally-assigned data-gathering tasks described by LTL formulas are not considered there, nor are communication constraints.
Another related area is temporal logic task planning under resource constraints.
The work in [3]} considers a global surveillance task performed by multiple aerial vehicles subject to battery charging constraints.
The multi-vehicle routing problem considered in [4]} proposes a solution based on Mixed-Integer Linear Programming (MILP), which can potentially be extended to include resource constraints.
