Mike Bogochow

  • Citations Per Year
Learn More
Many AI systems, such as robots, must plan under time constraints. The most popular search approach in robotics so far is anytime search (Likhachev and Ferguson 2009), in which the algorithm quickly finds a suboptimal plan, and then continues to find better plans as time passes, until eventually converging on an optimal plan. However, the time until the(More)
  • 1