Path Planning Algorithm Comparison for Mine Robotics

A simulated environment dataset from a study proposing an improved A* algorithm for underground mine transport robots. The dataset, shared by TongZhu Yu on figshare, compares search data between two algorithms to validate efficiency and safety improvements. It was last updated on 2026-05-04.

Use Cases

• Benchmarking search efficiency between path planning algorithms based on the described bidirectional adaptive search strategy.
• Evaluating safety-optimized routing based on terrain risk weights incorporated into the cost function.
• Comparing global and local path planning performance based on the described collaborative architecture combining A* and DWA algorithms.
• Validating robot navigation in complex, simulated roadway environments as described in the study.

Strengths

• Dataset is openly licensed under CC-BY-4.0, permitting broad reuse.
• The underlying study describes a clear methodological approach combining global and local path planning.

Limitations

• Dataset is very small at 5.5 KB, indicating limited scope.
• Row count and column-level documentation are unknown, requiring manual inspection after download.
• Data is derived from a simulated environment, which may not fully reflect real-world conditions.

Provenance

Source

TongZhu Yu via figshare

Collection Method

Generated from path planning experiments in a simulated environment, as described.

Freshness

Last updated 2026-05-04 17:32:29; freshness should be verified.