arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.05545eess.SYcs.ROcs.SY
收藏

面向不确定动态定向问题的自适应概率规划

Adaptive Probabilistic Planning for the Uncertain and Dynamic Orienteering Problem

Imperial College London(伦敦帝国学院);Dyson School of Design Engineering(戴森设计工程学院)

Qiuchen Qian, Yanran Wang, David Boyle

AI总结:

针对参数未知且时变的不确定动态定向问题,提出ADAPT贝叶斯在线规划框架,并通过无人机充电调度验证其鲁棒性与100%任务成功率。

摘要:

定向问题(Orienteering Problem, OP)是一个得到充分研究的路径规划问题,并已被扩展以纳入不确定性,从而反映随机或动态的旅行成本、奖品收集成本和奖品。然而,在在线场景中,由于建模知识不足以及参数初始不可知,现有方法在实际应用中可能效率低下。因此,我们提出不确定动态定向问题(Uncertain and Dynamic Orienteering Problem, UDOP),将旅行成本建模为具有未知且随时间变化参数的分布。UDOP还在其目标和预算约束中将不确定旅行成本与动态奖品及奖品收集成本关联起来。为解决UDOP,我们开发了一种概率路径自适应方法——ADAPT,它基于初始的“离线”解迭代执行“执行”和“在线规划”。执行阶段更新系统状态并记录在线成本观测值。在线规划器采用贝叶斯方法来自适应估计功耗,并基于安全置信度优化路径序列。我们在一个用于无线可充电传感器网络的实际无人机(Unmanned Aerial Vehicle, UAV)充电调度问题中评估ADAPT。UAV必须在不确定条件下管理自身能量,同时优化路径以高效为传感器节点充电。ADAPT保持了相当的解质量和计算时间,同时提供更优的鲁棒性。大量仿真表明,ADAPT在所有测试场景中均实现100%的任务成功率(Mission Success Rate, MSR),优于相当的基于启发式的方法和频率学派方法:前者在挑战性条件下失败率最高达70%,后者的平均MSR为67%。本工作推进了含不确定性OP领域的发展,为不确定和动态环境中的实际应用提供了一种可靠且高效的方法。

英文摘要:

The Orienteering Problem (OP) is a well-studied routing problem that has been extended to incorporate uncertainties, reflecting stochastic or dynamic travel costs, prize-collection costs, and prizes. Existing approaches may, however, be inefficient in real-world applications due to insufficient modeling knowledge and initially unknowable parameters in online scenarios. Thus, we propose the Uncertain and Dynamic Orienteering Problem (UDOP), modeling travel costs as distributions with unknown and time-variant parameters. UDOP also associates uncertain travel costs with dynamic prizes and prize-collection costs for its objective and budget constraints. To address UDOP, we develop an ADaptive Approach for Probabilistic paThs - ADAPT, that iteratively performs 'execution' and 'online planning' based on an initial 'offline' solution. The execution phase updates system status and records online cost observations. The online planner employs a Bayesian approach to adaptively estimate power consumption and optimize path sequence based on safety beliefs. We evaluate ADAPT in a practical Unmanned Aerial Vehicle (UAV) charging scheduling problem for Wireless Rechargeable Sensor Networks. The UAV must optimize its path to recharge sensor nodes efficiently while managing its energy under uncertain conditions. ADAPT maintains comparable solution quality and computation time while offering superior robustness. Extensive simulations show that ADAPT achieves a 100% Mission Success Rate (MSR) across all tested scenarios, outperforming comparable heuristic-based and frequentist approaches that fail up to 70% (under challenging conditions) and averaging 67% MSR, respectively. This work advances the field of OP with uncertainties, offering a reliable and efficient approach for real-world applications in uncertain and dynamic environments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