Optimize my schedule but keep it flexible: Distributed multi-criteria coordination for personal assistants

Emma Bowring, Milind Tambe, Makoto Yokoo

Research output: Contribution to conferencePaper

2 Citations (Scopus)

Abstract

Research projects have begun focusing on deploying personal assistant agents to coordinate users in such diverse environments as offices, distributed manufacturing or design centers, and in support of first responders for emergencies. In such environments, distributed constraint optimization (DCOP) has emerged as a key technology for multiple collaborative assistants to coordinate with each other. Unfortunately, while previous work in DCOP only focuses on coordination in service of optimizing a single global team objective, personal assistants often require satisfying additional individual user-specified criteria. This paper provides a novel DCOP algorithm that enables personal assistants to engage in such multicriteria coordination while maintaining the privacy of their additional criteria. It uses n-ary NOGOODS implemented as private variables to achieve this. In addition, we've developed an algorithm that reveals only the individual criteria of a link and can speed up performance for certain problem structures. The key idea in this algorithm is that interleaving the criteria searches - rather than sequentially attempting to satisfy the criteria - improves efficiency by mutually constraining the distributed search for solutions. These ideas are realized in the form of private-g and public-g Multi-criteria ADOPT, built on top of ADOPT, one of the most efficient DCOP algorithms. We present our detailed algorithm, as well as some experimental results in personal assistant domains.

Original languageEnglish
Pages39-46
Number of pages8
Publication statusPublished - Dec 1 2005
Event2005 AAAI Spring Symposium - Stanford, CA, United States
Duration: Mar 21 2005Mar 23 2005

Other

Other2005 AAAI Spring Symposium
CountryUnited States
CityStanford, CA
Period3/21/053/23/05

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Bowring, E., Tambe, M., & Yokoo, M. (2005). Optimize my schedule but keep it flexible: Distributed multi-criteria coordination for personal assistants. 39-46. Paper presented at 2005 AAAI Spring Symposium, Stanford, CA, United States.

Optimize my schedule but keep it flexible : Distributed multi-criteria coordination for personal assistants. / Bowring, Emma; Tambe, Milind; Yokoo, Makoto.

2005. 39-46 Paper presented at 2005 AAAI Spring Symposium, Stanford, CA, United States.

Research output: Contribution to conferencePaper

Bowring, E, Tambe, M & Yokoo, M 2005, 'Optimize my schedule but keep it flexible: Distributed multi-criteria coordination for personal assistants', Paper presented at 2005 AAAI Spring Symposium, Stanford, CA, United States, 3/21/05 - 3/23/05 pp. 39-46.
Bowring E, Tambe M, Yokoo M. Optimize my schedule but keep it flexible: Distributed multi-criteria coordination for personal assistants. 2005. Paper presented at 2005 AAAI Spring Symposium, Stanford, CA, United States.
Bowring, Emma ; Tambe, Milind ; Yokoo, Makoto. / Optimize my schedule but keep it flexible : Distributed multi-criteria coordination for personal assistants. Paper presented at 2005 AAAI Spring Symposium, Stanford, CA, United States.8 p.
@conference{3b1ba6f6e75a4434a38d0797956ede77,
title = "Optimize my schedule but keep it flexible: Distributed multi-criteria coordination for personal assistants",
abstract = "Research projects have begun focusing on deploying personal assistant agents to coordinate users in such diverse environments as offices, distributed manufacturing or design centers, and in support of first responders for emergencies. In such environments, distributed constraint optimization (DCOP) has emerged as a key technology for multiple collaborative assistants to coordinate with each other. Unfortunately, while previous work in DCOP only focuses on coordination in service of optimizing a single global team objective, personal assistants often require satisfying additional individual user-specified criteria. This paper provides a novel DCOP algorithm that enables personal assistants to engage in such multicriteria coordination while maintaining the privacy of their additional criteria. It uses n-ary NOGOODS implemented as private variables to achieve this. In addition, we've developed an algorithm that reveals only the individual criteria of a link and can speed up performance for certain problem structures. The key idea in this algorithm is that interleaving the criteria searches - rather than sequentially attempting to satisfy the criteria - improves efficiency by mutually constraining the distributed search for solutions. These ideas are realized in the form of private-g and public-g Multi-criteria ADOPT, built on top of ADOPT, one of the most efficient DCOP algorithms. We present our detailed algorithm, as well as some experimental results in personal assistant domains.",
author = "Emma Bowring and Milind Tambe and Makoto Yokoo",
year = "2005",
month = "12",
day = "1",
language = "English",
pages = "39--46",
note = "2005 AAAI Spring Symposium ; Conference date: 21-03-2005 Through 23-03-2005",

}

TY - CONF

T1 - Optimize my schedule but keep it flexible

T2 - Distributed multi-criteria coordination for personal assistants

AU - Bowring, Emma

AU - Tambe, Milind

AU - Yokoo, Makoto

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Research projects have begun focusing on deploying personal assistant agents to coordinate users in such diverse environments as offices, distributed manufacturing or design centers, and in support of first responders for emergencies. In such environments, distributed constraint optimization (DCOP) has emerged as a key technology for multiple collaborative assistants to coordinate with each other. Unfortunately, while previous work in DCOP only focuses on coordination in service of optimizing a single global team objective, personal assistants often require satisfying additional individual user-specified criteria. This paper provides a novel DCOP algorithm that enables personal assistants to engage in such multicriteria coordination while maintaining the privacy of their additional criteria. It uses n-ary NOGOODS implemented as private variables to achieve this. In addition, we've developed an algorithm that reveals only the individual criteria of a link and can speed up performance for certain problem structures. The key idea in this algorithm is that interleaving the criteria searches - rather than sequentially attempting to satisfy the criteria - improves efficiency by mutually constraining the distributed search for solutions. These ideas are realized in the form of private-g and public-g Multi-criteria ADOPT, built on top of ADOPT, one of the most efficient DCOP algorithms. We present our detailed algorithm, as well as some experimental results in personal assistant domains.

AB - Research projects have begun focusing on deploying personal assistant agents to coordinate users in such diverse environments as offices, distributed manufacturing or design centers, and in support of first responders for emergencies. In such environments, distributed constraint optimization (DCOP) has emerged as a key technology for multiple collaborative assistants to coordinate with each other. Unfortunately, while previous work in DCOP only focuses on coordination in service of optimizing a single global team objective, personal assistants often require satisfying additional individual user-specified criteria. This paper provides a novel DCOP algorithm that enables personal assistants to engage in such multicriteria coordination while maintaining the privacy of their additional criteria. It uses n-ary NOGOODS implemented as private variables to achieve this. In addition, we've developed an algorithm that reveals only the individual criteria of a link and can speed up performance for certain problem structures. The key idea in this algorithm is that interleaving the criteria searches - rather than sequentially attempting to satisfy the criteria - improves efficiency by mutually constraining the distributed search for solutions. These ideas are realized in the form of private-g and public-g Multi-criteria ADOPT, built on top of ADOPT, one of the most efficient DCOP algorithms. We present our detailed algorithm, as well as some experimental results in personal assistant domains.

UR - http://www.scopus.com/inward/record.url?scp=32944467553&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=32944467553&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:32944467553

SP - 39

EP - 46

ER -