An application of Pareto solution with adapted ACO for searching optimal route of a mobile robot in rough terrain environment

摘要

A challenge in searching an optimal route of a mobile robot involves finding the route that has the shortest distance and consumes the least energy. To solve this problem, an ant colony optimization (ACO) algorithm can be used, but only on a flat terrain, since the energy depends directly on the distance. In a rough terrain, the least energy route might not be the shortest distance. Also, the shortest distance route might not be the least energy. This is due to a factor of slope in the route. Although our adapted ACO can be used for searching energy-efficient routes in the rough terrain, it is difficult to achieve the shortest distance simultaneously. This paper proposes a novel method to find an optimal route of a mobile robot in rough terrain environment by using a Pareto solution with adapted ACO. In the proposed method, the adapted ACO is used to search two sets of route, i.e., one contains the least energy and another one contains the shortest distance. Then, the Pareto solution is deployed to find the optimal route in terms of energy and distance by adopting a distance vector for selection. The experiment was performed by simulation to verify the proposed searching method. The experimental results show that the proposed searching method can prescribe the optimal value for choosing the route provided by adapted ACO.