2 citations · 5 across the 10 of their papers we have counts for
7 papers · 1 filter
Oblivious Self-Distance Symmetric Rendezvous on the Integer Line
Konstantinos Georgiou, Claude Gravel, Lazar Mandic +1
Symmetric rendezvous on the line is a search problem in which two agents, initially placed at distance , must follow the same randomized strategy to meet as quickly as possible…
Optimal Average Disk-Inspection via Fermat's Principle
Konstantinos Georgiou
This work resolves the optimal average-case cost of the Disk-Inspection problem, a variant of Bellman's 1955 lost-in-a-forest problem. In Disk-Inspection, a mobile agent starts at…
Disk and Partial Disk Inspection: Worst- to Average-Case and Pareto Upper Bounds
James Conley, Konstantinos Georgiou
We consider unit-speed mobile agents initially positioned at the center of a unit disk, tasked with inspecting all points on the disk's perimeter. A perimeter point is consider…
Multi-Agent Search-Type Problems on Polygons
Konstantinos Georgiou, Caleb Jones, Jesse Lucier
We present several advancements in search-type problems for fleets of mobile agents operating in two dimensions under the wireless model. Potential hidden target locations are equi…
Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation
Konstantinos Georgiou, Xin Wang
We consider \emph{weighted group search on a disk}, which is a search-type problem involving 2 mobile agents with unit-speed. The two agents start collocated and their goal is to r…
The Fagnano Triangle Patrolling Problem
Konstantinos Georgiou, Somnath Kundu, Pawel Pralat
We investigate a combinatorial optimization problem that involves patrolling the edges of an acute triangle using a unit-speed agent. The goal is to minimize the maximum (1-gap) id…
Triangle Evacuation of 2 Agents in the Wireless Model
Konstantinos Georgiou, Woojin Jang
The input to the \emph{Triangle Evacuation} problem is a triangle . Given a starting point on the perimeter of the triangle, a feasible solution to the problem consists of…