Abstract
Weexplore a class of task allocation mechanismsthat are incremental and can be tuned to the computational resource limitations of agents. Our focus is on distributed task and resource allocation problemsinvolving coalitions of cooperativeagents that mustnegotiate amongthemselves on the distribution of tasks. Our emphasis is on the design of mechanismswith desirable real-time and dynamicproperties. Wedescribe preliminary workin four areas: the design of what we call time-bounded commitmentnetworks that are extensions of task-auctions and contract nets and that support a notion of reciprocal commitment;anytime algorithms for combinatorialtask allocation that take into account both positive and negative task interactions, organizationalframeworks for efficient task allocation in highly dynamicdomainsinvolving hundreds of agents, and logical tools for analyzingdynamicemergent properties of agent societies.
Original language | English |
---|---|
Pages | 53-62 |
Number of pages | 10 |
State | Published - 2001 |
Event | 2001 AAAI Fall Symposium - North Falmouth, United States Duration: 2 Nov 2001 → 4 Nov 2001 |
Conference
Conference | 2001 AAAI Fall Symposium |
---|---|
Country/Territory | United States |
City | North Falmouth |
Period | 2/11/01 → 4/11/01 |
Bibliographical note
Publisher Copyright:© 2001 AI Access Foundation. All rights reserved.
Funding
Acknowledgments This research was funded by DARPAC ontract F30602-99-C-0169 under the Autonomous Negotiating Teams (ANTS) Program.
Funders | Funder number |
---|---|
DARPAC | F30602-99-C-0169 |
Keywords
- Negotiation
- multiagent systems
- real-time resource allocation