Lagrangian Relaxation for Large-Scale Multi-agent Planning.
Geoffrey J. GordonPradeep VarakanthamWilliam YeohHoong Chuin LauAjay S. AravamudhanShih-Fen ChengPublished in: IAT (2012)
Keyphrases
- lagrangian relaxation
- multi agent planning
- integer programming
- feasible solution
- dynamic programming
- np hard
- lower bound
- lower and upper bounds
- multi agent
- column generation
- branch and bound algorithm
- dual decomposition
- linear programming
- lagrangian heuristic
- partial observability
- shortest path
- upper bound
- graph cuts
- optimization problems
- evolutionary algorithm
- search algorithm