Enhancing Trajectory-Based Operations for UAVs through Hexagonal Grid Indexing: A Step towards 4D Integration of UTM and ATM

Aviation is expected to face a surge in the number of manned aircraft and drones in the coming years, making it necessary to integrate Unmanned Aircraft System Traffic Management (UTM) into Air Traffic Management (ATM) to ensure safe and efficient operations. This research proposes a novel hexagonal grid-based 4D trajectory representation framework for unmanned aerial vehicle (UAV) traffic management that overcomes the limitations of existing square/cubic trajectory representation methods. The proposed model employs a hierarchical indexing structure using hexagonal cells, enabling efficient ground based strategic conflict detection and conflict free 4D trajectory planning. Additionally, the use of Hexagonal Discrete Global Grid Systems provides a more accurate representation of UAV trajectories, improved sampling efficiency and higher angular resolution. The proposed approach can be used for predeparture conflict free 4D trajectory planning, reducing computational complexity and memory requirements while improving the accuracy of strategic trajectory conflict detection. The proposed framework can also be extended for air traffic flow management trajectory planning, Air Traffic Control (ATC) workload measurement, sector capacity estimation, dynamics airspace sectorization using hexagonal sectors and traffic density calculation, contributing to the development of an efficient UTM system, and facilitating the integration of UAVs into the national airspace system with AT

Eco-ISEA3H, a machine learning ready spatial database for ecometric and species distribution modeling

We present the Eco-ISEA3H database, a compilation of global spatial data characterizing climate, geology, land cover, physical and human geography, and the geographic ranges of nearly 900 large mammalian species. The data are tailored for machine learning (ML)-based ecological modeling, and are intended primarily for continental- to global-scale ecometric and species distribution modeling. Such models are trained on present-day data and applied to the geologic past, or to future scenarios of climatic and environmental change. Model training requires integrated global datasets, describing species' occurrence and environment via consistent observational units. The Eco-ISEA3H database incorporates data from 17 sources, and includes 3,033 variables. The database is built on the Icosahedral Snyder Equal Area (ISEA) aperture 3 hexagonal (3H) discrete global grid system (DGGS), which partitions the Earth's surface into equal-area hexagonal cells. Source data were incorporated at six nested ISEA3H resolutions, using scripts developed and made available here. We demonstrate the utility of the database in a case study analyzing the bioclimatic envelopes of ten large, widely distributed mammalian species.Peer reviewe

Towards Q-analysis Integration in Discrete Global Grid Systems: Methodology, Implications and Data Complexity

Spatial data is characterized by rich contextual information with multiple characteristics at each location. The interpretation of this multifaceted data is an integral part of current technological developments, data rich environments and data driven approaches for solving complex problems. While data availability, exploitation and complexity continue to grow, new technologies, tools and methods continue to evolve in order to meet these demands, including advancing analytical capabilities, as well as the explicit formalization of geographic knowledge. In spite of these developments Discrete Global Grid Systems (DGGS) were proposed as a new comprehensive approach for transforming scientific data of various sources, types and qualities into one integrated environment. The DGGS framework was developed as the global data model and standard for efficient storage, analysis and visualization of spatial information via a discrete hierarchy of equal area cells at various spatial resolutions. Each DGGS cell is the explicit representation of the Earth surface, which can store multiple data values and be conveniently recognized and identified within the hierarchy of the DGGS system. A detailed evaluation of some notable DGGS implementations in this research indicates great prospects and flexibility in performing essential data management operations, including spatial analysis and visualization. Yet they fall short in recognizing interactivity between system components and their visualization, nor providing advanced data friendly techniques. To address these limitations and promote further theoretical advancement of DGGS, this research suggests the use of Q-analysis theory as a way to utilize the potential of the hierarchical DGGS data model via the tools of simplicial complexes and algebraic topology. As a proof of concept and demonstration of Q-analysis feasibility, the method has been applied in a water quality and water health study, the interpretation of which has revealed much contextual information about the behaviour of the water network, the spread of pollution and chain affects. It is concluded that the use of Q-analysis indeed contributes to the further advancement and development of DGGS as a data rich framework for formalizing multilevel data systems and for the exploration of new data driven and data friendly approaches to close the gap between knowledge and data complexity

Regular Hierarchical Surface Models: A conceptual model of scale variation in a GIS and its application to hydrological geomorphometry

