scispace - formally typeset
M

Maxim Likhachev

Researcher at Carnegie Mellon University

Publications -  234
Citations -  12727

Maxim Likhachev is an academic researcher from Carnegie Mellon University. The author has contributed to research in topics: Motion planning & Robot. The author has an hindex of 48, co-authored 210 publications receiving 11162 citations. Previous affiliations of Maxim Likhachev include University of Pennsylvania & Honeywell.

Papers
More filters
Proceedings Article

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

TL;DR: An anytime heuristic search, ARA*, is proposed, which tunes its performance bound based on available search time, and starts by finding a suboptimal solution quickly using a loose bound, then tightens the bound progressively as time allows.
Journal ArticleDOI

Fast replanning for navigation in unknown terrain

TL;DR: D/sup */ Lite is introduced, a heuristic search method that determines the same paths and thus moves the robot in the same way but is algorithmically different, and is at least as efficient as D/Sup */.
Proceedings Article

Anytime dynamic A*: an anytime, replanning algorithm

TL;DR: A graph-based planning and replanning algorithm able to produce bounded suboptimal solutions in an anytime fashion that combines the benefits of anytime and incremental planners to provide efficient solutions to complex, dynamic search problems.