Low Computational Cost for Multiple Waypoints Trajectory Planning: A Time‐Optimal‐Based Approach

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...

Full description

Saved in:
Bibliographic Details
Published in:Advanced intelligent systems Vol. 7; no. 1
Main Authors: Lin‐Yang, Da‐hui, Pastor, Francisco, García‐Cerezo, Alfonso J.
Format: Journal Article
Language:English
Published: Weinheim John Wiley & Sons, Inc 01.01.2025
Wiley
Subjects:
Algorithms
Computational efficiency
Computing costs
Computing time
Configuration management
Efficiency
Energy consumption
Methods
motion plannings
Optimization
optimization‐based methods
Planning
Pontryagin principle
Robots
time‐optimal plannings
Trajectory optimization
Trajectory planning
Waypoints
ISSN:2640-4567, 2640-4567
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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. In this article, a time‐optimal trajectory planner for mobile robots using optimization techniques is presented. In the proposed method, multi‐waypoint trajectories in milliseconds are calculated, ensuring fast and efficient performance. Both simulations and real‐world experiments validate its performance, obtaining near‐optimal trajectories with a significant reduction in computation time compared to the benchmark, making it practical for real‐time applications.
AbstractList 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.
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. In this article, a time‐optimal trajectory planner for mobile robots using optimization techniques is presented. In the proposed method, multi‐waypoint trajectories in milliseconds are calculated, ensuring fast and efficient performance. Both simulations and real‐world experiments validate its performance, obtaining near‐optimal trajectories with a significant reduction in computation time compared to the benchmark, making it practical for real‐time applications.
Author Pastor, Francisco
Lin‐Yang, Da‐hui
García‐Cerezo, Alfonso J.
Author_xml – sequence: 1
  givenname: Da‐hui
  orcidid: 0000-0003-1372-1395
  surname: Lin‐Yang
  fullname: Lin‐Yang, Da‐hui
  email: dahuilinyang@uma.es
  organization: Universidad de Málaga
– sequence: 2
  givenname: Francisco
  orcidid: 0000-0003-0006-6811
  surname: Pastor
  fullname: Pastor, Francisco
  organization: Universidad de Málaga
– sequence: 3
  givenname: Alfonso J.
  orcidid: 0000-0003-3432-3230
  surname: García‐Cerezo
  fullname: García‐Cerezo, Alfonso J.
  organization: Universidad de Málaga
BookMark eNqFUctuEzEUtVArUdpuWVtineDnzJhdiChECipSgxAr68aP4mgyHmxH1ez4BL6RL8EhqLDryvdxzrn3-rxAZ0McHEIvKZlTQthrCHmaM8IEIbzhz9AFawSZCdm0Z__Fz9F1zjtSCbSlhLUXyK7jA17G_XgoUEIcoK9ZLtjHhD8e-hLG3uEvMI0xDCXjTYKdMyWmCX_qYRjCcP8GL_Am7N2vHz9vxxL20NfoLWRn8WIcUwTz7Qqde-izu_77XqLPN-82yw-z9e371XKxnhnednzW2c4zIaUF5UByqVwju5pxtVXGN50kqvXUU2voltuGCVC2afnWgINjl1-i1UnXRtjpMdVl0qQjBP2nENO9hlSC6Z22WwnMKQ-EEiEoVcJza7zoONRiK6vWq5NWPeH7weWid_GQ6v9kzalsOa-bsoqan1AmxZyT849TKdFHY_TRGP1oTCWoE-Eh9G56Aq0Xq7uv_7i_AZvIlb8
Cites_doi 10.3389/frobt.2022.898890
10.1145/2728606.2728620
10.1038/s41586-023-06419-4
10.1016/j.advengsoft.2019.03.007
10.1109/LRA.2020.2975759
10.1017/CBO9780511546877
10.1007/s10514-021-10011-y
10.1109/TRO.2021.3100142
10.1109/LRA.2018.2795654
10.1109/ICCAR.2019.8813737
10.1007/978-3-642-00839-9
10.1109/100.580977
10.1109/TITS.2020.3045917
10.1007/s12532-021-00208-8
10.1109/TRO.2022.3177279
10.1007/978-3-319-28872-7_37
10.1002/aisy.202300703
10.1109/CASE49439.2021.9551524
10.1109/IROS.2018.8593813
10.1109/SSRR.2009.5424168
10.1109/LRA.2022.3154013
10.3390/s23063239
10.1126/scirobotics.abh1221
10.23919/CSMS.2022.0017
10.1126/scirobotics.abl6259
ContentType Journal Article
Copyright 2024 The Author(s). Advanced Intelligent Systems published by Wiley‐VCH GmbH
2025. This work is published under https://creativecommons.org/licenses/by/4.0/ (the "License"). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2024 The Author(s). Advanced Intelligent Systems published by Wiley‐VCH GmbH
– notice: 2025. This work is published under https://creativecommons.org/licenses/by/4.0/ (the "License"). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 24P
AAYXX
CITATION
8FE
8FG
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
P5Z
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
DOA
DOI 10.1002/aisy.202400363
DatabaseName Wiley Online Library Open Access
CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central
SciTech Premium Collection
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Databases
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DOAJ: Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
Advanced Technologies & Aerospace Collection
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
Advanced Technologies & Aerospace Database
ProQuest One Applied & Life Sciences
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList
Publicly Available Content Database
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ: Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: 24P
  name: Wiley Online Library Open Access
  url: https://authorservices.wiley.com/open-science/open-access/browse-journals.html
  sourceTypes: Publisher
