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

A multi-factor analysis approach for recycled asphalt mixture stockpile center location

TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT 2020年 86卷 102463-102463页

作者： Han, Chengjia Ma, Tao Xu, Guangji Chen, Siyu Southeast Univ Sch Transportat Nanjing 211189 Peoples R China Changsha Univ Sci & Technol Natl Engn Lab Highway Maintenance Technol Changsha 410114 Hunan Peoples R China

The mixture recycling of reclaimed asphalt pavement (RAP) has become a widely used strategy in road maintenance. The article aimed at acquiring the optimum solutions to quantity and location distribution of RAP stockpile logistic centers over a regional highway network using a multi factor analysis approach to further promote the development of asphalt recycling technology. Firstly, the economic radius of RAP stockpile logistic centers was calculated to determine the optimal number of RAP stockpile logistic centers according to the density of road network in the target region. Then, the proper location of each RAP stockpile logistic center was investigated employing ArcGIS buffer analysis and floyd algorithm, with three factors taken into consideration (environment impacts, RAP material yield and consumption of each road in highway network, and the economic transport distance). Finally, upon the selection of each RAP stockpile logistic center site, the economic benefits were evaluated through cost-benefit analysis (CBA). In a case study based on the data of Jiangsu province expressway network, it suggested that an establishment of 13 RAP stockpile logistic centers will meet the recycling maintenance need of asphalt pavement over the whole highway network in Jiangsu province, contributing to a 6-year net maintenance benefit of about 70 million CNY.

关键词： Reclaimed asphalt pavement Warehouse location floyd algorithm Road maintenance Cost-bene fit analysis Multi-factor analysis

来源：评论

学校读者我要写书评

暂无评论

Development of Path Planning Approach Based on Improved A-star algorithm in AGV System 3rd

Development of Path Planning Approach Based on Improved A-st...

引用

3rd European-Alliance-for-Innovation (EAI) International Conference on IoT as a Service (IoTaaS)

作者： Zhang, Yan Li, Ling-ling Lin, Hsiung-Cheng Ma, Zewen Zhao, Jiang Hebei Univ Sci & Technol Sch Elect Engn Shijiazhuang 050018 Hebei Peoples R China Hebei Univ Technol Dept Elect Informat Engn Tianjin 300130 Peoples R China Natl Chin Yi Univ Technol Dept Elect Engn Taichung 41170 Taiwan

ISBN: (纸本)9783030004101;9783030004095

Automate guide vehicle (AGV) has been widely applied in industry. Therefore, it is important to design a highly efficient AGV. The path planning is known as one of the key factor for AGV operation. Although typical A-star algorithm with a heuristic mechanism can be used in the shortest path searching, it may suffer from broken lines and redundant nodes. In this paper, an improved A-star algorithm is presented. Based on the initial path planned by A-star algorithm, traversing all the nodes on an initial path and deleting unnecessary nodes and connections, the proposed model can remove the superfluous inflection points and redundant nodes effectively so that no obstacles exist during AGV moving. The performance results reveal that the proposed method can provide more efficient path planning with a shorter route and less turn times.

关键词： Automate guide vehicle (AGV) A-star algorithm floyd algorithm Path planning

来源：评论

学校读者我要写书评

暂无评论

Vehicle Path Planning Fusion algorithm Based on Road Network 4

Vehicle Path Planning Fusion Algorithm Based on Road Network

引用

4th IEEE Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)

作者： Hu Xizhi Jiang Zhihui Xu Congcong South China Univ Technol Sch Mech & Automot Engn Guangzhou 510641 Peoples R China

ISBN: (数字)9781728143903

ISBN: (纸本)9781728143903

To solve the problem of global path planning and local path planning for small-area unstructured road region, a vehicle path fusion algorithm is proposed. According to the small regional global optimal road network based on floyd algorithm, the A* algorithm plans a feasible path. Based on the floyd path matrix, the path is recursively iterated to be optimal. The improved artificial potential field method, according to the obstacle information, plans an obstacle avoidance path. Based on the cubic polynomial curve, the path point set is fitted to generate a smooth driving track. Based on Matlab/Simulink simulation, the results prove that the designed algorithm meets the real-time requirements. The actual vehicle experiment results show that the simulation results are accurate, and prove the effectiveness of the path planning fusion algorithm and its robustness against environmental noise.

关键词： Intelligent Vehicle path planning floyd algorithm A* algorithm and artificial potential field method algorithm fusion

来源：评论

学校读者我要写书评

