Lagrangian relaxation for large-scale multi-agent planning.
Geoffrey J. GordonPradeep VarakanthamWilliam YeohHoong Chuin LauAjay S. AravamudhanShih-Fen ChengPublished in: AAMAS (2012)
Keyphrases
- lagrangian relaxation
- multi agent planning
- integer programming
- np hard
- branch and bound algorithm
- lower bound
- dual decomposition
- column generation
- feasible solution
- dynamic programming
- multi agent
- linear programming
- partial observability
- lower and upper bounds
- shortest path
- upper bound
- lagrangian heuristic
- markov decision processes
- constraint programming
- branch and bound
- linear program
- distributed systems
- computational complexity
- data structure