– sequence: 3
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
EISSN 2640-4567
EndPage n/a
ExternalDocumentID oai_doaj_org_article_db5a2e9fa010441194f3dcf483a9fa75
10_1002_aisy_202400363
AISY202400363
Genre article
GrantInformation_xml – fundername: Universidad de Málaga
GroupedDBID 0R~
1OC
24P
AAFWJ
AAHHS
ACCFJ
ACCMX
ACXQS
ADKYN
ADZMN
ADZOD
AEEZP
AEQDE
AFKRA
AIWBW
AJBDE
ALMA_UNASSIGNED_HOLDINGS
ALUQN
ARAPS
ARCSS
AVUZU
BENPR
BGLVJ
CCPQU
EBS
EJD
GROUPED_DOAJ
HCIFZ
IAO
ITC
M~E
OK1
PIMPY
WIN
AAMMB
AAYXX
ADMLS
AEFGJ
AFFHD
AFPKN
AGXDD
AIDQK
AIDYY
CITATION
ICD
PHGZM
PHGZT
PQGLB
8FE
8FG
ABUWG
AZQEC
DWQXO
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c3783-8d8f2455da9ea5359e6585da39b9cf685097f1f1dc1b3d624a9d673bcaea68503
IEDL.DBID 24P
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001354186600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2640-4567
IngestDate Fri Oct 03 12:39:22 EDT 2025
Wed Aug 13 08:44:30 EDT 2025
Sat Nov 29 07:20:58 EST 2025
Tue Jan 21 09:50:44 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License Attribution
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3783-8d8f2455da9ea5359e6585da39b9cf685097f1f1dc1b3d624a9d673bcaea68503
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-0006-6811
0000-0003-3432-3230
0000-0003-1372-1395
OpenAccessLink https://onlinelibrary.wiley.com/doi/abs/10.1002%2Faisy.202400363
PQID 3157332452
PQPubID 5064933
PageCount 10
ParticipantIDs doaj_primary_oai_doaj_org_article_db5a2e9fa010441194f3dcf483a9fa75
proquest_journals_3157332452
crossref_primary_10_1002_aisy_202400363
wiley_primary_10_1002_aisy_202400363_AISY202400363
PublicationCentury 2000
PublicationDate January 2025
2025-01-00
20250101
2025-01-01
PublicationDateYYYYMMDD 2025-01-01
PublicationDate_xml – month: 01
  year: 2025
  text: January 2025