暂无评论

The comparison of four UAV path planning algorithms based on geometry search algorithm 9

The comparison of four UAV path planning algorithms based on...

引用

9th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)

作者： He, ZeFang Zhao, Long Beihang Univ Sch Automat Sci & Elect Engn Beijing Peoples R China Beihang Univ Sci & Technol Aircraft Control Lab Beijing Peoples R China

ISBN: (纸本)9781538630228

The comparative study of four practical three-dimensional (3D) path planning algorithm based on geometry search is proceeded in this paper, the four algorithms include Dijkstra algorithm, floyd algorithm, A* algorithm and Ant colony algorithm. In four algorithms, the working environments of Unmanned Aerial Vehicle (UAV) are all modeled using grid map method and UAV three-dimensional paths are all obtained by amending two-dimensional paths with the terrain following algorithm. In addition, a perpendicular approach is used to choose the key path node during UAV path planning. In this paper, online real-time path planning abilities of the four algorithms are compared from the two aspects of the run time and the path length. Simulation results show that the four algorithms can all handle fixed threats and sudden threats, and their planning time are short;but synthetically considering the run time, complexity and path length of the four algorithms, Dijkstra algorithm is in turn better than floyd algorithm, A* algorithm and Ant colony algorithm.

关键词： UAV Path planning Dijkstra algorithm floyd algorithm A* algorithm Ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Delaunay graph based path planning of dynamic obstacle avoidance method for mobile

Delaunay graph based path planning of dynamic obstacle avoid...

引用

1st International Conference on High Performance Structures and Materials Engineering

作者： Dong, Huiying Song, Yang Zhao, Yu Shenyang Ligong Univ Shenyang 110159 Peoples R China

ISBN: (纸本)9783037850756

This paper is about dynamic obstacle avoidance. Delaunay Graph is used for modeling the working space, an approximate shortest path of mobile robot is determined by using floyd algorithm. Path can be found easily with genetic algorithm. Then genetic algorithm is used for obtaining the optimum path. It may meet which dynamic obstacle when robot follows optimum path. so it should avoid it. Results of simulation show that this path planning method is simple and realized easily.

关键词： Mobile robot obstacle avoidance Delaunay diagram floyd algorithm Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Complex Network Theory Based Recognition of Power Grid Key Line 5

Complex Network Theory Based Recognition of Power Grid Key L...

引用

5th International Conference on Electric Utility Deregulation and Restructuring and Power Technologies (DRPT)

作者： Liu, Rui Zhang, Jiancheng Dong, Zhe Li, Yi-qiang Tang, Xiaojun Luo, Hongmei Jia, Jinghua Cheng, Lun North China Elect Power Univ Sch Elect & Elect Engn Baoding Peoples R China State Grid Corp China China Elect Power Res Inst Beijing Peoples R China State Grid Corp China Hebei Elect Power Corp Shijiazhuang Peoples R China

ISBN: (纸本)9781467371063

The probability of power system cascading failure is very small, but once happened, its influence is disastrous. There are a few key branches play an important role in the process of cascading failures in power system. The identification of these key branches is of great significance to the safe and stable operation of power system. Power system transmits active power and reactive power at the same time. Different from the full range of active power, the reactive power has the characteristic of regional decoupling. The impact is generally limited in the vicinity of fault branch, so this paper temporarily only considers active power. Firstly, in this paper, the only link line between two subsystems is detected. If the branch is the only link line, it is the key branch. If it is not, then make the power flow of the fault branch as the basic parameters, and reduce the active power flow in the relevant branch of the fault branch to the fault branch by the power grid topology. Then get the grid key branch identification evaluation indicator. Finally apply the evaluation indicator in practical example of IEEE 39 bus system, and the result conform to the actual operation characteristics of IEEE 39 bus system and prove the correctness and effectiveness of the method.

关键词： recognition of key line floyd algorithm power flow transfer cascading failures womplex network theory

来源：评论

学校读者我要写书评

暂无评论

Research on Dynamic Taxi Ride-Sharing Price Model 8

Research on Dynamic Taxi Ride-Sharing Price Model

引用

8th International Conference on Advanced Cloud and Big Data (CBD)

作者： Zhang Xi-Jun Tao Ye Zhang Qi-Rui Dong Meiya Zhao Jumin Lanzhou Univ Technol Coll Comp & Commun Lanzhou 730050 Peoples R China Taiyuan Univ Technol Taiyuan 030600 Peoples R China

ISBN: (纸本)9781665423137

