Temporal Logic Optimal Control for Large-Scale Multi-Robot Systems: 10400 States and Beyond

Author(s):  
Yiannis Kantaros ◽  
Michael M. Zavlanos
2020 ◽  
Vol 39 (7) ◽  
pp. 812-836
Author(s):  
Yiannis Kantaros ◽  
Michael M Zavlanos

This article proposes a new highly scalable and asymptotically optimal control synthesis algorithm from linear temporal logic specifications, called [Formula: see text] for large-Scale optimal Temporal Logic Synthesis, that is designed to solve complex temporal planning problems in large-scale multi-robot systems. Existing planning approaches with temporal logic specifications rely on graph search techniques applied to a product automaton constructed among the robots. In our previous work, we have proposed a more tractable sampling-based algorithm that builds incrementally trees that approximate the state space and transitions of the synchronous product automaton and does not require sophisticated graph search techniques. Here, we extend our previous work by introducing bias in the sampling process that is guided by transitions in the Büchi automaton that belong to the shortest path to the accepting states. This allows us to synthesize optimal motion plans from product automata with hundreds of orders of magnitude more states than those that existing optimal control synthesis methods or off-the-shelf model checkers can manipulate. We show that [Formula: see text] is probabilistically complete and asymptotically optimal and has exponential convergence rate. This is the first time that convergence rate results are provided for sampling-based optimal control synthesis methods. We provide simulation results that show that [Formula: see text] can synthesize optimal motion plans for very large multi-robot systems, which is impossible using state-of-the-art methods.


Author(s):  
Gen'ichi Yasuda

This chapter provides a practical and intuitive way of cooperative task planning and execution for complex robotic systems using multiple robots in automated manufacturing applications. In large-scale complex robotic systems, because individual robots can autonomously execute their tasks, robotic activities are viewed as discrete event-driven asynchronous, concurrent processes. Further, since robotic activities are hierarchically defined, place/transition Petri nets can be properly used as specification tools on different levels of control abstraction. Net models representing inter-robot cooperation with synchronized interaction are presented to achieve distributed autonomous coordinated activities. An implementation of control software on hierarchical and distributed architecture is presented in an example multi-robot cell, where the higher level controller executes an activity-based global net model of task plan representing cooperative behaviors performed by the robots, and the parallel activities of the associated robots are synchronized without the coordinator through the transmission of requests and the reception of status.


2020 ◽  
Vol 39 (7) ◽  
pp. 856-892 ◽  
Author(s):  
Tingxiang Fan ◽  
Pinxin Long ◽  
Wenxi Liu ◽  
Jia Pan

Developing a safe and efficient collision-avoidance policy for multiple robots is challenging in the decentralized scenarios where each robot generates its paths with limited observation of other robots’ states and intentions. Prior distributed multi-robot collision-avoidance systems often require frequent inter-robot communication or agent-level features to plan a local collision-free action, which is not robust and computationally prohibitive. In addition, the performance of these methods is not comparable with their centralized counterparts in practice. In this article, we present a decentralized sensor-level collision-avoidance policy for multi-robot systems, which shows promising results in practical applications. In particular, our policy directly maps raw sensor measurements to an agent’s steering commands in terms of the movement velocity. As a first step toward reducing the performance gap between decentralized and centralized methods, we present a multi-scenario multi-stage training framework to learn an optimal policy. The policy is trained over a large number of robots in rich, complex environments simultaneously using a policy-gradient-based reinforcement-learning algorithm. The learning algorithm is also integrated into a hybrid control framework to further improve the policy’s robustness and effectiveness. We validate the learned sensor-level collision-3avoidance policy in a variety of simulated and real-world scenarios with thorough performance evaluations for large-scale multi-robot systems. The generalization of the learned policy is verified in a set of unseen scenarios including the navigation of a group of heterogeneous robots and a large-scale scenario with 100 robots. Although the policy is trained using simulation data only, we have successfully deployed it on physical robots with shapes and dynamics characteristics that are different from the simulated agents, in order to demonstrate the controller’s robustness against the simulation-to-real modeling error. Finally, we show that the collision-avoidance policy learned from multi-robot navigation tasks provides an excellent solution for safe and effective autonomous navigation for a single robot working in a dense real human crowd. Our learned policy enables a robot to make effective progress in a crowd without getting stuck. More importantly, the policy has been successfully deployed on different types of physical robot platforms without tedious parameter tuning. Videos are available at https://sites.google.com/view/hybridmrca .


Author(s):  
Lars Lindemann ◽  
Jakub Nowak ◽  
Lukas Schonbachler ◽  
Meng Guo ◽  
Jana Tumova ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document