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
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...
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...
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...
: 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...
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...
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...
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...
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&...
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...