Game theoretic optimal position computation of collaborating agents for visual area coverage

Sotiris Papatheodorou, Tembine Hamidou, Michalis Smyrnakis, Antonios Tzes

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

Abstract

The computation problem of the optimal position of collaborating mobile robots equipped with omnidirectional cameras for visual area coverage is the subject of this paper. The planar area has several stationary obstacles resulting in a computationally intractable search scheme. Rather than using gradient-based search methods, the multi-agent swarm is clustered to partially deal with the dimensionality curse. Each cluster is end-to-end connected and its area of responsibility is assigned based on its collective Voronoi tessellation. This area is then coarsely sampled and a game-theoretic approach is employed relying on fictitious play amongst the cluster’s members. The search scheme is then switched into a fine-spatial sampling and initialized using the previously attained coarse optimal positions of the agents. The provided adaptive-size game-theoretic optimization search approach provides the optimal location of the agents with a tenfold faster convergence compared to the gradient-search methods. Simulation studies are offered to highlight the efficiency of the search scheme.

Original languageEnglish (US)
Title of host publicationProceedings - 10th Hellenic Conference on Artificial Intelligence, SETN 2018
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781450364331
DOIs
StatePublished - Jul 9 2018
Event10th Hellenic Conference on Artificial Intelligence, SETN 2018 - Patras, Greece
Duration: Jul 9 2018Jul 12 2018

Other

Other10th Hellenic Conference on Artificial Intelligence, SETN 2018
CountryGreece
CityPatras
Period7/9/187/12/18

Fingerprint

Mobile robots
Cameras
Sampling

Keywords

  • Area coverage
  • Collaborative control
  • Game theory
  • Multi–agent optimization

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Papatheodorou, S., Hamidou, T., Smyrnakis, M., & Tzes, A. (2018). Game theoretic optimal position computation of collaborating agents for visual area coverage In Proceedings - 10th Hellenic Conference on Artificial Intelligence, SETN 2018 Association for Computing Machinery. https://doi.org/10.1145/3200947.3201015

Game theoretic optimal position computation of collaborating agents for visual area coverage . / Papatheodorou, Sotiris; Hamidou, Tembine; Smyrnakis, Michalis; Tzes, Antonios.

Proceedings - 10th Hellenic Conference on Artificial Intelligence, SETN 2018. Association for Computing Machinery, 2018.

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

Papatheodorou, S, Hamidou, T, Smyrnakis, M & Tzes, A 2018, Game theoretic optimal position computation of collaborating agents for visual area coverage in Proceedings - 10th Hellenic Conference on Artificial Intelligence, SETN 2018. Association for Computing Machinery, 10th Hellenic Conference on Artificial Intelligence, SETN 2018, Patras, Greece, 7/9/18. https://doi.org/10.1145/3200947.3201015
Papatheodorou S, Hamidou T, Smyrnakis M, Tzes A. Game theoretic optimal position computation of collaborating agents for visual area coverage In Proceedings - 10th Hellenic Conference on Artificial Intelligence, SETN 2018. Association for Computing Machinery. 2018 https://doi.org/10.1145/3200947.3201015
Papatheodorou, Sotiris ; Hamidou, Tembine ; Smyrnakis, Michalis ; Tzes, Antonios. / Game theoretic optimal position computation of collaborating agents for visual area coverage Proceedings - 10th Hellenic Conference on Artificial Intelligence, SETN 2018. Association for Computing Machinery, 2018.
@inproceedings{2c6260f7c9a443d7be0759e3fecb2dbe,
title = "Game theoretic optimal position computation of collaborating agents for visual area coverage∗",
abstract = "The computation problem of the optimal position of collaborating mobile robots equipped with omnidirectional cameras for visual area coverage is the subject of this paper. The planar area has several stationary obstacles resulting in a computationally intractable search scheme. Rather than using gradient-based search methods, the multi-agent swarm is clustered to partially deal with the dimensionality curse. Each cluster is end-to-end connected and its area of responsibility is assigned based on its collective Voronoi tessellation. This area is then coarsely sampled and a game-theoretic approach is employed relying on fictitious play amongst the cluster’s members. The search scheme is then switched into a fine-spatial sampling and initialized using the previously attained coarse optimal positions of the agents. The provided adaptive-size game-theoretic optimization search approach provides the optimal location of the agents with a tenfold faster convergence compared to the gradient-search methods. Simulation studies are offered to highlight the efficiency of the search scheme.",
keywords = "Area coverage, Collaborative control, Game theory, Multi–agent optimization",
author = "Sotiris Papatheodorou and Tembine Hamidou and Michalis Smyrnakis and Antonios Tzes",
year = "2018",
month = "7",
day = "9",
doi = "10.1145/3200947.3201015",
language = "English (US)",
booktitle = "Proceedings - 10th Hellenic Conference on Artificial Intelligence, SETN 2018",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Game theoretic optimal position computation of collaborating agents for visual area coverage∗

AU - Papatheodorou, Sotiris

AU - Hamidou, Tembine

AU - Smyrnakis, Michalis

AU - Tzes, Antonios

PY - 2018/7/9

Y1 - 2018/7/9

N2 - The computation problem of the optimal position of collaborating mobile robots equipped with omnidirectional cameras for visual area coverage is the subject of this paper. The planar area has several stationary obstacles resulting in a computationally intractable search scheme. Rather than using gradient-based search methods, the multi-agent swarm is clustered to partially deal with the dimensionality curse. Each cluster is end-to-end connected and its area of responsibility is assigned based on its collective Voronoi tessellation. This area is then coarsely sampled and a game-theoretic approach is employed relying on fictitious play amongst the cluster’s members. The search scheme is then switched into a fine-spatial sampling and initialized using the previously attained coarse optimal positions of the agents. The provided adaptive-size game-theoretic optimization search approach provides the optimal location of the agents with a tenfold faster convergence compared to the gradient-search methods. Simulation studies are offered to highlight the efficiency of the search scheme.

AB - The computation problem of the optimal position of collaborating mobile robots equipped with omnidirectional cameras for visual area coverage is the subject of this paper. The planar area has several stationary obstacles resulting in a computationally intractable search scheme. Rather than using gradient-based search methods, the multi-agent swarm is clustered to partially deal with the dimensionality curse. Each cluster is end-to-end connected and its area of responsibility is assigned based on its collective Voronoi tessellation. This area is then coarsely sampled and a game-theoretic approach is employed relying on fictitious play amongst the cluster’s members. The search scheme is then switched into a fine-spatial sampling and initialized using the previously attained coarse optimal positions of the agents. The provided adaptive-size game-theoretic optimization search approach provides the optimal location of the agents with a tenfold faster convergence compared to the gradient-search methods. Simulation studies are offered to highlight the efficiency of the search scheme.

KW - Area coverage

KW - Collaborative control

KW - Game theory

KW - Multi–agent optimization

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

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

U2 - 10.1145/3200947.3201015

DO - 10.1145/3200947.3201015

M3 - Conference contribution

AN - SCOPUS:85052018456

BT - Proceedings - 10th Hellenic Conference on Artificial Intelligence, SETN 2018

PB - Association for Computing Machinery

ER -