Ali Reza Pedram

Ali Reza Pedram

Auto-generated profile, based on publicly available information

Ali Reza Pedram

University of Texas at Austin

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 April 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
TTTakashi Tanaka
Takashi Tanaka
ENEhsan Nekouei
Ehsan Nekouei
APAli Reza Pedram
Ali Reza Pedram
KJKarl Henrik Johansson
Karl Henrik Johansson
We consider a dynamic traffic routing game over an urban road network involving a large number of drivers in which each driver selecting a particular route is subject to a penalty that is affine in the logarithm of the number of drivers selecting the same route. We show that the mean-field approximation of such a game leads to the so-called linearly solvable Markov decision process, implying that its mean-field equilibrium (MFE) can be found simply by solving a finite-dimensional linear system backward in time. Based on this backward-only characterization, it is further shown that the obtained MFE has the notable property of strong time-consistency. A connection between the obtained MFE and a particular class of fictitious play is also discussed.

28 December 2022 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
APAli Reza Pedram
Ali Reza Pedram
RFRiku Funada
Riku Funada
TTTakashi Tanaka
Takashi Tanaka
In this article, we propose a path planning methodology for a mobile robot navigating through an obstacle-filled environment to generate a reference path that is traceable with moderate sensing efforts. The desired reference path is characterized as the shortest path in an obstacle-filled Gaussian belief manifold equipped with a novel information-geometric distance function. The distance function we introduce is shown to be an asymmetric quasi-pseudometric and can be interpreted as the minimum information gain required to steer the Gaussian belief. An RRT*-based numerical solution algorithm is presented to solve the formulated shortest-path problem. To gain insight into the asymptotic optimality of the proposed algorithm, we show that the considered path length function is continuous with respect to the topology of total variation. Simulation results demonstrate that the proposed method is effective in various robot navigation scenarios to reduce sensing costs, such as the required frequency of sensor measurements and the number of sensors that must be operated simultaneously.

27 February 2022 in International Journal of Robust and Nonlinear Control
Verified
Journal Article
Closed access
HJHyunho Jung
Hyunho Jung
APAli Reza Pedram
Ali Reza Pedram
TCTravis C. Cuvelier
Travis C. Cuvelier
TTTakashi Tanaka
Takashi Tanaka

20 June 2025 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
GRGeorge Rapakoulias
George Rapakoulias
APAli Reza Pedram
Ali Reza Pedram
PTPanagiotis Tsiotras
Panagiotis Tsiotras
The Mean-Field Schrödinger Bridge (MFSB) problem is an optimization problem aiming to find the minimum effort control policy to drive a McKean-Vlassov stochastic differential equation from one probability measure to another. In the context of multi-agent control, the objective is to control the configuration of a swarm of identical, interacting cooperative agents, as captured by the time-varying probability measure of their state. Available methods for solving this problem for distributions with continuous support rely either on spatial discretizations of the problem’s domain or on approximating optimal solutions using neural networks trained through stochastic optimization schemes. For agents following Linear Time Varying dynamics, and for Gaussian Mixture Model boundary distributions, we propose a highly efficient parameterization to approximate the optimal solutions of the corresponding MFSB in closed form, without any learning step. Our proposed approach consists of a mixture of elementary policies, each solving a Gaussian-to-Gaussian Covariance Steering problem from the components of the initial mixture to the components of the terminal mixture. Leveraging the semidefinite formulation of the Covariance Steering problem, the proposed solver can handle probabilistic constraints on the system’s state while maintaining numerical tractability. We illustrate our approach on a variety of numerical examples.

14 December 2021
Verified
Conference Paper
Open access
APAli Reza Pedram
Ali Reza Pedram
RFRiku Funada
Riku Funada
TTTakashi Tanaka
Takashi Tanaka
This paper considers the problem of task-dependent (top-down) attention allocation for vision-based autonomous navigation using known landmarks. Unlike the existing paradigm in which landmark selection is formulated as a combinatorial optimization problem, we model it as a resource allocation problem where the decision-maker (DM) is granted extra freedom to control the degree of attention to each landmark. The total resource available to DM is expressed in terms of the capacity limit of the in-take information flow, which is quantified by the directed information from the state of the environment to the DM’s observation. We consider a receding horizon implementation of such a controlled sensing scheme in the Linear-Quadratic-Gaussian (LQG) regime. The convex-concave procedure is applied in each time step, whose time complexity is shown to be linear in the horizon length if the alternating direction method of multipliers (ADMM) is used. Numerical studies show that the proposed formulation is sparsity-promoting in the sense that it tends to allocate zero data rate to uninformative landmarks.

2 October 2019 in arXiv
Verified
Preprint
Open access
PDF file
APAli Reza Pedram
Ali Reza Pedram
TTTakashi Tanaka
Takashi Tanaka
We study the traffic routing game among a large number of selfish drivers over a traffic network. We consider a specific scenario where the strategic drivers can be classified into teams, where drivers in the same team have identical payoff functions. An incentive mechanism is considered to mitigate congestion, where each driver is subject to dynamic tax penalties. We explore a special case in which the tax is affine in the logarithm of the number of drivers selecting the same route from each team. It is shown via a mean-field approximation that a Nash equilibrium in the limit of a large population can be found by linearly solvable algorithms.