This thesis deals with questions of modelling and 3D visualization. Also, it involves an overview of technical equipment on a theatre stage and control systems of this machinery with accent on user interface and all the interaction with staff. Afterwards, the main topic is the investigation of 3D visualization utilization technology in the field of theatre stage control systems and then the proposal and implementation of the theatre stage 3D visualization application follows in order to increase a clearness and safety of operation with the theatre control system.

This diploma thesis focuses on a traffic simulator design. The matter of simulation methods is described here as well as a project of a town model, road system and its usage in an implementation in a traffic simulator. The work further explains the principles and techniques for creation of the town model in an editor and it analyzes traffic rules that are necessary for the creation of the simulator of this type. The created simulator uses various engines for its functioning. It would not be possible to continue in further work without their proper adjustment. That is why the installation of the used engines is described in the thesis. Principles of 3D model and texture usage are also explained.

Práce se zabývá detekcí kolizí v 3D simulačním prostoru. V první části jsou popsány nejpoužívanější algoritmy pro detekci, stejně jako některé knihovny hotových řešení. Druhá část práce obsahuje popis testovacího softwaru vytvořeného na základě knihovny OpenGL, včetně popisu důležitých částí. V poslední části práce jsou také prezentovány výsledky testování a porovnání vybraných algoritmů na vytvořených testovacích úlohách.

