An algorithm for Path planning with polygon obstacles avoidance based on the virtual circle tangents | Zendy

Z. A. Ibrahim | Zendy; Abdulmuttalib Rashid | Zendy; Ali Marhoon | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An algorithm for Path planning with polygon obstacles avoidance based on the virtual circle tangents

Author(s) -

Z. A. Ibrahim,

Abdulmuttalib Rashid,

Ali Marhoon

Publication year - 2016

Publication title -

iraqi journal for electrical and electronic engineering

Language(s) - English

Resource type - Journals

eISSN - 2078-6069

pISSN - 1814-5892

DOI - 10.37917/ijeee.12.2.13

Subject(s) - tangent , polygon (computer graphics) , path (computing) , line (geometry) , computer science , mobile robot , line segment , algorithm , motion planning , robot , shortest path problem , computer vision , simple polygon , artificial intelligence , great circle , mathematics , geometry , theoretical computer science , regular polygon , telecommunications , graph , frame (networking) , programming language

In this paper, a new algorithm called the virtual circle tangents is introduced for mobile robot navigation in an environment with polygonal shape obstacles. The algorithm relies on representing the polygonal shape obstacles by virtual circles, and then all the possible trajectories from source to target is constructed by computing the visible tangents between the robot and the virtual circle obstacles. A new method for searching the shortest path from source to target is suggested. Two states of the simulation are suggested, the first one is the off-line state and the other is the on-line state. The introduced method is compared with two other algorithms to study its performance.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research