• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 5
  • 1
  • Tagged with
  • 69
  • 69
  • 64
  • 63
  • 44
  • 17
  • 14
  • 14
  • 14
  • 12
  • 12
  • 10
  • 10
  • 10
  • 10
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
41

Social Behavior based Collaborative Self-organization in Multi-robot Systems

Tamzidul Mina (9755873) 14 December 2020 (has links)
<div>Self-organization in a multi-robot system is a spontaneous process where some form of overall order arises from local interactions between robots in an initially disordered system. Cooperative coordination strategies for self-organization promote teamwork to complete a task while increasing the total utility of the system. In this dissertation, we apply prosocial behavioral concepts such as altruism and cooperation in multi-robot systems and investigate their effects on overall system performance on given tasks. We stress the significance of this research in long-term applications involving minimal to no human supervision, where self-sustainability of the multi-robot group is of utmost importance for the success of the mission at hand and system re-usability in the future.</div><div><br></div><div>For part of the research, we take bio-inspiration of cooperation from the huddling behavior of Emperor Penguins in the Antarctic which allows them to share body heat and survive one of the harshest environments on Earth as a group. A cyclic energy sharing concept is proposed for a convoying structured multi-robot group inspired from penguin movement dynamics in a huddle with carefully placed induction coils to facilitate directional energy sharing with neighbors and a position shuffling algorithm, allowing long-term survival of the convoy as a group in the field. Simulation results validate that the cyclic process allows individuals an equal opportunity to be at the center of the group identified as the most energy conserving position, and as a result robot groups were able to travel over 4 times the distance during convoying with the proposed method without any robot failing as opposed to without the shuffling and energy sharing process. </div><div><br></div><div>An artificial potential based Adaptive Inter-agent Spacing (AIS) control law is also proposed for efficient energy distribution in an unstructured multi-robot group aimed at long-term survivability goals in the field. By design, as an altruistic behavior higher energy bearing robots are dispersed throughout the group based on their individual energy levels to counter skewed initial distributions for faster group energy equilibrium attainment. Inspired by multi-huddle merging and splitting behavior of Emperor Penguins, a clustering and sequential merging based systematic energy equilibrium attainment method is also proposed as a supplement to the AIS controller. The proposed system ensures that high energy bearing agents are not over crowded by low energy bearing agents. The AIS controller proposed for the unstructured energy sharing and distribution process yielded 55%, 42%, 23% and 33% performance improvements in equilibrium attainment convergence time for skewed, bi-modal, normal and random initial agent resource level distributions respectively on a 2D plane using the proposed energy distribution method over the control method of no adaptive spacing. Scalability analysis for both energy sharing concepts confirmed their application with consistently improved performances different sized groups of robots. Applicability of the AIS controller as a generalized resource distribution method under certain constraints is also discussed to establish its significance in various multi-robot applications.</div><div><br></div><div>A concept of group based survival from damaging directional external stimuli is also adapted from the Emperor Penguin huddling phenomenon where individuals on the damaging stimuli side continuously relocate to the leeward side of the group following the group boundary using Gaussian Processes Machine Learning based global health-loss rate minima estimations in a distributed manner. The method relies on cooperation from all robots where individuals take turns being sheltered by the group from the damaging external stimuli. The distributed global health loss rate minima estimation allowed the development of two settling conditions. The global health loss rate minima settling method yielded 12.6%, 5.3%, 16.7% and 14.2% improvement in average robot health over the control case of no relocation, while an optimized health loss rate minima settling method further improved on the global health loss rate settling method by 3.9%, 1.9%, 1.7% and 0.6% for robot group sizes 26, 35, 70 and 107 respectively.</div><div><br></div><div>As a direct application case study of collaboration in multi-robot systems, a distributed shape formation strategy is proposed where robots act as beacons to help neighbors settle in a prescribed formation by local signaling. The process is completely distributed in nature and does not require any external control due to the cooperation between robots. Beacon robots looking for a robot to settle as a neighbor and continue the shape formation process, generates a surface gradient throughout the formed shape that allow robots to determine the direction of the structure forming frontier along the dynamically changing structure surface and eventually reach the closest beacon. Simulation experiments validate complex shape formation in 2D and 3D using the proposed method. The importance of group collaboration is emphasized in this case study without which the shape formation process would not be possible, without a centralized control scheme directing individual agents to specific positions in the structure. </div><div> </div><div>As the final application case study, a collaborative multi-agent transportation strategy is proposed for unknown objects with irregular shape and uneven weight distribution. Although, the proposed system is robust to single robot object transportation, the proposed methodology of transport is focused on robots regulating their effort while pushing objects from an identified pushing location hoping other robots support the object moment on the other end of the center of mass to prevent unintended rotation and create an efficient path of the object to the goal. The design of the object transportation strategy takes cooperation cues from human behaviors when coordinating pushing of heavy objects from two ends. Collaboration is achieved when pushing agents can regulate their effort with one another to maintain an efficient path for the object towards the set goal. Numerous experiments of pushing simple shapes such as disks and rectangular boxes and complex arbitrary shapes with increasing number of robots validate the significance and effectiveness of the proposed method. Detailed robustness studies of changing weight of objects during transportation portrayed the importance of cooperation in multi-agent systems in countering unintended drift effects of the object and maintain a steady efficient path to the goal. </div><div><br></div><div>Each case study is presented independent of one another with the Penguin huddling based self-organizations in response to internal and external stimuli focused on fundamental self-organization methods, and the structure formation and object transportation strategies focused on cooperation in specific applications. All case studies are validated by relevant simulation and experiments to establish the effectiveness of altruistic and cooperative behaviors in multi-robot systems.</div>
42

