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

7th International Conference on Traffic Engineering and Transportation System (ICTETS)

作者： Gao, Renjie Wei, Zhexue Shandong Normal Univ Sch Business Jinan Peoples R China

ISBN: (纸本)9781510674479

During a large-scale epidemic outbreak, the strategic planning of storage and distribution locations for essential life supplies becomes of paramount importance. This article focuses on the scientific supply of epidemic-related goods, taking the case of Changchun city as an example. It considered the human resource costs involved in the supply chain and constructed an organized network diagram for the supply of essential life supplies to residents. The results indicate that through the analysis of the shortest paths, we derive the optimal number of distribution points for essential life supplies in various administrative regions and outlines detailed plans for the provision of these supplies to residents. This article establishes a solid theoretical and practical foundation for future emergency management strategies.

关键词： Epidemic Prevention site selection material transportation k-means plus plus algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

GA-based Global Path Planning for Mobile Robot Employing A* algorithm

引用

JOURNAL OF COMPUTERS 2012年第2期7卷 470-474页

作者： Zeng, Cen Zhang, Qiang Wei, Xiaopeng Dalian Univ Technol Dalian 116024 Peoples R China Dalian Univ Key Lab Adv Design & Intelligent Comp Minist Educ Dalian Dalian 116622 Peoples R China Dalian Univ Technol Dalian Peoples R China

Global path planning for mobile robot using genetic algorithm and A* algorithm is investigated in this paper. The proposed algorithm includes three steps: the MAKLINK graph theory is adopted to establish the free space model of mobile robots firstly, then dijkstra algorithm is utilized for finding a feasible collision-free path, finally the global optimal path of mobile robots is obtained based on the hybrid algorithm of A* algorithm and genetic algorithm. Experimental results indicate that the proposed algorithm has better performance than dijkstra algorithm in term of both solution quality and computational time, and thus it is a viable approach to mobile robot global path planning.

关键词： dijkstra algorithm Global path-planning Genetic algorithm A* algorithm

来源：评论

学校读者我要写书评

暂无评论

Balanced and energy-efficient multi-hop techniques for routing in wireless sensor networks

引用

IET NETWORKS 2018年第1期7卷 33-43页

作者： Fawzy, Abd Elwahab Shokair, Mona Saad, Waleed Fac Elect Engn Elect & Elect Commun Engn Dept Menoufia Egypt

In Wireless Sensor Networks, the power resources of the nodes are significantly restricted. Hence, a special treatment for their available energy is deeply required. In long distance transmission, Multi-Hop (MH) techniques are preferred. Although MH minimizes the amount of energy cost consumed by each node along the path but finding the optimal routing path between nodes is still very interesting issues. This paper proposes a Balanced and Energy Efficient MH (BEEMH) algorithm that is developed based on dijkstra algorithm. It gives great interest to the residual energy of nodes;hence higher energy nodes are exclusively elected to work as relays. Moreover, the total energy consumption at both TX and RX has been merged to model the weight of links between nodes. Finally, dijkstra algorithm is employed to efficiently search for the minimum cost path. Furthermore, two proposed MH protocols are introduced. Both are mainly based on the BEEMH algorithm. MATLAB simulator has been used to evaluate BEEMH in comparison with other conventional algorithms such as;minimum transmission energy (MTE), energy saving oriented least-hop routing algorithm (ESLHA), and energy saving-oriented routing algorithm based on dijkstra (ESRAD) under various scenarios of network models. Then the performance of our proposed protocols is compared with the related MH protocols.

关键词： wireless sensor networks routing protocols energy conservation telecommunication power management balanced and energy-efficient multihop techniques wireless sensor network routing power resources dijkstra algorithm energy cost minimisation optimal routing path residual energy higher-energy nodes Matlab simulator BEEMH algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Path Planning with Obstacle Avoidance for Autonomous Surveying

Optimal Path Planning with Obstacle Avoidance for Autonomous...

引用

36th Annual Conference of the IEEE Industrial-Electronics-Society (IECON)/4th IEEE International Conference on E-Learning in Industrial Electronics/IES Industry Forum

