World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
52
Citations
15628
World Ranking
4982
National Ranking
2315

Overview

Maxim Likhachev is affiliated with Carnegie Mellon University in the United States. Their research primarily spans the fields of Computer Science and Engineering, with significant contributions to subfields including Computer Vision and Pattern Recognition, Artificial Intelligence, Control and Systems Engineering, Aerospace Engineering, and Computer Networks and Communications.

The main research topics addressed by Maxim Likhachev focus on:

  • Robotic Path Planning Algorithms
  • Robot Manipulation and Learning
  • AI-based Problem Solving and Planning
  • Robotics and Sensor-Based Localization
  • Reinforcement Learning in Robotics
  • Machine Learning and Algorithms
  • Artificial Intelligence in Games

Among their recent publications are:

  • "Multirepresentation, Multiheuristic A* search-based motion planning for a free-floating underwater vehicle-manipulator system in unknown environment," 2020, Journal of Field Robotics
  • "Path Planning with Adaptive Dimensionality," 2021, Proceedings of the International Symposium on Combinatorial Search
  • "Multi-Objective Safe-Interval Path Planning With Dynamic Obstacles," 2022, IEEE Robotics and Automation Letters
  • "Enhanced Multi-Objective A* Using Balanced Binary Search Trees," 2022, Proceedings of the International Symposium on Combinatorial Search
  • "Planning Single-Arm Manipulations with N-Arm Robots," 2021, Proceedings of the International Symposium on Combinatorial Search

This body of work often appears in venues such as:

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

Maxim Likhachev frequently collaborates with other researchers, including:

  • Rishi Veerapaneni
  • Muhammad Suhail Saleem
  • Sandip Aine
  • Shohin Mukherjee
  • Jiaoyang Li

Best Publications

  • Autonomous driving in urban environments: Boss and the Urban Challenge

    Chris Urmson;Joshua Anhalt;Drew Bagnell;Christopher Baker

  • ARA*: Anytime A* with Provable Bounds on Sub-Optimality

    Maxim Likhachev;Geoffrey J. Gordon;Sebastian Thrun

  • 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

  • Anytime dynamic A*: an anytime, replanning algorithm

    Maxim Likhachev;Dave Ferguson;Geoff Gordon;Anthony Stentz

  • Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles

    Maxim Likhachev;Dave Ferguson

  • Improved fast replanning for robot navigation in unknown terrain

    S. Koenig;M. Likhachev

  • SIPP: Safe interval path planning for dynamic environments

    Mike Phillips;Maxim Likhachev

  • A Guide to Heuristic-based Path Planning

    Dave Ferguson;Maxim Likhachev;Anthony Stentz

  • Anytime search in dynamic graphs

    Maxim Likhachev;Dave Ferguson;Geoff Gordon;Anthony Stentz

  • Multi-Heuristic A*

    Sandip Aine;Siddharth Swaminathan;Venkatraman Narayanan;Victor Hwang

  • Motion planning in urban environments

    Dave Ferguson;Thomas M. Howard;Maxim Likhachev

  • Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees

    H. Brendan McMahan;Maxim Likhachev;Geoffrey J. Gordon

  • Topological constraints in search-based robot path planning

    Subhrajit Bhattacharya;Maxim Likhachev;Vijay Kumar

  • Real-time adaptive A*

    Sven Koenig;Maxim Likhachev

  • Incremental heuristic search in AI

    Sven Koenig;Maxim Likhachev;Yaxin Liu;David Furcy

  • Search-based planning for manipulation with motion primitives

    Benjamin J. Cohen;Sachin Chitta;Maxim Likhachev

  • Incremental A

    S. Koenig;M. Likhachev

  • Motion planning in urban environments: Ferguson, Howard, & Likhachev: Motion Planning in Urban Environments

    Dave Ferguson;Thomas M. Howard;Maxim Likhachev

  • Search-Based Path Planning with Homotopy Class Constraints

    Subhrajit Bhattacharya;Vijay Kumar;Maxim Likhachev

Frequent Co-Authors

Sven Koenig
Sven Koenig University of Southern California
Sachin Chitta
Sachin Chitta Autodesk (United States)
Anthony Stentz
Anthony Stentz Carnegie Mellon University
Vijay Kumar
Vijay Kumar University of Pennsylvania
Ronald C. Arkin
Ronald C. Arkin Georgia Institute of Technology
Sebastian Thrun
Sebastian Thrun Stanford University
J. Andrew Bagnell
J. Andrew Bagnell Carnegie Mellon University
Manuela Veloso
Manuela Veloso Carnegie Mellon University
Geoffrey J. Gordon
Geoffrey J. Gordon Carnegie Mellon University
Howie Choset
Howie Choset Carnegie Mellon University

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

The landscape of online education provides flexible opportunities for students interested in Computer Science and related fields. For those looking for a fast entry-point into the workforce, you might explore what degree can I get online in 6 months. These short-term programs often focus on foundational skills for tech and IT careers.

Budget is often a major concern. It's worth considering some of the cheapest online colleges that provide quality computer science and technology programs at a lower cost. For those interested in combining business and technology, pursuing the cheapest online business management degree can open doors to managerial roles in tech companies.

Aspiring engineers can now earn an engineer degree online from reputable institutions, allowing them to access lucrative STEM career pathways while balancing personal and professional commitments.

Whether your goal is quick certification, affordable study, or branching into business or engineering, these related degree pathways can help you navigate your journey in tech.

Best Scientists Citing Maxim Likhachev

Trending Scientists

Recently Published Articles