Path planning is one of the key research directions in the field of mobile robots. It ensures that moving objects can reach the target point safely and without collision in a complex obstacle environment. The path planning is to search an optimal path from the starting point to the target point for the mobile robot in an environment with obstacles, according to certain evaluation criteria (such as the time, the best path, the minimum energy consumption, etc.). The path planning based on artificial potential field method has been paid more and more attention because of its advantages such as convenient calculation, simple implementation of hardware and outstanding real-time performance. However, the artificial potential field method has some limitations, such as the local minimum, the oscillation of moving objects among obstacles and so on. To solve these problems, we can introduce the idea of decision tree into the artificial potential field method for improvement. In machine learning, decision tree is usually used for classification. It is a prediction model, which represents a mapping relationship between object attributes and object values. By utilizing the advantages of decision tree in rule expression and extraction, an improved artificial potential field path planning model based on decision tree is constructed, which can realize real-time and accurate identification of current behavior and fast decision-making of next time behavior in path planning. Aiming at the dynamic path planning problem of mobile robots in indoor complex environment, based on the traditional artificial potential field method, this paper introduces the distance term into the potential field function, and proposes an improved artificial potential field method based on the idea of decision tree, to solve the local minimum, the oscillation between obstacles and concave obstacle problems. According to repulsion coefficient, deflection angle of resultant force and velocity, a reasonable classification decision is made to meet the needs of different obstacle distribution scenarios, and the effectiveness of the proposed method is verified by simulation experiments. Simulation results show that, compared with the traditional artificial potential field method, the planning time of improved algorithm is reduced by 50%, and the smoothness of path planning by the improved algorithm is increased by 43.3%.
[1]
MH Mabrouk,et al.
Solving the potential field local minimum problem using internal agent states
,
2008,
Robotics Auton. Syst..
[2]
Zhou Zhou,et al.
An improved artificial potential field method for solving local minimum problem
,
2011,
2011 2nd International Conference on Intelligent Control and Information Processing.
[3]
Ming C. Lin,et al.
An opportunistic global path planner
,
2005,
Algorithmica.
[4]
Lorenzo Sabattini,et al.
Arbitrarily shaped formations of mobile robots: artificial potential fields and coordinate transformation
,
2011,
Auton. Robots.
[5]
Min Cheol Lee,et al.
Artificial potential field based path planning for mobile robots using a virtual obstacle concept
,
2003,
Proceedings 2003 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2003).
[6]
Vadim I. Utkin,et al.
Tracking the gradient of artificial potential fields : sliding mode control for mobile robots
,
1996
.
[7]
Oussama Khatib,et al.
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
,
1985,
Autonomous Robot Vehicles.
[8]
Li Na,et al.
Path planning research for mobile robot based on the circle scanning method
,
2008,
2008 Chinese Control and Decision Conference.
[9]
H. Youlal,et al.
Fuzzy dynamic path planning using genetic algorithms
,
2000
.
[10]
Tao Zhang,et al.
An improved wall following method for escaping from local minimum in artificial potential field based path planning
,
2009,
Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.