Optimal Sequential Stochastic Deployment of Multiple Passenger Robots
Chris (Yu Hsuan) Lee, Graeme Best, Geoffrey A. Hollinger

TL;DR
This paper introduces an optimal sequential stochastic deployment algorithm for passenger robots in marsupial systems, improving deployment efficiency by leveraging environmental uncertainty and outperforming existing methods in real-world tests.
Contribution
The paper presents a novel SSAP-based algorithm that computes optimal deployment policies efficiently, with proven performance advantages over traditional approaches.
Findings
Outperforms secretary and baseline algorithms in real-world drone deployment tests.
Computes optimal deployment policy in O(NR) time, scalable to large problems.
Achieves performance comparable to an offline oracle algorithm.
Abstract
We present a new algorithm for deploying passenger robots in marsupial robot systems. A marsupial robot system consists of a carrier robot (e.g., a ground vehicle), which is highly capable and has a long mission duration, and at least one passenger robot (e.g., a short-duration aerial vehicle) transported by the carrier. We optimize the performance of passenger robot deployment by proposing an algorithm that reasons over uncertainty by exploiting information about the prior probability distribution of features of interest in the environment. Our algorithm is formulated as a solution to a sequential stochastic assignment problem (SSAP). The key feature of the algorithm is a recurrence relationship that defines a set of observation thresholds that are used to decide when to deploy passenger robots. Our algorithm computes the optimal policy in time, where is the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
