Robots’ Cooperation for Finding a Target in Streets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Robots’ Cooperation for Finding a Target in Streets


We study the problem of finding a target t from a start point s in street environments with the cooperation of two robots which have a minimal sensing capability; that is, robots do not know any information about the workspace including information on distances, edges, coordinates, angles etc. They just can detect the discontinuities in the visibility region of their location. The robots can detect target point t as soon as it enters their visibility region and have communication peripherals to send messages to each other. Our aim is to minimize the length of the path passed by the robots. We propose an online algorithm for robots such that they move in the workspace and find the target. This algorithm generates a search path from a start point s to a target point t such that the distance traveled by the robots is at most 2 times longer than the shortest path. Also, we prove that this ratio is tight.
Fichier principal
Vignette du fichier
385217_1_En_3_Chapter.pdf (1.57 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01446262 , version 1 (25-01-2017)





Mohammad Abouei Mehrizi, Mohammad Ghodsi, Azadeh Tabatabaei. Robots’ Cooperation for Finding a Target in Streets. 1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.30-43, ⟨10.1007/978-3-319-28678-5_3⟩. ⟨hal-01446262⟩
105 View
82 Download



Gmail Facebook X LinkedIn More