This thesis describes the initial development of the Texas A&M Autonomous Ground Vehicle test platform and waypoint following software, including the associated controller design. The original goal of the team responsible for the development of the vehicle was to enter the DARPA Grand Challenge in October 2005. A 2004 Ford F150 4x4 pickup was chosen as the vehicle platform and was modified with a 6” suspension lift and 35” tires, as well as a commercial drive-by-wire system. The waypoint following software, the design of which is described in this thesis, is written in C and successfully drives the vehicle on a course defined by GPS waypoints at speeds up to 50 mph. It uses various heuristics to determine desired speeds and headings and uses control feedback to guide the vehicle towards these desired states. A vehicle dynamics simulator was also developed for software testing. Ultimately, this software will accept commands from advanced obstacle avoidance software so that the vehicle can navigate in true off-road terrain.

I många nätverk antas det att någon form av fix infrastruktur existerar och att nätverkets olika noder kan använda denna för att kommunicera med varandra. I ett ad hoc-nätverk antar man att det inte finns någon fix infrastruktur och att noderna måste använda varandra för att kunna kommunicera. Ett exempel på ett ad hoc-nätverk kan vara bärbara datorer sammankopplade med infraröda länkar under ett möte. När ad hoc-nätverket är mobilt innebär det att noderna rör sig. I detta arbete har de tre protokollen Epidemic, GeoMean och GeoMove tillsammans med de två rörelsemodellerna Waypoint och den utökade slumpmässiga vandringen implementerats i en nyskriven simulator för denna typ av nätverk. De två Geo-protokollen är nyutvecklade och syftar till att använda geografisk information för att underlätta kommunikationen i denna kategori av nätverk tillsammans med den nya utvidgade slumpmässiga vandringsmodellen. / In many networks, some kind of fix infrastructure is assumed to exist and the nodes of the network can use this infrastructure to communicate with each other. In an ad hoc network one assumes that there don't exist any kind of fix infrastructure and that the nodes must use each other to be able to communicate. One example of an ad hoc network could be laptops connected together with infrared links during a meeting. When an ad hoc network is mobile it implies that the nodes are moving. In this work, the three protocols Epidemic, GeoMean and GeoMove together with the two mobility models Waypoint and Extended Random Walk, have been implemented in a newly written simulator for this kind of network. The two Geo-protocols are newly developed and aim to use geographical information to aid communication in this category of networks together with the new Extended Random Walk model.

En av de viktigaste egenskaper hos en agent är hur den väljer att navigera i en virtuell miljö, därför ämnar den här studien att undersöka mänsklighetsgraden hos tre olika typer av styrtekniker i ett 2D bilspel. Dessa teknikerna är ett waypoint-system, ett neuralt nätverk och en skuggningsteknik. De tre teknikerna utvärderas genom att jämföra hur deras generella beteende skiljer sig från de mänskliga deltagarna och genom ett frågeformulär som deltagarna svarar på. Baserat på den data som samlades in kan man dra slutsatsen att skuggning-tekniken upplevdes mest mänsklig följt av det neurala nätverket. Detta gör det intressant att eventuellt i framtiden testa olika typer av neurala nätverk och se hur mänskligt de kan upplevas.

No description available.

