Finding the optimal path in a 3D environment with predefined obstacles Online publication date: Mon, 25-Mar-2024
by Gabriel Mansour; Ilias Chouridis; Apostolos Tsagaris
International Journal of Advanced Mechatronic Systems (IJAMECHS), Vol. 11, No. 1, 2024
Abstract: Robotics has substantially improved people's daily lives, especially industrial production and manufacturing. An offline programming method is proposed for robot's path planning in a 3D environment with obstacles. The purpose of this method is to find the shortest 3D path between two or more points avoiding obstacles. Two types of paths are created: in the first type, the shortest path between the points is created based on their input order; in the second type, the shortest path that connects the input points is formed. It is accomplished by using a hybrid algorithm that combines the ant colony optimisation algorithm with a genetic algorithm called the roulette wheel method. The proposed method takes into consideration the robot's capabilities and the variability of different environments, so that it can be effectively applied to a multitude of cases. The method has been tested and applied to real world industrial robots successfully.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Mechatronic Systems (IJAMECHS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook