Statistically Distinct Plans for Multi-Objective Task Assignment

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

A flow-based integer programming approach to design an interurban shared automated vehicle system and assess its financial viability

Shared automated vehicles (SAV) are expected to become part of on-demand transport systems in the future. In an interurban context, SAV systems may potentially contribute to significantly improve the availability and quality of public transport. In this paper, we propose a flow-based integer programming approach to design and assess the...