Multirobot Coordination With Counting Temporal Logics

Abstract

In many multirobot applications, planning trajectories in a way to guarantee that the collective behavior of the robots satisfies a certain high-level specification is crucial. Motivated by this problem, we introduce counting temporal logics-formal languages that enable concise expression of multirobot task specifications over possibly infinite horizons. We first introduce a general logic called counting linear temporal logic plus (cLTL+), and propose an optimization-based method that generates individual trajectories such that satisfaction of a given cLTL+ formula is guaranteed when these trajectories are synchronously executed. We then introduce a fragment of cLTL+, called counting linear temporal logic (cLTL), and show that a solution to planning problem with cLTL constraints can be obtained more efficiently if all robots have identical dynamics. In the second part of the paper, we relax the synchrony assumption and discuss how to generate trajectories that can be asynchronously executed, while preserving the satisfaction of the desired cLTL+ specification. In particular, we show that when the asynchrony between robots is bounded, the method presented in this paper can be modified to generate robust trajectories. We demonstrate these ideas with an experiment and provide numerical results that showcase the scalability of the method.

Multi-Agent Motion Planning From Signal Temporal Logic Specifications

“…Another class of synthesis approaches for STL is based on model predictive control (MPC), for example, [6], [14], [15], [16], [17]. In these approaches, a time-step is fixed and the decision variables of the optimization are just the state at each step.…”

A fully distributed motion coordination strategy for multi-robot systems with local information

“…Consider a MRS consisting of N = 4 robots, the dynamics of robot i is given by (17), and the velocity and input constraints are given by (18). For robots i ∈ {1, 2}, one has that v i,max = 1m/s, ω i,max = 0.5rad/s, and a i,max = 2m/s 2 .…”

Intermittent Connectivity for Exploration in Communication-Constrained Multi-Agent Systems

“…5) Cost function: To implement the objective function in Problems 1 and 2, we can penalize state transitions and information transmission costs C andC using the variables (9)- (13). The cost of using the mobility (resp.…”

“…As previous work [8], [10], [11], [12], [13] we plan multiagent trajectories via an Integer Linear Program (ILP). Connectivity problems have also been solved with the (mixed) ILP approach: [14] proposed a MILP that keeps static source states connected over time.…”