Minimum Time Consensus of Multi-agent System under Fuel Constraints
Abstract
This work addresses the problem of finding minimum time consensus point in the state space for a set of identical double integrator agents with bounded inputs and fixed fuel budget constraint. To address the problem, characterization of the attainable set for each agent subject to bounded inputs and fixed fuel budget constraints is done. Such attainable set is shown to be a convex set. The minimum time to consensus is the least time when the attainable sets of all agents intersect and the corresponding consensus state is the point of intersection. Using Helly's theorem, it is shown that the intersection is not empty at the time when all triplets of agents exhibit a non-empty intersection. Thus, a closed-form expression for the minimum time to consensus for a triplet of agents is obtained. The calculation of minimum time consensus for each of the triplets is performed independently and is distributed evenly among agents. The overall minimum time to consensus of agents is then given by the triplet that has the greatest minimum time to consensus. In the process, the set of initial conditions for agents from which consensus is possible under these input and fuel budget constraints is also characterized.
Cite
@article{arxiv.2407.19927,
title = {Minimum Time Consensus of Multi-agent System under Fuel Constraints},
author = {Akansha Rautela and Deepak Patil and Ameer Mulla and Indra Narayan Kar},
journal= {arXiv preprint arXiv:2407.19927},
year = {2025}
}