현재 위치
Home
Ant Colony System: An Approach for the Design of a Single Database to Establish Any Node-to-node Connectivity for Robot Path Planning in a Robot Colony
-
- 발행기관
- 보안공학연구지원센터(IJHIT) 바로가기
-
- 간행물
- International Journal of Hybrid Information Technology 바로가기
-
- 통권
- Vol.8 No.3 (2015.03)바로가기
-
- 페이지
- pp.213-234
-
- 저자
-
- 언어
- 영어(ENG)
-
- URL
- https://www.earticle.net/Article/A245275
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
원문정보
초록
- 영어
- In Ant Colony System, the agents or the ants travel in search of foods by following one another that is they show the swarming behavior along the searching path of the food source and return path towards the hive. In the artificial ant system or the robot system, the same operation of the robot can be observed by the suitable design of the travelling path. The path design and the travelling technique are already proposed in my two previous works. Those designs include different types of algorithms for different opeartions. Kruskel’s algorithm is applied to find the shortest path in between any two nodes, one is the source and another is the destination node. But the disadvantage of this design is the longer simulation time as three algorithms is required to travel from one node to another node and naturally several numbers of the databases are required to hold all the information about the entire robot colony. In this paper, a single database is proposed that can hold all the connectivity and which can be driven with a single algorithm. The proposed method is compared with the other previous techniques of finding the shortest path and the result set represented here showing the efficiency of the proposed method.
목차
Abstract
1. Introduction
2. Ant System and Shortest Path: Previous Works
3. Ant System: Robot Colony
3.1 Real Ant System
3.2 Robot Colony: Swarm Robot
3.3 Comparison: Real Ant and Swarm Robot
4. Advanced Robot Colony System
4.1 Modified Ant Colony Algorithm
4.2 Robot Modified Path Map
4.3 Robot Colony Algorithm
5. Routing of Robots in RCS
5.1 Routing Process
5.2 Node-to Node Connectivity Single Database (NNCSD)
5.3 Calculation of Shortest Route
6. Simulation Result
7. Conclusion
Acknowledgements
References
키워드
Kruskal’s Algorithm Shortest path Swarming Ant Colony System Node-to-Node Connectivity Database Robot Colony저자
간행물 정보
발행기관
-
- 발행기관명
- 보안공학연구지원센터(IJHIT) [Science & Engineering Research Support Center, Republic of Korea(IJHIT)]
- 설립연도
- 2006
- 분야
- 공학>컴퓨터학
- 소개
- 1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업
간행물
-
- 간행물명
- International Journal of Hybrid Information Technology
- 간기
- 격월간
- pISSN
- 1738-9968
- 수록기간
- 2008~2016
- 십진분류
- KDC 505 DDC 605
이 권호 내 다른 논문 / International Journal of Hybrid Information Technology Vol.8 No.3
피인용수 : 0건 (자료제공 : 네이버학술정보)
함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.
출처 : 네이버학술정보
0개의 논문이 장바구니에 담겼습니다.