[ES] En la presente tesis se aborda el problema del descubrimiento de vecinos en redes estáticas inalámbricas ad hoc, redes sin infraestructura. En estas redes los nodos deben descubrir los vecinos como un primer paso tras el despliegue. Además se aborda el problema de creación de redes espontáneas basadas en la confianza, y el de selección de vecinos. Se han presentado distintos algoritmos que solucionan el problema siguiendo unas premisas que se irán relajando a lo largo de la tesis. Se han implementado esos algoritmos en Castalia 3.2 para su validación y comparación con otros protocolos de referencia. Los protocolos determinísticos presentan mejores resultados de simulación, aunque requieren que sigan una planificación en la transmisión. En cuanto al protocolo aleatorio CDPRR (Collision Detection Probabilistic Round Robin) no sigue una planificación pero requiere el conocimiento del número de nodos de la red. El protocolo CDH (Collision Detection Hello) permite el desconocimiento del número de nodos. Ambos logran el descubrimiento de los vecinos con probabilidad 1 mediante la detección de colisiones. Ambas propuestas obtienen mejores prestaciones que los protocolos usados como referencia. Tanto para CDH como para CDPRR se ha realizado un modelo analítico de determinadas métricas. Se ha propuesto un protocolo aleatorio basado en líder que permite obtener buenas prestaciones y se puede usar de forma asíncrona aunque solo permite su uso en entornos one-hop. Finalmente, se presenta un protocolo aleatorio consciente de la energía que permite buenos resultados para altos duty cycles y redes compuestas de pocos nodos. En cuanto a la creación de redes espontáneas basadas en la confianza, se ha propuesto un modelo que usa el protocolo CDPRR como base. Este protocolo de creación de redes espontáneas basadas en la confianza permite premisas más realistas y mejora un protocolo determinístico de referencia. Finalmente, se propone un protocolo que combina el descubrimiento y la selección de vecinos con el objetivo de proporcionar nodos favoritos. Estos nodos permiten el envío de información al exterior de la red o en futuras operaciones como el encaminamiento. / [CA] En la present tesi s'aborda el problema del descobriment de veïns en xarxes estàtiques sense fil ad hoc, xarxes sense infraestructura. En estes xarxes els nodes han de descobrir els veïns com un primer pas després del desplegament. A més s'aborda el problema de creació de xarxes espontànies basades en la confiança, i el de selecció de veïns. S'han presentat distints algoritmes que solucionen el problema seguint unes premisses que se n'aniran relaxant al llarg de la tesi. S'han implementat eixos algoritmes en Castalia 3.2 per a la seua validació i comparació amb altres protocols de referència. Els protocols determinístics presenten millors resultats de simulació, encara que requerixen que seguisquen una planificació en la transmissió. Quant al protocol aleatori CDPRR (Collision Detection Probabilistic Round Robin) no seguix una planificació però requerix el coneixement del nombre de nodes de la xarxa. El protocol CDH (Collision Detection Hello) permet el desconeixement del nombre de nodes. Ambdós aconseguixen el descobriment dels veïns amb probabilitat 1 per mitjà de la detecció de col·lisions. Ambdós propostes obtenen millors prestacions que els protocols usats com a referència. Tant per a CDH com per a CDPRR s'ha realitzat un model analític de determinades mètriques. S'ha proposat un protocol aleatori basat en líder que permet obtindre bones prestacions i es pot usar de forma asíncrona encara que només permet el seu ús en entorns onehop. Finalment, es presenta un protocol aleatori conscient de l'energia que permet bons resultats per a alts duty cycles i xarxes compostes de pocs nodes. Quant a la creació de xarxes espontànies basades en la confiança, s'ha proposat un model que usa el protocol CDPRR com a base. Este protocol de creació de xarxes espontànies basades en la confiança permet premisses més realistes i millora un protocol determinístic de referència. Finalment, es proposa un protocol que combina el descobriment i la selecció de veïns amb l'objectiu de proporcionar nodes favorits. Estos nodes permeten l'enviament d'informació a l'exterior de la xarxa o en futures operacions com l'encaminament. / [EN] This thesis addresses the neighbor discovery problem in static wireless ad hoc networks, infrastructure-less networks. In these networks the nodes must discover the neighbors as a first step after the deployment. Furthermore, the thesis addresses the problem of creation of spontaneous networks based on trust, and the neighbor selection. Several algorithms have been presented that solve the problem following some assumptions that will be relaxed throughout the thesis. Those algorithms have been implemented in Castalia 3.2 for validation and comparison with other reference protocolos. The deterministic protocols provide better simulation results, although they require a transmission schedule. As for the randomized protocol CDPRR (Collision Detection Probabilistic Round Robin), it does not follow a schedule but it requires the knowledge of the number of nodes in the network. The CDH (Collision Detection Hello) protocol allows the ignorance of the number of nodes. They both achieve the discovery of the neighbors with probability 1 by detecting collisions. Both proposals achieve better performance than the protocols used as reference. For CDH and CDPRR an analytical model has been carried out regarding several metrics. A randomized protocol based on leader has been proposed that achieves a good performance and it can be used in an asynchronous way although it can only be used in one-hop environments. Finally, an energy-aware randomized protocol is proposed, which achieves good results for high duty cycles and networks composed of a small number of nodes. As for the creation of spontaneous networks based on trust, a model has been proposed which is based on the CDPRR protocol. This protocol for the creation of spontaneous networks based on trust allows more realistic assumptions and outperforms a determinsitic protocol used as reference. Finally, a protocol is proposed which combines the discovery and selection of neighbors aiming at providing favourite nodes. These nodes allow sending information towards outside the network or in future operations such as routing. / Sorribes Díaz, JV. (2021). Autoconfiguración de redes ad hoc basadas en confianza [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/180283 / TESIS

This study was created to describe and to design the 3D simulator for a driving schools. In the study there are gathered the basic definitions of available simulators and possibilities of their application in real life. This new simulator is designed on a basis of detailed study of available simulators. In study are described the issues with simulation of traffic system, monitoring compliance with the traffic rules as well as a new user interface model. The whole concept and procedure during implementation of the simulator are described at the end of the work.

Unmanned vehicle systems, specifically unmanned air vehicles (UAVs) and unmanned ground vehicles (UGVs), have become a popular research topic. This thesis discusses the potential of a UAV-UGV system used to track a human moving through complex urban terrain. This research focuses on path planning problems for both a UAV and a UGV, and presents effective solutions for both problems. In the UAV path planning problem, we desire to plan a path for a miniature fixed-wing UAV to fly through known urban terrain without colliding with any buildings. We present the Waypoint RRT (WRRT) algorithm, which accounts for UAV dynamics while planning a flyable, collision-free waypoint path for a UAV in urban terrain. Results show that this method is fast and robust, and is able to plan paths in difficult urban environments and other terrain maps as well. Simulation and hardware tests demonstrate that these paths are indeed flyable by a UAV. The UGV path planning problem focuses on planning a path to capture a moving target in an urban grid. We discuss using a target motion model based on Markov chains to predict future target locations. We then introduce the Capture and Propagate algorithm, which uses this target motion model to determine the probabilities of capturing the target in various numbers of steps and with various initial UGV moves. By applying some different cost functions, the result of this algorithm is used to choose an optimal first step for the UGV. Results demonstrate that this algorithm is at least as effective as planning a path directly to the current location of the target, and that in many cases, this algorithm performs better. We discuss these cases and verify them with simulation results.

Diplomová práce shrnuje nejdůležitější informace o letectví, jako například základní používané termíny, popis letových fází apod. V této práci je popsán flight management system, jeho funkce a schopnosti vytvořit cenově příznivý a současně absolutně spolehlivý letový plán. V další části práce je nastíněna důležitost předpovědi počasí pro bezpečnou a současně cenově příznivou leteckou dopravu. Tato práce je vytvořena v programu Matlab a všechny bloky jsou naprogramovány jako m-funkce. Důležité části kódu jsou z důvodu názornosti zobrazeny jako vývojové diagramy. Praktická část práce je rozdělena do několika podkapitol, kde každá podkapitola popisuje jeden blok z blokového schématu pro výpočet nejistoty odhadované doby příletu. Současně je zde vysvětlena funkce ostatních bloků pro plánování letu, předpověď počasí, kombinování větrů a výpočet odhadnuté doby příletu a její nejistoty.

This thesis describes design and implementation of 3D space physical real-time simulation system as add-on to graphical engine. System contains processing of rigid solid simulation, collision detection and response, which are provided by physical laws. Document contains theoretical introduction of this course of study, design and implementation as multiplatform library and description of user interfaces. Output of this thesis, except library, is also example applications, which demonstrate functionality of designed simulation model.

This MSc Thesis focuses on the collision detection between scene objects and consequent resolution of such collisions on the basis of physical model. The implementation of all the applications and algorithms is achieved in Win32 environment in Visual Studio using the programming language C++; it also employs the graphical library Open Inventor based on OpenGL. The work also includes additional application for the calculation of physical values. The demo applications involve algorithms for detection and resolution of explosive collision by the use of a simple and physical reflection on the basis of physical formulas and relationships. The main demo application called "tunnel transit" incorporates a simple game engine. The thesis also includes a discussion over the aroused problems with collision solving and some suggestions how to overcome them.