Decentralised minimal-time dynamic consensus

This paper considers a group of agents that aim to reach an agreement on individually received time-varying signals by local communication. In contrast to static network averaging problem, the consensus considered in this paper is reached in a dynamic sense. A discrete-time dynamic average consensus protocol can be designed to allow all the agents tracking the average of their reference inputs asymptotically. We propose a minimal-time dynamic consensus algorithm, which only utilises a minimal number of local observations of a randomly picked node in a network to compute the final consensus signal. Our results illustrate that with memory and computational ability, the running time of distributed averaging algorithms can be indeed improved dramatically as suggested by Olshevsky and Tsitsiklis. © 2012 AACC American Automatic Control Council).

High contrast holograms using nanotube forest

Nanotube forest behaves as highly absorbent material when they are randomly placed in sub-wavelength scales. Furthermore, it is possible to create diffractive structures when these bulks are patterned in a substrate. Here, we introduce an alternative to fabricate intensity holograms by patterning fringes of nanotube forest on a substrate. The result is an efficient intensity hologram that is not restricted to sub-wavelength patterning. Both the theoretical and experimental analysis was performed with good agreement. The produced holograms show a uniform behaviour throughout the visible spectra. © 2013 AIP Publishing LLC.