作者： Hodo, David W. Bevly, David M. Hung, John Y. Millhouse, Scott Selfridge, Bob Auburn Univ Elect & Comp Engn Dept Auburn AL 36849 USA Auburn Univ Dept Engn Mech Auburn AL 36849 USA US Army Corps Engn Engn & Support Ctr Huntsville AL 35807 USA

ISBN: (纸本)9781424452262

In order to perform surveying with an autonomous vehicle, a path must often be designed for geometrically complex boundaries, while also accounting for mapped obstacles. In this paper, several algorithms that solve different aspects of the problem are presented. Together, the algorithms generate a path with the following characteristics: (a) it completely covers a field given its respective corner points, (b) considers the desired initial orientation of the vehicle, (c) provides methods for known obstacles to be avoided by defining areas that are not to be mapped, and (d) can cover a composition of multiple, disjoint fields. The algorithm represents an integration of several theoretical concepts, including: Dubins's paths for basic planning, modified visibility graphs to define feasible paths around obstacles, dijkstra's algorithm to search for the shortest path, and ...

关键词： dijkstra algorithm Dubin path autonomous surveying autonomous vehicle collision avoidance corner point disjoint field mapped obstacle mobile robots modified visibility graph obstacle avoidance optimal path planning path planning vehicles

来源：评论

学校读者我要写书评

暂无评论

A Routing Agent Using Cross-Layer Method for Collision Avoidance in Ad Hoc Networks

引用

3rd KES International Symposium on Agent and Multi-Agent Systems

作者： Liu, Zhipeng Park, Chan-Heum Lee, Bokman Kim, Chonggun Yeungnam Univ Dept Comp Engn Gyongsan Gyeongbuk South Korea

ISBN: (纸本)9783642016646

The cross-layer design approach is an important concept in ad-hoc networks which is adopted to solve several open issues. It aims to overcome MANET performance problems by allowing protocols belonging to different layers to cooperate and share network status information while still maintaining separated layers. In this work, we provide a routing agent of cross layer method which is based on the cooperation between Adjacency matrix routing protocol and the IEEE 802.11e MAC protocol. This proposal aims to avoid the congested nodes and guarantee better performance in terms of delay, packet delivery ratio, and so on. In the proposed method, each node maintains an adjacency matrix representing the network topology and MAC conditions with neighbors. The number of retransmissions in MAC layer is introduced as an indication of congestion. When the congestion occurs, the source node works as the routing agent to detect new route by checking MAC information and the adjacency matrix to the destination. The simulation results show that Cross layer give better performance than network layer only methods, especially in the frequent congestion condition.

关键词： Ad hoc networks Cross-layer design Adjacency matrix routing protocol dijkstra algorithm Quality of service

来源：评论

学校读者我要写书评

暂无评论

A Shortest Path algorithm under Specified Nodes Constraint

A Shortest Path Algorithm under Specified Nodes Constraint

引用

International Conference on Sensing, Diagnostics, Prognostics, and Control (SDPC)

作者： Qian, Liu Yinfa, Zhang Natl Univ Def Technol Sch Informat & Commun Xian Shaanxi Peoples R China

ISBN: (纸本)9781538660577

Routing problem under the Specified Nodes Constraint is very common in the path planning field. The traditional dijkstra algorithm can solve the shortest path problem of the single source, but it is no longer applicable under the Specified Nodes Constraint. This paper put forward an improved dijkstra algorithm: First, piecewise calculate path lengths, Secondly, by comparing rerouting cost, get the local best path which is the most favorable to the global optimal, and then get the target path. The simulation result showed that this algorithm has relatively high accuracy of seeking path and low complexity, compared with related algorithms such as the NIR algorithm, the optimized NIR algorithm, the KSP algorithm;The implementation of the algorithm is relatively fast, but it can approximate or even find global optimal solution.

关键词： dijkstra algorithm Rerouting cost Specified node

来源：评论

学校读者我要写书评

暂无评论

Research on Robot Path Planning Based on Improved Adaptive Ant Colony algorithm 31

Research on Robot Path Planning Based on Improved Adaptive A...

引用

31st Chinese Control And Decision Conference (CCDC)

作者： Shao Xiaoqiang Lv Zhichao Zhao Xuan Nie Xinchao Xian Univ Sci & Technol Coll Elect & Control Engn Xian 710054 Peoples R China

