Comparison of algorithm performance under random coordinate points.

<p>Comparison of algorithm performance under random coordinate points.</p>

שמור ב:

מידע ביבליוגרפי
מחבר ראשי:	Meiqing Xu (8502255) (author)
מחברים אחרים:	Chao Deng (329151) (author), Xiangyu Hu (4326106) (author), Yuxin Lu (225932) (author), Wenyan Xue (22676549) (author), Bin Zhu (182882) (author)
יצא לאור:	2025
נושאים:	Microbiology Neuroscience Evolutionary Biology Inorganic Chemistry Science Policy Space Science Biological Sciences not elsewhere classified Mathematical Sciences not elsewhere classified Information Systems not elsewhere classified unmanned aerial vehicle faster simulation time encompassing wind speed dynamic obstacle avoidance deep reinforcement learning balance global navigation dimensional constraint model conventional heuristic methods heuristic search constraint optimization xlink "> study proposes simulated annealing path redundancy path distance mission omissions means algorithm local optimization intelligent scheduling improved k comparative evaluations
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!

פריטים דומים