World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
48
Citations
14993
World Ranking
6040
National Ranking
2722

Research.com Recognitions

  • 2015 - IEEE Fellow For contributions to networked control systems

Overview

Mehran Mesbahi is affiliated with the University of Washington in the United States. Their research spans extensive work primarily within the fields of Engineering and Computer Science, focusing particularly on Control and Systems Engineering, Aerospace Engineering, and Computer Networks and Communications. Additional subfields include Statistical and Nonlinear Physics and Artificial Intelligence.

The scientist's principal research topics cover a range of areas related to control systems and networked technologies. These include:

  • Distributed Control Multi-Agent Systems
  • Neural Networks Stability and Synchronization
  • Advanced Control Systems Optimization
  • Spacecraft Dynamics and Control
  • Control Systems and Identification
  • Reinforcement Learning in Robotics
  • Model Reduction and Neural Networks

Mehran Mesbahi has a significant publication record, with frequent contributions to several notable venues. The primary publication platforms include:

  • arXiv (Cornell University)
  • IEEE Transactions on Automatic Control
  • Journal of Guidance Control and Dynamics
  • IEEE Control Systems Letters
  • Automatica

Recent papers authored or coauthored by Mehran Mesbahi include:

  • "Dual Quaternion-Based Powered Descent Guidance with State-Triggered Constraints," 2020, Journal of Guidance Control and Dynamics
  • "Toward a Theoretical Foundation of Policy Optimization for Learning Control Policies," 2023, Annual Review of Control Robotics and Autonomous Systems
  • "From Noisy Data to Feedback Controllers: Nonconservative Design via a Matrix S-Lemma," 2020, IEEE Transactions on Automatic Control
  • "Consensus on Matrix-Weighted Switching Networks," 2021, IEEE Transactions on Automatic Control
  • "A Real-Time Algorithm for Non-Convex Powered Descent Guidance," 2020, AIAA Scitech 2020 Forum

The scientist has collaborated extensively with a group of frequent coauthors, including:

  • Shahriar Talebi (19 publications together)
  • Behçet Açıkmeşe (15 publications together)
  • Lulu Pan (11 publications together)
  • Yugeng Xi (11 publications together)
  • Dewei Li (11 publications together)

Mehran Mesbahi was recognized as an IEEE Fellow in 2015 with the citation for contributions to networked control systems.

Best Publications

  • Graph Theoretic Methods in Multiagent Networks

    Mehran Mesbahi;Magnus Egerstedt

  • On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian

    Yoonsoo Kim;M. Mesbahi

  • Formation Flying Control of Multiple Spacecraft via Graphs, Matrix Inequalities, and Switching

    Mehran Mesbahi;Fred Y. Hadaegh

  • Agreement over random networks

    Y. Hatano;M. Mesbahi

  • Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective

    Amirreza Rahmani;Meng Ji;Mehran Mesbahi;Magnus Egerstedt

  • Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulator.

    Maryam Fazel;Rong Ge;Sham M. Kakade;Mehran Mesbahi

  • From noisy data to feedback controllers: non-conservative design via a matrix S-lemma

    Henk J. van Waarde;M. Kanat Camlibel;Mehran Mesbahi

  • On the rank minimization problem over a positive semidefinite linear matrix inequality

    M. Mesbahi;G.P. Papavassilopoulos

  • Edge Agreement: Graph-Theoretic Performance Bounds and Passivity Analysis

    Daniel Zelazo;Mehran Mesbahi

  • Exotic states in a simple network of nanoelectromechanical oscillators

    Matthew Matheny;Jeffrey Emenheiser;Warren Fon;Airlie Chapman

  • On State-dependent dynamic graphs and their controllability properties

    M. Mesbahi

  • Controllability and Observability of Network-of-Networks via Cartesian Products

    Airlie Chapman;Marzieh Nabi-Abdolyousefi;Mehran Mesbahi

  • On strong structural controllability of networked systems: A constrained matching approach

    Airlie Chapman;Mehran Mesbahi

  • Feedback control for spacecraft reorientation under attitude constraints via convex potentials

    Unsik Lee;Mehran Mesbahi

  • Quadratically constrained attitude control via semidefinite programming

    Yoonsoo Kim;M. Mesbahi

  • On the Structural and Strong Structural Controllability of Undirected Networks

    Shima Sadat Mousavi;Mohammad Haeri;Mehran Mesbahi

  • Online distributed optimization via dual averaging

    Saghar Hosseini;Airlie Chapman;Mehran Mesbahi

  • On the controlled agreement problem

    A. Rahmani;M. Mesbahi

  • Network identification via node knock-out

    Marzieh Nabi-Abdolyousefi;Mehran Mesbahi

  • Online Distributed Optimization on Dynamic Networks

    Saghar Hosseini;Airlie Chapman;Mehran Mesbahi

  • LQR through the Lens of First Order Methods: Discrete-time Case.

    Jingjing Bu;Afshin Mesbahi;Maryam Fazel;Mehran Mesbahi

  • Technical Notes and Correspondence on the Rank Minimization Problem Over a Positive Semidefinite Linear Matrix Inequality

    G. P. Papavassilopoulos;M. Mesbahi

Frequent Co-Authors

Behcet Acikmese
Behcet Acikmese The University of Texas at Austin
Magnus Egerstedt
Magnus Egerstedt University of North Carolina at Chapel Hill
Fred Y. Hadaegh
Fred Y. Hadaegh Jet Propulsion Lab
Mohammad Haeri
Mohammad Haeri Sharif University of Technology
James P. Crutchfield
James P. Crutchfield University of California, Davis
Sham M. Kakade
Sham M. Kakade Harvard University
Mark Groudine
Mark Groudine Fred Hutchinson Cancer Research Center
Rong Ge
Rong Ge Duke University
Michael L. Roukes
Michael L. Roukes California Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science online opens up numerous flexible education options to suit different backgrounds and needs. For budget-conscious learners, there are cheap online degrees fast—offering high-quality programs at lower costs and shorter timelines. This makes it easier to start or advance your tech career without a heavy financial burden.

Students with academic challenges can find the best colleges for low gpa applicants, ensuring that previous grades don’t have to stand in the way of a strong future in IT. More and more institutions are accommodating diverse learning journeys and recognizing potential beyond transcripts.

Broadening your options, you might also consider tech-adjacent fields. For instance, Computer Science majors interested in sustainability can explore jobs for environmental science majors. The industries often overlap, with roles in data analysis, environmental modeling, and tech-driven research.

If speed is your priority, the fastest computer science degree pathways deliver intensive, condensed curricula that quickly prepare you for high-demand careers. This flexibility and variety ensure that there’s a suitable online path in Computer Science for everyone.

Best Scientists Citing Mehran Mesbahi

Trending Scientists

Recently Published Articles