Distributed Scheduling Using Constraint Optimization and Multiagent Path Planning

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00168363" target="_blank" >RIV/68407700:21230/10:00168363 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Distributed Scheduling Using Constraint Optimization and Multiagent Path Planning

Popis výsledku v původním jazyce

The goal of the distributed scheduling problem is to minimize the global cost of assigning n decentralized workers to m tasks at time points. This problem is further complicated in continuous environments because the entire state space cannot be searched. This paper presents a decentralized approach of dividing the distributed scheduling in continuous environments problem into two subproblems: distributed set covering and distributed multiagent path planning. First, we represent the rpblem of assigningworkers (i.e., covers) to tasks (i.e., sets) as a Distributed Constraint Optimization Problem (DCOP). Then, the DCOP solver passes its solution to the distributed multiagent path planner who creates a conflict-free path for each worker to its assigned tasks. By first representing the problem as a DCOP, it restricts the plan space to only a set of feasible plans. We apply this approach to the scenario of distributed scheduling for unmanned aerial vehicle surveillance.

Název v anglickém jazyce

Distributed Scheduling Using Constraint Optimization and Multiagent Path Planning

Popis výsledku anglicky

The goal of the distributed scheduling problem is to minimize the global cost of assigning n decentralized workers to m tasks at time points. This problem is further complicated in continuous environments because the entire state space cannot be searched. This paper presents a decentralized approach of dividing the distributed scheduling in continuous environments problem into two subproblems: distributed set covering and distributed multiagent path planning. First, we represent the rpblem of assigningworkers (i.e., covers) to tasks (i.e., sets) as a Distributed Constraint Optimization Problem (DCOP). Then, the DCOP solver passes its solution to the distributed multiagent path planner who creates a conflict-free path for each worker to its assigned tasks. By first representing the problem as a DCOP, it restricts the plan space to only a set of feasible plans. We apply this approach to the scenario of distributed scheduling for unmanned aerial vehicle surveillance.

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2010

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of AAMAS 2010 The 12th International Workshop on Distributed Constraint Reasoning

ISBN

978-0-9826571-1-9

ISSN

—

e-ISSN

—

Počet stran výsledku

13

Strana od-do

—

Název nakladatele

Drexel university

Místo vydání

Philadelphia

Místo konání akce

Toronto

Datum konání akce

10. 5. 2010

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—