Ant Colony Based Path Planning Algorithm for Autonomous Robotic Vehicles

Gigras, Yogita

doi:10.5121/ijaia.2012.3604

Cited by 6 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Ref. [56], an ant colony optimization path planning of an autonomous robot in a dynamic environment with 20 rectangular obstacles randomly generated. In the experiment, a robot of asterisk structure was assumed, where the source was of a square shape and the target was of a diamond shape in a moving space of 160*160 cm 2 .…”

Section: Literature Reviewmentioning

confidence: 99%

“…Cell decomposition [16] Visibility graph [15,21,22] Dijkstra algorithm [28,29] Artificial Potential Field [18,66] Subgoal graphs [27] set of surrounding point and path improvement algorithm [63] Heuristics Genetic algorithm [7,36,37 Ant colony optimization [8,56,57,65] Artificial bee colony [3,29,71] Firefly algorithm [13] Bacteria foraging [10] Cuckoo search algorithm [58,59] Artificial immune algorithm [14] Fuzzy logic controller [64] Reinforcement learning [62] Hybrid methods Hybrid A* algorithm with Voronoi diagram [67] Hybrid pseudo-bacterial potential field algorithm [68] Hybridized particle swarm optimization-modified frequency bat algorithm [69] Table 3. Distribution of path planning approaches.…”

Section: Classicalmentioning

confidence: 99%

See 1 more Smart Citation

Path Planning Algorithms for Mobile Robots: A Survey

Haruna,

Bashir Mu’azu,

Umar

et al. 2023

Motion Planning for Dynamic Agents

View full text Add to dashboard Cite

Mobile robots have applications in military (for reconnaissance, search and rescue operations, bomb detection, surveillance), transportation (for cargo and packet delivery), data acquisition, etc. For the mobile robots to be able to execute these tasks with minimum or no human intervention, they need to be autonomous and intelligent. Path planning (PP) is one of the most critical areas of concern in the field of autonomous mobile robots. It is about obtaining a collision-free motion optimal path based on either time, distance, energy or cost in a static or dynamic environment containing obstacles. However, power limitation hinders the mobile robots to accomplish their task of reaching the target location as there are several paths they can follow. Each of these paths has its own path length, cost (i.e., time to reach destination), and energy constraint, thus, the need to plan for an optimal path according to a certain performance criterion. Significant research has been conducted in recent years to address the PP problem. Hence, this chapter is aimed at presenting the different approaches for PP of mobile robots with respect to different optimality criteria (time, distance, energy and cost), challenges and making recommendations on possible areas of future research.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Classicalmentioning

confidence: 99%

Path Planning Algorithms for Mobile Robots: A Survey

Haruna,

Bashir Mu’azu,

Umar

et al. 2023

Motion Planning for Dynamic Agents

View full text Add to dashboard Cite

show abstract

“…Abele et al [3] generated the time optimal tool paths, for a robot based deburring process of internal contours, by Matlab interface to find the shortest path by solving the travelling salesman problem. Gigras et al [4] presented a new ant colony based approach, which is helpful in solving path planning problem for autonomous robotic application. Willigenburg et al [5] used kinematic path planner, to find the minimum time taken for the path planning and proposed a new computational method.…”

Section: Introductionmentioning

confidence: 99%

Cycle Time Optimized Path Planning for Industrial Robot using Robomaster

al.¹

2017

IJMPERD

View full text Add to dashboard Cite

The main aim of the paper is to demonstrate the optimal cycle time taken by a 6 axis industrial robot, by following the shortest path. Planning for path is important because, it allows knowing about the path traversal of robot from starting point and reaching the end point with shortest possible time in 3D workspace. The approach of this work is based on the use of robomaster software, for solving the path planning problems for industrial robot arms, that are used in industries and for any dynamic environments. In this analysis, an attempt has been taken to plan the path followed by the robot, by considering different sort options with different starting points. The analysis of different paths with cycle time and path length are done and from that, one having the shortest cycle time and minimum path length is achieved, which can be considered for further machining works.

show abstract