In this paper, we propose Ant Colony Optimization (ACO) for mobile robot. This paper describes theanalysis and design of a new class of mobile robots. These small robots are intended to be simple andinexpensive, and will all be physically identical, thus constituting a homogeneous team of robots. Theyderive their usefulness from their group actions, performing physical tasks and making cooperativedecisions as a Coordinated Team. This method based on heuristic concept is used to obtain globalsearch. Since the proposed method is very efficient, thus it can perform object finding very quickly. In theprocess of doing so, we first use ACO to obtain the shortest obstructed distance, which is an effectivemethod for arbitrary shape obstacles.