loading...
PID-filtered Negotiation for Decision Making in Dynamic Coverage Problem
Arlington, Virginia November 13-November 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2006.9518th IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Satoshi Kataoka, The University of Tokyo, Japan
Fuyuki Ishikawa, The University of Tokyo, Japan
Shinichi Honiden, The University of Tokyo, Japan
Negotiation between robots is often needed in wireless ad-hoc robot network. In dynamic coverage problem, wireless ad-hoc robots move in the field negotiating with other robots frequently. Robots are tied with P2P network and determine their actions autonomously by negotiations with other robots. The topic of this paper is a negotiation for Multi-Agent-System (MAS) in the problem of robots activity in dynamic coverage, which is the problem of robots to cover all the areas of a free space by their sensors in the shortest possible time. This paper introduce a novel algorithm for robots? negotiation for MAS in the dynamic coverage problem by using PID-filter. This algorithm reduced useless motion of robots and decreased the time concerning the convergence of a robot?s action for dynamic coverage problem. The claim made in this paper for new negotiation algorithm for MAS are supported by comprehensive experimental results and discusses future research directions.
Citation:
Satoshi Kataoka, Fuyuki Ishikawa, Shinichi Honiden, "PID-filtered Negotiation for Decision Making in Dynamic Coverage Problem," ictai, pp.481-488, 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.