FASTEST PATH ACROSS CONSTRAINED MOVING RECTILINEAR OBSTACLES

作     者：SRIKANT, R KRITHIVASAN, K 

作者机构：Dep. Comp. Sci. and Eng. Indian Inst. Technol. Madras 600 036 India 

出 版 物：《INFORMATION PROCESSING LETTERS》 (信息处理快报)

年 卷 期：1991年第37卷第6期

页      面：349-353页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：COMPUTATIONAL GEOMETRY OPTIMAL PATH ROBOT MOVING PARALLEL OBSTACLES MOTION PLANNING 

摘      要：Recently, there has been a lot of interest in planning the path of a robot in the present of obstacles. We present an optimal O(n log n) time algorithm to find the fastest path. The next section contains the basic definitions and properties. In Section 3, we explain how to replace the moving obstacles with stationary obstacles and give the modifications to be made to Lee and Preparata s algorithm.