Path planning for robotic teams based on LTL specifications and Petri net models
From MaRDI portal
Publication:2177780
DOI10.1007/s10626-019-00300-1zbMath1441.93194OpenAlexW2994583186WikidataQ126669780 ScholiaQ126669780MaRDI QIDQ2177780
Marius Kloetzer, Cristian Mahulea
Publication date: 6 May 2020
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-019-00300-1
Mixed integer programming (90C11) Automated systems (robots, etc.) in control theory (93C85) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Uses Software
Cites Work
- Multi-agent planning under local LTL specifications and event-based synchronization
- The increasing cost tree search for optimal multi-agent pathfinding
- A Petri net based approach for multi-robot path planning
- Supervisory control for collision avoidance in vehicular networks using discrete event abstractions
- A distributed protocol for motion coordination in free-range vehicular systems
- Temporal logic motion planning for dynamic robots
- Automated generation of dynamics-based runtime certificates for high-level control
- A distributed approach to robust control of multi-robot systems
- Gossip algorithms for heterogeneous multi-vehicle routing problems
- Conflict-based search for optimal multi-agent pathfinding
- On Distributed and Parameterized Supervisor Synthesis Problems
- Optimal Control of Markov Decision Processes With Linear Temporal Logic Constraints
- Robot Planning Based on Boolean Specifications Using Petri Net Models
- Planning Algorithms
- Finding the K Shortest Loopless Paths in a Network
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Path planning for robotic teams based on LTL specifications and Petri net models
