ebooks logo journals logo reference works logo abstract databases logo
bullet  SIGN IN Register | Why Register? | Got a Voucher? alerts   marked lists   shopping cart 

informaworld

HOME   |   SEARCH   |   BROWSE
    Issues List       Latest Issue       Volume 10 Issue 1       Subscribe       Article       Related articles      
<< firstfirst   < prevprev   Table of contentstoc   next >next   last >>last
Publisher Logo Publication Cover
Search within this journal

REACTIVE MOTION PLANNING: A MULTIAGENT APPROACH 

Author: Lars Overgaard
DOI: 10.1080/088395196118678
Publication Frequency: 10 issues per year
Published in: journal Applied Artificial Intelligence, Volume 10, Issue 1 February 1996 , pages 35 - 52
Formats available: PDF (English)
Article Requests: Order Reprints : Request Permissions
View Article: View Article (PDF) View Article (PDF)


Abstract

We present an efficient approach to reactive robot motion planning and collision avoidance. Unlike the traditional methods, there is no centralized control; instead the links and the joints of the robot are autonomous agents. This is a completely new approach. A set of dynamic equations of motion for an arbitrary robot is derived. Artificial forces are introduced to express and combine multiple, possibly conflicting objectives, such as avoiding obstacles while approaching a goal. The joint agents impose forces of constraint between the link agents, and these forces establish a flow of information among the agents. The emergent behavior of the multiagent system gives an impression of surprisingly intelligent overall control. The developed method is used in actual industrial applications to control welding robot installations for ship building with up to 11 degrees of freedom (DOF). Experimental results from the simulation of a 25-DOF snakelike robot operating in a complex three-dimensional structure are given. It is demonstrated that the time complexity is O(n 3 )for branched n-DOF robots, while for serial robots such as standard manipulators and the snake, it is O(n).
Bookmark with:
  • CiteULike
  • Del.icio.us
  • BibSonomy
  • Connotea
  • More bookmarks
Privacy Policy | Terms & Conditions | Accessibility | RSS
FAQs in: English . Français . Español . 中文(简体和繁體)
© 2010 Informa plc