<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-01T12:17:55Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/35161" metadataPrefix="qdc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/35161</identifier><datestamp>2026-02-03T11:34:50Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37953</setSpec></header><metadata><qdc:qualifieddc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Low Computational Cost for Multiple Waypoints Trajectory Planning: A Time-optimal Based Approach</dc:title>
   <dc:creator>Lin-Yang, Da-hui</dc:creator>
   <dc:creator>Pastor, Francisco</dc:creator>
   <dc:creator>García-Cerezo, Alfonso José</dc:creator>
   <dc:subject>Robótica</dc:subject>
   <dcterms:abstract>In the field of mobile robots, achieving minimum time in executing trajectories is crucial for applications like delivery, inspection, and search and rescue. In this article, a novel time-optimal planner based on optimization methods is introduced. Despite the high computational cost associated with such methods, the solution calculates time-optimal multi-waypoint trajectories, achieving results in the order of milliseconds. The proposed method formulates a time-optimal trajectory using the Pontryagin's maximum principle as a policy. By utilizing a point mass model, the planner generates trajectories that are adaptable to different robot models. The approach incorporates a definition of a search space to guarantee convergence while considering the system limits. Simulation and real-world experiments are performed to validate the feasibility of our method with different configurations. Simulation results compared to a benchmark method demonstrate our approach's superior performance in terms of computational time, achieving near-optimal solutions. In addition, in the real-world experiments, the integration of the method into practical applications is validated.</dcterms:abstract>
   <dcterms:dateAccepted>2024-11-14T12:44:45Z</dcterms:dateAccepted>
   <dcterms:available>2024-11-14T12:44:45Z</dcterms:available>
   <dcterms:created>2024-11-14T12:44:45Z</dcterms:created>
   <dcterms:issued>2024</dcterms:issued>
   <dc:type>journal article</dc:type>
   <dc:identifier>Lin-Yang, D.-h., Pastor, F. and García-Cerezo, A.J. (2024), Low Computational Cost for Multiple Waypoints Trajectory Planning: A Time-Optimal-Based Approach. Adv. Intell. Syst. 2400363. https://doi.org/10.1002/aisy.202400363</dc:identifier>
   <dc:identifier>https://hdl.handle.net/10630/35161</dc:identifier>
   <dc:identifier>10.1002/aisy.202400363</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>Lin-Yang, D., Pastor, F., &amp; García-Cerezo, A. J. (2024). Trajectory Data from Crazyflie Experiments in Circle and Eight-Shaped Circuits. https://hdl.handle.net/10630/39760</dc:relation>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
   <dc:rights>open access</dc:rights>
   <dc:rights>Attribution-NonCommercial-NoDerivatives 4.0 Internacional</dc:rights>
   <dc:publisher>Wiley</dc:publisher>
</qdc:qualifieddc>
</metadata></record></GetRecord></OAI-PMH>