Path Planning with Obstacle Avoidance in PEGs: Ant Colony Optimization Method

Authors:
Rong Du;Xiaobin Zhang;Cailian Chen;Xinping Guan
Affiliations:
-;-;-;-
Venue:
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Year:
2010

Citing 5
Cited 0

Solution of David Gale's lion and man problem

Theoretical Computer Science
Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation

Applied Soft Computing
Brief paper: A cooperative Homicidal Chauffeur game

Automatica (Journal of IFAC)
Randomized pursuit-evasion in a polygonal environment

IEEE Transactions on Robotics
On Discrete-Time Pursuit-Evasion Games With Sensing Limitations

IEEE Transactions on Robotics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with the problem of path planning in discrete-time pursuit-evasion games (PEGs) with obstacles. We present the so-called I-ACO (Improved Ant Colony Optimization) algorithm to plan paths for pursuers with efficiency and collision avoidance. The I-ACO algorithm can be divided into two modes, i.e. Approaching Mode and Capturing Mode, according to whether the evaders are sensed by the pursuers. The ant strategy provides the path planning methods with Direction Factor to keep the pursuers tracking the evaders. Furthermore, a blocking rule is presented to prevent the virtual ants from moving to a place repeatedly. Moreover, we present a Smoothening Rule to shorten the path found by the virtual ants. In the simulation, the path to the evader was simulated by using virtual ants. The simulation results show the high efficiency of the I-ACO algorithm.