Work

Lp-Norm based algorithm for multi-objective distributed constraint optimization

Year: 2014

Type: conference-paper

Abstract: In this paper, we develop a novel algorithm which finds a subset of Pareto front of a Multi-Objective Distributed Constraint Optimization Problem. This algorithm utilizes the Lp-norm method, pseudo-tree, and Dynamic Programming technique. Furthermore, we show that this Lp-norm based algorithm can only guarantee to find a Pareto optimal solution, when we employ L1-norm (Manhattan norm).

Source: Adaptive Agents and Multi-Agents Systems

DOI: 10.65109/xcdp4676

Authors: Tenda Okimoto, Nicolas Schwind, Maxime Clement, Katsumi Inoue

Institution: National Institute of Informatics

Language: English

Topic: Constraint Satisfaction and Optimization

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7124159199

FWCI: 0.758

Cites: 6

Cited by: 5

Related to: 10