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 publi...
详细信息
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.
Path planning is the core issues in the artificial intelligence field of games, and how to establish an effective method of path planning is still focused on. A new algorithm based on both the benefits of global path ...
详细信息
ISBN:
(纸本)9783038351153
Path planning is the core issues in the artificial intelligence field of games, and how to establish an effective method of path planning is still focused on. A new algorithm based on both the benefits of global path planner methods and local path planner methods and those of a star algorithm and improved artificial potential field method is proposed for NPC path planning in web games. Its feasibleness and effectiveness are also demonstrated by simulation results.
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...
详细信息
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-staralgorithm, 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.
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 i...
详细信息
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.
Unmanned Aerial Vehicles (UAVs) are used in a variety of operations in civilian and military domains including search and rescue, surveillance, monitoring, cadastral surveys, and package transportation. Although techn...
详细信息
ISBN:
(纸本)9788897999010;9788897999096
Unmanned Aerial Vehicles (UAVs) are used in a variety of operations in civilian and military domains including search and rescue, surveillance, monitoring, cadastral surveys, and package transportation. Although technological achievements in UAVs made them more intelligent than they were in the past, there is still human factor affecting their operations. Particularly in path planning, operators can improve effectiveness and efficiency of the mission by controlling static and dynamic criteria before the flight and during the flight. However, existence of multiple criteria has made the path planning a difficult task that operators can hardly achieve an optimal path for an UAV. In this paper, we propose a simulation model which can help UAV operators and planners achieve optimal paths. Our model considers environmental factors, performance limitations, basic aviation rules and UAV user requirements.
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 mee...
详细信息
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.
A simple equation to calculate the effective mean path to be travelled by the heat flow or electrical current in a porous powdered material is proposed. In this equation, the effective mean path is a function of the s...
详细信息
A simple equation to calculate the effective mean path to be travelled by the heat flow or electrical current in a porous powdered material is proposed. In this equation, the effective mean path is a function of the sample porosity degree and the tap porosity of the original powder. This latter parameter determines to a great extent the compact pore structure, since it depends on the powder particle size, shape and distribution. The proposed equation has been validated using real metallographic images from sintered powders compacts. For measurements, a computer program, based on the Pathfinding A* algorithm, has been developed. Results are in very good agreement with theoretical predictions. The proposed equation can be useful to model the electrical and thermal conductivity of sintered compacts.
In order to minimize the processing time for multiple robots to finish lots of tasks, an optimized multiple robots task allocation and path planning approach is proposed. In this approach, the optimized task sequence ...
详细信息
ISBN:
(纸本)9781424405701
In order to minimize the processing time for multiple robots to finish lots of tasks, an optimized multiple robots task allocation and path planning approach is proposed. In this approach, the optimized task sequence is first schemed on the assumption that all the tasks are processed by one robot. While scheming the task sequence, a star algorithm is employed to plan paths and calculate the path cost. Then, according to the number of the robots, the task sequence has been randomly divided into several task segments that will be assigned to robots. At last, the task number of each task segments are averaged according to the time each robot used, so that the optimized task allocation scheme is got. In this approach, not only multiple robot task allocation, but also the optimized path planning is realized to ensure that the robots can finish all the tasks in the shortest time. The experiments and simulation are provided to validate the effectiveness of the approach. The results show that the proposed approach can scheme optimized multiple robots task allocation and path planning scheme.
暂无评论