Most cooperative systems are, to some degree, asynchronous. This lack of synchrony is typically considered as an obstacle that makes the achievement of cooperative goals more difficult. In this work, we aim to highlight potential benefits of asynchrony, which is introduced into the system as differences between the speeds of the actions of different entities. We demonstrate the usefulness of th...

This paper investigates the rendezvous problem for autonomous cooperative landing of an unmanned aerial vehicle (UAV) on surface (USV). Such heterogeneous agents, with nonlinear dynamics, are dynamically decoupled but share a common task. The underlying control scheme is based distributed Model Predictive Control (MPC). main contribution algorithm online update rule location. only requires agen...

in this paper‎, ‎we introduce the notion of $(m,n)$-‎algebr‎aically compact modules as an analogue of algebraically‎ ‎compact modules and then we show that $(m,n)$-algebraically‎ ‎compactness‎ ‎and $(m,n)$-pure injectivity for modules coincide‎. ‎moreover‎, ‎further characterizations of a‎ ‎$(m,n)$-pure injective module over a commutative ring are given‎.

T he abundance of embedded computational resources in autonomous vehicles enables enhanced operational effectiveness through cooperative teamwork in civilian and military applications. Compared to autonomous vehicles that perform solo missions, greater efficiency and operational capability can be realized from teams of autonomous vehicles operating in a coordinated fashion. Potential applicatio...

In many distributed applications, pairs of queries and values are evaluated by participating nodes. This includes keyword search for documents, selection queries on tuples, and publish-subscribe. These applications require that all values accepted by the query be evaluated. To carry out this evaluation we will present the peer-to-peer based Bit Zipper Rendezvous which partitions query-value pai...