Sciweavers

194 search results - page 1 / 39
» Gathering Algorithms on Paths Under Interference Constraints
Sort
View
CIAC
2006
Springer
76views Algorithms» more  CIAC 2006»
13 years 9 months ago
Gathering Algorithms on Paths Under Interference Constraints
Jean-Claude Bermond, Ricardo C. Corrêa, Min-...
ADHOCNOW
2008
Springer
13 years 6 months ago
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
Jean-Claude Bermond, Min-Li Yu
AHSWN
2010
105views more  AHSWN 2010»
13 years 5 months ago
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
Jean-Claude Bermond, Min-Li Yu
CEC
2010
IEEE
12 years 9 months ago
Co-evolutionary search path planning under constrained information-sharing for a cooperative unmanned aerial vehicle team
—Mobile cooperative sensor networks are increasingly used for surveillance and reconnaissance tasks to support domain picture compilation. However, efficient distributed informat...
Jean Berger, Jens Happe
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 5 months ago
Optimal Path Planning under Temporal Logic Constraints
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...