TCC - Bacharelado em Sistemas da Informação (Sede)
URI permanente para esta coleçãohttps://arandu.ufrpe.br/handle/123456789/427
Navegar
2 resultados
Resultados da Pesquisa
Item Movimentação de um robô uniciclo utilizando controladores PID discretos(2021-07-20) Mei, Filipe Peticor; Medeiros, Victor Wanderley Costa de; Gonçalves, Glauco Estácio; http://lattes.cnpq.br/6157118581200722; http://lattes.cnpq.br/7159595141911505; http://lattes.cnpq.br/2113269128469015Autonomus robots are those who are able to complet tasks and goals in unstructured enviroments. One of the main goals of these type of equipment is to complet tasks that are considered to be repetitive, dangerous or impracticable to humans, beign used in domestic or industrial environments. To reach that goal, it’s essencial that the autonomous robot has a good location system. Various types of trajectory system control algorithms are proposed and the PID control is one of the classical controls that are popular in many aplications, making it possible to use it as a navigating system. Therefore, this reasearch proposes the development of a robot prototype, to asses how a digital control PID assists the development of it’s movement.Item Um algoritmo para geração de Navigation Meshes em mapas bidimensionais homogêneos: uma aplicação no jogo Dragon Age: Origins(2019) Costa, Ingrid Danielle Vilela; Bocanegra, Silvana; http://lattes.cnpq.br/4596111202208863; http://lattes.cnpq.br/6113606913639280In the field of electronic gaming and more recently in robotics, autonomous agent soften need to repeatedly solve the problem of searching for the smallest path. This need can eventually consume a lot of resources and demands optimizations to make these searches more efficient. Such optimizations may include improvements in search algorithms, map representation, data structures used. This work presents an optimization for search algorithms based on the reduction of the search space by means of an automatic Navigation Meshes generation algorithm which are networks of walka blemap areas implying in a reduction of the search space and consequently improving the search processing time. The generation of Navigation Meshes is a problem with no consolidated solution. To prove the heuristic, path finding problems were solved on 156 benchmark maps. The path findings were performmed by the A* algorithm and the solutions were compared between the original maps and the optimized ones. An average search space reduction of 97.42% was achieved, with a standard deviation of 0.026and the search had an average marginal reduction in execution time of 46.76%.