Publication

ODPOP: An algorithm for Open/Distributed Constraint Optimization

Boi Faltings
2006
Reports

Abstract

We propose ODPOP, a new distributed algorithm for \textit{open multiagent combinatorial optimization} \cite{Faltings2005c}. The ODOP algorithm explores the same search space as the dynamic programming algorithm DPOP~\cite{Petcu2005} or the AND/OR search algorithm AOBB~\cite{Dechter2003}, but does so in an incremental, best-first fashion suitable for open problems. ODPOP has several advantages over DPOP. First, it uses messages whose size only grows linearly with the treewidth of the problem. Second, by letting agents explore values in a non-increasing order of preference, it saves a significant amount of messages and computation over the basic DPOP algorithm. To show the merits of our approach, we report on experiments with practically sized distributed meeting scheduling problems in a multiagent system.

Official source

https://infoscience.epfl.ch/entities/publication/8c461c63-e2d8-415a-ad1d-f156ba5db6ba

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Boi Faltings
2006
Reports

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/8c461c63-e2d8-415a-ad1d-f156ba5db6ba

About this result

Related concepts (31)

Search algorithm

In computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within particular data structure, or calculated in the search space of a problem domain, with either discrete or continuous values. Although search engines use search algorithms, they belong to the study of information retrieval, not algorithmics. The appropriate search algorithm to use often depends on the data structure being searched, and may also include prior knowledge about the data.

Prim's algorithm

In computer science, Prim's algorithm (also known as Jarník's algorithm) is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex.

Algorithm

In mathematics and computer science, an algorithm (ˈælɡərɪðəm) is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning), achieving automation eventually.

Related publications (32)

ODPOP: An algorithm for Open/Distributed Constraint Optimization

Chat with Graph Search

Two-stage optimization approach for dynamic routing and charging scheduling in electrified-autonomous flexible transit

Fundamental computational limits of weak learnability in high-dimensional multi-index models

Scalable Choice-Based Optimization with Decomposition and Breakpoint-Based Methods