Publications related to Nonholonomic source seeking in switching random fields

An Algorithm for Odor Source Localization based on Source Term Estimation

Alcherio Martinoli, Ali Marjovi, Faezeh Rahbar

Finding sources of airborne chemicals with mobile sensing systems finds applications across the security, safety, domestic, medical, and environmental domains. In this paper, we present an algorithm based on source term estimation for odor source localizat ...

2019

An Algorithm for Odor Source Localization based on Source Term Estimation

Alcherio Martinoli, Ali Marjovi, Faezeh Rahbar

Finding sources of airborne chemicals with mobile sensing systems finds applications across the security, safety, domestic, medical, and environmental domains. In this paper, we present an algorithm based on source term estimation for odor source localizat ...

IEEE2019

Overlapping Multi-Bandit Best Arm Identification

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic

In the multi-armed bandit literature, the multi-bandit best-arm identification problem consists of determining each best arm in a number of disjoint groups of arms, with as few total arm pulls as possible. In this paper, we introduce a variant of the multi ...

IEEE2019

Freight railway network design problem

Michel Bierlaire, Virginie Janine Camille Lurkin, Nikola Obrenovic

In freight railway networks, commodities are usually transported via hubs, which are called marshaling or shunting yards, depending on their capacity. Consequently, the number and locations of these yards effect the transport costs to a great extent. The ...

2018

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

Dynamic Facility Location via Exponential Clocks

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Hyung Chan An

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance ...

Association for Computing Machinery2017

Pattern formation with voluminous processes

Alexandre David Olivier Maurer

When a shoal of small fishes notices a predator, they typically change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. This motivates us to design algorithms with similar properties. In this p ...

EPFL2016

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Pascal Frossard

In free viewpoint video, a viewer can choose at will any camera angle or the so-called "virtual view" to observe a dynamic 3-D scene, enhancing his/her depth perception. The virtual view is synthesized using texture and depth videos of two anchor camera vi ...

2015

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Distributed Deconfliction Algorithm for Unmanned Aerial Vehicles with Limited Range and Field of View Sensors

Denis Gillet, Alcherio Martinoli, Steven Adriaan Roelofsen

This paper proposes a novel approach for collision avoidance between Unmanned Aerial Vehicles (UAVs) with limited range and field of view sensors. The algorithm is designed for unicycle vehicles that need to fly above a specific minimal speed to maintain f ...

2015

Nonholonomic source seeking in switching random fields

Graph Chatbot

Chat with Graph Search

An Algorithm for Odor Source Localization based on Source Term Estimation

An Algorithm for Odor Source Localization based on Source Term Estimation

Overlapping Multi-Bandit Best Arm Identification

Freight railway network design problem

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Dynamic Facility Location via Exponential Clocks

Pattern formation with voluminous processes

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Centrality of trees for capacitated -center

Distributed Deconfliction Algorithm for Unmanned Aerial Vehicles with Limited Range and Field of View Sensors

Pattern formation with voluminous processes

Freight railway network design problem

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

An Algorithm for Odor Source Localization based on Source Term Estimation

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Dynamic Facility Location via Exponential Clocks

An Algorithm for Odor Source Localization based on Source Term Estimation

Overlapping Multi-Bandit Best Arm Identification

Distributed Deconfliction Algorithm for Unmanned Aerial Vehicles with Limited Range and Field of View Sensors

Centrality of trees for capacitated -center