静态流场中时间和能量路径规划优化的半拉格朗日方法

IF 3.7 3区 计算机科学 Q2 AUTOMATION & CONTROL SYSTEMS
Víctor C. da S. Campos , Armando A. Neto , Douglas G. Macharet
{"title":"静态流场中时间和能量路径规划优化的半拉格朗日方法","authors":"Víctor C. da S. Campos ,&nbsp;Armando A. Neto ,&nbsp;Douglas G. Macharet","doi":"10.1016/j.jfranklin.2025.107612","DOIUrl":null,"url":null,"abstract":"<div><div>Efficient path planning for autonomous mobile robots is a critical problem across numerous domains, where optimizing both <em>time</em> and <em>energy</em> consumption is paramount. This paper introduces a novel methodology that considers the dynamic influence of an environmental flow field and geometric constraints, including obstacles and forbidden zones, enriching the complexity of the planning problem. Here, we formulate it as a multi-objective optimal control problem, and propose a novel transformation called <em>Harmonic Transformation</em>, applying a semi-Lagrangian scheme to solve it. The set of Pareto efficient solutions is obtained considering two distinct approaches: (<span><math><mi>i</mi></math></span>) a deterministic method referred to as Concurrent Policy Iteration (CPI); and (<span><math><mrow><mi>i</mi><mi>i</mi></mrow></math></span>) an evolutionary-based one, called Multi-objective Evolutionary Policy Iteration (MEPI). Both methods were designed to make use of the proposed Harmonic Transformation. Through an extensive analysis of these approaches, comparing them with the state-of-the-art literature, we demonstrate their efficacy in finding optimized paths. Generally speaking, the Pareto Set of solutions found in our experiments indicates that the CPI demonstrated better performance in finding solutions close to the time-optimal one, whereas the MEPI was most successful in finding solutions close to the energy-optimal solution.</div></div>","PeriodicalId":17283,"journal":{"name":"Journal of The Franklin Institute-engineering and Applied Mathematics","volume":"362 7","pages":"Article 107612"},"PeriodicalIF":3.7000,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A semi-Lagrangian approach for time and energy path planning optimization in static flow fields\",\"authors\":\"Víctor C. da S. Campos ,&nbsp;Armando A. Neto ,&nbsp;Douglas G. Macharet\",\"doi\":\"10.1016/j.jfranklin.2025.107612\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Efficient path planning for autonomous mobile robots is a critical problem across numerous domains, where optimizing both <em>time</em> and <em>energy</em> consumption is paramount. This paper introduces a novel methodology that considers the dynamic influence of an environmental flow field and geometric constraints, including obstacles and forbidden zones, enriching the complexity of the planning problem. Here, we formulate it as a multi-objective optimal control problem, and propose a novel transformation called <em>Harmonic Transformation</em>, applying a semi-Lagrangian scheme to solve it. The set of Pareto efficient solutions is obtained considering two distinct approaches: (<span><math><mi>i</mi></math></span>) a deterministic method referred to as Concurrent Policy Iteration (CPI); and (<span><math><mrow><mi>i</mi><mi>i</mi></mrow></math></span>) an evolutionary-based one, called Multi-objective Evolutionary Policy Iteration (MEPI). Both methods were designed to make use of the proposed Harmonic Transformation. Through an extensive analysis of these approaches, comparing them with the state-of-the-art literature, we demonstrate their efficacy in finding optimized paths. Generally speaking, the Pareto Set of solutions found in our experiments indicates that the CPI demonstrated better performance in finding solutions close to the time-optimal one, whereas the MEPI was most successful in finding solutions close to the energy-optimal solution.</div></div>\",\"PeriodicalId\":17283,\"journal\":{\"name\":\"Journal of The Franklin Institute-engineering and Applied Mathematics\",\"volume\":\"362 7\",\"pages\":\"Article 107612\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2025-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of The Franklin Institute-engineering and Applied Mathematics\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0016003225001061\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of The Franklin Institute-engineering and Applied Mathematics","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0016003225001061","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

自主移动机器人的有效路径规划是许多领域的关键问题,其中优化时间和能量消耗是至关重要的。本文介绍了一种新的方法,该方法考虑了环境流场的动态影响和几何约束,包括障碍物和禁区,丰富了规划问题的复杂性。在此,我们将其表述为一个多目标最优控制问题,并提出了一种新的变换,称为调和变换,应用半拉格朗日格式来解决它。考虑两种不同的方法获得Pareto有效解集:(i)一种称为并发策略迭代(CPI)的确定性方法;(ii)基于进化的多目标进化策略迭代(MEPI)。这两种方法都是为了利用谐波变换而设计的。通过对这些方法的广泛分析,将它们与最先进的文献进行比较,我们证明了它们在寻找优化路径方面的功效。总的来说,在我们的实验中发现的帕累托解集表明,CPI在寻找接近时间最优解方面表现出更好的性能,而MEPI在寻找接近能量最优解方面表现得最成功。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A semi-Lagrangian approach for time and energy path planning optimization in static flow fields
Efficient path planning for autonomous mobile robots is a critical problem across numerous domains, where optimizing both time and energy consumption is paramount. This paper introduces a novel methodology that considers the dynamic influence of an environmental flow field and geometric constraints, including obstacles and forbidden zones, enriching the complexity of the planning problem. Here, we formulate it as a multi-objective optimal control problem, and propose a novel transformation called Harmonic Transformation, applying a semi-Lagrangian scheme to solve it. The set of Pareto efficient solutions is obtained considering two distinct approaches: (i) a deterministic method referred to as Concurrent Policy Iteration (CPI); and (ii) an evolutionary-based one, called Multi-objective Evolutionary Policy Iteration (MEPI). Both methods were designed to make use of the proposed Harmonic Transformation. Through an extensive analysis of these approaches, comparing them with the state-of-the-art literature, we demonstrate their efficacy in finding optimized paths. Generally speaking, the Pareto Set of solutions found in our experiments indicates that the CPI demonstrated better performance in finding solutions close to the time-optimal one, whereas the MEPI was most successful in finding solutions close to the energy-optimal solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.30
自引率
14.60%
发文量
586
审稿时长
6.9 months
期刊介绍: The Journal of The Franklin Institute has an established reputation for publishing high-quality papers in the field of engineering and applied mathematics. Its current focus is on control systems, complex networks and dynamic systems, signal processing and communications and their applications. All submitted papers are peer-reviewed. The Journal will publish original research papers and research review papers of substance. Papers and special focus issues are judged upon possible lasting value, which has been and continues to be the strength of the Journal of The Franklin Institute.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信