检索结果-内蒙古大学图书馆

作者： Jež, Radek Brno University of Technology

Práce se zabývá řídicími algoritmy pro poštovního robota. Řeší problematiku hledání optimální cesty a možné problémy vzniklé při navigaci robota. O... 详细信息

Práce se zabývá řídicími algoritmy pro poštovního robota. Řeší problematiku hledání optimální cesty a možné problémy vzniklé při navigaci robota. Obsahuje popis použitých datových struktur a algoritmů pro samostatnou činnost robota. Dále popis uživatelského prostředí hlavní řídicí aplikace a dvou dalších doplňujících aplikací. Další částí je popis testování práce v reálném prostředí a zhodnocení výsledků. V závěru jsou shrnuty poznatky z testování a doporučení pro další odladění chodu robota.

关键词： hledání nejkratší cesty Dijkstrův algoritmus graf čárový kód shortest path finding dijkstra’s algorithm graphs bar code Text

来源：评论

学校读者我要写书评

暂无评论

Teorie grafů v ekonomické praxi

Teorie grafů v ekonomické praxi

引用

作者： Geško, Dávid Brno University of Technology

Bakalárska práca sa zaoberá problematikou obchodného cestujúceho. V teoretickej časti sú popísané základné pojmy teórie grafov a metódy na riešenie probl... 详细信息

Bakalárska práca sa zaoberá problematikou obchodného cestujúceho. V teoretickej časti sú popísané základné pojmy teórie grafov a metódy na riešenie problému obchodného cestujúceho. V praktickej časti sa porovnáva efektívnosť jednotlivých metód na príkladoch z reálneho prostredia. V súhrnnej analýze sú vyhodnotené metódy na riešenie problému obchodného cestujúceho. Na základe výsledkov analýzy je následne vybraná a implementovaná najefektívnejšia metóda pre firmu, ktorá vyžadovala vytovorenie programu na výpočet optimálnej trasy pri rozvoze tovaru.

关键词： teória grafov Dijkstrov algoritmus problém obchodného cestujúceho permutačná metóda metóda najbližšieho suseda metóda vkladania metóda úspor VBA Graphs theory dijkstra’s algorithm Traveling salesman person problem permutation methods nearest n

来源：评论

学校读者我要写书评

暂无评论

Utilização de um algoritmo de caminho mínimo no processo de recolhimento do palhiço da cana-de-açúcar

Utilização de um algoritmo de caminho mínimo no processo ...

引用

作者： silva, Inara soldera Romano da Universidade Estadual Paulista

A atual preocupação com o meio ambiente tem feito com que empresas produtoras de cana-de-açúcar invistam na mudança do sistema de colheita. Essa mudança consiste na redução da q... 详细信息

A atual preocupação com o meio ambiente tem feito com que empresas produtoras de cana-de-açúcar invistam na mudança do sistema de colheita. Essa mudança consiste na redução da queima do canavial na pré-colheita e na utilização do corte mecanizado com cana crua. Porém, a colheita com corte mecanizado torna disponível a biomassa residual e sem as queimadas e com o maior acúmulo do palhiço sobre o solo, criamse condições favoráveis para o aparecimento de parasitas e atraso da brota da cana, comprometendo a próxima safra. Vários autores mostram a viabilidade do uso do palhiço na produção de energia. Pois, além do potencial energético desta biomassa, têm-se como vantagens as questões ambientais, a manutenção de empregos e a substituição dos recursos energéticos de fontes naturais. Mas, as grandes dificuldades ainda encontradas para aproveitamento desse resíduo para geração de energia são o grande número de maquinário envolvido no sistema de coleta deste resíduo e o alto custo que este processo demanda, principalmente o custo com transporte. O presente trabalho tem como objetivo propor aplicações de técnicas matemáticas de otimização para auxiliar o planejamento do recolhimento do palhiço da cana-de-açúcar para aproveitamento na geração de energia, estudando a melhor forma de carregamento dos fardos de palhiço, facilitando o transporte, diminuindo custos e desgastes de maquinários. Para isto, é sugerido o uso de técnicas de agricultura de precisão para mapear o palhiço enfardado, desta forma pode-se definir uma rota para recolher os fardos no campo e transportá-los para o centro de processamento. Para determinação da rota, propõe-se o uso do algoritmo de menor caminho da teoria de grafos, utilizando uma variação do algoritmo de *** current concern with the environment has made sugar cane growers invest in changing their harvesting system. This change consists of the reduced burning of cane fields before harvesting and the use of mechanized cutting for raw canes.

关键词： Cana-de-açúcar Agricultura de precisão Biomassa Algoritmo de dijkstra Palhiço de cana-de-açúcar sugar cane Crop residue Biomass Energy Baling Precision agriculture dijkstra’s algorithm Dissertação de mestrado

来源：评论

学校读者我要写书评

暂无评论

