The content of the thesis is a description of heuristic procedures, which are used to find the shortest paths in the graphs and verify their effec- tiveness on the actual data. It deals with heuristics for dijkstras a...
详细信息
The content of the thesis is a description of heuristic procedures, which are used to find the shortest paths in the graphs and verify their effec- tiveness on the actual data. It deals with heuristics for dijkstras algorithm, especially the A* algorithm, which uses a lower distance-to-target estimate. Heuristics are implemented and tested on the road network of the Czech Re- public. 1
The purpose of this work is to study the pedestrian flow equations as the coupled system formed by the eikonal equation and the first order hyperbolic system with the source term. The hyperbolic system consists of the...
详细信息
The purpose of this work is to study the pedestrian flow equations as the coupled system formed by the eikonal equation and the first order hyperbolic system with the source term. The hyperbolic system consists of the continuity equation and the equations of motion of a compressible inviscid fluid. To specify the outer volume forces in the latter equation it is assumed that the pedestrians try to move in a desired direction with a desired velocity, which are dependent on the density in their surroundings. The desired direction is obtained as the gradient of the solution of the eikonal equation. We show that the solution of the eikonal equation has the meaning of the time needed to pass the fastest path to the exit. We suggest avoiding solving the eikonal equation by using the graph theory, where as the graph we use the underlying triangulation. The norm of each edge in the graph is density-dependent and has the dimension of time. This is together with the use of the modified dijkstras algorithm the novelty of the work. Numerical results of the two approaches are presented. Powered by TCPDF (***)
Most of the people who use public transportation have specific areas of interests which can be used to cut down the transport network to several smaller parts. It is reasonable to assume that these people will want to...
详细信息
Most of the people who use public transportation have specific areas of interests which can be used to cut down the transport network to several smaller parts. It is reasonable to assume that these people will want to be informed in case a change occurs in the restricted part of transport network they are interested in. For this reason, we created an application which informs its users about the changes in public transportation that concern them. We assume that for users, the most important area of interest are the connections between individual stations, which is why this thesis mainly focuses on the possibility of search for connection in timetables. In addition to this search, we also deal with the applications adaptability and we have implemented examples of expansions for various result outputs, user interfaces and data sources. To improve general user experience, we have developed a mobile application that communicates with the main application and displays updated timetables according to the users area of interest. 1
Path finding is an important problem in robot design and automation that requires quick error-free solutions that rely on external environment. Automated mobile robotic systems employ various techniques to determine t...
详细信息
ISBN:
(纸本)9781538674765
Path finding is an important problem in robot design and automation that requires quick error-free solutions that rely on external environment. Automated mobile robotic systems employ various techniques to determine the path that the robot needs to follow to reach the destination to perform its function. Path finding problems can utilize various algorithms to solve the problem. Sensor data can be used as a reference to determine the path to be followed from the start point to the destination. However, this technique is highly localized and does not provide the ability to make decisions by taking global constraints or conditions into consideration. Image processing techniques are employed extensively to provide a solution based on global conditions. The proposed method involves use of image processing to process the acquired image of the maze from a mounted camera system. The processing steps are used to provide steps which the robot can follow to reach from its current position to the final position. This project implements a universal algorithm to allow the robot to maneuver autonomously.
暂无评论