Flexible social laws
Will Briggs, Diane J. Cook
Abstract
Will Briggs, Diane J. Cook
Abstract
Although communication is generally considered to dominate over processing cost in distributed systems, the problem of communication cost in multiagent planning has not been sufficiently addressed. One method for reducing both communication cost and planning time is the use of social laws. Social laws, however, can be too restrictive, limiting soundness. Flexible social laws can enable multiagent systems to reap the benefits of reduced communication cost and planning time (except in the worst case), without limiting soundness (although optimality may be degraded). By analysing the performance, we show that this model can make multiagent planning exponentially more efficient without limiting its applicability. Keywords: multiagent planning, social laws, distributed AI This paper has not already been accepted by and is not currently under review for a journal or another conference. Nor will it be submitted for such during IJCAI's review period. This research was supported in part by ...
OpenAlex reports 50 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Although communication is generally considered to dominate over processing cost in distributed systems, the problem of communication cost in multiagent planning has not been sufficiently addressed. One method for reducing both communication cost and planning time is the use of social laws. Social laws, however, can be too restrictive, limiting soundness. Flexible social laws can enable multiagent systems to reap the benefits of reduced communication cost and planning time (except in the worst case), without limiting soundness (although optimality may be degraded). By analysing the performance, we show that this model can make multiagent planning exponentially more efficient without limiting its applicability. Keywords: multiagent planning, social laws, distributed AI This paper has not already been accepted by and is not currently under review for a journal or another conference. Nor will it be submitted for such during IJCAI's review period. This research was supported in part by ...
Key concepts: Soundness, Limiting, Computer science, Social cost, Distributed computing, Mathematical optimization, Law, Engineering