ISBN: (纸本)9781728101057

Aiming at the problem that ant colony algorithm is easy to fall into local optimal and slow convergence in robot path planning, a path planning method based on improved ant colony algorithm is proposed for static obstacle *** method improves the search efficiency of the algorithm by using the adaptive adjustment heuristic function;The attenuation coefficient is adjusted dynamically to accelerate the convergence speed of the algorithm based on ant colony rule, pheromone is updated and the maximum and minimum of pheromone concentration is *** results show that compared with other algorithms in the same environment, the improved algorithm has a faster convergence rate when the path planning results are the *** improved algorithm has obtained the optimal path in different complexity environments, which also shows the effectiveness and reliability of the algorithm.

关键词： dijkstra algorithm Ant colony algorithm Path planning

来源：评论

学校读者我要写书评

暂无评论

FTSMR: A Failure Tolerant and Scalable Multipath Routing Protocol in MANET

FTSMR: A Failure Tolerant and Scalable Multipath Routing Pro...

引用

6th International Conference on Information Processing (ICIP 2012)

作者： Jayalakhsmi, V. Anna Univ Dept Comp Applicat Sudharsan Engn Coll Madras 600025 Tamil Nadu India

ISBN: (纸本)9783642316852

Multipath routing in Mobile Ad-hoc Networks (MANET) allow the establishment of multiple paths for routing between a source-destination pair. Multipath routing protocols address the problem of scalability, security, life time of networks, instability of wireless transmissions, and their adaptation to applications. This paper proposes a multipath protocol called Failure Tolerant and Scalable Multipath Routing FTSMR. This proposed FTSMR protocol uses multipath dijkstra algorithm to obtain multiple paths. The algorithm gains great flexibility and extensibility by employing different link metrics and cost functions. Route recovery and loop detection are also implemented in FTSMR in order to improve quality of service. Simulation based on NS2 simulator is performed in different scenarios. The simulation results reveal that the proposed FTSMR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints.

关键词： dijkstra algorithm End-to-end delay Mobile Ad Hoc Networks Multipath Routing Link Metrics

来源：评论

学校读者我要写书评

暂无评论

An Efficient algorithm to Create a Loop Free Backup Routing Table

引用

3rd International Conference on Wireless, Mobile Networks, and Applications/1st International Conference on Computer Science, Engineering and Applications

作者： Abujassar, Radwan S. Ghanbari, Mohammed Univ Essex Sch Comp Sci & Elect Engn Colchester CO4 3SQ Essex England

ISBN: (纸本)9783642211522

Traditional routing protocols schemes allow traffic to pass via the single shortest path. Pre-computing an alternative aims to route the traffic through it when the primary path goes down. A new algorithm schema has been proposed in this paper to find an alternative and disjoint path with primary one by creating a new backup routine table based on adjacent nodes for each node connected with the primary one. The results showing that loss packets, reroute and end to end delay times have been improved between source and destination with avoid loops on the network. The result obtained showed that new schema does not degrade from the network performance by sending an additional messages to create a new backup routing table. The Simulation results (using NS2 simulator) show a comparison between existing link state protocol and the proposed algorithm.

关键词： component Link state ART (Alternative Routing Table) dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Application of wave model for weather routing of ships in the North Indian Ocean

引用

NATURAL HAZARDS 2008年第3期44卷 373-385页

作者： Padhy, Chinmaya Prasad Sen, Debabrata Bhaskaran, Prasad Kumar Indian Inst Technol Dept Ocean Engn & Naval Architect Kharagpur 721302 W Bengal India

Weather routing of ships is used to establish the shortest time route or the most economical route from a departure to arrival point by applying available information of the weather condition viz. wind, wave and current. Information on ship speed loss due to these effects is pre-computed using sea-keeping computing tools, which are then suitably employed in the optimum ship routing algorithm. This developed algorithm was investigated using the wave height information from GEOSAT altimeter records. dijkstra's path optimization scheme, which employs optimal control theory and dynamic programming technique, is used to obtain reliable optimum route in a given random sea-state.

关键词： wave model ship route ship behavior dijkstra algorithm Indian Ocean

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：