Table of Contents
Fetching ...

Multi-Robot Coordination Under Physical Limitations

Tohid Kargar Tasooji, Sakineh Khodadadi

TL;DR

The paper addresses energy-efficient, distributed rendezvous for $N$ mobile robots under actuator constraints by integrating Pontryagin’s Minimum Principle with an algebraic Riccati equation–based gain design. It derives two main results: an unconstrained optimal protocol $U^*(t)=-(\mathcal{L}\otimes K)\varepsilon(t)$ with $K=R^{-1}B^T P$ where $P$ solves $P A + A^T P + Q - P B R^{-1} B^T P = 0$, and a bounded-input extension that projects the unconstrained input onto [$U_{min},U_{max}$], yielding a bang-bang control with explicit switching conditions. The approach is validated through simulations and Robotarium experiments, demonstrating robust rendezvous despite communication delays, packet loss, and wheel-velocity limits, and highlighting the trade-offs between convergence speed and control effort governed by $Q$ and $R$. These results offer a practical, scalable framework for distributed multi-robot coordination in real-world settings where physical and communication constraints are prominent.

Abstract

Multi-robot coordination is fundamental to various applications, including autonomous exploration, search and rescue, and cooperative transportation. This paper presents an optimal consensus framework for multi-robot systems (MRSs) that ensures efficient rendezvous while minimizing energy consumption and addressing actuator constraints. A critical challenge in real-world deployments is actuator limitations, particularly wheel velocity saturation, which can significantly degrade control performance. To address this issue, we incorporate Pontryagin Minimum Principle (PMP) into the control design, facilitating constrained optimization while ensuring system stability and feasibility. The resulting optimal control policy effectively balances coordination efficiency and energy consumption, even in the presence of actuation constraints. The proposed framework is validated through extensive numerical simulations and real-world experiments conducted using a team of Robotarium mobile robots. The experimental results confirm that our control strategies achieve reliable and efficient coordinated rendezvous while addressing real-world challenges such as communication delays, sensor noise, and packet loss.

Multi-Robot Coordination Under Physical Limitations

TL;DR

The paper addresses energy-efficient, distributed rendezvous for mobile robots under actuator constraints by integrating Pontryagin’s Minimum Principle with an algebraic Riccati equation–based gain design. It derives two main results: an unconstrained optimal protocol with where solves , and a bounded-input extension that projects the unconstrained input onto [], yielding a bang-bang control with explicit switching conditions. The approach is validated through simulations and Robotarium experiments, demonstrating robust rendezvous despite communication delays, packet loss, and wheel-velocity limits, and highlighting the trade-offs between convergence speed and control effort governed by and . These results offer a practical, scalable framework for distributed multi-robot coordination in real-world settings where physical and communication constraints are prominent.

Abstract

Multi-robot coordination is fundamental to various applications, including autonomous exploration, search and rescue, and cooperative transportation. This paper presents an optimal consensus framework for multi-robot systems (MRSs) that ensures efficient rendezvous while minimizing energy consumption and addressing actuator constraints. A critical challenge in real-world deployments is actuator limitations, particularly wheel velocity saturation, which can significantly degrade control performance. To address this issue, we incorporate Pontryagin Minimum Principle (PMP) into the control design, facilitating constrained optimization while ensuring system stability and feasibility. The resulting optimal control policy effectively balances coordination efficiency and energy consumption, even in the presence of actuation constraints. The proposed framework is validated through extensive numerical simulations and real-world experiments conducted using a team of Robotarium mobile robots. The experimental results confirm that our control strategies achieve reliable and efficient coordinated rendezvous while addressing real-world challenges such as communication delays, sensor noise, and packet loss.

Paper Structure

This paper contains 12 sections, 3 theorems, 56 equations, 7 figures, 1 algorithm.

Key Result

Theorem 3.1

Consider a multi-robot system with the global error dynamics given by where $\varepsilon(t) \in \mathbb{R}^{mN}$ is the stacked error vector (with $m$ being the dimension of each robot's state), $A \in \mathbb{R}^{m \times m}$ and $B \in \mathbb{R}^{m \times r}$ are the system matrices, $\mathcal{L} \in \mathbb{R}^{N \times N}$ is the Laplacian matrix corresponding to with ensures that the robot

Figures (7)

  • Figure 1: Communication topology of the MAS
  • Figure 2: Simulation results for optimal consensus algorithm 1: x positions of four mobile robots for different $Q$ and $R$.
  • Figure 3: Simulation results for optimal consensus algorithm 1: x velocities of four mobile robots for different $Q$ and $R$.
  • Figure 4: Simulation results for optimal consensus algorithm 1: performance index (cost function) of four mobile robots for different $Q$ and $R$.
  • Figure 5: Experimental testing results for optimal consensus algorithm 1: x positions of four mobile robots for different $Q$ and $R$.
  • ...and 2 more figures

Theorems & Definitions (8)

  • Theorem 3.1
  • proof
  • Theorem 3.2
  • proof
  • Remark 1
  • Theorem 3.3
  • proof
  • Remark 2