With the diversity of people's travelling modes, the traditional taxi industry is facing severe challenges. In order to meet the travel requirements in the intelligent era, it is necessary to improve the market competitiveness of the taxi industry. This paper proposes a sharing pricing model based on the rate balancing between the driver and passenger. The main concept adopts the dynamic request method for the passengers to take the ride-sharing taxi. For the first passenger's request the nearest taxi receives the request, picks up the passenger on time and drives according to the shortest path calculated by floyd algorithm. When other passengers ask for a drive, the driver will choose the passengers according to the taxi seat capacity to complete the ride-sharing process until all the passengers arrive at the destination. In the calculation of the driver's income and the passenger's costs we consider the driving conditions in different time periods and use the optimal solution of the model to make a sharing price. Finally the driver's income and the passengers' costs are compared and analyzed under three driving modes which are the common taxi, Didi express and ride-sharing taxi. The results show that the dynamic sharing pricing model designed in this paper is reasonable and very effective in daily life.

关键词： Intelligent transportation Multiplication mode floyd algorithm Rate equalization Billing algorithm

来源：评论

学校读者我要写书评

暂无评论

Path Optimization Method of Logistics Distribution Based on Mixed Multi-Intelligence algorithms 3

Path Optimization Method of Logistics Distribution Based on ...

引用

3rd International Conference on Ecosystem Assessment Management / Workshop on the Construction of an Early Warning Platform for Eco-Tourism in Hainan

作者： Zhou, Rui-qiong Cao, Jun-kuo Hainan Normal Univ Ctr Network Haikou 571158 Peoples R China Hainan Normal Univ Coll Informat Sci & Technol Haikou 571158 Peoples R China

ISBN: (纸本)9783319034492;9783319034485

In order to improve the efficiency and benefit for logistics distribution system, a path optimization method based on mixed multi-intelligence algorithms for vehicle routing problem was developed. In the process of proposed method, it firstly calculates the shortest paths between nodes of road network by floyd algorithm and then obtains the merge distribution paths by means of saving method. Finally, genetic algorithm is employed to optimize the merge distribution paths. The experimental results show that the proposed method of logistics distribution can well solve the complex network conditions and lower the cost of logistics distribution, illustrating that the proposed model is practical and effective.

关键词： Logistics distribution floyd algorithm Shortest path Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Graph Based RRT Optimization for Autonomous Mobile Robots 8th

Graph Based RRT Optimization for Autonomous Mobile Robots

引用

8th International Conference on Intelligence Science and Big Data Engineering (IScIDE)

作者： Aguilar, Wilbert G. Sandoval, David S. Caballeros, Jessica Alvarez, Leandro G. Limaico, Alex Rodriguez, Guillermo A. Quisaguano, Fernando J. Univ Las Fuerzas Armadas ESPE CICTE Res Ctr Sangolqui Ecuador Escuela Politec Nacl FIS Fac Quito Ecuador Univ Politecn Cataluna GREC Res Grp Barcelona Spain

ISBN: (纸本)9783030026981;9783030026974

In this article, we present the application of Graph Theory in the development of an algorithm of path planning for mobile robots. The proposed system evaluates a RRT algorithm based on the individual cost of nodes and the optimized reconnection of the final path based on Dijkstra and floyd criteria. Our proposal includes the comparisons between different RRT* algorithms and the simulation of the environments in different platforms. The results identify that these criteria must be considered in all the variations of RRT to achieve a definitive algorithm in mobile robotics.

关键词： RRT* Mobile robots Dijkstra algorithm floyd algorithm Path planning

来源：评论

学校读者我要写书评

暂无评论

Optimal Approach for the Eradication of Ebola 7

Optimal Approach for the Eradication of Ebola

引用

International Conference on Fluid Power and Mechatronics FPM

作者： Huang Xiao-rong Lv Wang-yong Liu Ju Liu Wan-li Sichuan Normal Univ Coll Math & Software Sci Chengdu Peoples R China

ISBN: (纸本)9781479987702

Iteration, floyd algorithm and genetic algorithm are used to optimize the eradication of Ebola. The iteration method is applied to estimate the quantity of the drugs needed. Then based on the floyd algorithm, the optimal locations of delivery is selected to find an optimal route. Minimizing the transport cost is used as objective function of scheduling model. The model should also satisfy some constraints. The GA is applied to find the optimal solution. The performance of the model can be measured by simulation.

关键词： Eradication of Ebola Iteration floyd algorithm Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：