RoboTSP - A Fast Solution to the Robotic Task Sequencing Problem

In many industrial robotics applications, such as spot-welding, spray-painting or drilling, the robot is required to visit successively multiple targets. The robot travel time among the targets is a significant component of the overall execution time. This travel time is in turn greatly affected by the order of visit of the targets, and by the robot configurations used to reach each target. Therefore, it is crucial to optimize these two elements, a problem known in the literature as the Robotic Task Sequencing Problem (RTSP). Our contribution in this paper is two-fold. First, we propose a fast, near-optimal, algorithm to solve RTSP. The key to our approach is to exploit the classical distinction between task space and configuration space, which, surprisingly, has been so far overlooked in the RTSP literature. Second, we provide an open-source implementation of the above algorithm, which has been carefully benchmarked to yield an efficient, ready-to-use, software solution. We discuss the relationship between RTSP and other Traveling Salesman Problem (TSP) variants, such as the Generalized Traveling Salesman Problem (GTSP), and show experimentally that our method finds motion sequences of the same quality but using several orders of magnitude less computation time than existing approaches.Comment: 6 pages, 7 figures, 1 tabl

Development of Novel Task-Based Configuration Optimization Methodologies for Modular and Reconfigurable Robots Using Multi-Solution Inverse Kinematic Algorithms

Modular and Reconfigurable Robots (MRRs) are those designed to address the increasing demand for flexible and versatile manipulators in manufacturing facilities. The term, modularity, indicates that they are constructed by using a limited number of interchangeable standardized modules which can be assembled in different kinematic configurations. Thereby, a wide variety of specialized robots can be built from a set of standard components. The term, reconfigurability, implies that the robots can be disassembled and rearranged to accommodate different products or tasks rather than being replaced. A set of MRR modules may consist of joints, links, and end-effectors. Different kinematic configurations are achieved by using different joint, link, and end-effector modules and by changing their relative orientation. The number of distinct kinematic configurations, attainable by a set of modules, varies with respect to the size of the module set from several tens to several thousands. Although determining the most suitable configuration for a specific task from a predefined set of modules is a highly nonlinear optimization problem in a hybrid continuous and discrete search space, a solution to this problem is crucial to effectively utilize MRRs in manufacturing facilities. The objective of this thesis is to develop novel optimization methods that can effectively search the Kinematic Configuration (KC) space to identify the most suitable manipulator for any given task. In specific terms, the goal is to develop and synthesize fast and efficient algorithms for a Task-Based Configuration Optimization (TBCO) from a given set of constraints and optimization criteria. To achieve such efficiency, a TBCO solver, based on Memetic Algorithms (MA), is proposed. MAs are hybrids of Genetic Algorithms (GAs) and local search algorithms. MAs benefit from the exploration abilities of GAs and the exploitation abilities of local search methods simultaneously. Consequently, MAs can significantly enhance the search efficiency of a wide range of optimization problems, including the TBCO. To achieve more optimal solutions, the proposed TBCO utilizes all the solutions of the Inverse Kinematics(IK) problem. Another objective is to develop a method for incorporating the multiple solutions of the IK problem in a trajectory optimization framework. The output of the proposed trajectory optimization method consists of a sequence of desired tasks and a single IK solution to reach each task point. Moreover, the total cost of the optimized trajectory is utilized in the TBCO as a performance measure, providing a means to identify kinematic configurations with more efficient optimized trajectories. The final objective is to develop novel IK solvers which are both general and complete. Generality means that the solvers are applicable to all the kinematic configurations which can be assembled from the available module inventory. Completeness entails the algorithm can obtain all the possible IK solutions

Mapping and Real-Time Navigation With Application to Small UAS Urgent Landing

Small Unmanned Aircraft Systems (sUAS) operating in low-altitude airspace require flight near buildings and over people. Robust urgent landing capabilities including landing site selection are needed. However, conventional fixed-wing emergency landing sites such as open fields and empty roadways are rare in cities. This motivates our work to uniquely consider unoccupied flat rooftops as possible nearby landing sites. We propose novel methods to identify flat rooftop buildings, isolate their flat surfaces, and find touchdown points that maximize distance to obstacles. We model flat rooftop surfaces as polygons that capture their boundaries and possible obstructions on them. This thesis offers five specific contributions to support urgent rooftop landing. First, the Polylidar algorithm is developed which enables efficient non-convex polygon extraction with interior holes from 2D point sets. A key insight of this work is a novel boundary following method that contrasts computationally expensive geometric unions of triangles. Results from real-world and synthetic benchmarks show comparable accuracy and more than four times speedup compared to other state-of-the-art methods. Second, we extend polygon extraction from 2D to 3D data where polygons represent flat surfaces and interior holes representing obstacles. Our Polylidar3D algorithm transforms point clouds into a triangular mesh where dominant plane normals are identified and used to parallelize and regularize planar segmentation and polygon extraction. The result is a versatile and extremely fast algorithm for non-convex polygon extraction of 3D data. Third, we propose a framework for classifying roof shape (e.g., flat) within a city. We process satellite images, airborne LiDAR point clouds, and building outlines to generate both a satellite and depth image of each building. Convolutional neural networks are trained for each modality to extract high level features and sent to a random forest classifier for roof shape prediction. This research contributes the largest multi-city annotated dataset with over 4,500 rooftops used to train and test models. Our results show flat-like rooftops are identified with > 90% precision and recall. Fourth, we integrate Polylidar3D and our roof shape prediction model to extract flat rooftop surfaces from archived data sources. We uniquely identify optimal touchdown points for all landing sites. We model risk as an innovative combination of landing site and path risk metrics and conduct a multi-objective Pareto front analysis for sUAS urgent landing in cities. Our proposed emergency planning framework guarantees a risk-optimal landing site and flight plan is selected. Fifth, we verify a chosen rooftop landing site on real-time vertical approach with on-board LiDAR and camera sensors. Our method contributes an innovative fusion of semantic segmentation using neural networks with computational geometry that is robust to individual sensor and method failure. We construct a high-fidelity simulated city in the Unreal game engine with a statistically-accurate representation of rooftop obstacles. We show our method leads to greater than 4% improvement in accuracy for landing site identification compared to using LiDAR only. This work has broad impact for the safety of sUAS in cities as well as Urban Air Mobility (UAM). Our methods identify thousands of additional rooftop landing sites in cities which can provide safe landing zones in the event of emergencies. However, the maps we create are limited by the availability, accuracy, and resolution of archived data. Methods for quantifying data uncertainty or performing real-time map updates from a fleet of sUAS are left for future work.PHDRoboticsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/170026/1/jdcasta_1.pd