An Algorithm for Odor Source Localization based on Source Term Estimation

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

In this paper, we study sampling from a posterior derived from a neural network. We propose a new probabilistic model consisting of adding noise at every pre- and post-activation in the network, arguing that the resulting posterior can be sampled using an ...

Navigation of drones is predominantly based on sensor fusion algorithms. Most of these algorithms make use of some form of Bayesian filtering with a majority employing an Extended Kalman Filter (EKF), wherein inertial measurements are fused with a Global N ...

Graph neural networks (GNNs) have demonstrated promising performance across various chemistry-related tasks. However, conventional graphs only model the pairwise connectivity in molecules, failing to adequately represent higher order connections, such as m ...

Despite the importance and pervasiveness of Wikipedia as one of the largest platforms for open knowledge, surprisingly little is known about how people navigate its content when seeking information. To bridge this gap, we present the first systematic large ...

The advent of comprehensive synaptic wiring diagrams of large neural circuits has created the field of connectomics and given rise to a number of open research questions. One such question is whether it is possible to reconstruct the information stored in ...

The success of drone missions is incumbent on an accurate determination of the drone pose and velocity, which are collectively estimated by fusing iner- tial measurement unit and global navigation satellite system (GNSS) mea- surements. However, during a G ...

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Two prominent categories for achieving coordinated multirobot displacement are flocking and navigation in formation. Both categories have their own body of literature and characteristics, including their respective advantages and disadvantages. While typic ...

As historical stone masonry structures are vulnerable and prone to damage in earthquakes, investigating their structural integrity is important to reduce injuries and casualties while preserving their historical value. Stone masonry is a composite material ...

Loop closure detection helps simultaneous localization and mapping systems reduce map and state uncertainty via recognizing previously visited places along the path of a mobile robot. However, visual loop closure detection is susceptible to scenes with dyn ...

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

Every day millions of people read Wikipedia. When navigating the vast space of available topics using hyperlinks, readers describe trajectories on the article network. Understanding these navigation patterns is crucial to better serve readers' needs and ad ...

The Vehicle Dynamic Model (VDM) based navigation of fixed-wing drones determines the airborne trajectory in conjunction with Inertial Measurement Unit (IMU) sensors. Without Global Navigation Satellite Systems (GNSS) signals, this method estimates navigati ...

Recent advances in computational neuroscience have demonstrated the usefulness and importance of stochastic, spatial reaction-diffusion simulations. However, ever increasing model complexity renders traditional serial solvers, as well as naive parallel imp ...

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

We show that a constant factor approximation of the shortest and closest lattice vector problem in any l(p)-norm can be computed in time 2((0.802 + epsilon)n). This matches the currently fastest constant factor approximation algorithm for the shortest vect ...

Astrobot swarms are used to capture astronomical signals to generate the map of the observable universe for the purpose of dark energy studies. The convergence of each swarm in the course of its coordination has to surpass a particular threshold to yield a ...

An Algorithm for Odor Source Localization based on Source Term Estimation

Chat with Graph Search

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

A ride time-oriented scheduling algorithm for dial-a-ride problems

Gibbs sampling the posterior of neural networks

VDMNav: Software Architecture for Aerodynamically Constrained Navigation on Small Fixed-Wing Drones

Molecular hypergraph neural networks

A Large-Scale Characterization of How Readers Browse Wikipedia

Bayesian reconstruction of memories stored in neural networks from their connectivity

Identifying aerodynamics of small fixed-wing drones using inertial measurements for model-based navigation

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Results on Sparse Integer Programming and Geometric Independent Sets

Hybrid Flock - Formation Control Algorithms

Geometrical Treatise on the Modelling of 3D Particulate Inclusion-Matrix Microstructures with an Application to Historical Stone Masonry Walls

PlaceNet: A multi-scale semantic-aware model for visual loop closure detection

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Wikipedia Reader Navigation: When Synthetic Data Is Enough

Optimization and Real-Time Aspects of Aircraft Model-Based Navigation

STEPS 4.0: Fast and memory-efficient molecular simulations of neurons at the nanoscale

Formula Normalizations in Verification

Approximate CVPp in time 2(0.802n)

Learning convergence prediction of astrobots in multi-object spectrographs