欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
提出了k完全相异可视最优有序路径查询问题,根据处理数据集与障碍集先后顺序的不同,给出了距离优先的近似算法Distance_First以及角度优先的近似算法Angle_First。实验结果表明,算法Distance_First适用于障碍集规模较小的k完全相异可视最优有序路径查询问题,而算法Angle_First适用于障碍集规模较大的k完全相异可视最优有序路径查询问题。
英文摘要：
The problem of k completely different visible optimal sequenced route query is put forward in the paper.Two approximate algorithms for resolving this query problem,the Distance_First algorithm and the Angle_First algorithm at the rules of distance preference and angle preference respectively,are presented based on different order of dealing with datasets and obstacle set.Experimental results show that for k completely different visible optimal sequenced route query problem,the Distance_First algorithm fits the one with smaller obstacle set and the Angle_First algorithm fits the one with larger obstacle set.
同期刊论文项目
同项目期刊论文
期刊信息
位置：