Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Jerome Thai"'
Publikováno v:
IEEE Transactions on Control of Network Systems. 5:370-382
Mobility-as-a-Service (MaaS) systems, such as ride-sharing services, have expanded very quickly over the past years. However, the popularity of MaaS systems make them increasingly vulnerable to denial-of-service (DOS) attacks, in which attackers atte
Autor:
Alexandre M. Bayen, Jerome Thai
Publikováno v:
Journal of Mathematical Analysis and Applications. 457:1675-1695
To impute the function of a variational inequality and the objective of a convex optimization problem from observations of (nearly) optimal decisions, previous approaches constructed inverse programming methods based on solving a convex optimization
Autor:
Alexandre M. Bayen, Jerome Thai
Publikováno v:
CDC
We study the learnability of the edge cost functions in routing games from observations of the equilibrium flows, where the learnability is measured as the minimum number of samples needed to maintain a high consistency of the empirical risk, which i
Autor:
Alexandre M. Bayen, Jerome Thai
Publikováno v:
IEEE Transactions on Automatic Control. 60:311-326
This paper investigates the problem of estimating the state of discretized hyperbolic scalar partial differential equations. It uses a Godunov scheme to discretize the so-called Lighthill–Whitham–Richards equation with a triangular flux function,
Publikováno v:
Transportation Research Procedia. 7:212-232
A new convex optimization framework is developed for the route flow estimation problem from the fusion of vehicle count and cellular network data. The issue of highly underdetermined link flow based methods in transportation networks is investigated,
Publikováno v:
ITSC
This work studies the impact of the increasing penetration of routing apps on road usage. Its conclusions apply both to manned vehicles in which human drivers follow app directions, and unmanned vehicles following shortest path algorithms. To address
Publikováno v:
2016 ACM/IEEE 7th International Conference on Cyber-Physical Systems (ICCPS).
Publikováno v:
CDC
We consider two classic problems in convex optimization: 1) minimizing a convex objective over the nonnegative orthant of the l1-ball and 2) minimizing a convex objective over the probability simplex. We propose an efficient and simple equality const
Publikováno v:
ACC
A common behavioral assumption in the modeling of traffic networks is the user equilibrium. Since traffic volumes, resulting from the rational behavior of agents, are easily but sparsely observable, and delay functions are not directly observable, we
Publikováno v:
ECC
We consider the problem of imputing the function that describes an optimization or equilibrium process from noisy partial observations of nearly optimal (possibly non-cooperative) decisions. We generalize existing inverse optimization and variational