Automated Pipe Routing Optimization for ship Machinery

引用

Journal of Marine science and Application 2022年第2期21卷 170-178页

作者： Gunawan Kunihiro Hamada Kakeru Kunihiro Allessandro setyo Anggito Utomo Michael Ahli Raymond Lesmana Cornelius Yutaka Kobayashi Tadashi Yoshimoto Takanobu shimizu Department of Mechanical Engineering Universitas IndonesiaKampus UI Depok 16424Indonesia Graduate School of Engineering Hiroshima University1-4-1 KagamiyamaHigashi-Hiroshima CityHiroshima 739-8527Japan Tsuneishi Shipbuilding Co. Ltd.1083TsuneishiNumakuma-choFukuyama CityHiroshima 720-0393Japan

In the shipbuilding industry,market competition is currently operating in an intense *** be able to strive in the global market,the shipbuilders must able to produce ships that are more efficient and can be constructed in a relatively short amount of *** piping layouts in the engine room requires a lot of time for the designer to design the best possible route and in a way are not the most efficient *** paper presents an automatic piping support system in the ship’s engine room based on the dijkstra’s algorithm of pathfinding *** proposed method is focused on finding the shortest possible route with a consideration of the following things:cost of the bend pipe,cost of the crossing pipe,cost reduction by pipe support,restriction on piping,reduction of calculation time,and design procedure of piping ***’s shortest path algorithm is adopted to find the shortest path route between the start and goal point that is determined based on the layout of the ship’s engine *** algorithm is adopted to decide the sequence of the pipe *** details of the proposed method are explained in this *** paper also discusses the application of the proposed method on an actual ship and evaluates its effectiveness.

关键词： Design optimization Piping system dijkstra’s algorithm shortest path

来源：评论

学校读者我要写书评

暂无评论

Interactive 3D Virtual Colonoscopic Navigation For Polyp Detection From CT Images

引用

Procedia Computer science 2017年 115卷 407-414页

作者： Jinu Joseph Rajesh Kumar R Pournami s Chandran P.V. Vidya Centre for Development of Advanced Computing Vellayambalam Thiruvananthapuram 695033 India

Optical colonoscopy is an invasive procedure used to examine surface lining of the colon, by inserting a flexible tube with a light and camera into the body. Virtual colonoscopy is emerging as a non-invasive alternative to optical colonoscopy. This paper describes 3D reconstruction of colon structure from patient specific CT images, interactive visualization and navigation through the reconstructed colon, automated computation of the navigation path and automated polyp detection with 90.91% sensitivity. This enables a doctor to perform a fast diagnosis through virtual exploration of the colon and resort to invasive colonoscopy procedures only if suspicious polyps are detected.

关键词： Endoscopy Polyp Volume Rendering 3D thinning surface Rendering dijkstra’s algorithm Principal Curvature Gaussian Curvature

来源：评论

学校读者我要写书评

暂无评论

Route search Method for Railway Replacement Buses Adopting Ant Colony Optimization

引用

Journal of Geographic Information system 2023年第4期15卷 391-420页

作者： Kei Nagaoka Kayoko Yamamoto Graduate School of Informatics and Engineering University of Electro-Communications Tokyo Japan

In recent years, Japan, and especially rural areas have faced the growing problems of debt-ridden local railway lines along with the population decline and aging population. Therefore, it is best to consider the discontinuation of local railway lines and introduce replacement buses to secure the transportation methods of the local people especially in rural areas. Based on the above background, targeting local railway lines that may be discontinued in the near future, appropriate bus stops when provided with potential bus stops were selected, the present study proposed a method that introduces routes for railway replacement buses adopting ant colony optimization (ACO). The improved ACO was designed and developed based on the requirements set concerning the route length, number of turns, road width, accessibility of railway lines and zones without bus stops as well as the constraint conditions concerning the route length, number of turns and zones without bus stops. Original road network data were generated and processed adopting a geographic information systems (GIs), and these are used to search for the optimal route for railway replacement buses adopting the improved ACO concerning the 8 zones on the target railway line (JR Kakogawa line). By comparing the improved ACO with dijkstra’s algorithm, its relevance was verified and areas needing further improvements were revealed.

关键词： Local Railway Line Railway Replacement Bus Route search Method Ant Colony Optimization (ACO) dijkstra’s algorithm Geographic Information systems (GIs)

来源：评论

学校读者我要写书评

暂无评论

The shortest Path Analysis Based on Road Network

引用

Asian Agricultural Research 2017年第6期9卷 98-100页

作者： Chaozheng DU Resources and Environment Department Heze University

Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily *** Heze Railway station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target *** dijkstra as theoretical basis of shortest path algorithm,we use ArcG Is network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.

关键词： shortest path dijkstra’s algorithm Road network model Network analysis

来源：评论

学校读者我要写书评

暂无评论