Popularity of mobile devices along with the presence of ad hoc networks requiring no infrastructure has contributed to recent advances in the field of mobile computing in ad hoc networks. Mobile ad hoc networks have been mostly utilized in military environments. The recent advances in ad hoc network technology now introduce a new class of applications. In this thesis, we design, implement and analyze a multi-hop ad hoc messenger application using Pocket PCs and Microsoft .Net Compact Framework. Pocket PCs communicate wirelessly with each other using the IEEE 802.11b technology without the use of an infrastructure. The main protocol implemented in this application is based on Dynamic Source Routing (DSR), which consists of two important mechanisms, Route Discovery and Route Maintenance. We adopt DSR since DSR operates solely based on source routing and "on-demand" process, so each packet does not have to transmit any periodic advertisement packets or routing information. These characteristics are desirable for the ad hoc messenger application for which a conversation is source-initiated on-demand. To test our application easily, we have developed a testing strategy by which a mobility configuration file is pre-generated describing the mobility pattern of each node generated based on the random waypoint mobility model. A mobility configuration file thus defines topology changes at runtime and is used by all nodes to know whether they can communicate with others in a single-hop or multi-hops during an experimental run. We use five standard metrics to test the performance of the wireless ad hoc messenger application implemented based on DSR, namely, (1) average latency to find a new route, (2) average latency to deliver a data packet, (3) delivery ratio of data packets, (4) normalized control overhead, and (5) throughput. These metrics test the correctness and efficiency of the wireless ad hoc messenger application using the DSR protocol in an 802.11 ad hoc network that imposes limitations on bandwidth and resources of each mobile device. We test the effectiveness of certain design alternatives for implementing the ad hoc messenger application with these five metrics under various topology change conditions by manipulating the speed and pause-time parameters in the random waypoint model. The design alternatives evaluated include (1) Sliding Window Size (SWS) for end-to-end reliable communication control; (2) the use of per-hop acknowledgement packets (called receipt packets) deigned for rapid detection of route errors by intermediate nodes; and (3) the use of cache for path look-up during route discovery and maintenance. Our analysis results indicate that as the node speed increases, the system performance deteriorates because a higher node speed causes the network topology to change more frequently under the random waypoint mobility model, causing routes to be broken. On the other hand, as the pause time increases, the system performance improves due to a more stable network topology. For the design alternatives evaluated in our wireless ad hoc messenger, we discover that as SWS increases, the system performance also increases until it reaches an optimal SWS value that maximizes the performance due to a balance of a higher level of data parallelism introduced and a higher level of medium contention in 802.11 because of more packets being transmitted simultaneously as SWS increases. Beyond the optimal SWS, the system performance deteriorates as SWS increases because the heavy medium contention effect outweighs the benefit due to data parallelism. We also discover that the use of receipt packets is helpful in a rapidly changing network but is not beneficial in a stable network. There is a break-even point in the frequency of topology changes beyond which the use of receipt packets helps quickly detect route errors in a dynamic network and would improve the system performance. Lastly, the use of cache is rather harmful in a frequently changing network because stale information stored in the cache of a source node may adversely cause more route errors and generate a higher delay for the route discovery process. There exists a break-even point beyond which the use of cache is not beneficial. Our wireless ad hoc messenger application can be used in a real chatting setting allowing Pocket PC users to chat instantly in 802.11 environments. The design and development of the dynamic topology simulation tool to model movements of nodes and the automatic testing and data collection tool to facilitate input data selection and output data analysis using XML are also a major contribution. The experimental results obtained indicate that there exists an optimal operational setting in the use of SWS, receipt packets and cache, suggesting that the wireless ad hoc messenger should be implemented in an adaptive manner to fine-tune these design parameters based on the current network condition and performance data monitored to maximize the system performance. / Master of Science

This thesis explores the design and implementation of a simulation framework created for C2 training environments, focusing on simulating the movement of aircraft and other moving targets between waypoints. The core objective was to develop an extensible, reliable, and realistic simulation system that can adapt to simulate a variety of entities, each characterized by unique movement patterns defined by their type. The simulated input scenarios involve a collection of targets, where each target traverses through a defined set of waypoints according to their specified movement behavior at initialization. The research involved a evaluation of established theories and ideologies of both aircraft and computer simulation, leading to the creation of a framework that leverages Java for its scalability and performance. The framework was designed from the ground up to promote extensibility of various types of moving targets beyond of just that of aircraft, such as helicopters, boats, missiles, and surface vehicles.  The accuracy of the simulation was tested by comparing its output to real-world flight data, demonstrating its capability to mimic realistic aircraft movement within predefined training scenarios. Additionally, the system's extensibility is showcased by simulating two different categories of aircraft—a commercial airliner and a small fighter jet—and illustrating the differences in their generated trajectories. Another outcome is the framework's ability to support real-time simulation, crucial for training scenarios in a C2 context. The system integrates and utilizes concurrent design techniques and dependable design patterns to ensure high throughput and performance, even when scaling to large numbers of targets. The framework's architecture allows for future extension and integration of new target types, without requiring modifications to the existing codebase, by the utilization of Javas SPI.

