Distributed constraint optimization for continuous mobile sensor coordination
de Schutter, B.D.
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. Â© 2018 European Control Association (EUCA).
To reference this document use:
Multi agent systems
Distributed constraint optimizations
Institute of Electrical and Electronics Engineers Inc.
2018 European Control Conference, ECC 2018, 16th European Control Conference, ECC 2018, 12 June 2018 through 15 June 2018, 1100-1105
Sponsor: European Control Association (EUCA)