13 citations · 32 across the 15 of their papers we have counts for
21 papers
Online Drone Coverage of Targets on a Line
Stefan Dobrev, Konstantinos Georgiou, Evangelos Kranakis +5
We study a problem of online targets coverage by a drone or a sensor that is equipped with a camera or an antenna of fixed half-angle of view . The targets to be monitored appea…
Variety-Seeking Jump Games on Graphs
Lata Narayanan, Jaroslav Opatrny, Shanmukha Tummala +1
We consider a class of jump games in which agents of different types occupy the nodes of a graph aiming to maximize the variety of types in their neighborhood. In particular, each…
Diversity-seeking swap games in networks
Yaqiao Li, Lata Narayanan, Jaroslav Opatrny +1
Schelling games use a game-theoretic approach to study the phenomenon of residential segregation as originally modeled by Schelling. Inspired by the recent increase in the number o…
The En Route Truck-Drone Delivery Problem
Danny Krizanc, Lata Narayanan, Jaroslav Opatrny +1
We study the truck-drone cooperative delivery problem in a setting where a single truck carrying a drone travels at constant speed on a straight-line trajectory/street. Delivery to…
Group Evacuation on a Line by Agents with Different Communication Abilities
Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis +5
We consider evacuation of a group of autonomous mobile agents (or robots) from an unknown exit on an infinite line. The agents are initially placed at the origin of the…
Graph Exploration by Energy-Sharing Mobile Agents
J. Czyzowicz, S. Dobrev, R. Killick +6
We consider the problem of collective exploration of a known -node edge-weighted graph by mobile agents that have limited energy but are capable of energy transfers. The age…
Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots
Jared Coleman, Evangelos Kranakis, Oscar Morales-Ponce +3
In the pattern formation problem, robots in a system must self-coordinate to form a given pattern, regardless of translation, rotation, uniform-scaling, and/or reflection. In other…
The Bike Sharing Problem
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick +5
Assume that autonomous mobile agents and single-agent transportation devices (called {\em bikes}) are initially placed at the left endpoint of the…
Evacuation of equilateral triangles by mobile agents of limited communication range
Iman Bagheri, Lata Narayanan, Jaroslav Opatrny
We consider the problem of evacuating mobile agents from a unit-sided equilateral triangle through an exit located at an unknown location on the perimeter of the triangl…
Distributed Pattern Formation in a Ring
Anne-Laure Ehresmann, Manuel Lafond, Lata Narayanan +1
Motivated by concerns about diversity in social networks, we consider the following pattern formation problems in rings. Assume mobile agents are located at the nodes of an …
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick +6
Two robots stand at the origin of the infinite line and are tasked with searching collaboratively for an exit at an unknown location on the line. They can travel at maximum speed $…
Energy Consumption of Group Search on a Line
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick +6
Consider two robots that start at the origin of the infinite line in search of an exit at an unknown location on the line. The robots can only communicate if they arrive at the sam…
Exploration of High-Dimensional Grids by Finite State Machines
Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny +1
We consider the problem of finding a treasure at an unknown point of an -dimensional infinite grid, , by initially collocated finite state agents (scouts/robots). Recen…
Evacuating Equilateral Triangles and Squares in the Face-to-Face Model
Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan +1
Consider robots initially located at a point inside a region . Each robot can move anywhere in independently of other robots with maximum speed one. The goal of the robo…
Priority Evacuation from a Disk Using Mobile Robots
J. Czyzowicz, K. Georgiou, R. Killick +5
We introduce and study a new search-type problem with ()-robots on a disk. The searchers (robots) all start from the center of the disk, have unit speed, and can communicate w…
God Save the Queen
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick +5
Queen Daniela of Sardinia is asleep at the center of a round room at the top of the tower in her castle. She is accompanied by her faithful servant, Eva. Suddenly, they are awakene…
Weak Coverage of a Rectangular Barrier
Stefan Dobrev, Evangelos Kranakis, Danny Krizanc +5
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intru…
Linear Search with Terrain-Dependent Speeds
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc +3
We revisit the linear search problem where a robot, initially placed at the origin on an infinite line, tries to locate a stationary target placed at an unknown position on the lin…
Search on a Line by Byzantine Robots
Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis +4
We consider the problem of fault-tolerant parallel search on an infinite line by robots. Starting from the origin, the robots are required to find a target at an unknown locati…
Evacuating Robots from a Disk Using Face-to-Face Communication
Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis +3
Assume that two robots are located at the centre of a unit disk. Their goal is to evacuate from the disk through an exit at an unknown location on the boundary of the disk. At any…
Optimal online and offline algorithms for robot-assisted restoration of barrier coverage
J. Czyzowicz, E. Kranakis, D. Krizanc +2
Cooperation between mobile robots and wireless sensor networks is a line of research that is currently attracting a lot of attention. In this context, we study the following proble…