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

26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Ramasamy, Sudha Eriksson, Kristina Peralippatt, Saptha Perumal, Balasubramanian Danielsson, Fredrik Univ West Dept Prod Syst Trollhattan Sweden

ISBN: (纸本)9781728129891

Plug and produce demonstrators handles multiple processes in the industry, appropriate path planning is essential and at the same time there is an increasing emphasis on more sustainable processes. To ensure the sustainability and automate these processes optimized path planning is required. We present an implementation of a path planning algorithm, which creates a smooth collision free path and considers energy use. In the paper, we demonstrated the implementation of PRM (Probabilistic Road Map) path planning and dijkstra based optimization algorithm in a simulation environment and thereafter test in a real plug and produce demonstrator. To validate the simulated results the real energy was measured through the signal analyzer online. The measured results outlined in this paper includes;computational time, move along path time, and energy use with different loads. From the experiments and results we conclude that the combination of the two algorithms, PRM with dijkstra, can be used to generate a collision free optimized path. Here we have considered the distance as the cost function for dijkstra optimization algorithm and measured the energy of the collision free optimized path. The practical implication of this research is as an enabler for any kind of application where there are large variations of orders e.g., kitting techniques in assembly operations for manufacturing industry.

关键词： Optimized Path Planning PRM algorithm dijkstra algorithm Energy Plug and Produce Collision-free path

来源：评论

学校读者我要写书评

暂无评论

Research on the optimum path——Taking the hospital delivery robot as an example

Research on the optimum path——Taking the hospital delivery...

引用

作者： Guodong Liu BSc Computer Science University College London

Medical delivery robot refers to the delivery robot used in the medical *** with ordinary delivery robots,the medical delivery robot needs to work in an environment with many people,which means that it needs to deal with many random obstacles at any *** article will discuss automatically avoiding obstacles,and formulate and compare algorithms to analyze the advantages and disadvantages of automatic road exploration algorithms of different *** order to accomplish this goal,this paper will use Matlab as the main development tool and use the A-star algorithm and the Euclid algorithm as the main heuristics in the main mathematical model of the *** program needs to be able to complete the obstacle avoidance task in a map with random size,random position,random shape,and random number of obstacles,and be able to reach the end point from the starting *** addition,this paper will also discuss the efficiency of the A-star algorithm and the dijkstra algorithm in obstacle avoidance and route planning,and demonstrate why the A-star algorithm is more efficient by taking time and congestion indicators.

关键词： delivery robot pathfinding robot A~* algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Hybrid adaptive routing in network-on-chips using KLSA with dijkstra algorithm

引用

Research Journal of Applied Sciences, Engineering and Technology 2014年第21期8卷 2211-2219页

作者： Muthulakshmi, M. James Albert, A. Karpagam University Coimbatore Tamil Nadu India

The aim of this study is to analyse dynamic programming in large scale, complex networks is more important in the fields of scientific and engineering. Recent applications needs the analysis of scale-free networks with many millions of nodes and edges;presenting a huge computational challenge. Employing distributed networks on-chip infrastructure presents a unique opportunity of delivering power efficient and massive parallel accelerations. Dynamic Programming (DP) network is a massive parallel and high throughput network architecture, which provides real-time computation for shortest path problems. This network combines with the NoC to enable optimal traffic control based on the online network status and, provides optimal path planning and dynamic routing with proposed novel routing mechanics heuristic K-Step Look Ahead (KLSA) in deadlock free architecture. K-step look ahead routing algorithm based calculating the Manhattan distance has some disadvantages and it affects the overall performance of the routing algorithm. In order to overcome aforementioned disadvantages of manhattan distance and improving the efficiency of K-step looks ahead algorithm proposing a dijkstra algorithm for calculating the distance between two nodes. Here in implementation, the results are compared with existing routing schemas or algorithms like XY, DyAD, odd-even, odd-even routing with an NoP selection scheme. The DP network presents a simple, reliable and efficient methodology to enable adaptive routing in NoCs. © Maxwell Scientific Organization, 2014.

关键词： dijkstra algorithm Dynamic programming K-step look ahead Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

A Customised Assessment Tool Based on Cellular Automata for the Visit-Ability of an Urban Environment 14th

A Customised Assessment Tool Based on Cellular Automata for ...

引用

