Optimal Path Planning for an Autonomous Mobile Robot Using Dragonfly Algorithm
نویسندگان
چکیده
منابع مشابه
Optimal Path Planning for Mobile Robot Using Tailored Genetic Algorithm
During routine inspecting, mobile robot may be requested to visit multiple locations to execute special tasks occasionally. This study aims at optimal path planning for multiple goals visiting task based on tailored genetic algorithm. The proposed algorithm will generate an optimal path that has the least idle time, which is proven to be effective on evaluating a path in our previous work. In p...
متن کاملPath Planning for Autonomous Mobile Robot using Potential Field
The popularity of autonomous mobile robots have been rapidly increasing due to their new emerging application areas, from room cleaning, tourist guidance to space explorations. However, the development of a satisfactory control algorithm that will enable the autonomous mobile robots to navigate safely especially in dynamic environments is still an open research problem. In this paper, a newly p...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملOptimal Path Forecasting of an Autonomous Mobile Robot Agent Using Breadth First Search Algorithm
Predicting and identifying an optimal navigational forecasting for a mobile robot agent is considered to be one of the key challenges for researchers in the field of AI and robotics. A mobile robot agent participating for wide range of mission critical application will explore into an unknown environment will be challenging criteria, considering its contraints such as time, cost, energy, explor...
متن کاملPath Planning Algorithm for Mobile Robot
The paper presents an algorithm for planning the path of a mobile robot in a labyrinth. The algorithm uses an image, obtained by a camera. The algorithm processes the image to convert it into a matrix, presenting the labyrinth with obstacles and walls. Afterwards the algorithm finds the shortest path to a final target in the labyrinth. As opposed to the classical Dijkstra’s algorithm, the prese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Simulation Modelling
سال: 2019
ISSN: 1726-4529
DOI: 10.2507/ijsimm18(3)474