NDLI: A Bottom-Up Search Algorithm for Dynamic Reformation of Agent Coalitions under Coalition Size Constraints

Content Provider	IEEE Xplore Digital Library
Author	Dutta, A. Dasgupta, P. Baca, J. Nelson, C.
Copyright Year	2013
Description	Author affiliation: Mech. & Mater. Eng. Dept., Univ. of Nebraska-Lincoln, Lincoln, NE, USA (Nelson, C.) \|\| Comput. Sci. Dept., Univ. of Nebraska, Omaha, NE, USA (Dutta, A.; Dasgupta, P.; Baca, J.)
Abstract	We consider the problem of dynamic coalition formation among a set of agents where the value function of the agents is constrained by the size of a coalition - larger coalitions are able to get higher value but only up to a certain fixed coalition size, denoted by n_max. The objective of the coalition formation problem is to determine a partition of the agent set that gives the highest utility to the agents. This problem is non-trivial as the set of partitions that needs to be explored grows exponentially with the number of agents and an exhaustive search in the space of partitions makes the problem intractable. To address this problem, we first provide a formal framework to model the coalition formation problem using a coalition structure graph (CSG). We then propose a branch and bound based algorithm called bottom Up CSG Search that searches for the optimal partitions or coalition structures among the nodes of CSG while pruning nodes that are not going to lead to the optimal coalition structure. We have provided analytical results related to the completeness, anytime-nature and time complexity of our algorithm. We have also verified the performance of our algorithm for a dynamic reformation problem where a set of physical e-puck robots starting from arbitrary positions form sub-teams that maximize their utility. Our experimental results show that our proposed algorithm performs better in terms of number of nodes generated and the time required to find the optimal coalition structure or partition than existing CSG-search algorithms.
Starting Page	329
Ending Page	336
File Size	1084465
Page Count	8
File Format	PDF
e-ISBN	9780769551456
DOI	10.1109/WI-IAT.2013.128
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-11-17
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Uncertainty Heuristic algorithms Search problems Robot sensing systems Partitioning algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Bottom-Up Search Algorithm for Dynamic Reformation of Agent Coalitions under Coalition Size Constraints

A block partitioning algorithm for modular robot reconfiguration under uncertainty

Gravitational search algorithm with heuristic search for clustering problems

Mobile Robot Platform for Real-Time search Algorithms

Decentralized sweep coverage algorithm for uncertain region of multi-agent systems

A dynamic size MCL algorithm for mobile robot localization

An Effective Heuristic for Multi-dimensional Partitioning in Bottom-Up Computation for Data Cubes

BHOHS: A Two Stage Novel Algorithm for Data Clustering

A dynamic sensor placement algorithm for dense sampling

A Bottom-Up Search Algorithm for Dynamic Reformation of Agent Coalitions under Coalition Size Constraints

Similar Documents

A Bottom-Up Search Algorithm for Dynamic Reformation of Agent Coalitions under Coalition Size Constraints

A block partitioning algorithm for modular robot reconfiguration under uncertainty

Gravitational search algorithm with heuristic search for clustering problems

Mobile Robot Platform for Real-Time search Algorithms

Decentralized sweep coverage algorithm for uncertain region of multi-agent systems

A dynamic size MCL algorithm for mobile robot localization

An Effective Heuristic for Multi-dimensional Partitioning in Bottom-Up Computation for Data Cubes

BHOHS: A Two Stage Novel Algorithm for Data Clustering

A dynamic sensor placement algorithm for dense sampling

A Bottom-Up Search Algorithm for Dynamic Reformation of Agent Coalitions under Coalition Size Constraints