14th International Conference on Cellular Automata for Research and Industry (ACRI)

作者： Georgiadi, Irene Trunfio, Giuseppe A. Georgoudas, Ioakeim G. Sirakoulis, Georgios Ch. Democritus Univ Thrace Dept Elect & Comp Engn GR-67100 Xanthi Greece Univ Sassari Dept Architecture Planning & Design Piazza Duomo 6 I-07041 Alghero SS Italy

ISBN: (纸本)9783030694791;9783030694807

This study copes with the problem of finding the optimal route that a pedestrian could follow in order to move into an urban environment taking into consideration various criteria and possible points of interest, either objective nor subjective. For this purpose, an appropriate computational model has been designed, based on Cellular Automata (CA) that responds taking into consideration the walkability of the urban area under study. The latter feature encompasses a variety of qualitative parameters in regard to the pedestrian mobility. Thus, this model aims at enforcing more sustainable transport approaches, such as walking. In order to evaluate the functionality of the proposed model, an initial application is carried out in the city of Xanthi, North-East Greece, in order to verify the plausibility and completeness of the proposed routes in different scenarios.

关键词： Crowd modelling Cellular Automata Walkability dijkstra algorithm Simulation

来源：评论

学校读者我要写书评

暂无评论

The Method Based On dijkstra Of Multi-directional Ship's Path Planning 32

The Method Based On Dijkstra Of Multi-directional Ship's Pat...

引用

32nd Chinese Control And Decision Conference (CCDC)

作者： Cheng, Zihui Zhang, Huajun Zhao, Qin Wuhan Univ Technol Automated Inst Wuhan 10497 Peoples R China

ISBN: (纸本)9781728158556

Aiming at the problem of the shortest path's optimization for direct navigation of ships, the dijkstra algorithm search is improved. The environment of the ship's navigation area was modeled by rasterization and swelling. Then the four-direction search,eight-direction search and arbitrary-angle search based on the dijkstra algorithm were improved, and the three search methods were compared. Simulation experiments and research results show that the improved arbitrary angle search method can best meet the requirement of the shortest direct flight path.

关键词： Path optimization Grid method Puffing process dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

An optimal trajectory planning algorithm for autonomous trucks: Architecture, algorithm, and experiment

引用

INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS 2020年第2期17卷

作者： Zhang, Feng Xia, Ranfei Chen, Xinxing Dongfeng Commercial Vehicle Tech Ctr Dept Adv Commod Dev Wuhan Peoples R China Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Minist Educ Image Proc & Intelligent Control Key Lab Room 115South Bldg 1 Wuhan 430074 Peoples R China

Safe lane changing of the dynamic industrial park and port scenarios with autonomous trucks involves the problem of planning an effective and smooth trajectory. To solve this problem, we propose a new trajectory planning method based on the dijkstra algorithm, which combines the dijkstra algorithm with a cost function model and the Bezier curve. The cost function model is established to filter target trajectories to obtain the optimal target trajectory. The third-order Bezier curve is employed to smooth the optimal target trajectory. Road experiments are carried out with an autonomous truck to illustrate the effectiveness and smoothness of the proposed method. Compared with other conventional methods, the improved method can generate a more effective and smoother trajectory in the truck lane change.

关键词： Autonomous truck trajectory planning dijkstra algorithm cost functional model Bezier curve

来源：评论

学校读者我要写书评

暂无评论

Location of Electric Vehicle Charging Station based on ArcGIS

International Core Journal of Engineering

引用

International Core Journal of Engineering 2022年第3期8卷 666-673页

作者： Jing Wang

With the rapid economic and social development of our country, the number of private cars has also increased rapidly, and at the same time, the problems of noise pollution and environmental pollution have become more and more prominent. As a kind of new energy vehicle, electric vehicle has quickly entered people's field of vision with its advantages of no pollution, low noise, convenient use and high energy utilization efficiency. However, wide-spread and universal adoption of electric vehicles requires a well-established infrastructure for electric vehicles, namely a network of charging facilities. Nowadays, there are still problems such as unreasonable location selection and unsound network in the setting of charging stations. It is urgent to analyze the current road network and build a reasonable charging station selection model. With the help of geographic information system, this paper analyzes and integrates the traffic hot spots and road network in Lingang area of Shanghai, and constructs a charging station site selection model with the help of charging station accessibility and charging station construction cost. The model composition is determined, and reference opinions are provided for the site selection and construction of the charging station.

