Path planning methods based on discrete graph searches are highly effective in dealing with large-scale environments, arbitrarily shaped obstacles, frequent map updates and complex cost functions. When it comes to planning for teams of coupled agents however, typical graph searchbased planning techniques quickly become infeasible due to the exponential growth of the dimensionality of the joint ...

When one engineers distributed algorithms, some special characteristics arise that are different from conventional (sequential or parallel) computing paradigms. These characteristics include: the need for either a scalable real network environment or a platform supporting a simulated distributed environment; the need to incorporate asynchrony, where arbitrary asynchrony is hard, if not impossib...

Dealing with a huge amount of data nowadays increase the need to distribute this data among cooperated servers in order to increase its availability and the performance of accessing and retrieving data. Rapidly growing networks implies that future files and database system are likely to be constructed as networked clusters of Distributed nodes and algorithms should be devised to work in this en...

In recent work we have developed an online algorithm selection technique, in which a model of algorithm performance is learned incrementally while being used. The resulting exploration-exploitation trade-off is solved as a bandit problem. The candidate solvers are run in parallel on a single machine, as an algorithm portfolio, and computation time is shared among them according to their expecte...

In this paper we provide a fully distributed implementation of the k-means clustering algorithm, intended for wireless sensor networks where each agent is endowed with a possibly high-dimensional observation (e.g., position, humidity, temperature, etc.). The proposed algorithm, by means of one-hop communication, partitions the agents into measure-dependent groups that have small ingroup and lar...

In this paper, a combination of simulated annealing (SA) and intelligent water drops (IWD) algorithm is used to solve the nonlinear/complex problem of simultaneous reconfiguration with optimal allocation (size and location) of wind turbine (WT) as a distributed generation (DG) and dynamic voltage restorer (DVR) as a distributed flexible AC transmission systems (DFACT) unit in a distribution sys...