PID-filtered negotiation for decision making in dynamic coverage problem

Satoshi Kataoka*, Fuyuki Ishikawa, Shinichi Honiden

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationProcedings - 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006
Pages481-485
Number of pages5
DOIs
Publication statusPublished - 2006
Externally publishedYes
Event18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006 - Arlington, VA, United States
Duration: 2006 Oct 132006 Oct 15

Publication series

NameProceedings - International Conference on Tools with Artificial Intelligence, ICTAI
ISSN (Print)1082-3409

Other

Other18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006
Country/TerritoryUnited States
CityArlington, VA
Period06/10/1306/10/15

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'PID-filtered negotiation for decision making in dynamic coverage problem'. Together they form a unique fingerprint.

Cite this