2 citations · 2 across the 10 of their papers we have counts for
12 papers
Search and Rescue on the Plane
Jared Coleman, Evangelos Kranakis, Danny Krizanc +1
We study a planar variant of the search and rescue problem whereby an agent starting at an arbitrary position in the plane must locate an object at an…
Linear Search with Probabilistic Detection and Variable Speeds
Jared Coleman, Oscar Morales-Ponce
We present results on new variants of the famous linear search (or cow-path) problem that involves an agent searching for a target with unknown position on the infinite line. We co…
Optimal Delivery with a Faulty Drone
Jared Coleman, Danny Krizanc, Evangelos Kranakis +1
We introduce and study a new cooperative delivery problem inspired by drone-assisted package delivery. We consider a scenario where a drone, en route to deliver a package to a dest…
Linear Search for an Escaping Target with Unknown Speed
Jared Coleman, Dmitry Ivanov, Evangelos Kranakis +2
We consider linear search for an escaping target whose speed and initial position are unknown to the searcher. A searcher (an autonomous mobile agent) is initially placed at the or…
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…
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…
Synchronous Robotic Framework
Nagarathna Hema Balaji, Jyothsna Kilaru, Oscar Morales-Ponce
We present a synchronous robotic testbed called SyROF that allows fast implementation of robotic swarms. Our main goal is to lower the entry barriers to cooperative-robot systems f…
Optimal Patrolling of High Priority Segments While Visiting the Unit Interval with a Set of Mobile Robots
Oscar Morales-Ponce
Consider a region that requires to be protected from unauthorized penetrations. The border of the region, modeled as a unit line segment, consists of high priority segments that re…
Gathering in the Plane of Location-Aware Robots in the Presence of Spies
Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis +2
A set of mobile robots (represented as points) is distributed in the Cartesian plane. The collection contains an unknown subset of byzantine robots which are indistinguishable from…
Computing the Optimal Longest Queue Length in Torus Networks
Oscar Morales-Ponce, Burkhard Englert, Mehrdad Aliasgari
A collection of mobile agents is arbitrarily deployed in the edges of a directed torus network where agents perpetually move to the successor edge. Each node has a switch that…
Cooperation with Disagreement Correction in the Presence of Communication Failures
Oscar Morales-Ponce, Elad M. Schiller, Paolo Falcone
Vehicle-to-vehicle communication is a fundamental requirement in cooperative vehicular systems to achieve high performance while keeping high safety standards. Vehicles periodicall…
Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points
Stefan Dobrev, Evangelos Kranakis, Danny Krizanc +2
Given a set of points in the plane, we solve the problems of constructing a geometric planar graph spanning 1) of minimum degree 2, and 2) which is 2-edge connected, re…