#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2005

2015

- This year (0)
- Last 5 years (8)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Yoonheui Kim, Ranjit Nair, Pradeep Varakantham, Milind Tambe, Makoto Yokoo
- AAAI Spring Symposium: Distributed Plan and…
- 2006

In many real-world multiagent applications such as distributed sensor nets, a network of agents is formed based on each agent's limited interactions with a small number of neighbors. While distributed POMDPs capture the real-world uncertainty in multiagent domains, they fail to exploit such locality of interaction. Distributed constraint optimization (DCOP)… (More)

The Max-Sum algorithm is a constraint optimization algorithm using message passing that can be configured to work in an approximate mode. It has been shown that in this mode it compares well with other approximate distributed optimization approaches. We used the approximate Max-Sum algorithm to coordinate adaptive radars for real-time weather sensing. When… (More)

- Yoonheui Kim, Michael Krainin, Victor R. Lesser
- 2011 IEEE/WIC/ACM International Conferences on…
- 2011

Solving a coordination problem in a decentralized environment requires a large amount of resources and thus exploiting the innate system structure and external information as much as possible is necessary for such a problem to be solved in a computationally effective manner. This work proposes new techniques for saving communication and computational… (More)

- Yoonheui Kim, Victor R. Lesser
- AAMAS
- 2013

Many distributed constraint optimization (DCOP) algorithms include nodes' local maximization operation that searches for the optimal variable assignment in a limited context. When the variable domain is discrete, this operation is exponential in the number of associated variables and thus com-putationally challenging. McAuley's recent work on efficient… (More)

- Yoonheui Kim, Victor R. Lesser
- AAAI
- 2014

In this paper we propose a novel DCOP algorithm, called DJAO, that is able to efficiently find a solution with low communication overhead; this algorithm can be used for optimal and bounded approximate solutions by appropriately setting the error bounds. Our approach builds on distributed junction trees used in Action-GDL to represent independence relations… (More)

- Yoonheui Kim, Victor R. Lesser
- 2008 IEEE/WIC/ACM International Conference on Web…
- 2008

In situations where Bayesian networks (BN) inferencing approximation is allowable, we show how to reduce the amount of sensory observations necessary and in a multi-agent context the amount of agent communication. To achieve this, we introduce Pseudo-Independence, a relaxed independence relation that quantitatively differentiates the various degrees of… (More)

- Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ramesh K. Sitaraman
- 2009 IEEE/WIC/ACM International Joint Conference…
- 2009

In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations. Thus, selecting a subset of nodes to perform measurements whose results will closely mirror the results of having all the nodes perform measurements is an important problem. This… (More)

An organizationally adept agent (OAA) adjusts its behavior when given annotated organizational guidelines. More importantly, it can also determine when such guidelines become ineffective and proactively adapt its behavior to better achieve organizational objectives. A central OAA tenet is a clear separation between operational decision making (the detailed… (More)

- Chongjie Zhang, CHONGJIE ZHANG, +4 authors William Yeoh
- 2014