<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:identifier>doi:10.1109/TAC.2024.3386024</dc:identifier><dc:language>eng</dc:language><dc:creator>Hustiu, Sofia</dc:creator><dc:creator>Mahulea, Cristian</dc:creator><dc:creator>Kloetzer, Marius</dc:creator><dc:creator>Lesage, Jean-Jacques</dc:creator><dc:title>On Multi-Robot Path Planning based on Petri Net Models and LTL Specifications</dc:title><dc:identifier>ART-2024-138585</dc:identifier><dc:description>This paper proposes a method exploiting the advantages of Petri net (PN) and Büchi automata models, by joining them in a newly defined Composed Petri net representation. Based on the latter model, collision-free trajectories are computed for a team of robots. The path planning algorithm is divided into two steps: computing a solution in a reduced PN model, and projecting it to the PN assigned to the environment. The results, given by a set of Mixed Integer Linear Programming (MILP) problems, yield lower computational complexity when compared with previous approaches.</dc:description><dc:date>2024</dc:date><dc:source>http://zaguan.unizar.es/record/147640</dc:source><dc:doi>10.1109/TAC.2024.3386024</dc:doi><dc:identifier>http://zaguan.unizar.es/record/147640</dc:identifier><dc:identifier>oai:zaguan.unizar.es:147640</dc:identifier><dc:relation>info:eu-repo/grantAgreement/EUR/AEI/TED2021-130449B-I00</dc:relation><dc:relation>info:eu-repo/grantAgreement/ES/MICINN/PID2021-125514NB-I00</dc:relation><dc:identifier.citation>IEEE TRANSACTIONS ON AUTOMATIC CONTROL 69, 9 (2024), 6373-6380</dc:identifier.citation><dc:rights>All rights reserved</dc:rights><dc:rights>http://www.europeana.eu/rights/rr-f/</dc:rights><dc:rights>info:eu-repo/semantics/openAccess</dc:rights></dc:dc>

</collection>