Solving Hierarchical Auctions with HTN Planning - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Solving Hierarchical Auctions with HTN Planning

Résumé

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.
Fichier principal
Vignette du fichier
MILOT_HPLAN2021.pdf (359.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03289854 , version 1 (21-07-2021)
hal-03289854 , version 2 (25-07-2021)

Identifiants

  • HAL Id : hal-03289854 , version 1

Citer

Antoine Milot, Estelle Chauveau, Simon Lacroix, Charles Lesire. Solving Hierarchical Auctions with HTN Planning. 4th ICAPS workshop on Hierarchical Planning (HPlan), Aug 2021, Guangzhou, China. ⟨hal-03289854v1⟩

Collections

ONERA
175 Consultations
111 Téléchargements

Partager

Gmail Facebook X LinkedIn More