Using additional information in DisCSPs search Prof. Amnon Meisels and Mr. Oz Lavee Prof. Amnon Meisels and Mr. Oz Lavee Ben Gurion University Israel.

Slides:



Advertisements
Similar presentations
Hybrid BDD and All-SAT Method for Model Checking Orna Grumberg Joint work with Assaf Schuster and Avi Yadgar Technion – Israel Institute of Technology.
Advertisements

Constraint Satisfaction Patrick Prosser. An Example, Exam Timetabling Someone timetables the exams We have a number of courses to examine how many? Dept.
MSS S i Half Reply Other MSSs ACCEPT OR REJECT MH H i NEWTKT REQUESTACK ACKs ART Start ART End AWT Start AWT End.
Impossibility of Distributed Consensus with One Faulty Process
Distributed Constraint Satisfaction Problems M OHSEN A FSHARCHI.
Distributed Constraint Optimization Problems M OHSEN A FSHARCHI.
Adopt Algorithm for Distributed Constraint Optimization
CompAPO: A complete version of the APO Algorithm Tal Grinshpoun and Amnon Meisels Department of Computer Science Ben-Gurion University of the Negev.
1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)
מערכת החזיה וממשק משתמש גרפי לסימולטור בעיבוד אילוצים מבוזר ניר הרשהורן וגיא רפפורט הנדסת תוכנה 2010/2011 אז מה אתם עושים בפרוייקט שלכם ?
Super solutions for combinatorial auctions Alan Holland & Barry O’Sullivan {a.holland,
Review: Constraint Satisfaction Problems How is a CSP defined? How do we solve CSPs?
1 Restart search techniques for Employee Timetabling Problems Amnon Meisels And Eliezer Kaplansky Ben-Gurion University.
PlanSIG, Dec, Temporal Plans and Resource Management Pieter Buzing & Cees Witteveen Delft University of Technology.
Local Search for Distributed SAT JIN Xiaolong (Based on [1] )
Academic Advisor: Prof. Ronen Brafman Team Members: Ran Isenberg Mirit Markovich Noa Aharon Alon Furman.
Multi-agent Oriented Constraint Satisfaction Authors: Jiming Liu, Han Jing and Y.Y. Tang Speaker: Lin Xu CSCE 976, May 1st 2002.
Constraint Satisfaction CSE 473 University of Washington.
CPSC 322, Lecture 12Slide 1 CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12 (Textbook Chpt ) January, 29, 2010.
Constraint Satisfaction Problems
Jean-Charles REGIN Michel RUEHER ILOG Sophia Antipolis Université de Nice – Sophia Antipolis A global constraint combining.
Constraint Propagation (Where a better exploitation of the constraints further reduces the need to make decisions) R&N: Chap. 5 + Chap. 24, p
Penalties for Distributed Local Search Muhammed B. Basharu.
CPSC 322, Lecture 17Slide 1 Planning: Representation and Forward Search Computer Science cpsc322, Lecture 17 (Textbook Chpt 8.1 (Skip )- 8.2) February,
Developing a Deterministic Patrolling Strategy for Security Agents Nicola Basilico, Nicola Gatti, Francesco Amigoni.
Search Algorithms for Agents
Multiagent Planning with Factored MDPs Carlos Guestrin Daphne Koller Stanford University Ronald Parr Duke University.
BNAIC, Oct, Temporal Plans and Resource Management Pieter Buzing & Cees Witteveen TU Delft.
Impact of Problem Centralization on Distributed Constraint Optimization Algorithms John P. Davin and Pragnesh Jay Modi Carnegie Mellon University School.
Distributed Scheduling. What is Distributed Scheduling? Scheduling: –A resource allocation problem –Often very complex set of constraints –Tied directly.
Constraint Satisfaction Not all problems are solved by a sequential series of steps. How do we solve other types of problems?
1 2.5:Reason Using Properties from Algebra Goal:Use algebraic properties in logical arguments.
Technical Coordination in Open Source Software Development James D. Herbsleb School of Computer Science Carnegie Mellon University
Distributed Constraint Optimization Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University A4M33MAS.
Cooperative Meeting Scheduling among Agents based on Multiple Negotiations Toramatsu SHINTANI and Takayuki ITO Department of Intelligence and Computer.
Constraint Satisfaction Problems (CSPs) CPSC 322 – CSP 1 Poole & Mackworth textbook: Sections § Lecturer: Alan Mackworth September 28, 2012.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Constraint Satisfaction Problems Chapter 6. Review Agent, Environment, State Agent as search problem Uninformed search strategies Informed (heuristic.
CS584 - Software Multiagent Systems Lecture 12 Distributed constraint optimization II: Incomplete algorithms and recent theoretical results.
Constraint Satisfaction CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Constraint Satisfaction Problems/Programming ZUI 2012/2013.
Distributed Constraint Satisfaction: Foundation of Cooperation in Multi-agent Systems Makoto Yokoo Kyushu University lang.is.kyushu-u.ac.jp/~yokoo/
Edge and Boundary interpretation Consistent line drawing labeling via backtracking Presented by Guy Shtub.
Solving Problems by searching Well defined problems A probem is well defined if it is easy to automatically asses the validity (utility) of any proposed.
Distributed Constraint Satisfaction Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University A4M33MAS.
Schreiber, Yevgeny. Value-Ordering Heuristics: Search Performance vs. Solution Diversity. In: D. Cohen (Ed.) CP 2010, LNCS 6308, pp Springer-
Chapter 5 Constraint Satisfaction Problems
Review Test1. Robotics & Future Technology Future of Intelligent Systems / Ray Kurzweil futurist Ray Kurzweil / A Long Bet A Long Bet / Robot Soccer.
Performance of Distributed Constraint Optimization Algorithms A.Gershman, T. Grinshpon, A. Meisels and R. Zivan Dept. of Computer Science Ben-Gurion University.
Proposal of Asynchronous Distributed Branch and Bound Atsushi Sasaki†, Tadashi Araragi†, Shigeru Masuyama‡ †NTT Communication Science Laboratories, NTT.
Constraint Satisfaction Problems/Programming ZUI 2012/2013.
Algorithmic and Domain Centralization in Distributed Constraint Optimization Problems John P. Davin Carnegie Mellon University June 27, 2005 Committee:
Formal Complexity Analysis of RoboFlag Drill & Communication and Computation in Distributed Negotiation Algorithms in Distributed Negotiation Algorithms.
Hybrid BDD and All-SAT Method for Model Checking
BnB vs Label Relaxation.
An Algorithm for Multi-Criteria Optimization in CSPs
Constraint Satisfaction Problems (CSPs)
Constraint Satisfaction Problem
Solving Equations by Factoring and Problem Solving
Asynchronous Partitioning Framework
Towards Next Generation Panel at SAINT 2002
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
Heuristic Ordering for Asynchronous Backtracking
Hierarchical Search on DisCSPs
Incorporating Constraint Checking Costs in Constraint Satisfaction Problem Suryakant Sansare.
Hierarchical Search on DisCSPs
Type Systems For Distributed Data Sharing
Constraint Satisfaction
CSP: Definition, Creation, and Algorithms
Constraint Satisfaction Problems
Presentation transcript:

Using additional information in DisCSPs search Prof. Amnon Meisels and Mr. Oz Lavee Prof. Amnon Meisels and Mr. Oz Lavee Ben Gurion University Israel

Over View Privacy in the DisCSP –earlier work. Privacy in the DisCSP –earlier work. The meeting scheduling problem. The meeting scheduling problem. The ABT-CBJ, multi variable ABT algorithm. The ABT-CBJ, multi variable ABT algorithm. Privacy in asynchronous search. Privacy in asynchronous search. Volunteering information in ABT algorithm. Volunteering information in ABT algorithm. Experimental result Experimental result

Privacy in DisCSP One of the reasons for using distributed search is privacy. One of the reasons for using distributed search is privacy. Earlier Work: Secure Distributed Constraint Satisfaction: Secure Distributed Constraint Satisfaction: - M. Yokoo et. al. - M. Yokoo et. al. Distributed Forward checking Distributed Forward checking – I. Brito and P. Meseguer. – I. Brito and P. Meseguer. Privacy/efficiency tradeoff and information reasoning Privacy/efficiency tradeoff and information reasoning – Wallace et. al. – Wallace et. al.

The goal This work is inspired from the work of Wallace et. al. This work is inspired from the work of Wallace et. al. In this work, we tried to understand the relation between the level of information revealing and the efficiency of the DisCSP search process. In this work, we tried to understand the relation between the level of information revealing and the efficiency of the DisCSP search process.

Meeting Scheduling Problem (MSP) Coordinating meetings among agents Coordinating meetings among agents where all agents can attend their meetings. Characteristic: Real world problem.Real world problem. Has a distributed structure.Has a distributed structure. Information privacy –Information privacy – agents will not want to reveal information regarding their calendar and their meetings agents will not want to reveal information regarding their calendar and their meetings

Meeting Scheduling Problem Wallace et. al. Each agent has his own calendar with private meetings Each agent has his own calendar with private meetings Each meeting consist of and it is one hour long. Each meeting consist of and it is one hour long.Goal: - Schedule a meeting that all Agents can attend with respect to the traveling time from their own private meetings.

Meeting scheduling problem Drawbacks at wallace MSP Drawbacks at wallace MSP One meeting to be scheduled, can be solved in polynomial time.One meeting to be scheduled, can be solved in polynomial time. Synchronous search process.Synchronous search process. In order to extend the Meeting Scheduling Problem to a more realistic search problem : In order to extend the Meeting Scheduling Problem to a more realistic search problem : Several meetings to be scheduled.Several meetings to be scheduled. In each meeting there is a different sub group of participants.In each meeting there is a different sub group of participants.

Meeting Scheduling problem Group S of m agents Group S of m agents Group T of n meetings Group T of n meetings Each meeting is associated with a set s i  S of agents that attend it. Each meeting is associated with a set s i  S of agents that attend it. Each meeting is associated with a location Each meeting is associated with a locationGoal: Schedule time for every meeting that enable all the participants to travel among their meetings Schedule time for every meeting that enable all the participants to travel among their meetings Remark – no private meetings. Remark – no private meetings.

Meeting Scheduling as Centralized CSP A 1 attends m 1,m 3,m 4 A 2 attends m 2,m 4 A 3 attends m 1,m 2 A 4 attends m 2,m 3 AC- Arriving Constraint m1m1 m3m3 m4m4 m2m2 AC

Meeting Scheduling as DisCSP x11x11 x22x22 x13x13 x23x23 x42x42 x44x44 x32x32 x31x31 x14x14 A1A1 A2A2 A3A3 A4A4 = = = = = = AC

ABT-CBJ Algorithm For this multi variable per agent problem, we used the ABT-CBJ algorithm: Multi Variable per agent. Multi Variable per agent. ABT Based algorithm. ABT Based algorithm. In each step, agent’s variables are assigned according to the CBJ algorithm. In each step, agent’s variables are assigned according to the CBJ algorithm. Assumption: agent variables are in a successive order among the total order of variables.

Privacy measurement What is information in an asynchronous distributed search process? What is information in an asynchronous distributed search process? What is an information unit ? What is an information unit ? What is the value of an information unit? What is the value of an information unit?

OK? Message The agent state and the Assigned values are change asynchronously. The agent state and the Assigned values are change asynchronously. The validity of the information retrieved from an OK? Message on the sending agent state is temporal. The validity of the information retrieved from an OK? Message on the sending agent state is temporal. XiXi

Nogood message A nogood is always correct. A nogood is always correct. Nogood can be referred as an information unit. Nogood can be referred as an information unit. The value of a nogood is the ratio of the eliminated subtree with the total search space The value of a nogood is the ratio of the eliminated subtree with the total search space Value(ng ) = Value(ng ) = D i+1 *…*D n /D 1 *…*D n

Nogood as information unit Reducing the number of nogood sent in the search process may affect the completeness of the search. Reducing the number of nogood sent in the search process may affect the completeness of the search. on the other hand: Does Volunteering additional nogoods will improve the search process? Does Volunteering additional nogoods will improve the search process?

Additional nogoods in MSP Generating additional nogoods in MSP does not require many CC’s. Generating additional nogoods in MSP does not require many CC’s. A2A2 A5A5 A8A8 x23x23 x84x84 x83x83 x54x54 AC

Additional nogoods in MSP Generating additional nogoods in MSP does not require many CC’s. Generating additional nogoods in MSP does not require many CC’s. A2A2 A5A5 A8A8 x23x23 x84x84 x83x83 x54x54 AC Conflict

Additional nogoods in MSP Generating additional nogoods in MSP does not require many CC’s. Generating additional nogoods in MSP does not require many CC’s. A2A2 A5A5 A8A8 x23x23 x84x84 x83x83 x54x54 AC NoGood(x 2 3 = Rome,Mon,14:00, x 5 4 =Paris,Mon,14:00>) Conflict

Additional nogoods in MSP Generating additional nogoods in MSP does not require many CC’s. Generating additional nogoods in MSP does not require many CC’s. A2A2 A5A5 A8A8 x23x23 x84x84 x83x83 x54x54 AC NoGood( x 2 3 = Rome,Mon,14:00, x 5 4 =Paris,Mon,14:00>) Conflict NoGood( x 2 3 = Rome,Mon,14:00, x 5 4 =Paris,Mon,15:00>)

The Experiment 16 - agents 16 - agents 9 - meetings 9 - meetings 3 - meeting per agent 3 - meeting per agent 24 - domain size 24 - domain size 2 different distance matrixes 2 different distance matrixes

Experimental Result Messages and CCC’s Vs. number of additional nogood in a message

Privacy Measurements Performance measurements Vs. information sent ratio

Conclusion The Meeting scheduling problem as a DisCSP The Meeting scheduling problem as a DisCSP aspect of information in an asynchronous search. aspect of information in an asynchronous search. The influence of volunteering information on the efficiency of the search process The influence of volunteering information on the efficiency of the search process