4 citations · 7 across the 5 of their papers we have counts for
6 papers
Ortho-unit polygons can be guarded with at most guards
J. M. Díaz-Báñez, P. Horn, M. A. Lopez +5
An orthogonal polygon is called an ortho-unit polygon if its vertices have integer coordinates, and all of its edges have length one. In this paper we prove that any ortho-unit pol…
A framework for synchronizing a team of aerial robots in communication-limited environments
J. M. Díaz-Báñez, L. E. Caraballo, M. A. Lopez +3
This paper addresses a synchronization problem that arises when a team of aerial robots (ARs) need to communicate while performing assigned tasks in a cooperative scenario. Each ro…
Computing the -resilience of a Synchronized Multi-Robot System
Sergey Bereg, Luis-Evaristo Caraballo, José-Miguel Díaz-Báñez +1
We study an optimization problem that arises in the design of covering strategies for multi-robot systems. Consider a team of cooperating robots traveling along predetermined c…
Resilience of a synchronized multi-agent system
S. Bereg, L. E. Caraballo, J. M. Díaz-Báñez +1
Fault tolerance is increasingly important for unmanned autonomous vehicles. For example, in a multi robot system the agents need the ability to effectively detect and tolerate inte…
Drawing the double circle on a grid of minimum size
Sergey Bereg, Ruy Fabila-Monroy, David Flores-Peñaloza +2
In 1926, Jarník introduced the problem of drawing a convex -gon with vertices having integer coordinates. He constructed such a drawing in the grid for so…
A note on equipartition
M. A. Lopez, S. Reisner
The problem of the existence of an equi-partition of a curve in has recently been raised in the context of computational geometry. The problem is to show that for a (continu…