Path planning for robotic teams based on LTL specifications and Petri net models
| Autor: | Marius Kloetzer, Cristian Mahulea |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
030213 general clinical medicine
0209 industrial biotechnology Theoretical computer science Computer science Büchi automaton 02 engineering and technology Petri net Automaton Task (project management) Computer Science::Robotics 03 medical and health sciences 020901 industrial engineering & automation 0302 clinical medicine Linear temporal logic Control and Systems Engineering Modeling and Simulation Robot Motion planning Electrical and Electronic Engineering Integer programming |
| Zdroj: | Discrete Event Dynamic Systems. 30:55-79 |
| ISSN: | 1573-7594 0924-6703 |
| DOI: | 10.1007/s10626-019-00300-1 |
| Popis: | This research proposes an automatic strategy for planning a team of identical robots evolving in a known environment. The robots should satisfy a global task for the whole team, given in terms of a Linear Temporal Logic (LTL) formula over predefined regions of interest. A Robot Motion Petri Net (RMPN) system is used for modeling the evolution of the robotic team in the environment, bringing the advantage of a fixed topology versus the number of robots, with respect to methods based on synchronous automaton products. The algorithmic method iterates the selection of an accepted run that satisfies the specification and the search for RMPN sequences of reachable markings that can produce desired observations. A Buchi automaton witnesses the advancement towards formula fulfillment, and at the core of our methods are three Mixed Integer Linear Programming (MILP) formulations that yield firing sequences and markings of RMPN model. The cost functions of these formulations reduce the number of robot synchronizations and induce collision avoidance. Simulation examples support the computational feasibility of the proposed method. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink