Table of Contents
Fetching ...

Optimal Control Synthesis with Relaxed Global Temporal Logic Specifications for Homogeneous Multi-robot Teams

Disha Kamale, Cristian-Ioan Vasile

TL;DR

This work tackles control synthesis for a homogeneous team of robots under a global temporal logic specification when infeasibilities occur. It introduces a relaxed specification automaton built from a Time Window Temporal Logic ($TWTL$) formula and user-defined relaxation rules encoded as a Weighted Finite-State Edit System ($WFSE$), enabling minimal revisions with penalties. By combining automata-based representations with a carefully designed MILP encoding (MILP$_{\mathcal E}$) that avoids explicit product-automata construction, the approach jointly optimizes motion and specification relaxation, ensuring the progress towards satisfaction is explicit and optimizable. The method demonstrates feasibility and efficiency through case studies, illustrating improved expressivity over baselines and providing runtime insights for scalable deployment in multi-robot tasks.

Abstract

In this work, we address the problem of control synthesis for a homogeneous team of robots given a global temporal logic specification and formal user preferences for relaxation in case of infeasibility. The relaxation preferences are represented as a Weighted Finite-state Edit System and are used to compute a relaxed specification automaton that captures all allowable relaxations of the mission specification and their costs. For synthesis, we introduce a Mixed Integer Linear Programming (MILP) formulation that combines the motion of the team of robots with the relaxed specification automaton. Our approach combines automata-based and MILP-based methods and leverages the strengths of both approaches while avoiding their shortcomings. Specifically, the relaxed specification automaton explicitly accounts for the progress towards satisfaction, and the MILP-based optimization approach avoids the state-space explosion associated with explicit product-automata construction, thereby efficiently solving the problem. The case studies highlight the efficiency of the proposed approach.

Optimal Control Synthesis with Relaxed Global Temporal Logic Specifications for Homogeneous Multi-robot Teams

TL;DR

This work tackles control synthesis for a homogeneous team of robots under a global temporal logic specification when infeasibilities occur. It introduces a relaxed specification automaton built from a Time Window Temporal Logic () formula and user-defined relaxation rules encoded as a Weighted Finite-State Edit System (), enabling minimal revisions with penalties. By combining automata-based representations with a carefully designed MILP encoding (MILP) that avoids explicit product-automata construction, the approach jointly optimizes motion and specification relaxation, ensuring the progress towards satisfaction is explicit and optimizable. The method demonstrates feasibility and efficiency through case studies, illustrating improved expressivity over baselines and providing runtime insights for scalable deployment in multi-robot tasks.

Abstract

In this work, we address the problem of control synthesis for a homogeneous team of robots given a global temporal logic specification and formal user preferences for relaxation in case of infeasibility. The relaxation preferences are represented as a Weighted Finite-state Edit System and are used to compute a relaxed specification automaton that captures all allowable relaxations of the mission specification and their costs. For synthesis, we introduce a Mixed Integer Linear Programming (MILP) formulation that combines the motion of the team of robots with the relaxed specification automaton. Our approach combines automata-based and MILP-based methods and leverages the strengths of both approaches while avoiding their shortcomings. Specifically, the relaxed specification automaton explicitly accounts for the progress towards satisfaction, and the MILP-based optimization approach avoids the state-space explosion associated with explicit product-automata construction, thereby efficiently solving the problem. The case studies highlight the efficiency of the proposed approach.
Paper Structure (22 sections, 1 theorem, 11 equations, 4 figures, 1 table, 1 algorithm)

This paper contains 22 sections, 1 theorem, 11 equations, 4 figures, 1 table, 1 algorithm.

Key Result

Proposition 1

${\mathcal{A}}$ is a directed acyclic graph (DAG).

Figures (4)

  • Figure 1: Transition system for Case Study 1
  • Figure 2: Trajectories obtained in case of a) feasible specification, b) insufficient time, c) unavailability of $zone A$.
  • Figure 3: Computation time for MILP$_\mathcal{E}$ for various parameters
  • Figure 4: Time for solving MILP$_\mathcal{E}$ where the environment size varies from 10 to 500 for $N = 2,10,20$.

Theorems & Definitions (8)

  • Definition 1: Transition System
  • Definition 2
  • Example II.1
  • Definition 3: Deterministic Finite State Automaton
  • Definition 4: Weighted Finite State Edit System
  • Definition 5: Relaxed Specification Automaton
  • Example III.1
  • Proposition 1