PublicationDecade 2020
PublicationPlace Weinheim
PublicationPlace_xml – name: Weinheim
PublicationTitle Advanced intelligent systems
PublicationYear 2025
Publisher John Wiley & Sons, Inc
Wiley
Publisher_xml – name: John Wiley & Sons, Inc
– name: Wiley
References 2021; 6
2021; 23
1962; 5
2009
2022; 46
2006
2023; 620
1997; 4
2021; 14
2021; 38
2020; 5
2018; 3
2023; 23
1990
2024; 6
2021
2022; 7
2022; 9
2019
2018
2016
2015
2014
2013
2022; 2
2022; 38
2019; 132
e_1_2_10_23_1
e_1_2_10_24_1
e_1_2_10_21_1
e_1_2_10_22_1
e_1_2_10_20_1
Kopp R. E. (e_1_2_10_28_1) 1962
e_1_2_10_2_1
e_1_2_10_4_1
e_1_2_10_18_1
e_1_2_10_3_1
e_1_2_10_19_1
e_1_2_10_6_1
e_1_2_10_16_1
e_1_2_10_5_1
e_1_2_10_17_1
e_1_2_10_8_1
e_1_2_10_14_1
e_1_2_10_7_1
e_1_2_10_15_1
e_1_2_10_12_1
e_1_2_10_9_1
e_1_2_10_13_1
e_1_2_10_10_1
e_1_2_10_11_1
e_1_2_10_32_1
e_1_2_10_31_1
e_1_2_10_30_1
e_1_2_10_29_1
e_1_2_10_27_1
e_1_2_10_25_1
e_1_2_10_26_1
References_xml – year: 2009
– start-page: 1
  year: 2015
  end-page: 10
– volume: 132
  start-page: 65
  year: 2019
  publication-title: Adv. Eng. Softw.
– start-page: 500
  year: 1990
  end-page: 505
– start-page: 2132
  year: 2021
  end-page: 2139
– volume: 2
  start-page: 273
  year: 2022
  publication-title: Complex Syst. Model. Simul.
– volume: 46
  start-page: 307
  year: 2022
  publication-title: Auton. Robot.
– volume: 5
  start-page: 3620
  year: 2020
  publication-title: IEEE Robot. Autom. Lett.
– start-page: 4523
  year: 2018
  end-page: 4530
– volume: 23
  start-page: 3239
  year: 2023
  publication-title: Sensors
– volume: 38
  start-page: 3357
  year: 2022
  publication-title: IEEE Trans. Robot.
– volume: 14
  start-page: 147
  year: 2021
  publication-title: Math. Program. Comput.
– volume: 9
  start-page: 898890
  year: 2022
  publication-title: Front. Robot. AI.
– start-page: 331
  year: 2019
  end-page: 335
– volume: 6
  start-page: 2300703
  year: 2024
  publication-title: Adv. Intell. Syst.
– volume: 23
  start-page: 4556
  year: 2021
  publication-title: IEEE Trans. Intell. Transp. Syst.
– volume: 620
  start-page: 982
  year: 2023
  publication-title: Nature
– start-page: 3636
  year: 2014
  end-page: 3641
– start-page: 1
  year: 2009
  end-page: 6
– volume: 6
  start-page: 34
  year: 2021
  publication-title: Sci. Robot.
– volume: 7
  start-page: 5719
  year: 2022
  publication-title: IEEE Robot. Autom. Lett.
– start-page: 1788
  year: 2013
  end-page: 1792
– volume: 7
  start-page: eabl6259
  year: 2022
  publication-title: Sci. Robot.
– year: 2006
– volume: 5
  start-page: 255
  year: 1962
  end-page: 279
– volume: 38
  start-page: 922
  year: 2021
  publication-title: IEEE Trans. Robot.
– start-page: 649
  year: 2016
  end-page: 666
– start-page: 5054
  year: 2013
  end-page: 5061
– volume: 3
  start-page: 2439
  year: 2018
  publication-title: IEEE Robot. Autom. Lett.
– volume: 4
  start-page: 23
  year: 1997
  publication-title: IEEE Robot. Autom. Mag.
– ident: e_1_2_10_4_1
  doi: 10.3389/frobt.2022.898890
– ident: e_1_2_10_2_1
  doi: 10.1145/2728606.2728620
– ident: e_1_2_10_13_1
  doi: 10.1038/s41586-023-06419-4
– ident: e_1_2_10_6_1
  doi: 10.1016/j.advengsoft.2019.03.007
– ident: e_1_2_10_16_1
  doi: 10.1109/LRA.2020.2975759
– ident: e_1_2_10_12_1
  doi: 10.1017/CBO9780511546877
– start-page: 255
  volume-title: Mathematics in Science and Engineering
  year: 1962
  ident: e_1_2_10_28_1
– ident: e_1_2_10_11_1
  doi: 10.1007/s10514-021-10011-y
– ident: e_1_2_10_22_1
  doi: 10.1109/TRO.2021.3100142
