By Topic

Rapid formation of multi-agent based on computational geometry algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Fu Jia ; Beijing Inst. of Technol., Beijing, China ; Wang Meiling ; Yang Yi ; Zhou Peide

This paper presents a multi-robot rapid line formation and obstacle avoidance algorithm, which is based on computational geometry algorithm, and this can greatly reduces the computational complexity. The paper studies the multi-robot system which possesses a communicative mechanism and an arbitrarily displaced initial state. The specific research establishes a convex hull of the multi-robot system, which is based on computational geometry algorithm, determines the convex hull diameter and the location of the straight line formation. It introduces the `spring force' to deal with the coordination of the robots, meanwhile it puts forward the concept of `gully' to model the line formation problem, and uses tangent method in computational geometry algorithm to determine the path to avoid obstacles. The proposed algorithm allows multi-robots to quickly form in a straight line and complete the obstacle avoidance, and its advantage is the small computational complexity and good real-time efficiency.

Published in:

Control Conference (CCC), 2010 29th Chinese

Date of Conference:

29-31 July 2010