首页|Multi-Agent Collaborative Task Planning with Uncertain Task Requirements
Multi-Agent Collaborative Task Planning with Uncertain Task Requirements
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
万方数据
维普
In response to the uncertainty of information of the injured in post disaster situations,considering constraints such as random chance and the quantity of rescue resource,the split deliv-ery vehicle routing problem with stochastic demands(SDVRPSD)model and the multi-depot split delivery heterogeneous vehicle routing problem with stochastic demands(MDSDHVRPSD)model are established.A two-stage hybrid variable neighborhood tabu search algorithm is designed for unmanned vehicle task planning to minimize the path cost of rescue plans.Simulation experiments show that the solution obtained by the algorithm can effectively reduce the rescue vehicle path cost and the rescue task completion time,with high optimization quality and certain portability.
School of Automation,Beijing Institute of Technology,Beijing 100081,China and National Key Laborary of Autonomous Intelligent Unmanned Systems,Beijing Institute of Technol-ogy,Beijing 100081,China
万方数据
维普
