This paper focuses on navigation of a humanoid robot cluttered with obstacles, avoiding collisions in static environment using Prim’s algorithm. Prim’s algorithm is a minimum spanning tree (MST) method with greedy approach which uses the concept of sets. It generates the MST by selecting least weights from the weighted graph and randomly forms disjoint sets with picking one least weight edge from the ones remaining for creating node incident to form the tree. Similar approach repeats for selecting all ‘n – 1’ edges to the tree which is the path direction to humanoid NAO. The developed algorithm is implemented in both simulation and experimental platforms to obtain the navigational results. The simulation and experimental navigational results confirm the efficiency of the path planning strategy as the percentage of deviations of navigational parameters is below 6%. © 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.