Environmental and geographical process models inevitably involve parameters that vary spatially. One example is hydrological modelling, where parameters derived from the shape of the ground such as flow direction and flow accumulation are used to describe the spatial complexity of drainage networks. One way of handling such parameters is by using a Digital Elevation Model (DEM), such modelling is the basis of the science of geomorphometry. A frequently ignored but inescapable challenge when modellers work with DEMs is the effect of scale and geometry on the model outputs. Many parameters vary with scale as much as they vary with position. Modelling variability with scale is necessary to simplify and generalise surfaces, and desirable to accurately reconcile model components that are measured at different scales. This thesis develops a surface model that is optimised to represent scale in environmental models. A Regular Hierarchical Surface Model (RHSM) is developed that employs a regular tessellation of space and scale that forms a self-similar regular hierarchy, and incorporates Level Of Detail (LOD) ideas from computer graphics. Following convention from systems science, the proposed model is described in its conceptual, mathematical, and computational forms. The RHSM development was informed by a categorisation of Geographical Information Science (GISc) surfaces within a cohesive framework of geometry, structure, interpolation, and data model. The positioning of the RHSM within this broader framework made it easier to adapt algorithms designed for other surface models to conform to the new model. The RHSM has an implicit data model that utilises a variation of Middleton and Sivaswamy (2001)’s intrinsically hierarchical Hexagonal Image Processing referencing system, which is here generalised for rectangular and triangular geometries. The RHSM provides a simple framework to form a pyramid of coarser values in a process characterised as a scaling function. In addition, variable density realisations of the hierarchical representation can be generated by defining an error value and decision rule to select the coarsest appropriate scale for a given region to satisfy the modeller’s intentions. The RHSM is assessed using adaptions of the geomorphometric algorithms flow direction and flow accumulation. The effects of scale and geometry on the anistropy and accuracy of model results are analysed on dispersive and concentrative cones, and Light Detection And Ranging (LiDAR) derived surfaces of the urban area of Dunedin, New Zealand. The RHSM modelling process revealed aspects of the algorithms not obvious within a single geometry, such as, the influence of node geometry on flow direction results, and a conceptual weakness of flow accumulation algorithms on dispersive surfaces that causes asymmetrical results. In addition, comparison of algorithm behaviour between geometries undermined the hypothesis that variance of cell cross section with direction is important for conversion of cell accumulations to point values. The ability to analyse algorithms for scale and geometry and adapt algorithms within a cohesive conceptual framework offers deeper insight into algorithm behaviour than previously achieved. The deconstruction of algorithms into geometry neutral forms and the application of scaling functions are important contributions to the understanding of spatial parameters within GISc

Design and Optimization of a 3-D Plasmonic Huygens Metasurface for Highly-Efficient Flat Optics

For miniaturization of future USAF unmanned aerial and space systems to become feasible, accompanying sensor components of these systems must also be reduced in size, weight and power (SWaP). Metasurfaces can act as planar equivalents to bulk optics, and thus possess a high potential to meet these low-SWaP requirements. However, functional efficiencies of plasmonic metasurface architectures have been too low for practical application in the infrared (IR) regime. Huygens-like forward-scattering inclusions may provide a solution to this deficiency, but there is no academic consensus on an optimal plasmonic architecture for obtaining efficient phase control at high frequencies. This dissertation asks the question: what are the ideal topologies for generating Huygens-like metasurface building blocks across a full 2π phase space? Instead of employing any a priori assumption of fundamental scattering topologies, a genetic algorithm (GA) routine was developed to optimize a “blank slate” grid of binary voxels inside a 3D cavity, evolving the voxel bits until a near-globally optimal transmittance (T) was attained at a targeted phase. All resulting designs produced a normalized T≥80 across the entire 2π range, which is the highest metasurface efficiency reported to-date for a plasmonic solution in the IR regime

Microlens array grid estimation, light field decoding, and calibration

We quantitatively investigate multiple algorithms for microlens array grid estimation for microlens array-based light field cameras. Explicitly taking into account natural and mechanical vignetting effects, we propose a new method for microlens array grid estimation that outperforms the ones previously discussed in the literature. To quantify the performance of the algorithms, we propose an evaluation pipeline utilizing application-specific ray-traced white images with known microlens positions. Using a large dataset of synthesized white images, we thoroughly compare the performance of the different estimation algorithms. As an example, we apply our results to the decoding and calibration of light fields taken with a Lytro Illum camera. We observe that decoding as well as calibration benefit from a more accurate, vignetting-aware grid estimation, especially in peripheral subapertures of the light field.Comment: \copyright 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other work

Microlens Array Grid Estimation, Light Field Decoding, and Calibration

We quantitatively investigate multiple algorithms for microlens array grid estimation for microlens array-based light field cameras. Explicitly taking into account natural and mechanical vignetting effects, we propose a new method for microlens array grid estimation that outperforms the ones previously discussed in the literature. To quantify the performance of the algorithms, we propose an evaluation pipeline utilizing application-specific raytraced white images with known microlens positions. Using a large dataset of synthesized white images, we thoroughly compare the performance of the different estimation algorithms. As an example, we apply our results to the decoding and calibration of light fields taken with a Lytro Illum camera. We observe that decoding as well as calibration benefit from a more accurate, vignetting-aware grid estimation, especially in peripheral subapertures of the light field