People Recommend system Based on Graph algorithm in Cloud Computing

People Recommend System Based on Graph Algorithm in Cloud Co...

引用

2012 International Conference on Applied Informatics and Communication(ICAIC 2012)

作者： Ting Yang Yanlei shang Junliang Chen Institute of Network Technology Research Center Beijing University of Posts and Telecommunications

With the high speed development of Web 2.0 social networking sites,the problem of information overload *** this paper,we propose a recommend system which based on content-based filtering to recommend new friends who users may want to know in social networking *** recommend the friends of friends,who have high influence in a community,but not the friend of this *** improve dijkstra’s algorithm and PageRank algorithm to fit for MapReduce framework to count distance between users and influence factor of a *** implement these parallel algorithm based on Hadoop’s MapReduce *** do experiment on Twitter’s data,we found that this recommend system can deal with large scale data,have high speed and the acceptation of our recommend is high.

关键词： Hadoop MapReduce Recommend system dijkstra’s algorithm PageRank algorithm.

来源：评论

学校读者我要写书评

暂无评论

依時性A*路徑演算系統開發－以國道高速公路路網為例

依時性A*路徑演算系統開發－以國道高速公路路網為例

引用

作者：謝伯嘉臺灣大學

学位级别：碩士

「条条大路通罗马」，交通运输的快速发展，使得我们要前往目的地，时常都有许多选择，然而因为有许多不同的选择，该如何选择就变成了另一个困扰。市面上有许多路径导引程式，不论「行前路径导引」或「途中路径导引」，多以空间最短路... 详细信息

「条条大路通罗马」，交通运输的快速发展，使得我们要前往目的地，时常都有许多选择，然而因为有许多不同的选择，该如何选择就变成了另一个困扰。市面上有许多路径导引程式，不论「行前路径导引」或「途中路径导引」，多以空间最短路径为决策目标，然而实际使用的时候，却时常发现导引程式提供的最佳路径车多雍塞。为解决传统路径导引程式往往仅依照空间距离做为路径导引决策的变数，未考虑实际交通路况的问题，本研究使用路段旅行时间做为路径选择的成本，建置一适用於国道高速公路路网的依时性A*路径演算系统。以A* algorithm做为路径演算的基础，将整合车辆侦测器(VD)与电子收费系统(ETC)资料的旅行时间资料库做为依时性演算法之资料来源，并加入後推式演算法以配合不同使用者的需求。使用者输入起点、讫点以及预计出发/抵达时间，系统就会根据旅行时间资料库提供的路段旅行资料，提供建议旅行路径与总旅行时间。本研究验证A* algorithm能够有效限制路径搜寻的方向，以较短的时间取得令人满意的建议路径，这在路网庞大复杂时，能够有效缩短运算时间，节省运算资源。本研究同时验证，後推式演算法虽然需要较长的演算时间，但是演算结果与前推式演算法一致，能够节省使用者欲於特定时间抵达目的地而反覆求解的时间。

关键词：依時性最短路徑問題 dijkstra’s algorithm A* algorithm 後推式路徑演算法路徑導引系統

来源：评论

学校读者我要写书评

暂无评论

以Linkit-7688 建构物联网之室内路径规划系统

以Linkit-7688 建构物联网之室内路径规划系统

引用

作者：陈圣融中原大学

学位级别：硕士

物联网的趋势浪潮下，感测器为实现智慧联网装置所不可或缺的重要元件，能让所有独立的物件实现互联互通的网路，举凡穿戴式装置、智慧型行动装置、环境监控设备等皆为现在科技热门应用，与我们生活周遭密不可分。室内路径规划得益于成... 详细信息

物联网的趋势浪潮下，感测器为实现智慧联网装置所不可或缺的重要元件，能让所有独立的物件实现互联互通的网路，举凡穿戴式装置、智慧型行动装置、环境监控设备等皆为现在科技热门应用，与我们生活周遭密不可分。室内路径规划得益于成熟的室外导航技术，使室内矢量地图的研究逐渐发展，这项技术给用户带来全新的地理位置服务体验，为用户在室内空间里提供路径规划服务。在夜盲症患者眼中的世界，身处于阴暗的环境下，他们是看不清周围环境的事物，因此对于不熟悉的环境会产生恐惧，希望透过路径规划系统，使他们有更多的机会出外行走，扩展其可活动的空间范围。此系统于老人、女性夜间亦可使用，行走时多一份安全保障。本研究使用dijkstra’s algorithm 最短路径演算法，实现室内地图跨楼层中任意两点的寻路系统，以Linkit smart 7688 Duo微控制单元，结合物联网设计出一个室内路径规划，避免走到阴暗的区域，透过感测器监控整栋大楼的各区域路段情形，能够确保使用者以明亮路程且距离短的方式抵达目标地点。

关键词：物联网路径规划 dijkstra’s algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：