CPP: a path planning method taking into account obstacle shadow hiding

IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Ruixin Zhang, Qing Xu, Youneng Su, Ruoxu Chen, Kai Sun, Fengchang Li, Guo Zhang
{"title":"CPP: a path planning method taking into account obstacle shadow hiding","authors":"Ruixin Zhang, Qing Xu, Youneng Su, Ruoxu Chen, Kai Sun, Fengchang Li, Guo Zhang","doi":"10.1007/s40747-024-01718-3","DOIUrl":null,"url":null,"abstract":"<p>Path planning algorithms are crucial for the autonomous navigation and task execution of unmanned vehicles in battlefield environments. However, existing path planning algorithms often overlook the concealment effects of obstacles, which can lead to significant safety risks for unmanned vehicles during operation. To address this issue, we proposed a novel path planning method—Covert Path Planning (CPP)—that incorporated considerations for the shadow occlusion caused by obstacles. By accounting for these concealment effects, CPP aimed to enhance the safety and effectiveness of unmanned vehicles in complex and dynamic battlefield scenarios. It started by designing shadow areas in the configuration environment based on solar azimuth and altitude angles. A gravitational field model was then created using these shadow areas and the target point’s position to guide the path point movement, achieving a path with a higher safety coefficient. The method also dynamically adjusted step length according to gravitational forces to boost planning efficiency. Additionally, a deformed ellipse-based obstacle avoidance technique was introduced to enhance the vehicle’s ability to navigate around obstacles. We simplified the path by considering the relationship between path points and shadows. We also proposed a Minimum-Jerk Trajectory Optimization method with controllable path noise points, which enhanced path smoothness and reduced predictability. Comparative analysis showed that CPP significantly outperformed five other algorithms—RRT, Improved B-RRT, RRT*, Informed RRT*, and Potential Field-by reducing running time by 46.01% to 93.3%, increasing path safety by 10.42% to 83.44%, and improving path smoothness, making it particularly effective for path planning in tactical scenarios involving unmanned vehicles.</p>","PeriodicalId":10524,"journal":{"name":"Complex & Intelligent Systems","volume":"161 1","pages":""},"PeriodicalIF":5.0000,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complex & Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s40747-024-01718-3","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Path planning algorithms are crucial for the autonomous navigation and task execution of unmanned vehicles in battlefield environments. However, existing path planning algorithms often overlook the concealment effects of obstacles, which can lead to significant safety risks for unmanned vehicles during operation. To address this issue, we proposed a novel path planning method—Covert Path Planning (CPP)—that incorporated considerations for the shadow occlusion caused by obstacles. By accounting for these concealment effects, CPP aimed to enhance the safety and effectiveness of unmanned vehicles in complex and dynamic battlefield scenarios. It started by designing shadow areas in the configuration environment based on solar azimuth and altitude angles. A gravitational field model was then created using these shadow areas and the target point’s position to guide the path point movement, achieving a path with a higher safety coefficient. The method also dynamically adjusted step length according to gravitational forces to boost planning efficiency. Additionally, a deformed ellipse-based obstacle avoidance technique was introduced to enhance the vehicle’s ability to navigate around obstacles. We simplified the path by considering the relationship between path points and shadows. We also proposed a Minimum-Jerk Trajectory Optimization method with controllable path noise points, which enhanced path smoothness and reduced predictability. Comparative analysis showed that CPP significantly outperformed five other algorithms—RRT, Improved B-RRT, RRT*, Informed RRT*, and Potential Field-by reducing running time by 46.01% to 93.3%, increasing path safety by 10.42% to 83.44%, and improving path smoothness, making it particularly effective for path planning in tactical scenarios involving unmanned vehicles.

CPP:一种考虑障碍物阴影隐藏的路径规划方法
路径规划算法是战场环境下无人驾驶车辆自主导航和任务执行的关键。然而,现有的路径规划算法往往忽略了障碍物的隐藏效应,这给无人驾驶车辆在运行过程中带来了很大的安全风险。为了解决这个问题,我们提出了一种新的路径规划方法——隐蔽路径规划(CPP),该方法考虑了障碍物造成的阴影遮挡。通过考虑这些隐藏效应,CPP旨在提高无人驾驶车辆在复杂动态战场场景中的安全性和有效性。它首先根据太阳的方位角和高度角在配置环境中设计阴影区域。然后利用这些阴影区域和目标点的位置建立引力场模型来引导路径点的运动,从而获得具有更高安全系数的路径。该方法还根据重力动态调整步长,提高规划效率。此外,还引入了一种基于变形椭圆的避障技术,以提高车辆在障碍物周围的导航能力。我们通过考虑路径点和阴影之间的关系来简化路径。提出了一种路径噪声点可控的最小扰动轨迹优化方法,增强了路径平滑性,降低了可预测性。对比分析表明,CPP算法显著优于RRT、Improved B-RRT、RRT*、Informed RRT*和Potential field算法,运行时间缩短46.01%至93.3%,路径安全性提高10.42%至83.44%,路径平滑度提高,尤其适用于无人车辆战术场景下的路径规划。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Complex & Intelligent Systems
Complex & Intelligent Systems COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
9.60
自引率
10.30%
发文量
297
期刊介绍: Complex & Intelligent Systems aims to provide a forum for presenting and discussing novel approaches, tools and techniques meant for attaining a cross-fertilization between the broad fields of complex systems, computational simulation, and intelligent analytics and visualization. The transdisciplinary research that the journal focuses on will expand the boundaries of our understanding by investigating the principles and processes that underlie many of the most profound problems facing society today.
×
引用
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学术官方微信