Big Data decision support system

Includes bibliographical references.2022 Fall.Each day, the amount of data produced by sensors, social and digital media, and Internet of Things is rapidly increasing. The volume of digital data is expected to be doubled within the next three years. At some point, it might not be financially feasible to store all the data that is received. Hence, if data is not analyzed as it is received, the information collected could be lost forever. Actionable Intelligence is the next level of Big Data analysis where data is being used for decision making. This thesis document describes my scientific contribution to Big Data Actionable Intelligence generations. Chapter 1 consists of my colleagues and I's contribution in Big Data Actionable Intelligence Architecture. The proven architecture has demonstrated to support real-time actionable intelligence generation using disparate data sources (e.g., social media, satellite, newsfeeds). This work has been published in the Journal of Big Data. Chapter 2 shows my original method to perform real-time detection of moving targets using Remote Sensing Big Data. This work has also been published in the Journal of Big Data and it has received an issuance of a U.S. patent. As the Field-of-View (FOV) in remote sensing continues to expand, the number of targets observed by each sensor continues to increase. The ability to track large quantities of targets in real-time poses a significant challenge. Chapter 3 describes my colleague and I's contribution to the multi-target tracking domain. We have demonstrated that we can overcome real-time tracking challenges when there are large number of targets. Our work was published in the Journal of Sensors

IEEE Journal of Selected Topics In Signal Processing : Vol. 7, No. 3, June 2013

1. "Statistics 102" for Multisource-Multitarget Detection and Tracking 2. Calibration of Multi-Target Tracking Algorithms Using Non-Cooperative Targets 3. Robust Multi-Bernoulli Filtering 4. An Efficient Multi-Frame Track-Before-Detect Algorithm for Multi-Target Tracking 5. Histogram-PMHT Unfettered Etc

Agoraphilic navigation algorithm in dynamic environment

This thesis presents a novel Agoraphilic (free space attraction [FSA])-based navigation algorithm. This new algorithm is capable of undertaking local path planning for robot navigation in static and dynamic environments with the presence of a moving goal. The proposed algorithm eliminates the common weaknesses of the existing navigation approaches when operating in unknown dynamic environments while using the modified Agoraphilic concept. The Agoraphilic Navigation Algorithm in Dynamic Environment (ANADE) presented in this thesis does not look for obstacles (problems) to avoid; rather, it looks for free space (solutions) to follow. Therefore, this algorithm is also a human-like optimistic navigation algorithm. The proposed algorithm creates a set of Free Space Forces (FSFs) based on the current and future growing free space around the robot. These Free Space Forces are focused towards the current and future locations of a moving goal and finally generate a single attractive force. This attractive force pulls the robot through current free space towards the future growing free space leading to the goal. The new free space concept allows the ANADE to overcome many common problems of navigation algorithms. Several versions of the ANADE have been developed throughout this research to overcome the main limitation of the original Agoraphilic algorithm and address the common weaknesses of the existing navigation approaches. The ANADE I uses an object tracking method to identify the states (locations) of moving objects accurately. The ANADE II uses a dynamic obstacle prediction methodology to identify the robot’s future environments. In the ANADE III, a novel controller based on fuzzy logic was developed and combined with the new FSA concept to provide optimal navigational solutions at a low computational cost. In the ANADE III, the effectiveness of the ANADE II was further improved by incorporating the velocity vectors of the moving objects into decision-making. In the ANADE IV, a self-tuning system was successfully applied to the ANADE III to take advantage of the performances of free space attraction-based navigation algorithms. The proposed final version of the algorithm (ANADE V) comprises nine main modules. These modules are repeatedly used to create the robot’s driving force, which pulls the robot towards the goal (moving or static). An obstacle tracking module is used to identify the time-varying free spaces by tracking the moving objects. Further, a tracking system is also used to track the moving goal. The capacity of the ANADE was strengthened further by obstacle and goal path prediction modules. Future location prediction allowed the algorithm to make decisions by considering future environments around the robot. This is further supported by a self-tuning, machine learning–based controller designed to efficiently account for the inherent high uncertainties in the robot’s operational environment at a reduced computational cost. Experimental and simulation-based tests were conducted under dynamic environments to validate the algorithm. Further, the ANADE was benchmarked against other recently developed navigation algorithms. Those tests were focused on the behaviour of the algorithm under challenging environments with moving and static obstacles and goals. Further, the test results demonstrate that the ANADE is successful in navigating robots under unknown, dynamically cluttered environments.Doctor of Philosoph