<div>Cost estimation is an integral part of any project, and accuracy in the cost estimation process is critical in achieving a successful project. Manually computing cost estimates is mentally draining, difficult to compute, and error-prone. Manual cost estimate computation is a task that requires experience. The use of automated techniques can improve the accuracy of estimates and vastly improve the cost estimation process. Two main gaps in the automation of construction cost estimation are: (1) the lack of interoperability between different software platforms, and (2) the need for manual inputs to complete quantity take-off (QTO) and cost estimation. To address these gaps, this research proposed a new systems to support the computing of cost estimation using Model View Definition (MVD)-based checking, industry foundation classes (IFC) geometric analysis, logic-based reasoning, natural language processing (NLP), and automated 3D image generation to reduce/eliminate the labor-intensive, tedious, manual efforts needed in completing construction cost estimation. In this research, new IFC-based systems were developed: (1) Modeling – an automated IFC-based system for generating 3D information models from 2D PDF plans; (2) QTO - a construction MVD specification for IFC model checking to prepare for cost estimation analysis and a new algorithm development method that computes quantities using the geometric analysis of wooden building objects in an IFC-based building information modeling (BIM) and extracts the material variables needed for cost estimation through item matching based on natural language processing; and (3) Costing – an ontology-based cost model for extracting design information from construction specifications and using the extracted information to retrieve the pricing of the materials for a robust cost information provision.</div><div><br></div><div>These systems developed were tested on different projects. Compared with the industry’s current practices, the developed systems were more robust in the automated processing of drawings, specifications, and IFC models to compute material quantities and generate cost estimates. Experimental results showed that: (1) Modeling - the developed component can be utilized in developing algorithms that can generate 3D models and IFC output files from Portable Document Format (PDF) bridge drawings in a semi-automated fashion. The developed algorithms utilized 3.33% of the time it took using the current state-of-the-art method to generate a 3D model, and the generated models were of comparative quality; (2) QTO – the results obtained using the developed component were consistent with the state-of-the-art commercial software. However, the results generated using the proposed component were more robust about the different BIM authoring tools and workflows used; (3) Extraction – the algorithms developed in the extraction component achieved 99.2% precision and 99.2% recall (i.e., 99.2% F1-measure) for extracted design information instances; 100% precision and 96.5% recall (i.e., 98.2% F1-measure) for extracted materials from the database; and (4) Costing - the developed algorithms in the costing component successfully computed the cost estimates and reduced the need for manual input in matching building components with cost items.</div>

<p>Nowadays, soybean is one the most consumed crops in the world. As the human population continuously increases, new phenotyping technology is needed to help plant scientists breed soybean that has high-yield, stress-tolerant, and disease-tolerant traits. Hyperspectral imaging (HSI) is one of the most commonly used technologies for phenotyping. The current HSI techniques include HSI tower and remote sensing on an unmanned aerial vehicle (UAV) or satellite. There are several noise sources the current HSI technologies suffer from such as changes in lighting conditions, leaf angle, and other environmental factors. To reduce the noise on HS images, a new portable, leaf-level, high-resolution HSI device was developed for corn leaves in 2018 called LeafSpec. Due to the previous design requiring a sliding action along the leaf which could damage the leaf if used on a soybean leaf, a new design of the LeafSpec was built to meet the requirements of scanning soybean leaves. The new LeafSpec device protects the leaf between two sheets of glass, and the scanning action is automated by using motors and servos. After the HS images have been collected, the current modeling method for HS images starts by averaging all the plant pixels to one spectrum which causes a loss of information because of the non-uniformity of the leaf. When comparing the two modeling methods, one uses the mean normalized difference vegetation index (NDVI) and the other uses the NDVI heatmap of the entire leaf to predict the nitrogen content of soybean plants. The model that uses NDVI heatmap shows a significant increase in prediction accuracy with an R2 increase from 0.805 to 0.871. Therefore, it can be concluded that the changes occurring within the leaf can be used to train a better prediction model. </p> <p>Although the LeafSpec device can provide high-resolution leaf-level HS images to the researcher for the first time, it suffers from two major drawbacks: intensive labor needed to gather the image data and slow throughput. A new idea is proposed to use a UAV that carries a 6 degree of freedom (DOF) robotic arm with a LeafSpec device as an end-effect to automatically gather soybean leaf HS images. A new UAV is designed and built to carry the large payload weight of the robotic arm and LeafSpec.</p>

