Yao Shunli

Papers

Total Citations

H-Index

About

Yao Shunli is a researcher whose work centers on path planning and optimization algorithms for robotic navigation, with a particular focus on improving efficiency in grid-based environments. His most cited paper, "An Improved Dijkstra's Algorithm for Shortest Path Planning on 2D Grid Maps" (2019), has garnered 35 citations and addresses a critical challenge in robotics: computing optimal paths from arbitrary starting positions to a single goal in partially-known or dynamic environments. By analyzing properties of eight-directional grid maps, Shunli's modification enhances the classic Dijkstra's algorithm, making it more practical for multi-robot systems and real-time applications. This contribution is especially valuable for controlling multiple robots from diverse initial positions, enabling them to efficiently converge on a target. Beyond this work, his research demonstrates a commitment to bridging theoretical graph algorithms with tangible robotic applications, offering solutions that reduce computational overhead while maintaining accuracy. Shunli's work is a clear asset for students and engineers seeking to understand or implement efficient path planning in constrained, two-dimensional spaces, and his algorithmic refinements continue to influence developments in autonomous navigation and swarm robotics.