Abstract
In this letter, a solution to a general distributed identification problem on a directed circular communication graph is proposed. The original use of a new strict Lyapunov function within a persistently excited framework is crucial to prove the consensus achievement for an asymmetric neighborhood-based decentralized parallel architecture, for which the communication burden is reduced, when compared to the case of symmetrical communication between the neighbors. Experimental results regarding quadrotor unmanned aerial vehicles illustrate the theoretical derivations.