The search session has expired. Please query the service again.
We propose a heuristic for solving the maximum independent set
problem for a set of processors in a network with arbitrary
topology. We assume an asynchronous model of computation and we use
modified Hopfield neural networks to find high quality solutions. We
analyze the algorithm in terms of the number of rounds necessary to
find admissible solutions both in the worst case (theoretical
analysis) and in the average case (experimental Analysis). We show
that our heuristic is better than the...
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with respect...
This paper presents coordination algorithms for groups of
mobile agents performing deployment and coverage tasks. As an
important modeling constraint, we assume that each mobile agent has
a limited sensing or communication radius.
Based on the geometry of Voronoi partitions and proximity graphs, we
analyze a class of aggregate objective functions and propose coverage
algorithms in continuous and discrete time.
These algorithms have convergence guarantees and are spatially
distributed with...
Currently displaying 1 –
4 of
4