<div>In recent years, the amount of data in the information processing systems has significantly increased, which is also referred to as big-data. The design of systems handling big-data calls for a scalable approach, which brings distributed systems into the picture. In contrast to centralized systems, data are spread across the network of agents in the distributed system, and agents cooperatively complete tasks through local communications and local computations. However, the design and analysis of distributed systems, in which no central coordinators with complete information are present, are challenging tasks. In order to support communication among agents to enable multi-agent coordination among others, practical communication constraints should be taken into consideration in the design and analysis of such systems. The focus of this dissertation is to provide design and analysis of distributed network processing using finite-rate communications among agents. In particular, we address the following open questions: 1) can one design algorithms balancing a graph weight matrix using finite-rate and simplex communications among agents? 2) can one design algorithms computing the average of agents’ states using finite-rate and simplex communications? and 3) going beyond of ad-hoc algorithmic designs, can one design a black-box mechanism transforming a general class of algorithms with unquantized communication to their finite-bit quantized counterparts?</div><div><br></div><div>This dissertation addresses the above questions. First, we propose novel distributed algorithms solving the weight-balancing and average consensus problems using only finite-rate simplex communications among agents, compliant to the directed nature of the network topology. A novel convergence analysis is put forth, based on a new metric inspired by the</div><div>positional system representations. In the second half of this dissertation, distributed optimization subject to quantized communications is studied. Specifically, we consider a general class of linearly convergent distributed algorithms cast as fixed-point iterate, and propose a novel black-box quantization mechanism. In the proposed mechanism, a novel quantizer preserving linear convergence is proposed, which is proved to be more communication efficient than state-of-the-art quantization mechanisms. Extensive numerical results validate our theoretical findings.</div>

<div>Exploring and surveilling the marine environment away from shore is critical for scientific, economic, and military purposes as we progress through the 21st century. Until recently, these missions far from shore were only possible using manned surface vehicles. Over the past decade, advances in energy density, actuators, electronics, and controls have enabled great improvements in vehicle endurance, yet, no solution is capable of supporting persistent operation especially when considering power hungry scientific surveys. This dissertation summarizes contributions related to the development of an adaptable underwater docking station and associated navigation solutions to allow applications in the wide range of maritime missions. The adaptable docking system is a novel approach to the standard funnel shaped docking station design that enables the dock to be collapsible, portable, and support a wide range of vehicles. It has been optimized and tested extensively in simulation. Field experiments in both pool and open water validate the simulation results. The associated control strategies for approach and terminal homing are also introduced and studied in simulation and field trials. These strategies are computationally efficient and enable operation in a variety of scenarios and conditions. Combined, the adaptable docking system and associated navigation strategies can form a baseline for future extended endurance missions away from manned support.</div>

In this research, an attempt is made to evaluate alternative model-predictive microgrid control approaches and to understand the trade-offs that emerge between model complexity and the ability to achieve real-time optimized system performance. Three alternative controllers are considered and their computational and optimization performance compared. In the first, nonlinearities of the generators are included within the optimization. Subsequently, an approach is considered wherein alternative (non-traditional) states and inputs of generators are used which enables one to leverage linear models with the model predictive control (MPC). Nonlinearities are represented outside the control in maps between MPC inputs and the physical inputs. Third, a recently proposed linearized trajectory (LTMPC) is considered. Finally, the performance of the controllers is examined utilizing alternative models of the synchronous machine that have been proposed for power system analysis.

Distributed optimization over multi-agent networks has become an increasingly popular research topic as it incorporates many applications from various areas such as consensus optimization, distributed control, network resource allocation, large scale machine learning, etc. Parallel distributed solution algorithms are highly desirable as they are more scalable, more robust against agent failure, align more naturally with either underlying agent network topology or big-data parallel computing framework. In this dissertation, we consider a multi-agent optimization formulation where the global objective function is the summation of individual local objective functions with respect to local agents' decision variables of different dimensions, and the constraints include both local private constraints and shared coupling constraints. Employing and extending tools from the monotone operator theory (including resolvent operator, operator splitting, etc.) and fixed point iteration of nonexpansive, averaged operators, a series of distributed solution approaches are proposed, which are all iterative algorithms that rely on parallel agent level local updates and inter-agent coordination. Some of the algorithms require synchronizations across all agents for information exchange during each iteration while others allow asynchrony and delays. The algorithms' convergence to an optimal solution if one exists are established by first characterizing them as fixed point iterations of certain averaged operators under certain carefully designed norms, then showing that the fixed point sets of these averaged operators are exactly the optimal solution set of the original multi-agent optimization problem. The effectiveness and performances of the proposed algorithms are demonstrated and compared through several numerical examples.<br>

