Distributed constraint optimization for continuous mobile sensor coordination

Jeroen Fransman, Joris Sijs, Henry Dol, Erik Theunissen, Bart De Schutter

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

2 Citations (Scopus)


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 languageEnglish
Title of host publicationProceedings of 2018 European Control Conference (ECC2018)
Place of PublicationPiscataway, NJ, USA
ISBN (Electronic)978-3-9524-2698-2
ISBN (Print)978-3-9524-2699-9
Publication statusPublished - 2018
Event16th European Control Conference, ECC 2018 - Limassol, Cyprus
Duration: 12 Jun 201815 Jun 2018


Conference16th European Control Conference, ECC 2018
Abbreviated titleECC 2018
Internet address


Dive into the research topics of 'Distributed constraint optimization for continuous mobile sensor coordination'. Together they form a unique fingerprint.

Cite this