Pathfinding with Lazy Successor Generation

Keisuke Okumura

We study a pathfinding problem where only locations (i.e., vertices) are given, and edges are implicitly defined by an oracle answering the connectivity of two locations. Despite i…