Skip to Main content Skip to Navigation
Conference papers

Robots’ Cooperation for Finding a Target in Streets

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01446262
Contributor : Hal Ifip <>
Submitted on : Wednesday, January 25, 2017 - 4:50:52 PM
Last modification on : Friday, March 2, 2018 - 3:04:02 PM
Document(s) archivé(s) le : Wednesday, April 26, 2017 - 6:53:55 PM

File

385217_1_En_3_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Mohammad 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⟩

Share

Metrics

Record views

160

Files downloads

218