Growing concerns over global warming and increasing fuel costs have pushed the traditional fuel-based centralized electrical grid to the forefront of mounting public pressure. These concerns will only intensify in the future, owing to the growth in electricity demand. Such growths require increased generation of electricity to meet the demand, and this means more carbon footprint from the electrical grid. To meet the growing demand economically by using clean sources of energy, the electrical grid needs significant structural and operational changes to cope with various challenges. Microgrids (µGs) can be an answer to the structural requirement of the electrical grid. µGs integrate renewables and serve local needs, thereby, reducing line losses and improving resiliency. However, stochastic nature of electricity harvest from renewables makes its integration into the grid challenging. The time varying and intermittent<br>nature of renewables and consumer demand can be mitigated by the use of storages and dynamic load scheduling. Automated dynamic load scheduling constitutes the operational changes that could enable us to achieve energy efficiency in the grid.<br>The current research works on automated load scheduling primarily focuses on scheduling residential and commercial building loads, while the current research on manufacturing scheduling is based on static approaches with very scarce literature on job shop scheduling. However, residential, commercial and, industrial sector, each contribute to about one-third of the total electricity consumption. A few research<br>works have been done focusing on dynamic scheduling in manufacturing facilities for energy efficiency. In a smart grid scenario, consumers are coupled through electricity<br>pool and storage. Thus, this research investigates the problem of integrating production line loads with building loads for optimal scheduling to reduce the total electricity<br>cost in a µG.<br>This research focuses on integrating the different types of loads from different types of consumers using automated dynamic load scheduling framework for sequential decision making. After building a deterministic model to be used as a benchmark, dynamic load scheduling models are constructed. Firstly, an intelligent algorithm is developed for load scheduling from a consumer’s perspective. Secondly, load scheduling model is developed based on central grid controller’s perspective. And finally, a reinforcement learning model is developed for improved load scheduling by sharing<br>among multiple µGs. The performance of the algorithms is compared against different well-known individualistic strategies, static strategies and, optimal benchmark<br>solutions. The proposed dynamic load scheduling framework is model free with minimum assumptions and it outperforms the different well-known heuristics and static strategies while obtains solutions comparable to the optimal benchmark solution.<br>The future electrical grid is envisioned to be an interconnected network of µGs. In addition to the automated load scheduling in a µG, coordination among µGs by<br>demand and capacity sharing can also be used to mitigate stochastic nature of supply and demand in an electrical grid. In this research, demand and resource sharing<br>among µGs is proposed to leverage the interaction between the different µGs for developing load scheduling policy based on reinforcement learning. <br>

<div><p>Analyzing behaviors of objects on the road is a complex task that requires data from various sensors and their fusion to recreate movement of objects with a high degree of accuracy. A data collection and processing system are thus needed to track the objects accurately in order to make an accurate and clear map of the trajectories of objects relative to various coordinate frame(s) of interest in the map. Detection and tracking moving objects (DATMO) and Simultaneous localization and mapping (SLAM) are the tasks that needs to be achieved in conjunction to create a clear map of the road comprising of the moving and static objects.</p> <p> These computational problems are commonly solved and used to aid scenario reconstruction for the objects of interest. The tracking of objects can be done in various ways, utilizing sensors such as monocular or stereo cameras, Light Detection and Ranging (LIDAR) sensors as well as Inertial Navigation systems (INS) systems. One relatively common method for solving DATMO and SLAM involves utilizing a 3D LIDAR with multiple monocular cameras in conjunction with an inertial measurement unit (IMU) allows for redundancies to maintain object classification and tracking with the help of sensor fusion in cases when sensor specific traditional algorithms prove to be ineffectual when either sensor falls short due to their limitations. The usage of the IMU and sensor fusion methods relatively eliminates the need for having an expensive INS rig. Fusion of these sensors allows for more effectual tracking to utilize the maximum potential of each sensor while allowing for methods to increase perceptional accuracy. </p> <p>The focus of this thesis will be the dock-less e-scooter and the primary goal will be to track its movements effectively and accurately with respect to cars on the road and the world. Since it is relatively more common to observe a car on the road than e-scooters, we propose a data collection system that can be built on top of an e-scooter and an offline processing pipeline that can be used to collect data in order to understand the behaviors of the e-scooters themselves. In this thesis, we plan to explore a data collection system involving a 3D LIDAR sensor and multiple monocular cameras and an IMU on an e-scooter as well as an offline method for processing the data to generate data to aid scenario reconstruction. </p><br></div>

