Performance evaluation of robot path planning using hybrid TSP based ACO

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Path problem is a motivating theme in robotics framework/system these days. The relevant quantity of inspection had always been committed to this specific complex issue lately. This ant colony optimization calculation is an elective strategy only to tackle such a problematic situation. Every ant drops an amount of simulated pheromone at each node that the ant has just finished covering up. This specific pheromone fundamentally deviates the likelihood that the following ant winds up included to a specific network node. The proposed directs the ants to make a path line inclusive of all factors to reach the goal point. This paper purposes ant colony based approach which is useful in taking care of way arranging problem for self-sufficient automated (robotic) application.

Cite

CITATION STYLE

APA

Khurana, A., Khatri, S. K., & Singh, A. V. (2019). Performance evaluation of robot path planning using hybrid TSP based ACO. In Communications in Computer and Information Science (Vol. 955, pp. 448–457). Springer Verlag. https://doi.org/10.1007/978-981-13-3140-4_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free