检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高春林 王霜[1] 胡佳慧 梁咏仪 GAO Chunlin;WANG Shuang;HU Jiahui;LIANG Yongyi(Modern Agricultural Equipment Research Institute,Xihua University,Chengdu 610039 China)
机构地区:[1]西华大学现代农业装备研究院,四川成都610039
出 处:《西华大学学报(自然科学版)》2025年第3期61-67,共7页Journal of Xihua University:Natural Science Edition
基 金:四川省科技攻关项目“丘陵山地多功能动力平台研制”(2022YFG0079)。
摘 要:为减少丘陵山区的“户作机械化”模式下的机耕道改造成本、缩短改造时间,提出一种能够连通给定区域所有田块且长度最短的机耕道布局规划方法。该方法基于集合覆盖和最小斯坦纳树,将整个规划过程分为两阶段:首先通过集合覆盖问题模型找出连通所有地块的所有交点组合;然后将交点组合作为需要连接的目标节点,在地块边界信息构成的无向图中求出对应的最小斯坦纳树,通过对不同结果的路网长度的比较,得出总长度最短的机耕道布局。实例验证结果表明:该方法是可行的,且减少了机耕道的改造成本。To reduce the cost of converting farm roads in hilly and mountainous areas under the"household mechanization"model and shorten the transformation time,a method is proposed to plan the layout of farm roads that connects all plots in a given area and has the shortest length.This method is based on set coverings and minimum Steiner trees.It divides the entire planning process into two stages.First,it uses a set covering problem model to find all intersection combinations that connect all plots.Then,it treats these intersection groups as target nodes to be connected and finds the corresponding minimum Steiner tree in an undirected graph formed by plot boundary information.By comparing the network lengths of differ-ent results,the layout with the shortest total length of farm roads is determined.Experimental verification results show that this method is feasible and can reduce the cost of converting farm roads.
分 类 号:S23[农业科学—农业机械化工程] TP391.7[农业科学—农业工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.91