Lagrangian Relaxation for Large-Scale Multi-Agent Planning
Multi-agent planning is a well-studied problem with applications in various areas. Due to computational constraints, existing research typically focuses either on unstructured domains with many agents, where we are content with heuristic solutions, or domains with small numbers of agents or special...
Saved in:
Main Authors: | Gordon, Geoffrey J., VARAKANTHAM, Pradeep, YEOH, William, LAU, Hoong Chuin, Aravamudhan, Ajay Srinivasan, CHENG, Shih-Fen |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2012
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/larc/3 https://ink.library.smu.edu.sg/cgi/viewcontent.cgi?article=1002&context=larc |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Lagrangian relaxation for large-scale multi-agent planning
by: GORDON, Geoffrey J., et al.
Published: (2012) -
Lagrangian relaxation for large-scale multi-agent planning
by: GORDON, Geoff, et al.
Published: (2012) -
Lagrangian relaxation for large-scale multi-agent planning
by: GORDON, Geoff, et al.
Published: (2012) -
A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
by: Gunawan, A., et al.
Published: (2014) -
A Lagrangian column generation approach for the probabilistic crowdsourced logistics planning
by: HAN, Chung-kyun, et al.
Published: (2021)