Safety Verification for Urban Air Mobility Scheduling

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.

The problem of learning graphons has attracted considerable attention across several scientific communities, with significant progress over the re-cent years in sparser regimes. Yet, the current techniques still require diverg-ing degrees in order to succe ...

Under certain conditions, the ionization of a molecule may create a superposition of electronic states, leading to ultrafast electron dynamics. If controlled, this motion could be used in attochemistry applications, but it has been shown that the decoheren ...

This letter proposes a data-driven input reconstruction method from outputs (IRO) based on the Willems' Fundamental Lemma. Given only output measurements, the unknown inputsestimated recursively by the IRO asymptotically converge to the true input without ...

Most human-robot interfaces, such as joysticks and keyboards, require training and constant cognitive effort and provide a limited degree of awareness of the robots’ state and its environment. Embodied interactions, that is the bidirectional link between t ...

Many modern services need to routinely perform tasks on a large scale. This prompts us to consider the following question: How can we design efficient algorithms for large-scale computation? In this thesis, we focus on devising a general strategy to addr ...

We study jump-penalized estimators based on least absolute deviations which are often referred to as Potts estimators. They are estimators for a parsimonious piecewise constant representation of noisy data having a noise distribution which has heavier tail ...

In this paper we consider the binary transfer learning problem, focusing on how to select and combine sources from a large pool to yield a good performance on a target task. Constraining our scenario to real world, we do not assume the direct access to the ...

In this paper, we study the data exchange problem, where a set of users is interested in gaining access to a common file, but where each has only partial knowledge about it as side-information. Assuming that the file is broken into packets, the side-inform ...

In this paper we present a new reduced basis technique for parametrized nonlinear scalar conservation laws in presence of shocks. The essential ingredients are an efficient algorithm to approximate the shock curve, a procedure to detect the smooth componen ...

The level set method is a popular technique for tracking moving interfaces in several disciplines including computer vision and fluid dynamics. However, despite its high flexibility, the original level set method is limited by two important numerical issue ...

This paper describes an efficient algorithm to predict the RF gas breakdown power threshold in microwave devices with complex geometries. The two necessary calculations when investigating such a phenomenon have been performed: on the one hand, the computat ...

Distributed constraint optimization (DCOP) provides a framework for coordinated decision making by a team of agents. Often, during the decision making, capacity constraints on agents' resource consumption must be taken into account. To address such scenari ...

We present a general framework and an efficient algorithm for tracking relevant video structures. The structures to be tracked are implicitly defined by a Matching Pursuit procedure that extracts and ranks the most important image contours. Based on the ra ...

The performances of approximation using redundant expansions rely on having dictionaries adapted to the signals. In natural high-dimensional data, the statistical dependencies are, most of the time, not obvious. Learning fundamental patterns is an alternat ...

In this paper, we study dynamic protocol update (DPU). Contrary to local code updates on-the-fly, DPU requires global coordination of local code replacements. We propose a novel solution to DPU. The key idea is to add a level of indirection between the ser ...

The linear complementarity problem (LCP) is a general problem that unifies linear and quadratic programs and bimatrix games. In this paper, we present an efficient algorithm for the solution to multiparametric linear complementarity problems (pLCPs) that a ...

Recent advances in process synthesis, design, operations, and control have created an increasing demand for efficient numerical algorithms for optimizing a dynamic system coupled with discrete decisions; these problems are termed mixed-integer dynamic opti ...

Safety Verification for Urban Air Mobility Scheduling

Chat with Graph Search

Learning Sparse Graphons And The Generalized Kesten-Stigum Threshold

How to Find Molecules with Long-lasting Charge Migration?

Data-Driven Input Reconstruction and Experimental Validation

Embodied Flight with a Drone

When Stuck, Flip a Coin : New Algorithms for Large-Scale Tasks

Jump-Penalized Least Absolute Values Estimation of Scalar or Circle-Valued Signals

Scalable greedy algorithms for transfer learning

Efficient Algorithms for the Data Exchange Problem

Reduced Basis Techniques For Nonlinear Conservation Laws

An Efficient Algorithm for Level Set Method Preserving Distance Function

Microwave Corona Breakdown Prediction in Arbitrarily-Shaped Waveguide Based Filter

Distributed Constraint Optimization with Structured Resource Constraints

Tracking Atoms with Particles for Audio-visual Source Localization

MoTIF: An Efficient Algorithm for Learning Translation Invariant Dictionaries

Structural and Algorithmic Issues of Dynamic Protocol Update

Multiparametric Linear Complementarity Problems

Global mixed-integer dynamic optimization