output
20122026
most citedEfficient Multi-Robot Coverage of a Known Environment

99 citations

14 papers

math.MG2026

A Closed Form for the Chord-Power Integral I_2 of a Triangle

Mher Martirosyan, Ruben Sargsyan

The chord-power integrals are classical integral-geometric functionals of a planar convex body, obtained by integrating powers of the chord length against the kinematic measu…

astro-ph.HE2026

A precessing jet from a supermassive black hole: multi-wavelength observations of S5 1044+71

M. Cerruti, P. A. Duverne, G. Ganesaratnam +3

The bright gamma-ray blazar S5 1044+71 has been identified as showing very significant quasi-periodic oscillations in the Fermi-LAT data in recent studies, with a periodicity of ab…

cs.CV2024★ 1 cited

Parallel Watershed Partitioning: GPU-Based Hierarchical Image Segmentation

Varduhi Yeghiazaryan, Yeva Gabrielyan, Irina Voiculescu

Many image processing applications rely on partitioning an image into disjoint regions whose pixels are 'similar.' The watershed and waterfall transforms are established mathematic…

cs.CL2024

Enabling ASR for Low-Resource Languages: A Comprehensive Dataset Creation Approach

Ara Yeroyan, Nikolay Karpov

In recent years, automatic speech recognition (ASR) systems have significantly improved, especially in languages with a vast amount of transcribed speech data. However, ASR systems…

math.NA2024★ 1 cited

Numerical approximations of a lattice Boltzmann scheme with a family of partial differential equations

Bruce M Boghosian, François Dubois, Pierre Lallemand

In this contribution, we address the numerical solutions of high-order asymptotic equivalent partial differential equations with the results of a lattice Boltzmann scheme for an in…

cs.RO2018★ 99 cited

Efficient Multi-Robot Coverage of a Known Environment

Nare Karapetyan, Kelly Benson, Chris McKinney +2

This paper addresses the complete area coverage problem of a known environment by multiple-robots. Complete area coverage is the problem of moving an end-effector over all availabl…

eess.SP2018★ 6 cited

Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA

Michel Kulhandjian, Claude D'Amours, Hovannes Kulhandjian +3

We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (C…

math.AP2015★ 6 cited

Existence of positive solutions for an approximation of stationary mean-field games

Nojood Almayouf, Elena Bachini, Andreia Chapouto +22

Here, we consider a regularized mean-field game model that features a low-order regularization. We prove the existence of solutions with positive density. To do so, we combine a pr…

cs.CG2014★ 1 cited

Continuous Yao Graphs

Luis Barba, Prosenjit Bose, Jean-Lou De Carufel +5

In this paper, we introduce a variation of the well-studied Yao graphs. Given a set of points and an angle , we define the continuous Yao grap…

cs.CG2014★ 12 cited

Theta-3 is connected

Oswin Aichholzer, Sang Won Bae, Luis Barba +5

In this paper, we show that the -graph with three cones is connected. We also provide an alternative proof of the connectivity of the Yao graph with three cones.

cs.CG2013★ 1 cited

Fitting Voronoi Diagrams to Planar Tesselations

Greg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio +2

Given a tesselation of the plane, defined by a planar straight-line graph , we want to find a minimal set of points in the plane, such that the Voronoi diagram associated wi…

cs.CG2013★ 1 cited

New and Improved Spanning Ratios for Yao Graphs

Luis Barba, Prosenjit Bose, Mirela Damian +7

For a set of points in the plane and a fixed integer , the Yao graph partitions the space around each point into equiangular cones of angle , and connects…

physics.soc-ph2012★ 66 cited

The Kinetics of Wealth and the Origin of the Pareto Law

Bruce M. Boghosian

An important class of economic models involve agents whose wealth changes due to transactions with other agents. Several authors have pointed out an analogy with kinetic theory, wh…

cs.CG2012★ 1 cited

Coloring and Guarding Arrangements

Prosenjit Bose, Jean Cardinal, Sébastien Collette +4

Given an arrangement of lines in the plane, what is the minimum number of colors required to color the lines so that no cell of the arrangement is monochromatic? In this paper…