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.
Domaines
Robotique [cs.RO]
Origine : Fichiers produits par l'(les) auteur(s)