Learning Multi-step Dual-arm Tasks From Demonstrations

Natalia S Sanchez Tamayo (9156518) 29 July 2020 (has links)
Surgeon expertise can be difficult to capture through direct robot programming. Deep imitation learning (DIL) is a popular method for teaching robots to autonomously execute tasks through learning from demonstrations. DIL approaches have been previously applied to surgical automation. However, previous approaches do not consider the full range of robot dexterous motion required in general surgical task, by leaving out tooltip rotation changes or modeling one robotic arm only. Hence, they are not directly applicable for tasks that require rotation and dual-arm collaboration such as debridement. We propose to address this limitation by formulating a DIL approach for the execution of dual-arm surgical tasks including changes in tooltip orientation, position and gripper actions.<br><br>In this thesis, a framework for multi-step surgical task automation is designed and implemented by leveraging deep imitation learning. The framework optimizes Recurrent Neural Networks (RNNs) for the execution of the whole surgical tasks while considering tooltip translations, rotations as well as gripper actions. The network architecture proposed implicitly optimizes for the interaction between two robotic arms as opposed to modeling each arm independently. The networks were trained directly from the human demonstrations and do not require to create task specific hand-crafted models or to manually segment the demonstrations.<br><br>The proposed framework was implemented and evaluated in simulation for two relevant surgical tasks, the peg transfer task and the surgical debridement. The tasks were tested under random initial conditions to challenge the robustness of the networks to generalize to variable settings. The performance of the framework was assessed using task and subtask success as well as a set of quantitative metrics. Experimental evaluation showed favorable results for automating surgical tasks under variable conditions for the surgical debridement, which obtained a task success rate comparable to the human task success. For the peg transfer task, the framework displayed moderate overall task success. Quantitative metrics indicate that the robot generated trajectories possess similar or better motion economy that the human demonstrations.
43

AUTONOMOUS NAVIGATION AND ROOM CATEGORIZATION FOR AN ASSISTANT ROBOT

Doga Y Ozgulbas (10756674) 07 May 2021 (has links)
<div><div><div><p>Globally, there are more than 727 million people aged 65 years and older in the world, and the elderly population is expected to grow more than double in the next three decades. Families search for affordable and quality care for their senior loved ones will have an effect on the care-giving profession. A personal robot assistant could help with daily tasks such as carrying things for them and keeping track of their routines, relieving the burdens of human caregivers. Performing mentioned tasks usually requires the robot to autonomously navi- gate. An autonomous navigation robot should collect the knowledge of its surroundings by mapping the environment, find its position in the map and calculate trajectories by avoiding obstacles. Furthermore, to assign specific tasks which are in various locations, robot has to categorize the rooms in addition to memorizing the respective coordinates. In this research, methods have been developed to achieve autonomous navigation and room categorization of a mobile robot within indoor environments. A Simultaneously Localization and Map- ping (SLAM) algorithm has been used to build the map and localize the robot. Gmapping, a method of SLAM, was applied by utilizing an odometry and a 2D Light Detection and Ranging (LiDAR) sensor. The trajectory to achieve the goal position by an optimal path is provided by path planning algorithms, which is divided into two parts namely, global and local planners. Global path planning has been produced by DIJKSTRA and local path planning by Dynamic Window Approach (DWA). While exploring new environments with Gmapping and trajectory planning algorithms, rooms in the generated map were classified by a powerful deep learning algorithm called Convolutional Neural Network (CNN). Once the environment is explored, the robots localization in the 2D space is done by Adaptive Monte Carlo Localization (AMCL). To utilize and test the methods above, Gazebo software by The Robotic Operating System (ROS) was used and simulations were performed prior to real life experiments. After the trouble-shooting and feedback acquired from simulations, the robot was able to perform above tasks and later tested in various indoor environments. The environment was mapped successfully by Gmapping and the robot was located within the map by AMCL. Compared to the theoretical maximum efficient path, the robot was able to plan the trajectory with acceptable deviation. In addition, the room names were classified with minimum of 85% accuracy by CNN algorithm. Autonomous navigation results show that the robot can assist elderly people in their home environment by successfully exploring, categorizing and navigating between the rooms.</p></div></div></div>
44

