Mobile robot path planning using Ant Colony Optimization
Ant colony optimization (ACO) technique is proposed to solve the mobile robot path planning (MRPP) problem. In order to demonstrate the effectiveness of ACO in solving the MRPP problem, several maps of varying complexity used by an earlier researcher is used for evaluation. Each map consists of stat...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2017
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015962268&doi=10.1109%2fROMA.2016.7847836&partnerID=40&md5=bda25be6f6d2162eb028ffe7718cf325 http://eprints.utp.edu.my/20155/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Ant colony optimization (ACO) technique is proposed to solve the mobile robot path planning (MRPP) problem. In order to demonstrate the effectiveness of ACO in solving the MRPP problem, several maps of varying complexity used by an earlier researcher is used for evaluation. Each map consists of static obstacles in different arrangements. Besides that, each map has a grid representation with an equal number of rows and columns. The performance of the proposed ACO is tested on a given set of maps. Overall, the results demonstrate the effectiveness of the proposed approach for path planning. © 2016 IEEE. |
|---|