By Topic

Collision avoidance with obstacles in flocking for multi agent systems

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
$33 $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

3 Author(s)
Mir Saman Rahimi Mousavi ; Center of Excellence in Design, Robotics and Automation (CEDRA), School of Mechanical Engineering, Sharif University of Technology, Tehran, Iran ; Mehran Khaghani ; Gholamreza Vossoughi

Multi agent system is a system consist of multiple interacting agents. These systems tend to select the best solution for their problems. They can be used in different tasks which are hard for an individual or even a complex system to do. One of the most common algorithms which are used in multi agent systems is flocking. Here we introduce a theorem that multi agent systems could flock in environments with fixed obstacles without any collision between agents and obstacles. We use Lyapunov theory and prior algorithms on flocking to extract a theorem which under those conditions in the theorem, collision never occurs between agents and obstacles. Results show that the theorem insures collision avoidance between agents and obstacles.

Published in:

Industrial Electronics, Control & Robotics (IECR), 2010 International Conference on

Date of Conference:

27-29 Dec. 2010