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

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

作者： Liu, Shengfa Lin, Huining Wang, Yu Zhang, Hao Guo, Jinxu Wuhan Univ Technol Coll Informat Engn Wuhan Hubei Peoples R China Wuhan Univ Technol Sch Management Wuhan Hubei Peoples R China Wuhan Univ Technol Minist Educ Key Lab Fiber Opt Sensing Technol & Informat Proc Wuhan Hubei Peoples R China

ISBN: (纸本)9781538630228

In recent years, group security in public places has become more and more concerned. Therefore, there is a need for a system that can detect the concentration of people quickly and evacuate crowds efficiently in public places. In this paper, firstly, network dome was used to monitor public places. Secondly, Visual Background Extractor (ViBe) was used to extract moving objects. Then a density detection algorithm was proposed to detect the density of moving objects. The evacuation plan was established for the dense population, the shortest evacuation path was planned by using the A* algorithm, and a time-optimized crowd shunt algorithm was designed to complete the multi-export evacuation of the crowded population. Through the test of different scenes, the system can quickly complete the detection and evacuation of dense population. At the same time, compared with the traditional shortest path population shunting algorithm, the time-optimized crowd shunt algorithm proposed in this paper takes into account the problem of export flow and crowding between crowds, which meets the practical requirements and takes less time.

关键词： Visual Background Extractor Population density Multi-export evacuation Time optimization a star algorithm Crowd evacuation algorithm

来源：评论

学校读者我要写书评

暂无评论

A* algorithm-Based Initial Route Construction for Mobile Relay on WSN 7

A* Algorithm-Based Initial Route Construction for Mobile Rel...

引用

Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS)

作者： Yudo, Yogi Anggun Saloko Shigei, Noritaka Miyajima, Hiromi Kagoshima Univ Grad Sch Sci & Engn Kagoshima Japan

ISBN: (纸本)9781479959556

Energy consumption is the most crucial issue in Wireless Sensor Network (WSN). Mobile relay is one of the techniques for saving the energy in WSN. In mobile relay, initial route construction determines the sequence of relaying nodes, which is provided to mobile relay algorithms. Several methods have been proposed for determining the initial route for mobile relay in WSN. We have proposed Battery-Aware Initial Route construction by Dijkstra's algorithm (BAIR-D). BAIR-D employs Dijkstra's algorithm to find the initial route. It takes into account node's battery level into the cost function, such that this algorithm avoids using node with low battery levels. We have implemented this method in a centralized fashion. However, from a scalability point of view, the initial route construction should be performed distributedly. In this paper, we present a new initial route construction based on A-star algorithm, which is referred as BAIR-A*. Unlike BAIR-D, BAIR-A* is suitable for distributed implementation, because the method can significantly reduce the communication needed for initial route construction. We also present the distributed algorithm of BAIR-A*. We demonstrate the effectiveness of BAIR-A by using numerical simulations.

关键词： component a star algorithm mobile node initial route distributed fashion

来源：评论

学校读者我要写书评

暂无评论

Dynamic Adjustment A* Routing algorithm

Dynamic Adjustment A* Routing Algorithm

引用

International Conference on Innovative Computing and Communication/Asia-Pacific Conference on Information Technology and Ocean Engineering

作者： Dai, Zhiquan Guan, Yong Guan, Ran Capital Normal Univ Coll Informat Engn Beijing Peoples R China

ISBN: (纸本)9780769539423

Routing algorithm mainly focuses on routing method to ensure the connection between the sender and the receiver during each session is optimal and effective. It is very useful in packet transmission, especially in meeting the quality of service. Some traditional shortest path search algorithm (Width preferred search algorithm, Dijkstra algorithm) can solve the shortest path problem well within polynomial time when the wireless and cable network have infrastructure. But in the real-time communication environment, high dynamic topology of network structure and the QoS under network structure, we usually need to find out a group of the shortest or the second shortest path as the basis of scheme evaluation and selection. Usually, the heuristic search algorithm can solve the problem well, the heuristic function of the heuristic search algorithm equals sum of the actual passed path cost and the estimated cost of current node to target node. According to the feature of heuristic function, this paper dynamically adjusts the proportion in the searching process, and uses it in the search of the shortest path of network node. The result of this experiment shows that the efficiency of the improved algorithm is about 12.5% higher than that of the original algorithm.

关键词： optimal path heuristic function a star algorithm Dynamic regulation Routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A New Approach to Path-finding by Possibilities Search 7

A New Approach to Path-finding by Possibilities Search

引用

Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS)

作者： Benoit, Vallade Nakashima, Tomoharu Osaka Prefecture Univ Dept Comp Sci & Intelligent Syst Osaka Japan

ISBN: (纸本)9781479959556

This paper presents a new approach to the pathfinding in video games. Path-finding algorithms, are used to find a path between two positions of a map. The standard way consists to search for a specific path. However it appears that in actual games, where the allowed computation time becomes smaller and the game-plays and maps are more complex, it should not be the best way to proceed. Therefore, this new approach to the pathfinding considers the global possibilities of movement instead of searching for a specific path. This paper describes the concept of possibility and details the procedure used to search them. The appreciable experiments results prove the validity and efficiency of this approach.

关键词： Path-finding algorithm Dijkstra algorithm a star algorithm Monte Carlo Tree Search algorithm notion of possibility video games map simplification

来源：评论

学校读者我要写书评

暂无评论

Providing Runner Platform for Personal Shopper, Delivery Services and Queue Assistant for Urban Community 14

