Asaph Ben-Yair

Learn More
We address the problem of nding the shortest path between two points in an unknown real physical environment where a traveling agent must move around in the environment to explore unknown territory We introduce the Physical A algorithm PHA for solving this problem PHA expands all the mandatory nodes that A would expand and returns the shortest path between(More)
  • 1