关键词： Electric Vehicle Charging Station dijkstra algorithm ArcGIS

来源：评论

学校读者我要写书评

暂无评论

The Method Based on dijkstra of Three-dimensional Path Planning

The Method Based on Dijkstra of Three-dimensional Path Plann...

引用

Chinese Automation Congress (CAC)

作者： Zhang, Hongxia Cheng, Zihui Wuhan Business Univ Dept Mech Engn & Automot Serv Wuhan Peoples R China Wuhan Univ Technol Automated Inst Wuhan Peoples R China

ISBN: (纸本)9781728176871

In order to better solve the path planning problem, our paper extends the two-dimensional path planning to three-dimensional *** spatial modeling method based on the surface model rasterizes the three-dimensional space for environmental modeling, and by improving the dijkstra algorithm, the diagonal search and the linear search at any angle are designed. Experiments show that the linear search can effectively plan the optimal path.

关键词： path planning environment modeling dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Reducing the Exposure Dose by Optimizing the Route of Personnel Movement When Visiting Specified Points and Taking into Account the Avoidance of Obstacles

引用

ENERGIES 2022年第21期15卷 8222页

作者： Tashlykov, Oleg L. Grigoryev, Alexey M. Kropachev, Yuriy A. Ural Fed Univ Nucl Power Plants & Res Dept Ekaterinburg 620002 Russia NN Krasovskii Inst Math & Mech Ekaterinburg 620108 Russia Beloyarsk NPP Zarechnyi 624250 Russia

The data on the collective dose reduction of a nuclear power plant's personnel after the introduction of new dose limits by the International Commission for Radiological Protection (ICRP) (Publication 60) in 1990 are presented. The main methods of personnel irradiation reduction are formulated, which are namely: to impact on radiation parameters, to increase the distance between a radiation source and a person, and to reduce the exposure time in radiation fields. The ways to implement one of the basic principles of radiation safety, the principle of optimization, are described. The possibility of route optimization in minimizing the personnel dose costs when moving in heterogeneous radiation fields is shown. The results of the algorithm development for solving the "dosimetrist problem" using the dijkstra algorithm and dynamic programming are presented, including determining the optimal route with visiting given points in the room and bypassing possible obstacles. An interpolation algorithm based on the method of radial basic functions for constructing a radiation map of a room is proposed and implemented. The results of a computational experiment using the "Uran" supercomputer and the assessment of the developed algorithm efficiency are given. The results of experimental verification of the developed algorithm for solving the "dosimetrist problem" using interpolation in the operating nuclear power plant conditions are presented.

关键词： radiation dose optimization of radiation protection task of the dosimetrist route optimization optimal route dijkstra algorithm dynamic programming radiation map of the room radial basis functions

来源：评论

学校读者我要写书评

暂无评论

Minimum collective dose based optimal evacuation path-planning method under nuclear accidents

引用

ANNALS OF NUCLEAR ENERGY 2020年 147卷 107644-107644页

作者： Pei, Qiu-Yan Hao, Li-Juan Chen, Chun-Hua Zheng, Xiao-Lei He, Tao Chinese Acad Sci Inst Nucl Energy Safety Technol Key Lab Neutron & Radiat Safety Hefei 230031 Anhui Peoples R China Univ Sci & Technol China Hefei 230027 Anhui Peoples R China

The effectiveness of the path plan is the main factor of the evacuation affecting the amount of exposure to personnel, however, the effect of the radiation field distribution has not been fully considered in current studies. In this paper, a Minimizing Collective dose based Path-Planning method (MCPP) was proposed. Among which, the accumulative dose based dijkstra algorithm was proposed to find the optimal evacuation routes, and then the equilibrium model considering road resistance was used to formulate the optimal evacuation path plan under nuclear accidents, in which the obtained routes were reasonably arranged to evacuate all people with minimize collective dose. This paper used the Daya Bay Nuclear Power Station as an application scenario for evacuation simulation to verify the effectiveness of the method. The results showed that the path plan formulated by MCPP method could reasonably reduce personnel radiation exposure during the evacuation process. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： Nuclear emergency Evacuated path-planning Collective dose dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：