solving the multi observer 3d visual area coverage scheduling problem by decomposition解决多观察者的3 d视觉区域范围调度问题分解.pdfVIP

  • 1
  • 0
  • 约10.15万字
  • 约 16页
  • 2017-08-29 发布于上海
  • 举报

solving the multi observer 3d visual area coverage scheduling problem by decomposition解决多观察者的3 d视觉区域范围调度问题分解.pdf

solving the multi observer 3d visual area coverage scheduling problem by decomposition解决多观察者的3 d视觉区域范围调度问题分解

American Journal of Operations Research , 2011, 1, 118-133 doi:10.4236/ajor.2011.13014 Published Online September 2011 (http://www.SciRP.org/journal/ajor) Solving the Multi Observer 3D Visual Area Coverage Scheduling Problem by Decomposition 1 1,2 1 Helman I. Stern , Moshe Zofi , Moshe Kaspi 1 Department of Industrial Engineering and Management,

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档