In real world applications such as rescue robots, service robots, mobile mining robots, and mine searching robots, an autonomous mobile robot needs to reach multiple goals with the shortest path while avoiding obstacles. In this thesis, we propose Artificial Immune System (AIS) based algorithms and two hybrids based on AIS associated with the Simulated Annealing (SA) algorithm and Voronoi Diagram (VD) for real-time map building and path planning for multi-goal applications. A global route is initially planned by the Immune System Algorithm (ISA). Then the created path is used to guide the robot to multiple waypoints following the foraging trail. An AIS-based point-to-point navigator is also proposed and tested here, which is used to navigate the robot along a collision-free global route. The proposed hybrid ISA model integrated with SA or VD algorithm aims to generate paths while a mobile robot explores terrain with map building in an unknown environment. We explore the ISA algorithm with simulation and comparison studies to demonstrate the capability of the proposed hybrid model of AIS and SA or AIS and VD algorithms in achieving a global route with minimized overall distance. Simulation and comparison studies validate the efficiency and effectiveness of the proposed hybrid models. They also confirm that concurrent multi-waypoint navigation with obstacle avoidance and mapping of an autonomous robot is successfully performed under unknown environments.

With the increasing maturity of unmanned aerial vehicles (UAVs), also known as drones, wireless ecosystem is experiencing an unprecedented paradigm shift. These aerial platforms are specifically appealing for a variety of applications due to their rapid and flexible deployment, cost-effectiveness, and high chance of forming line-of-sight (LoS) links to the ground nodes. As with any new technology, the benefits of incorporating UAVs in existing cellular networks cannot be characterized without completely exploring the underlying trade space. This requires a detailed system-level analysis of drone cellular networks by taking the unique features of UAVs into account, which is the main objective of this dissertation. We first focus on a static setup and characterize the performance of a three-dimensional (3D) two-hop cellular network in which terrestrial base stations (BSs) coexist with UAVs to serve a set of ground user equipment (UE). In particular, a UE connects either directly to its serving terrestrial BS by an access link or connects first to its serving UAV which is then wirelessly backhauled to a terrestrial BS (joint access and backhaul). We consider realistic antenna radiation patterns for both BSs and UAVs using practical models developed by the third generation partnership project (3GPP). We assume a probabilistic channel model for the air-to-ground transmission, which incorporates both LoS and non-LoS links. Assuming the max-power association policy, we study the performance of the network in both amplify-and-forward (AF) and decode-and-forward (DF) relaying protocols. Using tools from stochastic geometry, we analyze the joint distribution of distance and zenith angle of the closest (and serving) UAV to the origin in a 3D setting. Further, we identify and extensively study key mathematical constructs as the building blocks of characterizing the received signal-to-interference-plus-noise ratio (SINR) distribution. Using these results, we obtain exact mathematical expressions for the coverage probability in both AF and DF relaying protocols. Furthermore, considering the fact that backhaul links could be quite weak because of the downtilted antennas at the BSs, we propose and analyze the addition of a directional uptilted antenna at the BS that is solely used for backhaul purposes. The superiority of having directional antennas with wirelessly backhauled UAVs is further demonstrated via extensive simulations. Second, we turn our attention to a mobile setup and characterize the performance of several canonical mobility models in a drone cellular network in which UAV base stations serve UEs on the ground. In particular, we consider the following four mobility models: (i) straight line (SL), (ii) random stop (RS), (iii) random walk (RW), and (iv) random waypoint (RWP), among which the SL mobility model is inspired by the simulation models used by the 3GPP for the placement and trajectory of UAVs, while the other three are well-known canonical models (or their variants) that offer a useful balance between realism and tractability. Assuming the nearest-neighbor association policy, we consider two service models for the UEs: (i) UE independent model (UIM), and (ii) UE dependent model (UDM). While the serving UAV follows the same mobility model as the other UAVs in the UIM, it is assumed to fly towards the UE of interest in the UDM and hover above its location after reaching there. We then present a unified approach to characterize the point process of UAVs for all the mobility and service models. Using this, we provide exact mathematical expressions for the average received rate and the session rate as seen by the typical UE. Further, using tools from the calculus of variations, we concretely demonstrate that the simple SL mobility model provides a lower bound on the performance of other general mobility models (including the ones in which UAVs follow curved trajectories) as long as the movement of each UAV in these models is independent and identically distributed (i.i.d.). Continuing our analysis on mobile setups, we analyze the handover probability in a drone cellular network, where the initial positions of the UAVs serving the ground UEs are modeled by a homogeneous Poisson point process (PPP). Inspired by the mobility model considered in the 3GPP studies, we assume that all the UAVs follow the SL mobility model, i.e., move along straight lines in random directions. We further consider two different scenarios for the UAV speeds: (i) same speed model (SSM), and (ii) different speed model (DSM). Assuming nearest-neighbor association policy, we characterize the handover probability of this network for both mobility scenarios. For the SSM, we compute the exact handover probability by establishing equivalence with a single-tier terrestrial cellular network, in which the BSs are static while the UEs are mobile. We then derive a lower bound for the handover probability in the DSM by characterizing the evolution of the spatial distribution of the UAVs over time. After performing these system-level analyses on UAV networks, we focus our attention on the air-to-ground wireless channel and attempt to understand its unique features. For that, we first study the impact of UAV wobbling on the coherence time of the wireless channel between UAVs and a ground UE, using a Rician multi-path channel model. We consider two different scenarios for the number of UAVs: (i) single UAV scenario (SUS), and (ii) multiple UAV scenario (MUS). For each scenario, we model UAV wobbling by two random processes, i.e., the Wiener and sinusoidal processes, and characterize the channel autocorrelation function (ACF) which is then used to derive the coherence time of the channel. For the MUS, we further show that the UAV-UE channels for different UAVs are uncorrelated from each other. One key observation that is revealed from our analysis is that even for small UAV wobbling, the coherence time of the channel may degrade quickly, which may make it difficult to track the channel and establish a reliable communication link. Finally, we develop an impairments-aware air-to-ground unified channel model that incorporates the effect of both wobbling and hardware impairments, where the former is caused by random physical fluctuations of UAVs, and the latter by intrinsic radio frequency (RF) nonidealities at both the transmitter and receiver, such as phase noise, in-phase/quadrature (I/Q) imbalance, and power amplifier (PA) nonlinearity. The impact of UAV wobbling is modeled by two stochastic processes, i.e., the canonical Wiener process and the more realistic sinusoidal process. On the other hand, the aggregate impact of all hardware impairments is modeled as two multiplicative and additive distortion noise processes, which is a well-accepted model. For the sake of generality, we consider both wide-sense stationary (WSS) and nonstationary processes for the distortion noises. We then rigorously characterize the ACF of the wireless channel, using which we provide a comprehensive analysis of four key channel-related metrics: (i) power delay profile (PDP), (ii) coherence time, (iii) coherence bandwidth, and (iv) power spectral density (PSD) of the distortion-plus-noise process. Furthermore, we evaluate these metrics with reasonable UAV wobbling and hardware impairment models to obtain useful insights. Similar to our observation above, this work again demonstrates that the coherence time severely degrades at high frequencies even for small UAV wobbling, which renders air-to-ground channel estimation very difficult at these frequencies. / Doctor of Philosophy / With the increasing maturity of unmanned aerial vehicles (UAVs), also known as drones, wireless ecosystem is changing dramatically. Owing to their ease of deployment and high chance of forming direct line-of-sight (LoS) links with the other UAVs and ground users, they are very appealing for numerous wireless applications. As with any new technology, exploring the full extent of the benefits of UAVs requires careful exploration of the underlying trade space. Therefore, in this dissertation, our main focus is on the analysis of such aerial networks, their interplay with the current terrestrial networks, and the unique features of UAVs that make them different from conventional ground nodes. One important aspect of aerial communication systems is their integration into our current cellular networks. Clearly, the addition of these new aerial components has the potential of benefiting both the ground users (such as mobile users watching a concert who need cellular connectivity to share the moments) and the cellular base station (BS). Therefore, careful analysis of these ``aerial-terrestrial" networks is of utmost importance. In the first phase of this dissertation, we perform this analysis by interpreting the network as a combination of one-hop (from the BS to the user) and two-hop (from the BS to the UAV and then from the UAV to the UE) links. Since the locations of BSs, UAVs, and users are irregular in general, we use tools from stochastic geometry to carry out our analysis, which is a field of mathematics that studies random shapes and patterns. Also, because existing terrestrial BSs are primarily designed to serve the ``ground", we propose the addition of a separate set of antennas at the BS site that is solely used to serve the ``air", i.e., to communicate with the UAVs, and demonstrate the benefits of this additional infrastructure in detail. One of our assumptions in the first phase of this dissertation was that the considered network was static, i.e., the UAVs were hovering in the air and the BSs/users were also not moving. In the second phase, on the other hand, we explore the benefits and challenges of a mobile network of UAVs and characterize the performance of several canonical mobility models in a drone cellular network. In particular, one of the models that we studied extensively is the so-called straight line (SL) mobility model, which was inspired by the simulation models used by the third generation partnership project (3GPP) for the placement and trajectory of UAVs. Since the locations of UAVs could be assumed random in general, we use tools from stochastic geometry and present a unified approach to characterize the point process of UAVs, using which we obtained exact mathematical expressions for the average received rate (i.e., throughput) as seen by the users. Continuing our analysis on mobile setups and using the SL mobility model, we also analyze the handover probability in a drone cellular network, which is defined as the event when the serving UAV of a user changes. By establishing equivalence between our aerial setup with a terrestrial cellular network, we compute the exact handover probability in drone cellular networks. In the final phase of this dissertation, we focus our attention on the air-to-ground wireless channel and attempt to understand its unique features. For that, we propose an impairments-aware unified channel model for an air-to-ground wireless communication system and extensively analyze the link between a hovering UAV in the air and a static user on the ground. In particular, we consider two different types of impairments: (i) UAV wobbling, and (ii) hardware impairments, where the former is caused by random physical fluctuations, and the latter by intrinsic radio frequency (RF) nonidealities at both the transmitter and receiver. Using appropriate models for each type of impairment, we rigorously characterize the autocorrelation function (ACF) of the wireless channel, using which we provide a comprehensive analysis of key channel-related metrics, such as coherence time and coherence bandwidth. One key observation that is revealed from our analysis is that even for small UAV wobbling and low hardware impairment levels, the coherence time of the channel may degrade quickly at high frequencies, which could make it difficult to track the channel and establish a reliable communication link at these frequencies.

Tato diplomová práce je zaměřena na vývoj simulačního prostředí v Matlab/Simulink zvoleného letadla ve známém letovém režimu. Pozice a orientace letadla pohybujícího se ve vzduchu je popsána pohybovými rovnicemi se šesti stup\v{n}i volnosti. Soustava translačních, rotačních a kinematických rovnic tvoří soustavu devíti nelineárních diferenciálních rovnic prvního řádu. Tyto rovnice lze linearizovat okolo nějakého rovnovážného stavu, který budeme nazývat letovým režimem. Součástí simulačního prostředí je řídící systém letadla založený na PID regulaci. Základem je návrh autopilota, který řídí úhel podélného sklonu a úhel příčného náklonu. Součástí návrhu jsou takzvané „flight director\textquotedblright \phantom{s}m\'dy jako udržení výšky, volba kursu, regulace vertikální rychlosti, změna výšky, zachycení požadované výšky a navigační m\'{o}d založený na nelineárním navigačním zákonu. Optimalizace regulátorů za použití PSO algoritmu a Pareto optimalitě je využita pro nastavení parametrů PID regulátoru. Simulační prostředí je vizualizováno v softwaru FlightGear.

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.