– ident: e_1_2_10_24_1
  doi: 10.1109/LRA.2018.2795654
– ident: e_1_2_10_7_1
  doi: 10.1109/ICCAR.2019.8813737
– ident: e_1_2_10_20_1
  doi: 10.1007/978-3-642-00839-9
– ident: e_1_2_10_15_1
  doi: 10.1109/100.580977
– ident: e_1_2_10_27_1
  doi: 10.1109/TITS.2020.3045917
– ident: e_1_2_10_32_1
  doi: 10.1007/s12532-021-00208-8
– ident: e_1_2_10_31_1
  doi: 10.1109/TRO.2022.3177279
– ident: e_1_2_10_8_1
– ident: e_1_2_10_23_1
– ident: e_1_2_10_26_1
– ident: e_1_2_10_21_1
  doi: 10.1007/978-3-319-28872-7_37
– ident: e_1_2_10_19_1
  doi: 10.1002/aisy.202300703
– ident: e_1_2_10_9_1
– ident: e_1_2_10_5_1
  doi: 10.1109/CASE49439.2021.9551524
– ident: e_1_2_10_25_1
  doi: 10.1109/IROS.2018.8593813
– ident: e_1_2_10_14_1
– ident: e_1_2_10_3_1
  doi: 10.1109/SSRR.2009.5424168
– ident: e_1_2_10_29_1
  doi: 10.1109/LRA.2022.3154013
– ident: e_1_2_10_18_1
  doi: 10.3390/s23063239
– ident: e_1_2_10_10_1
  doi: 10.1126/scirobotics.abh1221
– ident: e_1_2_10_17_1
  doi: 10.23919/CSMS.2022.0017
– ident: e_1_2_10_30_1
  doi: 10.1126/scirobotics.abl6259
SSID ssj0002171027
Score 2.278674
Snippet In the field of mobile robots, achieving minimum time in executing trajectories is crucial for applications like delivery, inspection, and search and rescue....
SourceID doaj
proquest
crossref
wiley
SourceType Open Website
Aggregation Database
Index Database
Publisher
SubjectTerms Algorithms
Computational efficiency
Computing costs
Computing time
Configuration management
Efficiency
Energy consumption
Methods
motion plannings
Optimization
optimization‐based methods
Planning
Pontryagin principle
Robots
time‐optimal plannings
Trajectory optimization
Trajectory planning
Waypoints
SummonAdditionalLinks – databaseName: DOAJ: Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV29TsMwELZQxcCCQIAIFOQBiSlqYsf5YUsRFUilIPFXJsuJbakI0qoJoG48As_Ik3B20qqdWNhiJ8PpLr777mx_h9AJJZBWCJK5wvOUG_gK_CCjnsu0BovLMMzt9bHHfjQYxMNhcrvU6sucCavpgWvFdWTGBFGJFiZxCHzIuTWVuQ5iKmAysuylgHqWkinjgwFoQ-SM5iyNHumIUTmDdNAcmaQhXYlClqx_BWEu41QbaHpbaLNBiDitJdtGa6rYQbI__sR1B4amegejssIAOfF1cyYQP4nZZDwqqhJDBHqx5fgZnnclOsMpNvc9fr6-b8BNvIlXeOpCDJM4bXjFd9FD7-L-_NJtGiS4OY1i6sYy1iRgTIpECUZZogBPwIgmWZLrMAYwEGlf-zL3MypDEohEhhHNcqGEeUv3UKsYF2ofYVi2fgSuzmPaZIgiEZGXZaZRephLzTIHnc4Vxic1DwavGY8JN6rlC9U6qGv0ufjK8FfbCbAqb6zK_7Kqg9pza_BmUZWc-oa80WwVO4hYC_0hCk-v7p4Xo4P_EOwQbRDTAdgWYdqoVU3f1RFazz-qUTk9tj_hL2H94RI
  priority: 102
  providerName: Directory of Open Access Journals
