Optimized Angular a Star Algorithm for Global Path Search Based on Neighbor Node Evaluation

摘要: Any electromechanical device can be termed as Robot, which imitates human actions and in some of the situation used a replacement for human. These days Robots are integral part our life applied several applications tasks by giving respective commands. The research robotics domain is to make it autonomous much independent be. problem that arises controlling mobile robot with energy constraint. A lot wasted, if takes wrong trajectory motion, this motion depends upon knowledge indeed not constant. variation environment results making difficult take precise accurate measurements reach destination without loss. An expected decision according situation. For decisions path planning there algorithms like A*, Dijkstra, D* etc. In paper we have done analysis on partially known Optimal planned new heuristic approach over star algorithm, moving at an appropriate angle cuts down unnecessary cost planning. Experimental show proposed algorithm effective more than 8% conventional A* same map environment.