research
∙
07/24/2023
The Fagnano Triangle Patrolling Problem
We investigate a combinatorial optimization problem that involves patrol...
share
research
∙
03/27/2023
Overcoming Probabilistic Faults in Disoriented Linear Search
We consider search by mobile agents for a hidden, idle target, placed on...
research
∙
09/18/2022
Triangle Evacuation of 2 Agents in the Wireless Model
The input to the Triangle Evacuation problem is a triangle ABC. Given a ...
research
∙
08/05/2021
Evacuating from ell_p Unit Disks in the Wireless Model
The search-type problem of evacuating 2 robots in the wireless model fro...
research
∙
05/03/2021
Makespan Trade-offs for Visiting Triangle Edges
We study a primitive vehicle routing-type problem in which a fleet of nu...
research
∙
06/23/2020
The Bike Sharing Problem
Assume that m ≥ 1 autonomous mobile agents and 0 ≤ b ≤ m single-agent tr...
research
∙
04/18/2020
A Study of Knowledge Sharing related to Covid-19 Pandemic in Stack Overflow
The Covid-19 outbreak, beyond its tragic effects, has changed to an unpr...
research
∙
02/18/2020
Probabilistically Faulty Searching on a Half-Line
We study p-Faulty Search, a variant of the classic cow-path optimization...
research
∙
01/13/2020
Lower Bounds for Shoreline Searching with 2 or More Robots
Searching for a line on the plane with n unit speed robots is a classic ...
research
∙
05/16/2019
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model
Two robots stand at the origin of the infinite line and are tasked with ...
research
∙
04/22/2019
Energy Consumption of Group Search on a Line
Consider two robots that start at the origin of the infinite line in sea...
research
∙
07/23/2018
Average Case - Worst Case Tradeoffs for Evacuating 2 Robots from the Disk in the Face-to-Face Model
The problem of evacuating two robots from the disk in the face-to-face m...
research
∙
05/09/2018
Symmetric Rendezvous With Advice: How to Rendezvous in a Disk
In the classic Symmetric Rendezvous problem on a Line (SRL), two robots ...
research
∙
04/17/2018
