Multi-robot multi-target dynamic path planning using artificial bee colony and evolutionary programming in unknown environment
Obstacle avoidance
Benchmark (surveying)
DOI:
10.1007/s11370-017-0244-7
Publication Date:
2018-02-02T02:59:12Z
AUTHORS (5)
ABSTRACT
Navigation or path planning is the basic need for movement of robots. Navigation consists of two foremost concerns, target tracking and hindrance avoidance. Hindrance avoidance is the way to accomplish the task without clashing with intermediate hindrances. In this paper, an evolutionary scheme to solve the multi-agent, multi-target navigation problem in an unknown dynamic environment is proposed. The strategy is a combination of modified artificial bee colony for neighborhood search planner and evolutionary programming to smoothen the resulting intermediate feasible path. The proposed strategy has been tested against navigation performances on a collection of benchmark maps for A* algorithm, particle swarm optimization with clustering-based distribution factor, genetic algorithm and rapidly-exploring random trees for path planning. Navigation effectiveness has been measured by smoothness of feasible paths, path length, number of nodes traversed and algorithm execution time. Results show that the proposed method gives good results in comparison to others.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (26)
CITATIONS (46)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....