Flexible and Scalable Methods for Multi-Agent Distributed Resource Allocations by Exploiting Phase Transitions
Abstract
This report summarizes the main findings and results on five independent yet closely related research topics, which were motivated by some difficult distributed constraint problems from Autonomous Negotiating Teams (ANTs) domains: (1) distributed constraint problem solving in sensor networks and low overhead distributed constraint algorithms, (2) analysis of negotiation protocols as distributed search, (3) phase transitions and backbones of the Traveling Salesman Problem, (4) configuration space analysis of Boolean satisfiability and backbone-guided local search, and (5) improved integer local search algorithms for complex scheduling problems. Our results provide deep understanding of the difficulty and complexity of distributed constraint problems in sensor networks and distributed environments, and produce effective and efficient methods, algorithms and software for these difficult problems.
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 2004
- Accession Number
- ADA423994
Entities
People
- Weixiong Zhang
Organizations
- University of Southern California