Optimal Sequential Stochastic Deployment of Multiple Passenger Robots

  title={Optimal Sequential Stochastic Deployment of Multiple Passenger Robots},
  author={Chris Yu Hsuan Lee and Graeme Best and Geoffrey A. Hollinger},
  journal={2021 IEEE International Conference on Robotics and Automation (ICRA)},
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… 

Figures from this paper

Stochastic Assignment for Deploying Multiple Marsupial Robots
This work proposes a centralized heuristic search algorithm for the multiple-carrier robot deployment problem that combines Monte Carlo Tree Search with a dynamic programming-based solution to the Sequential Stochastic Assignment Problem as a rollout action-selection policy.
Resilient Multi-Sensor Exploration of Multifarious Environments with a Team of Aerial Robots
The solution centers around a behavior tree architecture, which adaptively switches between various behaviors involving coordinated exploration and responding to adverse events, which exploits the benefits of both visual and range sensors with a new frontier-based exploration algorithm.


Optimal Deployment of Multiple Passenger Robots using Sequential Stochastic Assignment
A deployment algorithm that reasons over uncertainty by exploiting information about the prior probability distribution of features of interest in the environment is proposed that outperforms other competing algorithms, such as the classic secretary approach and baseline partitioning methods.
Coordinating heterogeneous teams of robots using temporal symbolic planning
The results show that this approach outperforms ad-hoc extensions of state-of-the-art cost-based coordination methods and that the approach is able to efficiently coordinate teams of heterogeneous robots and to consider symbolic actions.
Path Planning With Spatiotemporal Optimal Stopping for Stochastic Mission Monitoring
This work considers an optimal stopping formulation of the mission monitoring problem, in which a monitor vehicle must remain in close proximity to an autonomous robot that stochastically follows a predicted trajectory, and proposes a resolution-complete algorithm that runs in a polynomial time.
Planning Paths for Package Delivery in Heterogeneous Multirobot Teams
This paper addresses the task scheduling and path planning problem for a team of cooperating vehicles performing autonomous deliveries in urban environments and proposes two additional algorithms, based on enumeration and a reduction to the traveling salesman problem, for this special case.
Marsupial teams of robots: deployment of miniature robots for swarm exploration under communication constraints
This paper compares two autonomous and realistic marsupial strategies for initial deployment in unknown scenarios, in the context of swarm exploration: Random and Extended Spiral of Theodorus.
Nested marsupial robotic system for search and sampling in increasingly constrained environments
A key contribution of the work is the application of a unified algorithmic approach to autonomous planning, control, and estimation supporting vision-based manipulation and non-GPS-based ground and aerial mobility, thus reducing algorithmic complexity across this capability set.
Marsupial-like mobile robot societies
This poster defines the marsupial robot team concept and proposes a taxonomy of roles for each agent, and describes the team members (Human, Dispensing Agent, and Passenger Agents) in terms of the characteristics of more traditional agent societies.
Path planning for information acquisition and evasion using marsupial vehicles
This paper considers a path planning problem with two marsupial vehicles (one carrier vehicle and one passenger vehicle that is deployed by the carrier vehicle) exploring a planar area and straight line travel for both vehicles is shown to be optimal.
Efficient multi-robot coverage of a known environment
Two approximation heuristics for solving the multi-robot coverage problem with multiple robots are presented and results indicate that their approaches provide good coverage distribution between robots and minimize the workload per robot, meanwhile ensuring complete coverage of the area.
A marsupial robotic system for surveying and inspection of freshwater ecosystems
Freshwater ecosystems are vast areas that are constantly changing and evolving. To maintain the ecosystem as well as the structures located close to bodies of water, frequent monitoring is required.