Decentralized Task and Path Planning for Multi-Robot Systems

  title={Decentralized Task and Path Planning for Multi-Robot Systems},
  author={Yuxiao Chen and Ugo Rosolia and A. Ames},
  journal={IEEE Robotics and Automation Letters},
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… 

Figures and Tables from this paper


Simultaneous task allocation and planning for temporal logic goals in heterogeneous multi-robot systems
The proposed framework avoids the need to compute a combinatorial number of possible assignment costs, where each computation itself requires solving a complex planning problem, and can improve computational efficiency compared with classical assignment solutions, in particular for on-demand missions where task costs are unknown in advance.
Simultaneous Task Allocation and Planning Under Uncertainty
This work shows how to generate a sequence of multi-robot policies, iteratively refining them to reallocate tasks if individual robots fail, and providing probabilistic guarantees on the performance (and safe operation) of the team of robots under the resulting policy.
Multi-Robot Task Allocation in Uncertain Environments
There is no single strategy that produces best performance in all cases, and that the best task allocation strategy changes as a function of the noise in the system, showing the need for further investigation of task allocation strategies and their application to planetary exploration.
Simulated annealing for multi-robot hierarchical task allocation with flexible constraints and objective functions
In this paper we study a novel approach in networked robotics for optimal allocation with interchangeable objective functions, from minimizing the worst-case cost of any agent in a multi-robot team
Decentralized Motion Planning for Multiple Mobile Robots: The Cocktail Party Model
This paper presents an approach for decentralized real-time motion planning for multiple mobile robots operating in a common 2-dimensional environment with unknown stationary obstacles, and suggests a heuristic strategy based on maze-searching techniques.
M*: A complete multirobot path planning algorithm with performance bounds
  • Glenn Wagner, H. Choset
  • Mathematics, Computer Science
    2011 IEEE/RSJ International Conference on Intelligent Robots and Systems
  • 2011
This work presents a general strategy called subdimensional expansion, which dynamically generates low dimensional search spaces embedded in the full configuration space of a set of robots, and presents an implementation of sub dimensional expansion for robot configuration spaces that can be represented as a graph, called M*, and shows that M* is complete and finds minimal cost paths.
Advanced approaches for multi-robot coordination in logistic scenarios
This paper describes modern optimization techniques for coordination in multiRobot systems and focuses on approaches that are based on algorithms widely used to solve graphical models and constraint optimization problems, such as the max-sum algorithm.
Multi-robot Task Allocation: A Review of the State-of-the-Art
This chapter provides a comprehensive review on challenging aspects of MRTA problem, recent approaches to tackle this problem and the future directions.
Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs
The NP-hardness proof for the time optimal versions of the discrete multi-robot path planning problem shows that these problems remain NP- hard even when there are only two groups of robots (i.e. robots within each group are interchangeable).
A Complete Methodology for Generating Multi-Robot Task Solutions using ASyMTRe-D and Market-Based Task Allocation
  • Fang Tang, L. Parker
  • Computer Science
    Proceedings 2007 IEEE International Conference on Robotics and Automation
  • 2007
The fundamental contribution of this work is the layering of the low-level coalition formation algorithm for generating strongly-cooperative task solutions, with high-level, traditional task allocation methods for weakly-co cooperative task solutions.