IFC-Based Systems and Methods to Support Construction Cost Estimation

Temitope Akanbi (10776249) 10 May 2021 (has links)
<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>
45

Automated Leaf-Level Hyperspectral Imaging of Soybean Plants using an UAV with a 6 DOF Robotic Arm

Jialei Wang (11147142) 19 July 2021 (has links)
<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>
46

Distributed Network Processing and Optimization under Communication Constraint

Chang Shen Lee (11184969) 26 July 2021 (has links)
<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>
47

Persistent Autonomous Maritime Operation with an Underwater Docking Station

Brian Rate Page (10667433) 26 April 2021 (has links)
<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>
48

A Comparison of Models and Approaches to Model Predictive Control of Synchronous Machine-based Microgrids

Lucas Martin Peralta Bogarin (11192433) 28 July 2021 (has links)
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.
49

Intuitive programming of mobile manipulation applications : A functional and modular GUI architecture for End-User robot programming / Intuitiv programmering av mobil manipulations applikationer : En funktionell och modulär GUI arkitektur för slutanvändares robot programmering

De Martini, Alessandro January 2021 (has links)
Mobile manipulators are changing the way companies and industries complete their work. Untrained end users risk facing unfunctional and nonuser- friendly Graphical User Interfaces. Recently, there has been shortages of people and talent in the heathcare industry where these applications would benefit in being used to accomplish easy and low level tasks. All these reasons contribute to the need of finding functional robot-user ways of communicating that allow the expansion of mobile manipulation applications. This thesis addresses the problem of finding an intuitive way to deploy a mobile manipulator in a laboratory environment. This thesis has analyzed whether it is possible to permit the user to work with a manipulator efficiently and without too much effort via a functional graphical user interface. Creating a modular interface based on user needs is the innovation value of this work. It allows the expansion of mobile manipulator applications that increases the number of possible users. To accomplish this purpose a Graphical User Interface application is proposed using an explanatory research strategy. First, user data was acquired using an ad hoc research survey and mixed with literature implementations to create the right application design. Then, an iterative implementation based on code-creation and tests was used to design a valuable solution. Finally, the results from an observational user study with non-roboticist programmers are presented. The results were validated with the help of 10 potential end users and a validation matrix. This demonstrated how the system is both functional and user-friendly for novices, but also expressive for experts. / Mobilmanipulatorer förändrar sättet som företag och industrier utför sitt arbete. Otränade slutanvändare och särskilt de utan programmeringskunskap kommer att bemötas av icke-funktionella och användarovänliga grafiska användargränssnitt. Den senaste tiden har det varit brist på specialiserad personal inom hälsovårdsindustrin som har resulterat i ett beroende på dessa applikationer för att genomföra enkla uppgifter samt uppgifter på låg nivå. Alla dessa faktorer bidrar till det ökande behovet att hitta ett funktionellt sätt att kommunicera mellan robot och slutanvändare vilket tillåter expansionen av mobilmanipulatorapplikationer. Arbetet som beskrivs i denna avhandling adresserar problemet att finna ett intuitivt sätt att använda en mobilmanipulator i ett laboratoriemijö. Möjligheten att tillåta användaren att på ett enkelt och effektivt sätt arbeta med en manipulator via ett funtionellt grafiskt användargränssnitt analyseras. Innovationsvärdet och detta examensarbetes bidrag till nuvarande kunskap betraktar möjligheten att skapa ett modulärt gränssnitt baserat på användares behov. Detta möjliggör expansionen av mobilmanipulatörers applikation vilket ökar antalet möjliga användare. En förklarande forskningsstrategi används för att föreslå en grafisk användargränssnittsapplikation för att uppnå detta mål. Först användes data från ad hoc-undersökningar blandat med litteraturimplementeringar för att skapa den rätta applikationsdesignen. En iterativ implementering baserad på kodskapande samt tester användes sedan för att designa en värdefull lösning redo att testas. Slutligen presenteras resultat från en användarobservationsstudie med icke-robotikprogrammerare. De insamlade resultaten som samlades in under valideringsstadiet tack vare en grupp bestående av tio potentiella slutanvändare har analyserats genom användandet av en valideringsmatris som är baserad på tre parametrar. Detta demonstrerade hur systemet är både funktionellt och användarvänligt för nybörjare men också expressivt för experter.
50

Distributed Solutions for a Class of Multi-agent Optimization Problems

Xiaodong Hou (6259343) 10 May 2019 (has links)
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>

Page generated in 0.2434 seconds