Sciweavers

622 search results - page 2 / 125
» Solving the Robots Gathering Problem
Sort
View
IPL
2010
112views more  IPL 2010»
13 years 3 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
IROS
2009
IEEE
159views Robotics» more  IROS 2009»
13 years 12 months ago
Data gathering tours for mobile robots
— We study a path planning problem which arises when multiple robots are used to gather data from stationary devices with wireless communication capabilities. Each device has a g...
Deepak Bhadauria, Volkan Isler
ICRA
2003
IEEE
96views Robotics» more  ICRA 2003»
13 years 10 months ago
Marco polo localization
We introduce the Marco Polo Localization approach, where we apply sound as a tool for gathering range measurements between robots, and use those to solve a range-only Simultaneous...
Eric Beowulf Martinson, Frank Dellaert
CEC
2010
IEEE
13 years 3 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...