arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1910.04251math.OCcs.RO

Two-stage stochastic programming approach for path planning problems under travel time and availability uncertainties

Wayne State University(韦恩州立大学);Virginia Tech(弗吉尼亚理工大学);U.S. Army CCDC Ground Vehicle Systems Center(美国陆军CCDC地面车辆系统中心);Aptiv(安波福)

Saravanan Venkatachalam, Manish Bansal, Jonathon M. Smereka, Joseph Lee

英文摘要:

Significant advances in sensing, robotics, and wireless networks have enabled the collaborative utilization of autonomous aerial, ground and underwater vehicles for various applications. However, to successfully harness the benefits of these unmanned ground vehicles (UGVs) in homeland security operations, it is critical to efficiently solve UGV path planning problem which lies at the heart of these operations. Furthermore, in the real-world applications of UGVs, these operations encounter uncertainties such as incomplete information about the target sites, travel times, and the availability of vehicles, sensors, and fuel. This research paper focuses on developing algebraic-based-modeling framework to enable the successful deployment of a team of vehicles while addressing uncertainties in the distance traveled and the availability of UGVs for the mission.

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

↑