Figure 10From: Heuristic Expanding Disconnected Graph: A Rapid Path Planning Method for Mobile RobotsComparison of EDG* and competitive algorithms for nonoptimal programming cases in the 1024 × 1024 CSMBack to article page