A multi-objective optimization behavior fusion avoidance method for snake-like rescue robot

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

The obstacle avoidance path planning of rescue robot has been the key problem of autonomous navigation for rescue robot. Most of the existing path planning algorithms is aimed at the optimization of a particular target, often resulting in deadlock or oscillation in order to obtain the optimal solution or the optimal path. Therefore, using the multi-objective optimization theory, this paper presents a multi-objective optimization dynamic obstacle avoidance algorithm based on interval weights, the fusion process of obstacle avoidance process is divided into three seed action, by giving the behavior function of different weights, the output rate of real-time dynamic change of different action. This is not to obtain the optimal solution or the optimal path at the current moment, but to obtain only the most efficient solution or the most satisfactory path at the current moment. Experiments show that the algorithm can effectively improve the flexibility and security of the obstacle avoidance process under the premise of ensuring the real-time and robustness of the search and rescue robot obstacle avoidance process.

Cite

CITATION STYLE

APA

Hongyan, L., & Yuanbin, H. (2017). A multi-objective optimization behavior fusion avoidance method for snake-like rescue robot. In MATEC Web of Conferences (Vol. 139). EDP Sciences. https://doi.org/10.1051/matecconf/201713900155

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free