World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
71
Citations
19488
World Ranking
1779
National Ranking
900

Research.com Recognitions

  • 2013 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For significant contributions to planning, decision making and coordination for robots and other situated agents.

Overview

Sven Koenig is affiliated with the University of Southern California in the United States. Their research primarily focuses on computer science, with a notable emphasis on subfields such as Computer Vision and Pattern Recognition, Artificial Intelligence, Computer Networks and Communications, Industrial and Manufacturing Engineering, and Computational Theory and Mathematics.

Their work spans diverse topics, including:

  • Robotic Path Planning Algorithms
  • Optimization and Search Problems
  • AI-based Problem Solving and Planning
  • Vehicle Routing Optimization Methods
  • Multimodal Machine Learning Applications
  • Constraint Satisfaction and Optimization
  • Logic, Reasoning, and Knowledge

Among recent publications associated with Sven Koenig, several stand out by their titles, years, and venues:

  • Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks (2021) - Proceedings of the International Symposium on Combinatorial Search
  • Lifelong Multi-Agent Path Finding in Large-Scale Warehouses (2021) - Proceedings of the AAAI Conference on Artificial Intelligence
  • EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding (2021) - Proceedings of the AAAI Conference on Artificial Intelligence
  • A Differentiated Discussion About AI Education K-12 (2021) - KI - Künstliche Intelligenz
  • Pairwise symmetry reasoning for multi-agent path finding search (2021) - Artificial Intelligence

Koenig has collaborated frequently with several coauthors, reflecting sustained partnerships in research. Frequent coauthors include Jiaoyang Li, T. K. Satish Kumar, Ariel Felner, Peter J. Stuckey, and Shao-Hung Chan.

Their publications are often presented at key academic venues, including:

  • Proceedings of the International Symposium on Combinatorial Search
  • arXiv (Cornell University)
  • Proceedings of the International Conference on Automated Planning and Scheduling
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Artificial Intelligence

Sven Koenig has been recognized as a Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) since 2013 for contributions in planning, decision making, and coordination for robots and other situated agents.

Best Publications

  • D*lite

    Sven Koenig;Maxim Likhachev

  • Fast replanning for navigation in unknown terrain

    S. Koenig;M. Likhachev

  • Lifelong planning A

    Sven Koenig;Maxim Likhachev;David Furcy

  • Probabilistic robot navigation in partially observable environments

    Reid Simmons;Sven Koenig

  • Theta*: any-angle path planning on grids

    Kenny Daniel;Alex Nash;Sven Koenig;Ariel Felner

  • Improved fast replanning for robot navigation in unknown terrain

    S. Koenig;M. Likhachev

  • Theta*: any-angle path planning on grids

    Alex Nash;Kenny Daniel;Sven Koenig;Ariel Feiner

  • Auction-Based Multi-Robot Routing

    Michail G. Lagoudakis;Evangelos Markakis;David Kempe;Pinar Keskinocak

  • Lazy theta*: any-angle path planning and path length analysis in 3D

    Alex Nash;Sven Koenig;Craig Tovey

  • Heuristic Search: Theory and Applications

    Stefan Edelkamp;Stefan Schroedl;Sven Koenig

  • A layered architecture for office delivery robots

    Reid Simmons;Richard Goodwin;Karen Zita Haigh;Sven Koenig

  • Xavier: a robot navigation architecture based on partially observable Markov decision process models

    Sven Koenig;Reid G. Simmons

  • Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

    Roni Stern;Nathan R. Sturtevant;Ariel Felner;Sven Koenig

  • BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm

    William Yeoh;Ariel Felner;Sven Koenig

  • Domain-independent construction of pattern database heuristics for cost-optimal planning

    Patrik Haslum;Adi Botea;Malte Helmert;Blai Bonet

  • Robot exploration with combinatorial auctions

    M. Berhault;H. Huang;P. Keskinocak;S. Koenig

  • Lifelong Multi-Agent Path Finding in Large-Scale Warehouses.

    Jiaoyang Li;Andrew Tinka;Scott Kiesel;Joseph W. Durham

  • Simple auctions with performance guarantees for multi-robot task allocation

    M.G. Lagoudakis;M. Berhault;S. Koenig;P. Keskinocak

  • Efficient and inefficient ant coverage methods

    Sven Koenig;Boleslaw Szymanski;Yaxin Liu

  • Building Terrain-Covering Ant Robots: A Feasibility Study

    Jonas Svennebring;Sven Koenig

  • Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

    Roni Stern;Nathan Sturtevant;Ariel Felner;Sven Koenig

  • Unsupervised learning of probabilistic models for robot navigation

    S. Koenig;R.G. Simmons

Frequent Co-Authors

Ariel Felner
Ariel Felner Ben-Gurion University of the Negev
Craig A. Tovey
Craig A. Tovey Georgia Institute of Technology
Nathan R. Sturtevant
Nathan R. Sturtevant University of Alberta
Maxim Likhachev
Maxim Likhachev Carnegie Mellon University
Peter J. Stuckey
Peter J. Stuckey Monash University
Reid Simmons
Reid Simmons Carnegie Mellon University
Robert C. Holte
Robert C. Holte University of Alberta
Shlomo Zilberstein
Shlomo Zilberstein University of Massachusetts Amherst
Pinar Keskinocak
Pinar Keskinocak Georgia Institute of Technology
Gaurav S. Sukhatme
Gaurav S. Sukhatme University of Southern California

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 online education in Computer Science opens the door to multiple opportunities and flexible pathways. Aspiring students can consider a range of degrees and certifications that offer both convenience and career advancement potential.

For those new to the field, obtaining an associate's degree online can be a fast and accessible way to build foundational skills. This can help kickstart your tech career or serve as a stepping stone toward a bachelor’s degree.

Many professionals look for easy certifications to get online to quickly acquire industry-relevant credentials. These certifications can boost your resume and demonstrate expertise in specialized areas, often in just a few months.

If you’re looking to accelerate your education, the quickest cheapest masters degree programs allow you to advance your qualifications without a lengthy or costly commitment. These fast-tracked programs are ideal for career changers or those seeking a competitive edge.

When considering long-term value, it’s essential to focus on graduate degrees that are worth it. These in-demand programs can lead to higher earning potentials and broaden your job prospects in the ever-evolving tech industry.

Best Scientists Citing Sven Koenig

Trending Scientists