PID-filtered negotiation for decision making in dynamic coverage problem

Satoshi Kataoka, Fuyuki Ishikawa, Shinichi Honiden

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 Dec 1
Externally publishedYes
Event18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006 - Arlington, VA, United States
Duration: 2006 Oct 132006 Oct 15

Other

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

Fingerprint

Decision making
Robots
Multi agent systems
Sensors

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kataoka, S., Ishikawa, F., & Honiden, S. (2006). PID-filtered negotiation for decision making in dynamic coverage problem. In Procedings - 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006 (pp. 481-485). [4031934] https://doi.org/10.1109/ICTAI.2006.95

PID-filtered negotiation for decision making in dynamic coverage problem. / Kataoka, Satoshi; Ishikawa, Fuyuki; Honiden, Shinichi.

Procedings - 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006. 2006. p. 481-485 4031934.

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

Kataoka, S, Ishikawa, F & Honiden, S 2006, PID-filtered negotiation for decision making in dynamic coverage problem. in Procedings - 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006., 4031934, pp. 481-485, 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006, Arlington, VA, United States, 06/10/13. https://doi.org/10.1109/ICTAI.2006.95
Kataoka S, Ishikawa F, Honiden S. PID-filtered negotiation for decision making in dynamic coverage problem. In Procedings - 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006. 2006. p. 481-485. 4031934 https://doi.org/10.1109/ICTAI.2006.95
Kataoka, Satoshi ; Ishikawa, Fuyuki ; Honiden, Shinichi. / PID-filtered negotiation for decision making in dynamic coverage problem. Procedings - 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006. 2006. pp. 481-485
@inproceedings{2d84ccc801b547debf0c01295dc9c069,
title = "PID-filtered negotiation for decision making in dynamic coverage problem",
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.",
author = "Satoshi Kataoka and Fuyuki Ishikawa and Shinichi Honiden",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/ICTAI.2006.95",
language = "English",
isbn = "0769527280",
pages = "481--485",
booktitle = "Procedings - 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006",

}

TY - GEN

T1 - PID-filtered negotiation for decision making in dynamic coverage problem

AU - Kataoka, Satoshi

AU - Ishikawa, Fuyuki

AU - Honiden, Shinichi

PY - 2006/12/1

Y1 - 2006/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38949108984&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38949108984&partnerID=8YFLogxK

U2 - 10.1109/ICTAI.2006.95

DO - 10.1109/ICTAI.2006.95

M3 - Conference contribution

AN - SCOPUS:38949108984

SN - 0769527280

SN - 9780769527284

SP - 481

EP - 485

BT - Procedings - 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006

ER -