Providing Runner Platform for Personal Shopper, Delivery Ser...

引用

14th International Conference on Developments in eSystems Engineering (DeSE)

作者： Yen, Lu Wai Kamsin, Intan Farahana Binti Asia Pacific Univ Technol & Innovat Technol Pk Malaysia Kuala Lumpur Malaysia

ISBN: (纸本)9781665408882

Nowadays, people are busy with works, studies, or tasks, as well as the disabled people, are getting some problem in daily life. Therefore, all of them are pursuing convenience and efficiency in their daily life. This research is to discuss about a proposed system called as VRunner, which is a mobile application that provides the on-demand runner booking service to the user from the available runner or rider in order to offer delivery service, queue assistant, errand runners, and personal shopper. The VRunner application provides errand services for personal shoppers or riders, which can purchase items from groceries to costume, jewelry and bag for customers and deliver them to the customer's doorstep. The on-demand runner service able to offer delivery everywhere based on the customer's request. The aim of the VRunner is to provide the runner service in an urban community and provide revenue-generating opportunities for the riders and provide solutions for customers who need runner services such as food delivery, personal shoppers, queue assistants, and errand runners. It also assists companies in increasing productivity by offering advertising space and delivering Business to Customers (B2C) business.

关键词： Global Positioning System (GPS) Geographical Information Systems (GIS) a star algorithm Google Cloud Messaging (GCM)

来源：评论

学校读者我要写书评

暂无评论

A systematic review and analysis of A-star pathfinding algorithms and its variations

A systematic review and analysis of A-star pathfinding algor...

引用

作者： Zuoyu Wang Xinduo Fan Department of Computer Science Denison University

This paper presents a comprehensive review and analysis of the A-star（A） pathfinding algorithm and its variations. A-star algorithm's core principles, practical representations, and diverse applications are examined. The study extends to various A derivatives, including Weighted A, IDA（Iterative Deepening A）, ARA（Anytime Repairing A）, D（Dynamic A）,LPA（Lifelong Planning A）, D Lite, and AD（Anytime Dynamic D）. Each variant's unique adaptations and efficiencies are explored, highlighting their suitability for specific challenges in pathfinding tasks. This work aims to elucidate the intricacies of these algorithms, demonstrating their significance and versatility in solving complex navigational problems,thus offering valuable insights for future research and application development in the field of artificial intelligence and game industry.

关键词： a star algorithm pathfinding algorithm D~*/D~* Lite/LPA~*(incremental search algorithms) Weighted A~ A~*/ARA~*(anytime algorithms) IDA~ AD~

来源：评论

学校读者我要写书评

暂无评论

Modified A* algorithm integrated with ant colony optimization for multi-objective route-finding;case study: Yazd

引用

APPLIED SOFT COMPUTING 2021年第PartA期113卷 107877-107877页

作者： Pasandi, Leila Hooshmand, Mehrnaz Rahbar, Morteza Univ Tabriz Islamic Art Univ Tabriz Dept Architecture Tabriz Iran Iran Univ Sci & Technol Sch Architecture & Environm Design Tehran Iran Iran Univ Sci & Technol Hengam StResalat Square Tehran Iran

In this paper, MASA (Modified A* algorithm) method is introduced which can merge numerous factors with different weights into a multi-weighted graph to offer the most optimal route for a pedestrian tourist. Several mobile applications support personalized tour recommendations in making feasible plans, however, tours should not only make visiting attractions possible via the shorter route but also satisfy the unique needs of individuals with different preferences. MASA integrates the Ant Colony Optimization algorithm for arranging points of interest (POI), with a modified A* algorithm for generating multi-weighted graphs through pairs of POIs to propose the most suitable tour and facilitate traversal for a tourist who does not get involved with riding vehicles. Our contribution in this research is to consider multiple factors simultaneously or customize the route based on the user's choice, and introduce pareto front chart for selecting optimal links, which has not been solved yet for being a challenging as well as complicated case. The user in this paper is authorized to choose preferred POIs, defined the importance of each parameter to affect route finding. A historical region in Yazd is selected as the case study due to its winding streets to show the solidity of our approach, with four main factors including Length, Communion, Relaxation, and Isovist, and then three routes have been generated considering customized selections along with an overall route considering all objectives. The computational results have shown the capability of the new proposed algorithm in route finding. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Personalized tour recommendation Route-finding Optimal route Multi-weighted graph Ant Colony Optimization a star algorithm

来源：评论

学校读者我要写书评

暂无评论

Search Method of disaster inspection coordinated by Multi-UAV

Search Method of disaster inspection coordinated by Multi-UA...

引用

第三十八届中国控制会议

作者： ZheZhang JianWu ChengHe Nanchang Hangkong University N0.650 Research Institute of Hongdu Aviation Industry Group

The use of unmanned aerial vehicle(UAV)for timely and efficient disaster inspection is an important measure to reduce earthquake *** at the problem that complicated terrain of the disaster area and the urgent time of disaster relief,this paper puts forward a multi-UAV collaborative disaster inspection search method,gets the optimal scheme of inspection under the primary disaster and secondary *** such as terrain,inspection time,search area coverage and number of drones are fully taken into account,and the multi-machine cooperative flight model under primary disaster and secondary disaster is established *** with the fastest descent method and the a star algorithm.,a route plan is obtained to complete the maximum coverage search in a specified time with *** whole area search route under secondary disaster is obtained by using taboo search *** simulation results show that the route is reasonable and the maneuverability is strong.

关键词： UAV Gradient Method Disaster inspection Coverage a star algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：