H-DPOP: Using hard constraints for search space pruning in DCOP

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 325-330

  Kumar, Akshat ^a   Petcu, Adrian ^b   Faltings, Boi ^b  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED PROBLEMS; DISTRIBUTED CONSTRAINTS; HARD CONSTRAINTS; HYBRID ALGORITHMS; ORDERS OF MAGNITUDES; REAL PROBLEMS; SEARCH SPACE PRUNING;

ARTIFICIAL INTELLIGENCE; BIONICS; CONSTRAINED OPTIMIZATION; DYNAMIC PROGRAMMING; SYSTEMS ENGINEERING;

UNMANNED AERIAL VEHICLES (UAV);

EID: 57749193941     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Cheng, K. C. K., and Yap, R. H. C. 2005. Constrained decision diagrams. In Proceedings of the National Conference on Artificial Intelligence, AAAI-05, 366-371.
2. Dechter, R. 2003. Constraint Processing. Morgan Kaufmann.
3. Faltings, B. 2006. Distributed Constraint Programming. Foundations of Artificial Intelligence. Elsevier. 699-729.
4. Freuder, E. C. 1985. A sufficient condition for backtrack-bounded search. Journal of the ACM 32(14):755-761.
5. Kask, K.; Dechter, R.; Larrosa, J.; and Dechter, A. 2005. Unifying cluster-tree decompositions for automated reasoning in graphical models. Artificial Intelligence.
6. Knuth, D. E. 1993. The Stanford graphbase: a platform for combinatorial algorithms. In Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, 41-43.
7. Leyton-Brown, K.; Pearson, M.; and Shoham, Y. 2000. Towards a universal test suite for combinatorial auction algorithms. In Proceedings of ACM Conference on Electronic Commerce, EC-00, 235-245.
8. Mateescu, R., and Dechter, R. 2006. Compiling Constraint Networks into AND/OR Multi-Valued Decision Diagrams (AOMDDs). In Proceedings of the Twelfth International Conference on Principles and Practice of Constraint Programming (CP'06).
9. Meisels, A., and Zivan, R. 2003. Asynchronous forward-checking on Dis CSPs. In Proceedings of the Distributed Constraint Reasoning Workshop, IJCAI 2003, Acapulco, Mexico.
10. Modi, P. J.; Shen, W.M.; Tambe, M.; and Yokoo, M. 2005. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. AI Journal 161:149-180.
11. Petcu, A., and Faltings, B. 2005. DPOP: A scalable method for multiagent constraint optimization. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, IJCAI-05, 266-271.
12. Petcu, A. 2006. FRODO: A FRamework for Open and Distributed constraint Optimization. Technical Report No. 2006/001, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland. http://liawww.epfl.ch/frodo/.
13. Yokoo, M.; Durfee, E. H.; Ishida, T.; and Kuwabara, K. 1992. Distributed constraint satisfaction for formalizing distributed problem solving. In International Conference on Distributed Computing Systems, 614-621.
14. Yokoo, M.; Durfee, E. H.; Ishida, T.; and Kuwabara, K. 1998. The distributed constraint satisfaction problem - formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering 10(5):673-685.