Related papers: A Semidefinite Relaxation for Air Traffic Flow Sch…
In this paper we propose and apply the enhanced semidefinite relaxation technique for solving a class of non-convex quadratic optimization problems. The approach is based on enhancing the semidefinite relaxation methodology by complementing…
Existing macroscopic traffic control methods often struggle to strictly regulate rare, safety-critical extreme events under stochastic disturbances. In this paper, we develop a rare chance-constrained optimal control framework for…
In this paper, we introduce a generalized dynamical unbalanced optimal transport framework by incorporating limited control input and mass dissipation, addressing limitations in conventional optimal transport for control applications. We…
Bio-Inspired Algorithms on Road Traffic Congestion and safety is a very promising research problem. Searching for an efficient optimization method to increase the degree of speed optimization and thereby increasing the traffic Flow in an…
We consider the problem of scheduling arrivals to a congestion system with a finite number of users having identical deterministic demand sizes. The congestion is of the processor sharing type in the sense that all users in the system at…
While motion planning approaches for automated driving often focus on safety and mathematical optimality with respect to technical parameters, they barely consider convenience, perceived safety for the passenger and comprehensibility for…
Semidefinite programming (SDP) is a powerful framework from convex optimization that has striking potential for data science applications. This paper develops a provably correct randomized algorithm for solving large, weakly constrained SDP…
In this research a continuous model for resource allocations in a queuing system is considered and a local prediction on the system behavior is developed. As a result we obtain a set of possible cases, some of which lead to quite clear…
The use of convex relaxations has lately gained considerable interest in Power Systems. These relaxations play a major role in providing global optimality guarantees for non-convex optimization problems. For the Optimal Power Flow (OPF)…
We discuss numerical strategies to deal with PDE systems describing traffic flows, taking into account a density threshold, which restricts the vehicles density in the situation of congestion. These models are obtained through asymptotic…
In this paper, we study randomized and cyclic coordinate descent for convex unconstrained optimization problems. We improve the known convergence rates in some cases by using the numerical semidefinite programming performance estimation…
In this paper, we consider the optimal power flow (OPF) problem which consists in determining the power production at each bus of an electric network by minimizing the production cost. Our contribution is an exact solution algorithm for the…
This paper studies how to solve semi-infinite polynomial programming (SIPP) problems by semidefinite relaxation method. We first introduce two SDP relaxation methods for solving polynomial optimization problems with finitely many…
This paper addresses the design of input signals for the purpose of discriminating among a finite set of models dynamic systems within a given finite time interval. A motivating application is fault detection and isolation. We propose…
We investigate how to control optimally a traffic flow through a junction on the line by acting only on speed reduction or traffic light at the junction. We show the existence of an optimal control and, under structure assumptions, provide…
We consider optimal control problems for partial differential equations where the controls take binary values but vary over the time horizon, they can thus be seen as dynamic switches. The switching patterns may be subject to combinatorial…
The need to guarantee hard delay bounds to traffic flows with deterministic traffic profiles, e.g., token buckets, arises in a number of network settings. Of interest are solutions that offer such guarantees while minimizing network…
This paper develops a novel second order cone relaxation of the semidefinite programming formulation of optimal power flow, that does not imply the `angle relaxation'. We build on a technique developed by Kim et al., extend it for complex…
The economic dispatch problem is considered for unbalanced three-phase power distribution networks entailing both non-deferrable and elastic loads, and distributed generation (DG) units. The objective is to minimize the costs of power drawn…
In this paper, we study the stability of light traffic achieved by a scheduling algorithm which is suitable for heterogeneous traffic networks. Since analyzing a scheduling algorithm is intractable using the conventional mathematical tool,…