Full exam for Autonomous Agents and Multiagent Systems in the Computer Engineering degree programme at Politecnico di Milano. The document covers: Politecnico di Milano Facoltà di Ingegneria dell’Informazione AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS March 7th, 2012 LAST NAME AND FIRST NAME ROW COLUMN ID NUMBER (MATRICOLA) The exam is composed of three stapled sheets printed on both sides. This front page must be filled
Full exam for Autonomous Agents and Multiagent Systems in the Computer Engineering degree programme at Politecnico di Milano. The document covers: Politecnico di Milano Facoltà di Ingegneria dell’Informazione AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS March 7th, 2012 LAST NAME AND FIRST NAME ROW COLUMN ID NUMBER (MATRICOLA) The exam is composed of three stapled sheets printed on both sides. This front page must be filled
Import quality: text was extracted directly from the original document.
Representative passages recognised in different parts of the material. The full extracted text remains available to search, while this compact preview makes the page easier to read.
Politecnico di Milano Facoltà di Ingegneria dell’Informazione AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS March 7th, 2012 LAST NAME AND FIRST NAME ROW COLUMN ID NUMBER (MATRICOLA) The exam is composed of three stapled sheets printed on both sides. This front page must be filled with last name, first name, ID number, position (row and column communicated by the instructor), and signature. Exams without a completely filled front page or with missing sheets will not be considered. Answers can be written only on these sheets. If you need more space, please write on the last page. Exam is closed books (i.e., no books, notebooks, notes, … are allowed). Cell phones, bags, cases, and wallets are not allowed on the desk during the exam. All the answers must be justified. SIGNATURE Question 1 (8 points). Consider a DCSP with 5 agents (A, B, C, D, and E) with the domains and the constraints represented in the following graph, where each edge is a ≠ ( different) constraint (for example, the values of agents A and B must be different): A B C E D {1,2,3} {1,3} {1,2} {2,3} {2} The priority of the agents is given by their lexicographic order: A has highest priority, B has second- highest priority, and so on. 1) Assuming that the agents activate at discrete turns according to their lexicographic order (starting with A) and that, all else being equal, values are chosen from domains in increasing order, report the messages exchanged between the agents when the asynchronous backtracking algorithm is used to solve the above DCSP. Do not consider the ADD-NEIGHBOR procedure. Report also the solution found. 2) For which priority order of the agents does the asynchronous backtracking algorithm exchange the minimum number of messages? Justify the answer. 1) The messages exchanged between the…
First page of the document.
