Greedy dynamic reward algorithm-based coverage path planning for unmanned sailboats in non-stationary wind environments

Unmanned sailboats, powered by wind, are well-suited for long-term island patrols but face challenges in maneuverability due to wind constraints, limiting route flexibility. This study addresses the issue of coverage path planning by proposing a Greedy Dynamic Reward Algorithm that incorporates wind...

תיאור מלא

מידע ביבליוגרפי

Principais autores:	Jinkun Shen, Zhongben Zhu, Guiqiang Bai, Zhongchao Deng, Yifan Xue, Xiaojian Cao, Xiaokai Mu, Hongde Qin
פורמט:	Artigo
שפה:	Inglês
יצא לאור:	Elsevier 2025-01-01
סדרה:	Applied Ocean Research
נושאים:	Unmanned sailboat Island coverage search Non-stationary wind Complete coverage path planning Greedy dynamic reward algorithm
גישה מקוונת:	http://www.sciencedirect.com/science/article/pii/S0141118724005030
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!