Decentralized Task and Path Planning for Multi-Robot Systems

11/19/2020
by   Yuxiao Chen, et al.
0

We consider a multi-robot system with a team of collaborative robots and multiple tasks that emerges over time. We propose a fully decentralized task and path planning (DTPP) framework consisting of a task allocation module and a localized path planning module. Each task is modeled as a Markov Decision Process (MDP) or a Mixed Observed Markov Decision Process (MOMDP) depending on whether full states or partial states are observable. The task allocation module then aims at maximizing the expected pure reward (reward minus cost) of the robotic team. We fuse the Markov model into a factor graph formulation so that the task allocation can be decentrally solved using the max-sum algorithm. Each robot agent follows the optimal policy synthesized for the Markov model and we propose a localized forward dynamic programming scheme that resolves conflicts between agents and avoids collisions. The proposed framework is demonstrated with high fidelity ROS simulations and experiments with multiple ground robots.

READ FULL TEXT

page 1

page 2

page 6

page 7

research
06/04/2016

Effective Multi-Robot Spatial Task Allocation using Model Approximations

Real-world multi-agent planning problems cannot be solved using decision...
research
02/03/2018

Path Planning for Minimizing the Expected Cost till Success

Consider a general path planning problem of a robot on a graph with edge...
research
06/19/2021

A Unified View of Algorithms for Path Planning Using Probabilistic Inference on Factor Graphs

Even if path planning can be solved using standard techniques from dynam...
research
10/28/2017

Distributed Server Allocation for Content Delivery Networks

We propose a dynamic formulation of file-sharing networks in terms of an...
research
06/19/2018

Cooperative Queuing Policies for Effective Human-Multi-Robot Interaction

We consider multi-robot applications, where a team of robots can ask for...
research
09/24/2021

A dynamic programming algorithm for informative measurements and near-optimal path-planning

An informative measurement is the most efficient way to gain information...
research
06/21/2019

Control-Theoretic Models of Environmental Crime

We present two models of perpetrators' decision-making in extracting res...

Please sign up or login with your details

Forgot password? Click here to reset