His main research concerns Motion planning, Artificial intelligence, Robot, Mathematical optimization and Heuristic. His Motion planning research is multidisciplinary, relying on both Homotopy, Graph and Trajectory. His Artificial intelligence research incorporates elements of Best-first search, Iterative deepening depth-first search, Incremental heuristic search, Beam search and Task.
His Robot study combines topics from a wide range of disciplines, such as Real-time computing and Graph. His research in Mathematical optimization intersects with topics in Any-angle path planning, Monotone polygon and Range. His Heuristic research incorporates themes from Humanoid robot and Heuristics.
Maxim Likhachev mainly investigates Motion planning, Robot, Artificial intelligence, Mathematical optimization and Heuristic. The concepts of his Motion planning study are interwoven with issues in Motion, Trajectory and Mobile robot. His Robot research focuses on Human–computer interaction and how it connects with Focus.
He interconnects Machine learning, Task and Computer vision in the investigation of issues within Artificial intelligence. His work in Mathematical optimization addresses subjects such as Graph, which are connected to disciplines such as Graph theory. His Heuristic research incorporates themes from Beam search, Humanoid robot and Heuristics.
Maxim Likhachev mostly deals with Motion planning, Robot, Mathematical optimization, Distributed computing and State. His Motion planning research is classified as research in Path. His research in Robot intersects with topics in Object, Human–computer interaction, Task and Maxima and minima.
In general Mathematical optimization study, his work on Heuristic and Optimal planning often relates to the realm of Quality and Observable, thereby connecting several areas of interest. The concepts of his Distributed computing study are interwoven with issues in Reinforcement learning, Loop, Robotic arm and Model free. His work carried out in the field of State brings together such families of science as Function, Collision, Control theory and Perspective.
Maxim Likhachev focuses on Motion planning, Distributed computing, Robot, Model free and Reinforcement learning. His research investigates the connection between Motion planning and topics such as Algorithm that intersect with problems in Heuristic. His work deals with themes such as Loop, Task, Speedup and Behavior-based robotics, which intersect with Distributed computing.
The various areas that he examines in his Robot study include Object, State and Face. Maxim Likhachev combines subjects such as Motion and Real-time computing with his study of Object. His studies in Model free integrate themes in fields like Task analysis and Operations research.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Autonomous driving in urban environments: Boss and the Urban Challenge
Chris Urmson;Joshua Anhalt;Drew Bagnell;Christopher Baker.
Journal of Field Robotics (2008)
D*lite
Sven Koenig;Maxim Likhachev.
national conference on artificial intelligence (2002)
ARA*: Anytime A* with Provable Bounds on Sub-Optimality
Maxim Likhachev;Geoffrey J. Gordon;Sebastian Thrun.
neural information processing systems (2003)
Anytime dynamic A*: an anytime, replanning algorithm
Maxim Likhachev;Dave Ferguson;Geoff Gordon;Anthony Stentz.
international conference on automated planning and scheduling (2005)
Fast replanning for navigation in unknown terrain
S. Koenig;M. Likhachev.
IEEE Transactions on Robotics (2005)
Lifelong planning A
Sven Koenig;Maxim Likhachev;David Furcy.
Artificial Intelligence (2004)
Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles
Maxim Likhachev;Dave Ferguson.
The International Journal of Robotics Research (2009)
Improved fast replanning for robot navigation in unknown terrain
S. Koenig;M. Likhachev.
international conference on robotics and automation (2002)
A Guide to Heuristic-based Path Planning
Dave Ferguson;Maxim Likhachev;Anthony Stentz.
(2005)
Anytime search in dynamic graphs
Maxim Likhachev;Dave Ferguson;Geoff Gordon;Anthony Stentz.
Artificial Intelligence (2008)
If you think any of the details on this page are incorrect, let us know.
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:
Willow Garage
Carnegie Mellon University
University of Pennsylvania
Georgia Institute of Technology
Stanford University
Carnegie Mellon University
Carnegie Mellon University
Carnegie Mellon University
Carnegie Mellon University
University of Pennsylvania
University of California, Irvine
Uppsala University
Nagasaki University
Nicolaus Copernicus University
Michigan State University
Brigham and Women's Hospital
ETH Zurich
Spanish National Research Council
Uppsala University
Boston University
Bethel University
Pennsylvania State University
University of California, San Diego
Karolinska Institute
NewYork–Presbyterian Hospital
University of Alberta