Hybrid method for automating generation of reticulated structures (lattice structures) in complex conception domains

A reticulated structure is an interconnexion of bars used to create industrial products. They are rigid and lighter than traditional structures. So they can be the best choice when material gain is an optimization purpose. Generating a reticulated structure automatically is a feature helping industrial players in the design phase. This generation depends on the kind of the conception domain. In this paper we propose a solution that generates a reticulated structure in an arbitrary domain with zero or several holes. The proposed solution is a hybrid method using a technique generating a reticulated structure in a convex conception domain and suggesting a criterion to validate generated segments. Our new algorithm uses a method of computational geometry. We also present a study of the behaviour of a reticulated structure generated using our tool by calculating the deformation energy of this structure

Geofencing for Small Unmanned Aircraft Systems in Complex Low Altitude Airspace

As small unmanned aircraft systems (UAS) are utilized in an increasingly wide variety of commercial and civil applications, safety of flight within low altitude airspace can be improved through use of electronic geofence systems to partition the airspace. A geofence is defined as a volume of airspace with specific temporal, spatial, and permission constraints. This thesis develops geofencing as a tool for individual UAS and for managing airspace utilization through UAS Traffic Management (UTM). Permissions constraints determine which UAS may fly within each geofence. As a safety system, geofencing aims to keep the UAS within the airspace sectors (keep-in geofences) it has permission to access. Similarly, geofencing prevents the UAS from entering the airspace sectors it does not have permission to access (keep-out geofences). This thesis offers three specific contributions to geofencing. First, a methodology is developed to enable the UTM system to build and manage the set of active geofences, ensuring a maximum of one geofence per volume of airspace at any given time. Spatial priority of geofences within the UTM system is awarded in order of request, with always active (static) geofences having top priority. Unlike static geofences, dynamic geofences appear and disappear at user-specified times and are spatially and temporally deconflicted to maximize authorized airspace volume. Polygon set operations are used to deconflict the horizontal boundaries of newly requested geofence sets from the existing UTM approved geofence set. Second, a Triangle Weight Characterization with Adjacency (TWCA) algorithm is developed to efficiently determine whether a UAS is within a given geofence independent of the complexity of its boundary. This algorithm enables the UAS geofence module to quickly check whether the UAS is violating a geofence boundary by decomposing the horizontal boundary into triangles and tracking the occupied triangle over time through an adjacency graph. To test the performance of TWCA against the industry standard of Ray Casting, the run-time per query is calculated for randomly generated geofences and flight paths. The run-time of Ray Casting scales linearly with the number of geofence vertices while the average run-time of TWCA is constant independent of number of vertices. This time independence from geofence complexity is managed by a pre-processing step that enables real-time operation of this algorithm. Third, to enable the UAS operator or geofence automation to intervene prior to a boundary violation, the geofence polygons are scaled to provide warning and override cues. This boundary layering algorithm utilizes a uniform and a directional buffer distance to scale keep-in geofences inward and keep-out geofences outward. The layering algorithm is designed to handle arbitrary nonconvex polygons, with special cases identified and analyzed through Monte Carlo simulation. Multiple layering techniques are utilized in parallel to increase the likelihood of finding a scaled boundary solution. The statistical results show that the likelihood of success for inward and outward scaling decreases as buffer magnitude increases. The contributions of this thesis are combined to form a full system simulation, from the request of a new geofence and access to an existing geofence through the prevention of the boundary violation by the UAS.PHDRoboticsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/153391/1/minist_1.pd

Large-Scale Spatial Data Management on Modern Parallel and Distributed Platforms

Rapidly growing volume of spatial data has made it desirable to develop efficient techniques for managing large-scale spatial data. Traditional spatial data management techniques cannot meet requirements of efficiency and scalability for large-scale spatial data processing. In this dissertation, we have developed new data-parallel designs for large-scale spatial data management that can better utilize modern inexpensive commodity parallel and distributed platforms, including multi-core CPUs, many-core GPUs and computer clusters, to achieve both efficiency and scalability. After introducing background on spatial data management and modern parallel and distributed systems, we present our parallel designs for spatial indexing and spatial join query processing on both multi-core CPUs and GPUs for high efficiency as well as their integrations with Big Data systems for better scalability. Experiment results using real world datasets demonstrate the effectiveness and efficiency of the proposed techniques on managing large-scale spatial data