Researchers have developed a new framework for tackling large-scale distributed constraint optimization problems (DCOPs), particularly for applications like satellite scheduling. The approach combines online learning algorithms with an iterative pricing method to efficiently allocate tasks and optimize local scheduling. This method achieved near-optimal performance, fulfilling over 99% of observation requests in real-world decentralized satellite scheduling scenarios, significantly outperforming existing baselines. AI
IMPACT This research could enable more efficient and scalable solutions for complex scheduling problems in domains like satellite operations.
RANK_REASON The cluster contains a research paper detailing a new algorithmic framework for distributed constraint optimization problems. [lever_c_demoted from research: ic=1 ai=1.0]
- alphaXiv
- arXiv
- CatalyzeX Code Finder for Papers
- CORE Recommender
- DagsHub
- Gotit.pub
- Hugging Face
- Influence Flower
- iterative pricing
- online learning
- Pranav Rajbhandari
- ScienceCast
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