<div>Multi-robot systems have demonstrated strong capability in handling environmental operations. In this study, We examine how a team of robots can be utilized in covering and removing spill patches in a dynamic environment by executing three consecutive stages: deployment, coverage, and rendezvous. </div><div> </div><div>For the deployment problem, we aim for robot allocation based on the discreteness of the patches that need to be covered. With the deep neural network (DNN) based spill detector and remote sensing facilities such as drones with vision sensors and satellites, we are able to obtain the spill distribution in the workspace. Then, we formulate the allocation problem in a general optimization form and provide solutions using an integer linear programming (ILP) solver under several realistic constraints. After the allocation process is completed and the robot team is divided according to the number of spills, we deploy robots to their computed optimal goal positions. In the robot deployment part, control laws based on artificial potential field (APF) method are proposed and practiced on robots with a common unicycle model. </div><div> </div><div>For the coverage control problem, we show two strategies that are tailored for a wirelessly networked robot team. We propose strategies for coverage with and without path planning, depending on the availability of global information. Specifically, in terms of coverage with path planning, we partition the workspace from the aerial image into pieces and let each robot take care of one of the pieces. However, path-planning-based coverage relies on GPS signals or other external positioning systems, which are not applicable for indoor or GPS-denied circumstances. Therefore, we propose an asymptotic boundary shrink control that enables a collective coverage operation with the robot team. Such a strategy does not require a planned path, and because of its distributedness, it shows many advantages, including system scalability, dynamic spill adaptability, and collision avoidance. In case of a large-scale patch that poses challenges to robot connectivity maintenance during the operation, we propose a pivot-robot coverage strategy by mean of an a priori geometric tessellation (GT). In the pivot-robot-based coverage strategy, a team of robots is sent to perform complete coverage to every packing area of GT in sequence. Ultimately, the entire spill in the workspace can be covered and removed.</div><div> </div><div>For the rendezvous problem, we investigate the use of graph theory and propose control strategies based on network topology to motivate robots to meet at a designated or the optimal location. The rendezvous control strategies show a strong robustness to some common failures, such as mobility failure and communication failure. To expedite the rendezvous process and enable herding control in a distributed way, we propose a multi-robot multi-point rendezvous control strategy. </div><div> </div><div>To verify the validity of the proposed strategies, we carry out simulations in the Robotarium MATLAB platform, which is an open source swarm robotics experiment testbed, and conduct real experiments involving multiple mobile robots.</div>

<div><div><div><p>This project aims to develop a cloud-based platform that integrates sensors with business intelligence for real-time energy management at the plant level. It provides facility managers, an energy management platform that allows them to monitor equipment and plant-level energy consumption remotely, receive a warning, identify energy loss due to malfunction, present options with quantifiable effects for decision-making, and take actions, and assess the outcomes. The objectives consist of:</p><ol><li><p>Developing a generic platform for the monitoring energy consumption of industrial equipment using sensors</p></li><li><p>Control the connected equipment using an actuator</p></li><li><p>Integrating hardware, cloud, and application algorithms into the platform</p></li><li><p>Validating the system using an Energy Consumption Forecast scenario</p></li></ol><p>A Demo station was created for testing the system. The demo station consists of equipment such as air compressor, motor and light bulb. The current usage of these equipment is measured using current sensors. Apart from current sensors, temperature sensor, pres- sure sensor and CO2 sensor were also used. Current consumption of these equipment was measured over a couple of days. The control system was tested randomly by turning on equipment at random times. Turning on the equipment resulted in current consumption which ensured that the system is running. Thus, the system worked as expected and user could monitor and control the connected equipment remotely.</p></div></div></div>