Flocking control of mobile robots with obstacle avoidance based on simulated annealing algorithm (Q779557)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Flocking control of mobile robots with obstacle avoidance based on simulated annealing algorithm |
scientific article; zbMATH DE number 7219958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Flocking control of mobile robots with obstacle avoidance based on simulated annealing algorithm |
scientific article; zbMATH DE number 7219958 |
Statements
Flocking control of mobile robots with obstacle avoidance based on simulated annealing algorithm (English)
0 references
13 July 2020
0 references
Summary: Flocking control problem of mobile robots under environment with unknown obstacles is addressed in this paper. Based on the simulated annealing algorithm, a flocking behaviour for mobile robots is achieved which converges to alignment while avoiding obstacles. Potential functions are designed to evaluate the positional relationship between robots and obstacles. Unlike the existing analytical method, simulated annealing algorithm is utilized to search the quasi-optimal position of robots in order to reduce the potential functions. Motion control law is designed to drive the robot move to the desired position at each sampling period. Experiments are implemented, and the results illustrate the effectiveness of the proposed flocking control method.
0 references
0 references
0.7684264779090881
0 references
0.7654926776885986
0 references
0.765157163143158
0 references
0.7642896771430969
0 references
0.757023811340332
0 references