Nisha Rathode (Editor)

Shlomo Zilberstein

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Name
  
Shlomo Zilberstein


Shlomo Zilberstein httpsuploadwikimediaorgwikipediacommonsthu

Institutions
  
University of Massachusetts, Amherst

Thesis
  
Operational Rationality Through Compilation of Anytime Algorithms (1993)

Known for
  
Anytime Algorithms Decentralized Partially Observable Markov Decision Processes

Alma mater
  
University of California, Berkeley, Technion – Israel Institute of Technology

Fields
  
Artificial intelligence, Computer Science

Doctoral advisor
  
Stuart J. Russell

Residence
  
United States of America

UMass Amherst Distinguished Faculty Lecture 2019, Professor Shlomo Zilberstein


Shlomo Zilberstein (Hebrew: שלמה זילברשטיין; born 1960) is an Israeli-American computer scientist. He is a Professor of Computer Science and Associate Dean for Research and Engagement in the College of Information and Computer Sciences at the University of Massachusetts, Amherst. He graduated with a B.A. in Computer Science summa cum laude from Technion – Israel Institute of Technology in 1982, and a Ph.D. in Computer Science from University of California at Berkeley in 1993, advised by Stuart J. Russell. He is known for his contributions to artificial intelligence, anytime algorithms, multi-agent systems, and automated planning and scheduling algorithms, notably within the context of Markov decision processes (MDPs), Partially Observable MDPs (POMDPs), and Decentralized POMDPs (Dec-POMDPs).

Contents

Research

His research is in the area of artificial intelligence, specifically automated planning, in addition to decision theory, reasoning under uncertainty, heuristic search, automated coordination and communication, and reinforcement learning.

He directs the Resource-Bounded Reasoning Laboratory at the University of Massachusetts, Amherst. In 2002, Daniel S. Bernstein, Robert Givan, Neil Immerman, and Shlomo Zilberstein introduced the Decentralized POMDP which extends the widely used single-agent POMDP model to a multi-agent scenario (Dec-POMDP). He has also developed AI algorithms for semi-autonomous systems with potential applications to semi-autonomous cars.

Service and awards

He served as editor-and-chief of the Journal of Artificial Intelligence Research and associate editor of the Journal of Autonomous Agents and Multi-Agent Systems. Additionally, he served as chair of the conference committee for both the Twenty-Ninth and Thirtieth AAAI Conference on Artificial Intelligence. The National Science Foundation awarded Dr. Zilberstein with the RIA, CAREER, and ITR awards. In 2011, he was elected as a fellow of the Association for the Advancement of Artificial Intelligence.

Selected publications

  • Bernstein, Daniel S.; Givan, Robert; Immerman, Niel; and Zilberstein, Shlomo (2002). "The Complexity of Decentralized Control of Markov Decision Processes" (PDF). Mathematics of Operations Research. 27 (4): 819–840. doi:10.1287/moor.27.4.819.297. CS1 maint: Multiple names: authors list (link)
  • Hansen, Eric A.; Zilberstein, Shlomo (2001). "LAO*: A Heuristic Search Algorithm that Finds Solutions with Loops" (PDF). Artificial Intelligence. 129 (1-2): 35–62. doi:10.1016/s0004-3702(01)00106-0. 
  • Zilberstein, Shlomo (1996). "Using Anytime Algorithms in Intelligent Systems" (PDF). AI Magazine. 17 (3): 73–83. 
  • References

    Shlomo Zilberstein Wikipedia