Sciweavers

AROBOTS
2002
113views more  AROBOTS 2002»
14 years 9 days ago
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
This paper describes an incremental deployment algorithm for mobile sensor networks. A mobile sensor network is a distributed collection of nodes, each of which has sensing, compu...
Andrew Howard, Maja J. Mataric, Gaurav S. Sukhatme
CORR
2010
Springer
122views Education» more  CORR 2010»
14 years 16 days ago
How to meet asynchronously (almost) everywhere
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
DAGSTUHL
1994
14 years 1 months ago
Competitive Strategies for Autonomous Systems
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
Christian Icking, Rolf Klein
ATAL
2008
Springer
14 years 2 months ago
Coalition game-based distributed coverage of unknown environments by robot swarms
We consider the problem of distributed exploration or coverage of an unknown environment by a swarm of mobile minirobots that have limited memory, computation and communication ca...
Ke Cheng, Prithviraj Dasgupta
ARCS
2006
Springer
14 years 4 months ago
Minimising the Hardware Resources for a Cellular Automaton with Moving Creatures
: Given is the following "creature's exploration problem": n creatures are moving around in an unknown environment in order to visit all cells in shortest time. This...
Mathias Halbach, Rolf Hoffmann
ATAL
2000
Springer
14 years 4 months ago
Multiagent Bidding Mechanisms for Robot Qualitative Navigation
This paper explores the use of bidding mechanisms to coordinate the actions requested by a group of agents in charge of achieving the task of guiding a robot towards a specified t...
Carles Sierra, Ramon López de Mántar...
ESA
2004
Springer
98views Algorithms» more  ESA 2004»
14 years 5 months ago
Competitive Online Approximation of the Optimal Search Ratio
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elm...
ROBOCUP
2007
Springer
106views Robotics» more  ROBOCUP 2007»
14 years 6 months ago
Beyond Frontier Exploration
This article investigates the prerequisites for a global exploration strategy in an unknown environment on a virtual disaster site. Assume that a robot equipped with a laser range...
Arnoud Visser, Xingrui-Ji, Merlijn van Ittersum, L...
ICTAI
2007
IEEE
14 years 6 months ago
Swarm Approaches for the Patrolling Problem, Information Propagation vs. Pheromone Evaporation
This paper deals with the multi-agent patrolling problem in unknown environment using two collective approaches exploiting environmental dynamics. After specifying criteria of per...
Hoang Nam Chu, Arnaud Glad, Olivier Simonin, Fran&...
ICAS
2009
IEEE
237views Robotics» more  ICAS 2009»
14 years 7 months ago
Localisation and Mapping Using a Laser Range Finder: A Goal-Seeking Approach
In this paper we examine the problem of localisation and mapping of an unknown environment using data from a laser range finder. In order to support our method we detect landmark...
Sotirios Ch. Diamantas, Richard M. Crowder