Market-Based Multirobot Coordination: A Survey and Analysis

Dias, M. B.; Zlot, Robert; Kalra, Nidhi; Stentz, Anthony

doi:10.21236/ada526116

Cited by 196 publications

(235 citation statements)

References 24 publications

Supporting

Mentioning

231

Contrasting

Unclassified

Order By: Relevance

“…These methods for multi-agent coordination are typically implemented through the use of market-based strategies such as auctions [40]. When an agent realizes that a role needs to be fulfilled, it sends a message to its team members asking them for their utility of executing the role.…”

Section: Negotiation-based and Market-based Methodsmentioning

confidence: 99%

“…17-20] and is key to many role allocation procedures. Utility values can be used as "bids" in auction-based methods for role assignment [40], as the variables in linear programming techniques for optimal assignment [2,4,63], and as a way for agents to decide between roles when making decisions autonomously [29]. Typically, computing an agent's utility for a role is not trivial as it is dependent on how an agent's capabilities match up with the capabilities required to execute the role, on the priority of the role in question, and on the current and possibly future needs of the team.…”

Section: Formalizing the Role Allocation Problemmentioning

confidence: 99%

“…Despite these strengths, negotiationbased methods are not appropriate for all situations. If full communication is available, it may be more efficient for the agents to pool their information together in one central location where a single agent can execute an assignment or scheduling algorithm for the team [40]. Centralized approaches typically lead to better solutions than distributed methods [40].…”

Section: No Communicationmentioning

confidence: 99%

“…If full communication is available, it may be more efficient for the agents to pool their information together in one central location where a single agent can execute an assignment or scheduling algorithm for the team [40]. Centralized approaches typically lead to better solutions than distributed methods [40]. Furthermore, if the agents are not working on a very complicated problem that requires a large number of roles, a negotiation-based approach may be overly complex, and simpler methods, e.g., the communication-less methods discussed in Sect.…”

Section: No Communicationmentioning

confidence: 99%

“…5.1.5, may suffice. More information on market-based approaches to coordination can be found in Dias et al [40].…”

Section: No Communicationmentioning

confidence: 99%

See 4 more Smart Citations

Multi-agent role allocation: issues, approaches, and multiple perspectives

Campbell

2010

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

In cooperative multi-agent systems, roles are used as a design concept when creating large systems, they are known to facilitate specialization of agents, and they can help to reduce interference in multi-robot domains. The types of tasks that the agents are asked to solve and the communicative capabilities of the agents significantly affect the way roles are used in cooperative multi-agent systems. Along with a discussion of these issues about roles in multi-agent systems, this article compares computational models of the role allocation problem, presents the notion of explicitly versus implicitly defined roles, gives a survey of the methods used to approach role allocation problems, and concludes with a list of open research questions related to roles in multi-agent systems.

show abstract

Section: Negotiation-based and Market-based Methodsmentioning

confidence: 99%

Section: Formalizing the Role Allocation Problemmentioning

confidence: 99%

Section: No Communicationmentioning

confidence: 99%

Section: No Communicationmentioning

confidence: 99%

“…5.1.5, may suffice. More information on market-based approaches to coordination can be found in Dias et al [40].…”

Section: No Communicationmentioning

confidence: 99%

See 3 more Smart Citations

Multi-agent role allocation: issues, approaches, and multiple perspectives

Campbell

2010

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

show abstract

A negotiation‐based method for task allocation with time constraints in open grid environments

Kong

Zhang

2014

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThis paper addresses the task allocation problem in an open, dynamic grid environments and service‐oriented environments. In such environments, both grid/service providers and consumers can be modelled as intelligent agents. These agents can leave and enter the environment freely at any time. Task allocation under time constraints becomes a challenging issue in such environments because it is difficult to apply a central controller during the allocation process due to the openness and dynamism of the environments. This paper proposes a negotiation‐based method for task allocation under time constraints in an open, dynamic grid environment, where both consumer and provider agents can freely enter or leave the environment. In this method, there is no central controller available, and agents negotiate with each other for task allocation based only on local views. The experimental results show that the proposed method can outperform the current methods in terms of the success rate of task allocation and the total profit obtained from the allocated tasks by agents under different time constraints. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

Maintenance strategies for wireless sensor networks: from a reactive to a proactive approach

Azzaz

Saı̈dane

2013

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

In this paper, we have introduced three proactive maintenance strategies for static wireless sensor networks (WSNs) using a limited number of mobile maintainer robots: the centralised proactive maintenance strategy denoted by CPMS, the fixed distributed proactive maintenance strategy denoted by FDPMS and the adaptive distributed proactive maintenance strategy denoted by ADPMS. The proposed maintenance strategies are based on a simple energy dissipation analytical model to estimate the occurrence times of the expected sensor failures in the network. Once identified, the anticipated failures are replaced by the available robots before they happen. To select the appropriate maintainer robot for each expected failure, CPMS opts for a centralised scheduling method based on the genetic algorithm fundamentals. However, the distributed maintenance strategies (FDPMS and ADPMS) use two different WSN area partitioning methods to share the sensor maintenance tasks among the available robots. Simulation results have shown that CPMS gives the minimal network dysfunction time representing the interruption service time induced by the detected faulted nodes. However, due to its significant signalling cost, we have remarked that CPMS can be deployed only in small scale WSNs. In large-scale ones, ADPMS has demonstrated its efficiency in terms of the network dysfunction time, the robot travelled distance and the introduced signalling cost. In particular cases, when sensor failures are uniformly distributed on the network map, FDPMS has given the best performances. INTRODUCTIONProviding a continuous service is the main requirement for many wireless sensor network (WSN) applications. To achieve this goal, the WSN must deploy a set of mechanisms to protect the network coverage from the eventual sensor failures. In literature, many approaches have been proposed to conserve the initial WSN quality of service (QoS) parameters and restore the coverage and the connectivity upon a sensor failure such as the use of mobile wireless sensors [1] and the exploiting of the nodes redundancy in the network [2]. However, in order to reduce the maintenance strategy deployment cost, Y. Mei et al.[3] proposes to use a small number of mobile robots to deal with the detected sensor failures in a static WSN. Indeed, in [3], Y. Mei and all have presented a set of algorithms to detect, report and handle the occurred sensor failures in the WSN. Thus, three approaches are introduced to coordinate the robot motions: (i) the centralised manager algorithm (CMA); (ii) the fixed distributed manager algorithm (FDMA); and (iii) the Dynamic Distributed Manager Algorithm (DDMA).By reacting after the sensor failures detection, the classical WSN maintenance approaches (CMA, FDMA and DDMA) can cause the service interruption during the failure recovery times. The network dysfunction time ratio induced by the faulted node cannot be tolerable by many real-time WSN application types such as surveillance and military applications [4]. In this paper, we introduce newer proactiv...

show abstract

Market-Based Multirobot Coordination: A Survey and Analysis

Abstract: When robots work together as a team, the members that perform each task should be the ones that promise to use the least resources to do the job.

Cited by 196 publications

References 24 publications

Multi-agent role allocation: issues, approaches, and multiple perspectives

Multi-agent role allocation: issues, approaches, and multiple perspectives

A negotiation‐based method for task allocation with time constraints in open grid environments

Maintenance strategies for wireless sensor networks: from a reactive to a proactive approach

Contact Info

Product

Resources

About