Publications related to Convex polygon

Geometric and Learning Methods for Robots to Navigate in Human Crowds with Application to Smart Mobility Devices

The thesis at hand is concerned with robots' navigation in human crowds. Specifically, methods are developed for planning a mobile robot's local motion between pedestrians, and they are evaluated in experiments where a robot interacts with real pedestrians ...

EPFL2023

Flow Time Scheduling and Prefix Beck-Fiala

Ola Nils Anders Svensson, Lars Rohwedder

We relate discrepancy theory with the classic scheduling problems of minimizing max flow time and total flow time on unrelated machines. Specifically, we give a general reduction that allows us to transfer discrepancy bounds in the prefix Beck-Fiala (bound ...

ASSOC COMPUTING MACHINERY2022

Reactive Navigation in Crowds for Non-holonomic Robots with Convex Bounding Shape

Aude Billard, Diego Felipe Paez Granados, David Julian Gonon

This paper describes a novel method for non-holonomic robots of convex shape to avoid imminent collisions with moving obstacles. The method's purpose is to assist navigation in crowds by correcting steering from the robot's path planner or driver. We evalu ...

2021

Critical Parameters for Scalable Distributed Learning with Large Batches and Asynchronous Updates

Martin Jaggi, Amirkeivan Mohtashami, Sebastian Urban Stich

It has been experimentally observed that the efficiency of distributed training with stochastic gradient (SGD) depends decisively on the batch size and—in asynchronous implementations—on the gradient staleness. Especially, it has been observed that the spe ...

MICROTOME PUBLISHING2021

A first-order primal-dual method with adaptivity to local smoothness

Volkan Cevher, Maria-Luiza Vladarean

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

2021

Convex Combination of Diffusion Strategies Over Networks

Ali H. Sayed, Jie Chen

Combining diffusion strategies with complementary properties enables enhanced performance when they can be run simultaneously. In this article, we first propose two schemes for the convex combination of two diffusion strategies, namely, the power-normalize ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Adaptive Gradient Descent without Descent

Konstantin Mishchenko

We present a strikingly simple proof that two rules are sufficient to automate gradient descent: 1) don’t increase the stepsize too fast and 2) don’t overstep the local curvature. No need for functional values, no line search, no information about the func ...

2020

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan

This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

The covering radius and a discrete surface area for non-hollow simplices

Matthias Schymura

We explore upper bounds on the covering radius of non-hollow lattice polytopes. In particular, we conjecture a general upper bound of d/2 in dimension d, achieved by the "standard terminal simplices" and direct sums of them. We prove this conjecture up to ...

2022

Nested Convex Bodies are Chaseable

Marek Elias

In the Convex Body Chasing problem, we are given an initial point v0. Rd and an online sequence of n convex bodies F1,..., Fn. When we receive Ft, we are required to move inside Ft. Our goal is to minimize the total distance traveled. This fundamental onli ...

SPRINGER2020

Characterization of local morphology and availability of triple-phase boundaries in solid oxide cell electrodes

Jan Van Herle, Marco Cantoni, Arata Nakajo, Pierre Burdet, Giorgio Rinaldi

The performance of solid oxide cells is known to be dependent upon the density of three phase boundaries (TPB), but the potential for improving their effective electrocatalytic activity by morphological adjustments is imprecisely known. A spilling algorith ...

2019

On the reverse isodiametric problem and Dvoretzky-Rogers-type volume bounds

Matthias Schymura

The isodiametric inequality states that the Euclidean ball maximizes the volume among all convex bodies of a given diameter. We are motivated by a conjecture of Makai Jr. on the reverse question: Every convex body has a linear image whose isodiametric quot ...

2018

Stochastic Three-Composite Convex Minimization with a Linear Operator

Volkan Cevher

We develop a primal-dual convex minimization framework to solve a class of stochastic convex three-composite problem with a linear operator. We consider the cases where the problem is both convex and strongly convex and analyze the convergence of the propo ...

JMLR: W&CP2018

Inference for Generalized Linear Models via Alternating Directions and Bethe Free Energy Minimization

Ulugbek Kamilov

Generalized linear models, where a random vector x is observed through a noisy, possibly nonlinear, function of a linear transform z = A x, arise in a range of applications in nonlinear filtering and regression. Approximate message passing (AMP) methods, b ...

IEEE2017

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

Unsplittable Coverings in the Plane

János Pach, Doemoetoer Palvoelgyi

A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of its members. A 1-fold covering is called a covering. The problem of splitting multiple coverings into several coverings was motivated by classical density est ...

Springer-Verlag Berlin2016

Unsplittable coverings in the plane

János Pach, Doemoetoer Palvoelgyi

A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of its members. A 1-fold covering is called a covering. The problem of splitting multiple coverings into several coverings was motivated by classical density est ...

Academic Press Inc Elsevier Science2016

Time-Optimal Path-Following Operation in the Presence of Uncertainty

Dominique Bonvin, Timm Faulwasser, Alejandro Gabriel Marchetti, Predrag Milosavljevic

Path-following tasks, which refer to dynamic motion planning along pre-specified geometric references, are frequently encountered in applications such as milling, robot-supported measurements, and trajectory planning for autonomous vehicles. Different conv ...

Ieee2016

From Compact Semi-Toric Systems To Hamiltonian S-1-Spaces

Silvia Sabatini

We show how any labeled convex polygon associated to a compact semi-toric system, as de fined by V (u) over tilde Ngoc, determines Karshon's labeled directed graph which classifies the underlying Hamiltonian S-1-space up to isomorphism. Then we characteriz ...

Amer Inst Mathematical Sciences2015

Optimal transport of closed differential forms for convex costs

Bernard Dacorogna, Olivier Kneuss

Let c : A(k-1) -> R+ be convex and Omega subset of R-n be a bounded domain. Let f(0) and f(1) be two closed k-forms on Omega satisfying appropriate boundary conditions. We discuss the minimization of integral(Omega) c (A) dx over a subset of (k - 1)-forms ...

Elsevier France-Editions Scientifiques Medicales Elsevier2015