Abstract: Finding a shortest path from an arbitrarily selected initial position to a single goal position is very useful in some domains, such as in partially-known environments or control many ...
Abstract: In this paper, the robot is a maze robot. Dijkstra algorithm is used in the robot path planning. The shortest path is selected in the process of barrier. Simulation results prove the model ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback