Practical genetic algorithms
Ant Colony Optimization
Designing Autonomous Mobile Robots: Inside the Mind of an Intelligent Machine
Designing Autonomous Mobile Robots: Inside the Mind of an Intelligent Machine
Sweep based Multiple Ant Colonies Algorithm for Capacitated Vehicle Routing Problem
ICEBE '05 Proceedings of the IEEE International Conference on e-Business Engineering
Fundamentals of Computational Swarm Intelligence
Fundamentals of Computational Swarm Intelligence
IEEE Computational Intelligence Magazine
Building comprehensible customer churn prediction models with advanced rule induction techniques
Expert Systems with Applications: An International Journal
Path Planning with Obstacle Avoidance in PEGs: Ant Colony Optimization Method
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
Experimental evaluation of pheromone models in ACOPlan
Annals of Mathematics and Artificial Intelligence
Active leading through obstacles using ant-colony algorithm
Neurocomputing
A novel neural network method for shortest path tree computation
Applied Soft Computing
A study of a soft computing based method for 3D scenario reconstruction
Applied Soft Computing
Generic Cabling of Intelligent Buildings Based on Ant Colony Algorithm
International Journal of Software Science and Computational Intelligence
Efficient metaheuristics for pick and place robotic systems optimization
Journal of Intelligent Manufacturing
A method for avoiding the searching bias in ACO deceptive problem solving
Web Intelligence and Agent Systems
Process control using genetic algorithm and ant colony optimization algorithm
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Hi-index | 0.00 |
In the Motion Planning research field, heuristic methods have demonstrated to outperform classical approaches gaining popularity in the last 35 years. Several ideas have been proposed to overcome the complex nature of this NP-Complete problem. Ant Colony Optimization algorithms are heuristic methods that have been successfully used to deal with this kind of problems. This paper presents a novel proposal to solve the problem of path planning for mobile robots based on Simple Ant Colony Optimization Meta-Heuristic (SACO-MH). The new method was named SACOdm, where d stands for distance and m for memory. In SACOdm, the decision making process is influenced by the existing distance between the source and target nodes; moreover the ants can remember the visited nodes. The new added features give a speed up around 10 in many cases. The selection of the optimal path relies in the criterion of a Fuzzy Inference System, which is adjusted using a Simple Tuning Algorithm. The path planner application has two operating modes, one is for virtual environments, and the second one works with a real mobile robot using wireless communication. Both operating modes are global planners for plain terrain and support static and dynamic obstacle avoidance.