Sciweavers

1927 search results - page 26 / 386
» UMDAs for dynamic optimization problems
Sort
View
ISVC
2007
Springer
16 years 17 days ago
Combinatorial Shape Decomposition
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
Ralf Juengling, Melanie Mitchell
CCE
2004
15 years 6 months ago
Continuous reformulations of discrete-continuous optimization problems
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
Oliver Stein, Jan Oldenburg, Wolfgang Marquardt
HYBRID
2001
Springer
15 years 11 months ago
Hybrid Geodesics as Optimal Solutions to the Collision-Free Motion Planning Problem
In this paper we address the problem of designing energy minimizing collision-free maneuvers for multiple agents moving on a plane. We show that the problem is equivalent to that o...
Jianghai Hu, Maria Prandini, Karl Henrik Johansson...
JSAC
2007
109views more  JSAC 2007»
15 years 6 months ago
Optimization of Semi-Dynamic Lightpath Rearrangements in a WDM Network
— In this paper, we study the Routing and Wavelength Assignment (RWA) problem in a semi-dynamic scenario where rearrangements are conducted in a series of sessions after traffic...
Yiming Zhang, Oliver W. W. Yang, Jing Wu, Michel S...
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
15 years 1 months ago
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
Lanshan Han, M. Kanat Camlibel, Jong-Shi Pang, W. ...