<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462017000300407</article-id>
<article-id pub-id-type="doi">10.13053/cys-21-3-2444</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Branching Path Planning with Modal Logics]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Bárcenas]]></surname>
<given-names><![CDATA[Everardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
<xref ref-type="aff" rid="Aaf"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Benítez-Guerrero]]></surname>
<given-names><![CDATA[Edgard]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Benitez]]></surname>
<given-names><![CDATA[Antonio]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Calleja]]></surname>
<given-names><![CDATA[Jorge de la]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Medina]]></surname>
<given-names><![CDATA[Ma. Auxilio]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,CONACYT  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Veracruzana  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Politécnica de Puebla  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2017</year>
</pub-date>
<volume>21</volume>
<numero>3</numero>
<fpage>407</fpage>
<lpage>418</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462017000300407&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462017000300407&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462017000300407&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: Path planning concerns about finding a route for an agent, such that this agent move along the route from an initial to a final goal. Some additional constraints may also have to be satisfied for the agent, such as avoiding obstacles or collisions. Path planning has been recently studied in the context of linear temporal logic with great success. Expressive constraint specifications involving temporal ordering can be succinctly expressed by logic formulas, whereas environments are abstracted as transition systems. The plan is obtained by counterexample generation in a model checking tool: finding a path, if any, such that a given formula (constraints) satisfies a given model (agent environment). Due to the expressive power of linear temporal logic, only linear planning has mostly been considered so far, that is, plans corresponding to tasks to be performed in a linear successive order. In this work, we study branching shaped (tree) plans in the context of the µ-calculus, an expressive modal logic which subsumes many program logics such as LTL, PDL and CTL. Branching plans can be succinctly expressed by logic formulas so that a team of mobile devices can concurrently satisfy the plan. In the current work, we provide a plan generator based on a model checking algorithm for the µ-calculus. We show the algorithm is sound and complete, that is, for any environment, there a satisfying plan for a given set of constraints, if and only if, the plan generator succeeds.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Branching shaped (tree) plans]]></kwd>
<kwd lng="en"><![CDATA[µ-calculus]]></kwd>
<kwd lng="en"><![CDATA[modal logic]]></kwd>
<kwd lng="en"><![CDATA[plan generator]]></kwd>
<kwd lng="en"><![CDATA[model checking]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bárcenas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Benitez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[de la Calleja]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Medina]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ríos-Martínez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Reasoning about the past on temporal specifications for motion planning]]></source>
<year>2014</year>
<page-range>206-11</page-range><publisher-name><![CDATA[CONIELECOMP, IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bárcenas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Genevčs]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Layaďda]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Schmitt]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Walsh]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Query reasoning on trees with types, interleaving, and counting]]></source>
<year>2011</year>
<conf-name><![CDATA[ Proceedings of the 22nd International Joint Conference on Artificial Intelligence]]></conf-name>
<conf-date>2011</conf-date>
<conf-loc> </conf-loc>
<page-range>718-23</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bárcenas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Lavalle]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Expressive reasoning on tree structures: Recursion, inverse programs, Presburger constraints and nominals]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Espinoza]]></surname>
<given-names><![CDATA[F. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Gelbukh]]></surname>
<given-names><![CDATA[A. F.]]></given-names>
</name>
<name>
<surname><![CDATA[González-Mendoza]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Artificial Intelligence and Its Applications - 12th Mexican International Conference on Artificial Intelligence, MICAI 2013, Proceedings, Part I]]></source>
<year>2013</year>
<volume>8265</volume>
<page-range>80-91</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bárcenas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Lavalle]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Global numerical constraints on trees]]></article-title>
<source><![CDATA[Logical Methods in Computer Science]]></source>
<year>2014</year>
<volume>10</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Blackburn]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Benthem]]></surname>
<given-names><![CDATA[J. F. A. K. v.]]></given-names>
</name>
<name>
<surname><![CDATA[Wolter]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of Modal Logic, Volume 3 (Studies in Logic and Practical Reasoning)]]></source>
<year>2006</year>
<publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[Elsevier Science Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bobadilla]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Sanchez]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Czarnowski]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Gossman]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[LaValle]]></surname>
<given-names><![CDATA[S. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Controlling wild bodies using linear temporal logic]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Durrant-Whyte]]></surname>
<given-names><![CDATA[H. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Roy]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Abbeel]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Robotics: Science and Systems VII]]></source>
<year>2011</year>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bonatti]]></surname>
<given-names><![CDATA[P. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Lutz]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Murano]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Vardi]]></surname>
<given-names><![CDATA[M. Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The complexity of enriched mu-calculi]]></article-title>
<source><![CDATA[Logical Methods in Computer Science]]></source>
<year>2008</year>
<volume>4</volume>
<numero>3</numero>
<issue>3</issue>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burch]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Clarke]]></surname>
<given-names><![CDATA[E. M.]]></given-names>
</name>
<name>
<surname><![CDATA[McMillan]]></surname>
<given-names><![CDATA[K. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Dill]]></surname>
<given-names><![CDATA[D. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Hwang]]></surname>
<given-names><![CDATA[L. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Symbolic model checking: 10]]></source>
<year>1990</year>
<conf-name><![CDATA[ Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS &#8217;90)]]></conf-name>
<conf-date>June 4-7, 1990</conf-date>
<conf-loc>Philadelphia, Pennsylvania, USA </conf-loc>
<page-range>428-39</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Buss]]></surname>
<given-names><![CDATA[S. R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The undecidability of k-provability]]></article-title>
<source><![CDATA[Ann. Pure Appl. Logic]]></source>
<year>1991</year>
<volume>53</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>75-102</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Clarke]]></surname>
<given-names><![CDATA[E. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Veith]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Counterexamples revisited: Principles, algorithms, applications]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Dershowitz]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Verification: Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday]]></source>
<year>2003</year>
<volume>2772</volume>
<page-range>208-24</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Conner]]></surname>
<given-names><![CDATA[D. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Rizzi]]></surname>
<given-names><![CDATA[A. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Choset]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Composition of local potential functions for global robot control and navigation]]></article-title>
<source><![CDATA[IROS]]></source>
<year>2003</year>
<page-range>3546-51</page-range><publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dix]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Posegga]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Schmitt]]></surname>
<given-names><![CDATA[P. H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Modal logics for AI planning]]></source>
<year>1990</year>
<conf-name><![CDATA[ Proceedings of the First International Conference on Expert Planning Systems]]></conf-name>
<conf-date>June 27-29, 1990</conf-date>
<conf-loc> </conf-loc>
<page-range>157-62</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fainekos]]></surname>
<given-names><![CDATA[G. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Girard]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Kress-Gazit]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Pappas]]></surname>
<given-names><![CDATA[G. J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Temporal logic motion planning for dynamic robots]]></article-title>
<source><![CDATA[Automatica]]></source>
<year>2009</year>
<volume>45</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>343-52</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Johansson]]></surname>
<given-names><![CDATA[K. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Dimarogonas]]></surname>
<given-names><![CDATA[D. V.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Revising motion planning under linear temporal logic specifications in partially known workspaces]]></article-title>
<source><![CDATA[ICRA]]></source>
<year>2013</year>
<page-range>5025-32</page-range><publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Holzmann]]></surname>
<given-names><![CDATA[G. J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The model checker SPIN]]></article-title>
<source><![CDATA[IEEE Trans. Software Eng.]]></source>
<year>1997</year>
<volume>23</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>279-95</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kloetzer]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Belta]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Automatic deployment of distributed teams of robots from temporal logic motion specifications]]></article-title>
<source><![CDATA[IEEE Transactions on Robotics]]></source>
<year>2010</year>
<volume>26</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>48-61</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lenzi]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The modal µ-calculus: a survey]]></article-title>
<source><![CDATA[TASK Quaterly]]></source>
<year>2005</year>
<volume>9</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>293-316</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[McCarthy]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Hayes]]></surname>
<given-names><![CDATA[P. J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Some philosophical problems from the standpoint of artificial intelligence]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Meltzer]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Michie]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Machine Intelligence 4]]></source>
<year>1969</year>
<page-range>463-502</page-range><publisher-name><![CDATA[Edinburgh University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Sattler]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Vardi]]></surname>
<given-names><![CDATA[M. Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Bdd-based decision procedures for the modal logic K]]></article-title>
<source><![CDATA[Journal of Applied Non-Classical Logics]]></source>
<year>2006</year>
<volume>16</volume>
<numero>1-2</numero>
<issue>1-2</issue>
<page-range>169-208</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rabin]]></surname>
<given-names><![CDATA[M. O]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Decidability of second-order theories and automata on infinite trees]]></article-title>
<source><![CDATA[Bull. Amer. Math. Soc.]]></source>
<year>1968</year>
<volume>74</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1025-9</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Seidel]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons]]></article-title>
<source><![CDATA[Comput. Geom.]]></source>
<year>2010</year>
<volume>43</volume>
<numero>6-7</numero>
<issue>6-7</issue>
<page-range>556-64</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tarski]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A lattice-theoretical fixpoint theorem and its applications]]></article-title>
<source><![CDATA[Pacific Journal of Mathematics]]></source>
<year>1955</year>
<volume>5</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>285-309</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ulusoy]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[S. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Ding]]></surname>
<given-names><![CDATA[X. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Belta]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Rus]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimality and robustness in multi-robot path planning with temporal logic constraints]]></article-title>
<source><![CDATA[I. J. Robotic Res.]]></source>
<year>2013</year>
<volume>32</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>889-911</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Hwang]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Ting]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Ubipapago: Context-aware path planning]]></article-title>
<source><![CDATA[Expert Syst. Appl.]]></source>
<year>2011</year>
<volume>38</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>4150-61</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wolff]]></surname>
<given-names><![CDATA[E. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Topcu]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Murray]]></surname>
<given-names><![CDATA[R. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Automaton-guided controller synthesis for nonlinear systems with temporal logic]]></article-title>
<source><![CDATA[IROS]]></source>
<year>2013</year>
<page-range>4332-9</page-range><publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
