2017•Unpublished venueRequires access

Research on robot obstacle avoidance and path tracking under dynamically unknown environment

Nie Qingbin

Open publisher page 1 citations

Abstract

The path of the mobile robot is a multi-objective optimization problem. The traditional ant colony algorithm is introduced into the path planning of the mobile robot. Due to the complexity of the robot path, the large search space and the low efficiency, it is easy to fall into the local optimum and even deadlock and other defeats. In order to enhance the efficiency and accuracy of path planning, a path planning algorithm of mobile robot based on ant colony algorithm is proposed. The path planning of mobile robot is simulated under grid environment. The experimental results show that the improved algorithm can improve the efficiency of path planning for mobile robot, safely avoid obstacles and find all the optimal solutions in the shortest time.

About this research paper

What this paper is about

The path of the mobile robot is a multi-objective optimization problem. The traditional ant colony algorithm is introduced into the path planning of the mobile robot. Due to the complexity of the robot path, the large search space and the low efficiency, it is easy to fall into the local optimum and even deadlock and other defeats. In order to enhance the efficiency and accuracy of path planning, a path planning algorithm of mobile robot based on ant colony algorithm is proposed. The path planning of mobile robot is simulated under grid environment. The experimental results show that the improved algorithm can improve the efficiency of path planning for mobile robot, safely avoid obstacles and find all the optimal solutions in the shortest time.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The path of the mobile robot is a multi-objective optimization problem. The traditional ant colony algorithm is introduced into the path planning of the mobile robot. Due to the complexity of the robot path, the large search space and the low efficiency, it is easy to fall into the local optimum and even deadlock and other defeats. In order to enhance the efficiency and accuracy of path planning, a path planning algorithm of mobile robot based on ant colony algorithm is proposed. The path planning of mobile robot is simulated under grid environment. The experimental results show that the improved algorithm can improve the efficiency of path planning for mobile robot, safely avoid obstacles and find all the optimal solutions in the shortest time.

Key concepts: Mobile robot, Motion planning, Ant colony optimization algorithms, Obstacle avoidance, Computer science, Path (computing), Robot, Deadlock

Related papers

Back to paper searchBrowse research topicsOriginal source
Research on robot obstacle avoidance and path tracking under dynamically unknown environment — Research Paper | ScholarLens