Lably
Skip to content

Peter E. Hart

  • 1 min read
  • 3 chapters

Related on Lably

Through K-nearest neighbors algorithm and A* search algorithm

Education

Hart studied at Rensselaer Polytechnic Institute, leading to a BEE degree (1962). He did his graduate studies at Stanford University, where he got his MS (1963) and PhD (1966); Thomas M. Cover was his advisor and discovered & co-published a seminal paper on 1-NN nearest neighbor search.

Sign in to keep reading

2 more chapters are free with a Lably account.

More in Robotics