2013
DOI: 10.1007/s10472-013-9363-9
|View full text |Cite
|
Sign up to set email alerts
|

Group planning with time constraints

Abstract: Embedding planning systems in real-world domains has led to the necessity of Distributed Continual Planning (DCP) systems where planning activities are distributed across multiple agents and plan generation may occur concurrently with plan execution. A key challenge in DCP systems is how to coordinate activities for a group of planning agents. This problem is compounded when these agents are situated in a real-world dynamic domain where the agents often encounter differing, incomplete, and possibly inconsisten… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 60 publications
0
4
0
Order By: Relevance
“…In Brafman et al (2009), a Coalition-Planning game formulation has been developed for self-interested players with personal goals who find the cooperation with each other beneficial in order to increase their personal net benefit. The research is focused on cooperative self-interested agents in groups (Hadad et al, 2013) and game scenarios in resource coalition (Dunne et al, 2010). A pure game-theoretic approach has been proposed to perform a strategic analysis of all possible player strategies and define equilibria based on the relationships between different solutions in game-theoretic terms (Bowling et al, 2003).…”
Section: Game-theoretic Technology Planningmentioning
confidence: 99%
“…In Brafman et al (2009), a Coalition-Planning game formulation has been developed for self-interested players with personal goals who find the cooperation with each other beneficial in order to increase their personal net benefit. The research is focused on cooperative self-interested agents in groups (Hadad et al, 2013) and game scenarios in resource coalition (Dunne et al, 2010). A pure game-theoretic approach has been proposed to perform a strategic analysis of all possible player strategies and define equilibria based on the relationships between different solutions in game-theoretic terms (Bowling et al, 2003).…”
Section: Game-theoretic Technology Planningmentioning
confidence: 99%
“…The system proposed in [17] couples coalition formation with planning by allocating the best possible team of robots for each task, thus reducing planning complexity. Authors in [18] presented a temporal reasoning mechanism for self-interested planning agents. In this work, agents' behavior is modeled on the basis of the Belief-Desire-Intention (BDI) theoretical model of cooperation to compute joint plans with time constraints.…”
Section: Related Workmentioning
confidence: 99%
“…When agents that have their own incentives are involved in a MAP problem, there is a need for a stable solution plan, a plan from which none of the agents is willing to deviate during execution because otherwise it would only imply a loss of utility to some of them. In coalitional planning, self-interested agents create coalitions in order to share resources and cooperate on goal achievement because joining forces turns out to be more beneficial for reaching their goals [3,8,13]. Hence, in cooperative game-theoretic models such as coalitional planning, selfinterested agents build their plans on the basis of a cooperative behavior and exploitation of synergies with the other agents.…”
Section: Introductionmentioning
confidence: 99%