Statistically Distinct Plans for Multiobjective Task Assignment

We study the problem of finding statistically distinct plans for stochastic task assignment problems such as online multirobot pickup and delivery (MRPD) when facing multiple competing objectives. In many real-world settings, robot fleets do not only need to fulfill delivery requests but also have t...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on robotics 2024, Vol.40, p.2217-2232
Hauptverfasser:	Wilde, Nils, Alonso-Mora, Javier
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive algorithms Adaptive sampling Costs Linear programming Multiobjective optimization (MOO) Multiple objective analysis Multiple robots multirobot task assignment (MRTA) Optimization path planning for multiple mobile robots pickup and delivery Planning Policies Quality of service Robots Sensitivity analysis Task analysis Tradeoffs
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!