– databaseName: ProQuest Central
  dbid: BENPR
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NT9wwEB3RpYdeCoiiLqXIByROEUkc56MXtFuBqEQXRAulJ8vxB9qqbLabBbQ3fkJ_Y38JM1lnWy5w6C1OosjKs2fejO03ADs8xrBCxWWgwtAGSWTRDgoeBsI5RNykqW6Oj10cZ4NBfnlZnPqEW-23VbY2sTHUptKUI9_jESn30Trh_vhXQFWjaHXVl9B4AcukVJZ0YLl_MDg9W2RZkHCjB81atcYw3lPDeoZhIW2d5Cl_5I0a0f5HTPNfvto4nMOV_-3qKrz2VJP15mNjDZbsaB3McXXH5qUcfBoQW_WUIXdln_3mQvZNzcbVcDStGbqyH01ef8ba8kYfWI_RwZE_979P0N5cq5941UdnaFjPC5S_gfPDg68fjwJfaSHQPMt5kJvcYX-FUYVVgovCIjHBFi_KQrs0R1aRuchFRkclN2mcqMKkGS-1soqe8g3ojKqRfQsM53-Uoc0MhaNQUxUqC8uSKq6n2jhRdmG3_eNyPBfUkHPp5FgSNnKBTRf6BMjiLRLCbm5Ukyvp55U0pVCxLZyiuDKhMeC40S7JucKbmejCVouR9LOzln8B6kLcQPxMV2Tv05fvi9bm0998B69iKhLc5Gm2oDOd3Nj38FLfTof1ZNuP0AcDj-_3
  priority: 102
  providerName: ProQuest
Title Low Computational Cost for Multiple Waypoints Trajectory Planning: A Time‐Optimal‐Based Approach
URI https://onlinelibrary.wiley.com/doi/abs/10.1002%2Faisy.202400363
https://www.proquest.com/docview/3157332452
https://doaj.org/article/db5a2e9fa010441194f3dcf483a9fa75
Volume 7
WOSCitedRecordID wos001354186600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ: Directory of Open Access Journals
  customDbUrl:
  eissn: 2640-4567
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002171027
  issn: 2640-4567
  databaseCode: DOA
  dateStart: 20190101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2640-4567
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002171027
  issn: 2640-4567
  databaseCode: M~E
  dateStart: 20190101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 2640-4567
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002171027
  issn: 2640-4567
  databaseCode: P5Z
  dateStart: 20201001
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2640-4567
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002171027
  issn: 2640-4567
  databaseCode: BENPR
  dateStart: 20201001
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2640-4567
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002171027
  issn: 2640-4567
  databaseCode: PIMPY
  dateStart: 20201001
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
– providerCode: PRVWIB
  databaseName: Wiley Online Library Free Content
  customDbUrl:
  eissn: 2640-4567
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002171027
  issn: 2640-4567
  databaseCode: WIN
  dateStart: 20190101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
