activity
20202022
most citedLine Search for an Oblivious Moving Target

2 citations · 3 across the 4 of their papers we have counts for

collaborators

5 papers

cs.DC20222 cited

Line Search for an Oblivious Moving Target

Jared Coleman, Evangelos Kranakis, Danny Krizanc +1

Consider search on an infinite line involving an autonomous robot starting at the origin of the line and an oblivious moving target at initial distance from it. The robo…

cs.DC20221 cited

Delivery to Safety with Two Cooperating Robots

Jared Coleman, Evangelos Kranakis, Danny Krizanc +1

Two cooperating, autonomous mobile robots with arbitrary nonzero max speeds are placed at arbitrary initial positions in the plane. A remotely detonated bomb is discovered at some…

cs.DC2021

Message Delivery in the Plane by Robots with Different Speeds

Jared Coleman, Evangelos Kranakis, Danny Krizanc +1

We study a fundamental cooperative message-delivery problem on the plane. Assume robots which can move in any direction, are placed arbitrarily on the plane. Robots each have t…

cs.DC2021

The Pony Express Communication Problem

Jared Coleman, Evangelos Kranakis, Danny Krizanc +1

We introduce a new problem which we call the Pony Express problem. n robots with differing speeds are situated over some domain. A message is placed at some commonly known point. R…

cs.CG2020

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…