지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2011.10
- 수록면
- 1,069 - 1,073 (5page)
이용수
초록· 키워드
오류제보하기
Recently, the ant algorithm has been widely used to solve the problem of searching for optimization route from various different paths. The ant algorithm can also be applied for searching an appropriate route that consumes less energy in mobile robot area, which is similar problem domain. However, in order to apply, the ant algorithm is required to adapt due to the factor of energy that must be considered in addition to the distance alone. This paper presents the adaptation of ant algorithm to solve the problem of searching energy-efficient route for mobile robot. The adapted ant algorithm deploys a speed, which is employed to find the energy to move the robot in each route, to generate pheromones used to define the probability that the ants will choose for the best route. Then, the distance is used as a weighting factor to discover the energy-efficient route in terms of distance and speed by simulation. The results from adapted ant algorithm are also used to compare with the conventional ant algorithm for investigation. The simulation results expressed that, when using the speed with the distance to weight, the average distance is shortest. Consequently, when transforming into the energy, the result is much lower as well. Therefore, the adaptation of ant algorithm can improve the result of searching problem for optimization route that consumes less energy, which is a limited resource of mobile robot.
목차
Abstract
1. INTRODUCTION
2. ANT COLONY OPTIMIZATION (ACO)
3. ADAPTATION OF ACO ALGORITHM FOR MOBLIE ROBOT
4. EXPERIMENT AND RESULTDISCUSSION
5. CONCLUSION
REFERENCES
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-569-000914162