Abstract
DCOP (Distributed Constraint optimization Problem) is a framework for representing distributed multi- agent problems. However, it only allows discrete values for the decision variables, which limits its application for real-world problems. In this paper, an extension of DCOP is investigated to handle variables with continuous domains. Additionally, an iterative any-time algorithm Compression-DPOP (C-DPOP) is presented that is based on the Distributed Pseudo-tree Opti- mization Procedure (DPOP). C-DPOP iteratively samples the search space in order to handle problems that are restricted by time and memory limitations. The performance of the algorithm is examined through a mobile sensor coordination problem. The proposed algorithm outperforms DPOP with uniform sampling regarding both resource requirement and performance.
Original language | English |
---|---|
Title of host publication | Proceedings of 2018 European Control Conference (ECC2018) |
Place of Publication | Piscataway, NJ, USA |
Publisher | IEEE |
Pages | 1100-1105 |
ISBN (Electronic) | 978-3-9524-2698-2 |
ISBN (Print) | 978-3-9524-2699-9 |
DOIs | |
Publication status | Published - 2018 |
Event | 16th European Control Conference, ECC 2018 - Limassol, Cyprus Duration: 12 Jun 2018 → 15 Jun 2018 http://www.ecc18.eu/ |
Conference
Conference | 16th European Control Conference, ECC 2018 |
---|---|
Abbreviated title | ECC 2018 |
Country/Territory | Cyprus |
City | Limassol |
Period | 12/06/18 → 15/06/18 |
Internet address |