Solving Hierarchical Auctions with HTN Planning
Overview & Synopsis
This paper presents a preliminary approach to solve the Multi-Robot Task Allocation problem through hierarchical auctions combined with the use of HTN planning. We present the global approach and the challenges arisen by partiallyordered HTNs through some examples. We finally outline some options to integrate such constraints in the allocation scheme.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Solving Hierarchical Auctions with HTN Planning |
|---|---|
| Author / Organization | Antoine Milot, Estelle Chauveau, Simon Lacroix, Charles Lesire |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2021 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-138725 |
| Original Source Link | Visit Source Page on hal.science » |