Kengo Matsuta

Learn More
Agents often have to solve series of similar path planning problems. Adaptive A* is a recent incremental heuristic search algorithm that solves such problems faster than A*, updating a heuristic function (also known as h-values) using information from previous searches. In this paper, we address path planning with multiple targets on Adaptive A* framework.(More)
  • 1