– providerCode: PRVWIB
  databaseName: Wiley Online Library Open Access
  customDbUrl:
  eissn: 2640-4567
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002171027
  issn: 2640-4567
  databaseCode: 24P
  dateStart: 20190101
  isFulltext: true
  titleUrlDefault: https://authorservices.wiley.com/open-science/open-access/browse-journals.html
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB5By4ELDwFioax8QOIUNbbjJOa2W7VipXaJeLXlYtmxjRbBbrVZQHvrT-A38ksYO9m0e6oElyjjPGR5Ms94vgF4yRmGFZqZRKepSzLqUA8KnibCe-S4zfM6lo99Oi6m0_LsTFbXqvhbfIg-4RYkI-rrIODaNPtXoKF61qwxvgt7IHnOb8MupbwMzRtYVvVZFnS40YKGmmk0_GmC3kKxQW5M2f72K7YsUwTw3_I6r_uu0fgc3f__aT-Ae53jSUbtl_IQbrn5I7DHi1-kbezQJQWRalYEPVly0m01JKd6fbGYzVcNQcP2NWb512TT7Og1GZFQRvLn8vdb1D7f9Tc8G6NptGTUwZU_ho9Hhx8O3iRd34Wk5kXJk9KWnmVCWC2dFlxIh24KUlwaWfu8RB-j8NRTW1PDbc4yLW1ecFNrp8NV_gR25ou5ewoEtQEtUIOmwofAU0tdpMaE_ut5bb0wA3i1WXN10cJrqBZImamwUqpfqQGMA0v6uwIsdhxYLL-oTsqUNUIzJ70OUWZGqcw8t7XPSq5xsBAD2NswVHWy2ihOAyZk-AM9ABZZd8NU1Gjy_rynnv3LQ8_hLguNhGMuZw92Vssf7gXcqX-uZs1yGL_hIeyOD6fVu2FME-CxEp9xrJqcVOdInU6mfwFYpfjl
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LbtQwFL0qBQk2PASIaQt4AWIVNbHjJK5UoSlQddTpUIkChY1x_ECD2skwGahmxyfwJXwUX8K1kwx0A6su2MVOZCXx8T33-nEPwCNGMaxQtIxUHNsoTSzaQc7iiDuHPW6yTIfjY2-G-WhUHB-LwxX40Z2F8dsqO5sYDLWptJ8j32SJz9zn1wmfTj9HXjXKr652EhoNLPbt4gxDtnp78Bz79zGluy-Onu1FrapApFlesKgwhcNmuFHCKs64sEjCWGKiFNplBTJo7hKXGJ2UzGQ0VcJkOSu1ssrfZdjuJbicphgs4fg55O-Xczro3iNf511uyJhuqnG9wCDUb9RkGTvHfUEi4Jxf-6d3HOht98b_9mNuwvXWkSb9Bvm3YMVOboMZVmekEapoJzmxVM8JeubkoN06Sd6qxbQaT-Y1QaL-FFYtFqQTb9oifeKPxfz89v0lWtNTdYJXO0j1hvTb9Ot34PWFfNhdWJ1UE3sPCFq3JEdGiLnzgbQSKo_L0uvJZ9o4XvbgSdfDctqkC5FNYmgqPRbkEgs92PEAWD7l03yHimr2UbZWQ5qSK2qFUz5qTpNEpI4Z7dKCKazMeQ82OkzI1vbU8jcgekADpP7xKrI_ePVuWVr7e5sP4ere0cFQDgej_XW4Rr0ccpiR2oDV-eyLvQ9X9Nf5uJ49CGODwIeLxtwv3e1LmA
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LjtMwFL0aBoTY8BAgOgzgBYhV1MSO4wQJoQ5DRTWlVOI1sDGOH6hoaEpTGHXHJ_A9fA5fwrWTFGYDq1mwi53ISuLj-_L1PQB3GUW3QtEyUnFsozSxKAc5iyPuHM64yTIdjo-9HovJJD88LKZb8KM7C-PTKjuZGAS1qbSPkfdZ4iv3-X3CvmvTIqb7w0eLz5FnkPI7rR2dRgORA7s-Rvetfjjax7m-R-nwycvHT6OWYSDSTOQsyk3ucEhuVGEVZ7ywqJCxxYqy0C7LUZsKl7jE6KRkJqOpKkwmWKmVVf4uw3HPwFmBPqZfXVP-bhPfQVMfdbfo6kTGtK9m9RodUp-0yTJ2Qg8GuoATNu6flnJQdcNL__NPugwXWwObDJoVcQW27PwqmHF1TBoCizb4ia16RdBiJ8_alEryRq0X1Wy-qgkq8I9hN2NNOlKnB2RA_HGZn9--P0cp-0kd4dUemgCGDNqy7Nfg1al82HXYnldzewMISr1EoKaIufMOtiqUiMvS88xn2jhe9uB-N9ty0ZQRkU3BaCo9LuQGFz3Y82DYPOXLf4eOavlBttJEmpIragunvDedJkmROma0S3OmsFPwHux2-JCtTKrlb3D0gAZ4_eNV5GD04u2mtfP3Me_AeYSaHI8mBzfhAvUsySFQtQvbq-UXewvO6a-rWb28HZYJgfenDblfYNJUaw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Low+Computational+Cost+for+Multiple+Waypoints+Trajectory+Planning%3A+A+Time%E2%80%90Optimal%E2%80%90Based+Approach&rft.jtitle=Advanced+intelligent+systems&rft.au=Lin%E2%80%90Yang%2C+Da%E2%80%90hui&rft.au=Pastor%2C+Francisco&rft.au=Garc%C3%ADa%E2%80%90Cerezo%2C+Alfonso+J.&rft.date=2025-01-01&rft.issn=2640-4567&rft.eissn=2640-4567&rft.volume=7&rft.issue=1&rft.epage=n%2Fa&rft_id=info:doi/10.1002%2Faisy.202400363&rft.externalDBID=10.1002%252Faisy.202400363&rft.externalDocID=AISY202400363
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2640-4567&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2640-4567&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2640-4567&client=summon