CAJ | 학술논문

本文重点讨论了蚁群算法,包括蚁群算法的基本原理及工作流程.为了模拟实际蚂蚁的觅食行为,设人工蚁出发点H为蚁穴位置,食物源则在最终目标点F,蚂蚁觅食过程就是从H出发,在AS范围寻找食物源的过程.经过蚂蚁群体的反复寻食,基于蚂蚁留下信息素的正反馈作用,最终绕开所有障碍物找到了一条最短路径.
본문중점토론료의군산법,포괄의군산법적기본원리급공작류정.위료모의실제마의적멱식행위,설인공의출발점H위의혈위치,식물원칙재최종목표점F,마의멱식과정취시종H출발,재AS범위심조식물원적과정.경과마의군체적반복심식,기우마의류하신식소적정반궤작용,최종요개소유장애물조도료일조최단로경.
In this paper,the ant colony optimization,namely the basic principle and workflow of the ant colony optimization is mainly discussed.In the end,to simulate the ant defacto foraging,the anthill and food source are denoted by starting point H of the robot and the object point F,respectively.The process of the ant foraging is the procedure that the ant begins with H and finds the food source within AS from T,by the iterative foraging of the ant colony and based on positive feedback effect of the pheromone which the ants leave,finally a shortest path is find by bypassing all obstacles.