Concept

Dynamic programming

Related publications (204)

Automated Reconstruction of Tree Structures using Path Classifiers and Mixed Integer Programming

Pascal Fua, Engin Türetken, Fethallah Benmansour

Although tracing linear structures in 2D images and 3D image stacks has received much attention over the years, full automation remains elusive. In this paper, we formulate the delineation problem as one of solving a Quadratic Mixed Integer Program (Q-MIP) ...

2012

Semi-Supervised and Unsupervised Novelty Detection using Nested Support Vector Machines

Jean-Philippe Thiran, Volker Gass, Frank Grégoire Jean de Morsier, Maurice Borgeaud

Very often in change detection only few labels or even none are available. In order to perform change detection in these extreme scenarios, they can be considered as novelty detection problems, semi-supervised (SSND) if some labels are available otherwise ...

Ieee2012

A stochastic reach-avoid problem with random obstacles

Maryam Kamgarpour, John Lygeros

We present a dynamic programming based solution to a stochastic reachability problem for a controlled discrete-time stochastic hybrid system. A sum-multiplicative cost function is introduced along with a corresponding dynamic recursion which quantifies the ...

ACM Press2011

Optimal Exact Path-Following for Constrained Differentially Flat Systems

Timm Faulwasser

We propose a dynamic optimization approach to calculate optimal feedforward controls for exact path-following problems of differentially flat systems. Besides the derivation of a small dimensional optimal control problem, we provide easily checkable condit ...

2011

Multiple Object Tracking using K-Shortest Paths Optimization

Pascal Fua, François Fleuret, Engin Türetken, Jérôme Berclaz

Multi-object tracking can be achieved by detecting objects in individual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in previ ...

Institute of Electrical and Electronics Engineers2011

Modifier Adaptation for Run-to-Run Optimization of Transient Processes

Dominique Bonvin, Grégory François, Sean Costello

Dynamic optimization can be used to determine optimal input profiles for dynamic processes. Due to plant-model mismatch and disturbances, the optimal inputs determined through model-based optimization will, in general, not be optimal for the plant. Modifie ...

2011

Discrete time stochastic hybrid dynamical games: Verification & controller synthesis

Maryam Kamgarpour

This paper presents a framework for analyzing probabilistic safety and reachability problems for discrete time stochastic hybrid systems in scenarios where system dynamics are affected by rational competing agents. In particular, we consider a zero-sum gam ...

2011

Decentralized flight path planning for air traffic management

Maryam Kamgarpour, Wei Zhang

This paper studies the flight path planning problem for a large-scale air traffic management (ATM) system. The goal is to find the optimal 4D path plan, represented by a sequence of waypoints and the corresponding time stamps, for each individual flight su ...

2011

Bin Packing via Discrepancy of Permutations

Friedrich Eisenbrand, Thomas Rothvoss, Doemoetoer Palvoelgyi

A well studied special case of bin packing is the 3-partition problem, where n items of size > 1/4 have to be packed in a minimum number of bins of capacity one. The famous Karmarkar-Karp algorithm transforms a fractional solution of a suitable LP relaxati ...

Siam, 3600 Univ City Science Center, Philadelphia, Pa 19104-2688 Usa2011

Learning a feasible and stabilizing explicit model predictive control law by robust optimization

Colin Neil Jones, Melanie Nicole Zeilinger

Fast model predictive control on embedded sys- tems has been successfully applied to plants with microsecond sampling times employing a precomputed state-to-input map. However, the complexity of this so-called explicit MPC can be prohibitive even for low-d ...

2011

Graph Chatbot

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.