A distributed joint-learning and auction algorithm for target assignment

Teymur Sadikhov, Minghui Zhu, Sonia Martínez

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

1 Citation (Scopus)

Abstract

We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents incur cost or reward while traveling on the edges of this graph. Agents do not know the graph or the locations of the targets on it. However, they can obtain local information about these by local sensing and communicating with other agents within a limited range. To solve this problem, we come up with a new distributed algorithm that integrates Q-Learning and a distributed auction. The Q-Learning part helps estimate the assignment benefits calculated by summing up rewards over the graph edges for each agent-target pair, while the auction part takes care of assigning agents to targets in a distributed fashion. The algorithm is shown to terminate with a near-optimal assignment in a finite time. Optimality refers to the assignment benefit maximization, which can depend on a target-agent pair value, and the routing cost of the agent to visit the target.

Original languageEnglish (US)
Title of host publication2010 49th IEEE Conference on Decision and Control, CDC 2010
Pages5450-5455
Number of pages6
DOIs
StatePublished - Dec 1 2010
Event2010 49th IEEE Conference on Decision and Control, CDC 2010 - Atlanta, GA, United States
Duration: Dec 15 2010Dec 17 2010

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other2010 49th IEEE Conference on Decision and Control, CDC 2010
CountryUnited States
CityAtlanta, GA
Period12/15/1012/17/10

Fingerprint

Auctions
Assignment
Target
Q-learning
Reward
Graph in graph theory
Learning
Costs
Terminate
Assignment Problem
Distributed Algorithms
Parallel algorithms
Undirected Graph
Optimality
Routing
Sensing
Integrate
Unknown
Estimate
Range of data

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

Sadikhov, T., Zhu, M., & Martínez, S. (2010). A distributed joint-learning and auction algorithm for target assignment. In 2010 49th IEEE Conference on Decision and Control, CDC 2010 (pp. 5450-5455). [5718180] (Proceedings of the IEEE Conference on Decision and Control). https://doi.org/10.1109/CDC.2010.5718180
Sadikhov, Teymur ; Zhu, Minghui ; Martínez, Sonia. / A distributed joint-learning and auction algorithm for target assignment. 2010 49th IEEE Conference on Decision and Control, CDC 2010. 2010. pp. 5450-5455 (Proceedings of the IEEE Conference on Decision and Control).
@inproceedings{25c92807926842f6a8e465c6cde0f244,
title = "A distributed joint-learning and auction algorithm for target assignment",
abstract = "We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents incur cost or reward while traveling on the edges of this graph. Agents do not know the graph or the locations of the targets on it. However, they can obtain local information about these by local sensing and communicating with other agents within a limited range. To solve this problem, we come up with a new distributed algorithm that integrates Q-Learning and a distributed auction. The Q-Learning part helps estimate the assignment benefits calculated by summing up rewards over the graph edges for each agent-target pair, while the auction part takes care of assigning agents to targets in a distributed fashion. The algorithm is shown to terminate with a near-optimal assignment in a finite time. Optimality refers to the assignment benefit maximization, which can depend on a target-agent pair value, and the routing cost of the agent to visit the target.",
author = "Teymur Sadikhov and Minghui Zhu and Sonia Mart{\'i}nez",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/CDC.2010.5718180",
language = "English (US)",
isbn = "9781424477456",
series = "Proceedings of the IEEE Conference on Decision and Control",
pages = "5450--5455",
booktitle = "2010 49th IEEE Conference on Decision and Control, CDC 2010",

}

Sadikhov, T, Zhu, M & Martínez, S 2010, A distributed joint-learning and auction algorithm for target assignment. in 2010 49th IEEE Conference on Decision and Control, CDC 2010., 5718180, Proceedings of the IEEE Conference on Decision and Control, pp. 5450-5455, 2010 49th IEEE Conference on Decision and Control, CDC 2010, Atlanta, GA, United States, 12/15/10. https://doi.org/10.1109/CDC.2010.5718180

A distributed joint-learning and auction algorithm for target assignment. / Sadikhov, Teymur; Zhu, Minghui; Martínez, Sonia.

2010 49th IEEE Conference on Decision and Control, CDC 2010. 2010. p. 5450-5455 5718180 (Proceedings of the IEEE Conference on Decision and Control).

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

TY - GEN

T1 - A distributed joint-learning and auction algorithm for target assignment

AU - Sadikhov, Teymur

AU - Zhu, Minghui

AU - Martínez, Sonia

PY - 2010/12/1

Y1 - 2010/12/1

N2 - We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents incur cost or reward while traveling on the edges of this graph. Agents do not know the graph or the locations of the targets on it. However, they can obtain local information about these by local sensing and communicating with other agents within a limited range. To solve this problem, we come up with a new distributed algorithm that integrates Q-Learning and a distributed auction. The Q-Learning part helps estimate the assignment benefits calculated by summing up rewards over the graph edges for each agent-target pair, while the auction part takes care of assigning agents to targets in a distributed fashion. The algorithm is shown to terminate with a near-optimal assignment in a finite time. Optimality refers to the assignment benefit maximization, which can depend on a target-agent pair value, and the routing cost of the agent to visit the target.

AB - We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents incur cost or reward while traveling on the edges of this graph. Agents do not know the graph or the locations of the targets on it. However, they can obtain local information about these by local sensing and communicating with other agents within a limited range. To solve this problem, we come up with a new distributed algorithm that integrates Q-Learning and a distributed auction. The Q-Learning part helps estimate the assignment benefits calculated by summing up rewards over the graph edges for each agent-target pair, while the auction part takes care of assigning agents to targets in a distributed fashion. The algorithm is shown to terminate with a near-optimal assignment in a finite time. Optimality refers to the assignment benefit maximization, which can depend on a target-agent pair value, and the routing cost of the agent to visit the target.

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

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

U2 - 10.1109/CDC.2010.5718180

DO - 10.1109/CDC.2010.5718180

M3 - Conference contribution

AN - SCOPUS:79953150786

SN - 9781424477456

T3 - Proceedings of the IEEE Conference on Decision and Control

SP - 5450

EP - 5455

BT - 2010 49th IEEE Conference on Decision and Control, CDC 2010

ER -

Sadikhov T, Zhu M, Martínez S. A distributed joint-learning and auction algorithm for target assignment. In 2010 49th IEEE Conference on Decision and Control, CDC 2010. 2010. p. 5450-5455. 5718180. (Proceedings of the IEEE Conference on Decision and Control). https://doi.org/10.1109/CDC.2010.5718180