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, Geoff, VARAKANTHAM, Pradeep Reddy, YEOH, William, SRINIVASAN, Ajay, LAU, Hoong Chuin, CHENG, Shih-Fen |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2012
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/1565 https://ink.library.smu.edu.sg/context/sis_research/article/2564/viewcontent/aamas12_slr.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Lagrangian Relaxation for Large-Scale Multi-Agent Planning
由: Gordon, Geoffrey J., et al.
出版: (2012) -
Lagrangian relaxation for large-scale multi-agent planning
由: GORDON, Geoffrey J., et al.
出版: (2012) -
Lagrangian relaxation for large-scale multi-agent planning
由: GORDON, Geoff, et al.
出版: (2012) -
A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
由: Gunawan, A., et al.
出版: (2014) -
A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
由: GUNAWAN, Aldy, et al.
出版: (2012)