Skip to main content

5 Result(s)

within Article Remove this filter Jaroslav Opatrny Remove this filter

and

  1. No Access

    Article

    Exploration of High-Dimensional Grids by Finite State Machines

    We consider the problem of finding a “treasure” at an unknown point of an n-dimensional infinite grid, \(n\ge 3\) ...

    Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov in Algorithmica (2024)

  2. No Access

    Article

    Weak Coverage of a Rectangular Barrier

    Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. Each sensor can monitor a circular area of specific diameter around its position, called the sensor diameter. ...

    Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Maňuch… in Algorithmica (2020)

  3. No Access

    Article

    Search on a line with faulty robots

    We consider the problem of searching on a line using n mobile robots, of which at most f are faulty, and the remaining are reliable. The robots start at the same location and move in parallel along the line with ...

    Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan… in Distributed Computing (2019)

  4. No Access

    Article

    Distributed algorithms for barrier coverage using relocatable sensors

    We study the barrier coverage problem using relocatable sensor nodes. We assume each sensor can sense an intruder or event inside its sensing range. Sensors are initially located at arbitrary positions on the ...

    Mohsen Eftekhari, Evangelos Kranakis, Danny Krizanc… in Distributed Computing (2016)

  5. No Access

    Article

    Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors

    We consider the problem of monitoring the Euclidean plane using rotating sensors with detection sectors and beam sensors. We assume that intruders can appear anywhere at any time and move arbitrarily fast, and...

    Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny in Theory of Computing Systems (2014)