Multi-agent Plan Repairing
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00184472" target="_blank" >RIV/68407700:21230/11:00184472 - isvavai.cz</a>
Result on the web
<a href="http://ijcai-11.iiia.csic.es/files/proceedings/planning_partial_observability.tar.gz" target="_blank" >http://ijcai-11.iiia.csic.es/files/proceedings/planning_partial_observability.tar.gz</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Multi-agent Plan Repairing
Original language description
Coordinated multi-agent planning and acting in dynamic and uncertain environments poses a number of challenges. We present a conceptual framework formalising the problem of multi-agent planning and subsequent plan repair. As a first step towards tacklingthe problem of multi-agent plan repair, we introduce a sequel of three algorithms. As a preliminary experiment, we evaluate and compare one of them with re-planning from scratch in a synthetic domain of multi-robot cranes and show computational and communication gains of the plan repairing technique.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů