Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 13 of 13 for “"Multi-robot path planning"”.
-
Information-theoretic multi-robot path planning
… phenomena. One approach is to use a team of robots to sample the area and model the measurement values at unobserved points. For smoothly varying and hot-spot fields, there is some work which has been done to model the fields well. However, there is still a class of common environmental …
-
Efficient Multi-Robot Path Planning in Discrete Spaces
Multi-robot path planning involves moving multiple robots from their unique starting positions to their unique goals in a common graph discretization. This problem appears in a variety of applications, including planetary exploration, warehouse management, intelligent transportation networks, …
-
Multi-Robot Path Planning Using Sampling-Based Algorithms and Reinforcement Learning
In today’s world, robots are becoming extremely useful in many facets of life. With the recent increase in applicable uses of robots, multi-robot path planning has emerged as a fundamental research area. Multi-robot path planning is the process of developing a coordinated plan which is utilized by …
-
Multi-Robot Path Planning for Persistent Monitoring in Stochastic and Adversarial Environments
In this thesis, we study multi-robot path planning problems for persistent monitoring tasks. The goal of such persistent monitoring tasks is to deploy a team of cooperating mobile robots in an environment to continually observe locations of interest in the environment. Robots patrol the environment …
-
Risk-Aware Human-In-The-Loop Multi-Robot Path Planning for Lost Person Search and Rescue
We introduce a framework that would enable using autonomous aerial vehicles in search and rescue scenarios associated with missing person incidents to assist human searchers. We formulate a lost person behavior model and a human searcher model informed by data collected from past search missions. …
-
Social Graphs and Their Applications to Robotics
… propose a new method to design a roadmap-based path planning algorithm in a 2D static environment, which assumes a-priori knowledge of robots’ positions, their goals’ positions, and surrounding obstacles. The new algorithm, called Multi-Robot Path Planning Algorithm (MRPPA), combines Visibility …
-
Decentralized, Noncooperative Multirobot Path Planning with Sample-BasedPlanners
… the viability of decentralized, noncooperative multi-robot path planning algorithms is tested. Three algorithms based on the Batch Informed Trees (BIT*) algorithm are presented. The first of these algorithms combines Optimal Reciprocal Collision Avoidance (ORCA) with BIT*. The second of these …
-
Multi-agent routing in shared guidepath networks
… computer, this thesis considers a class of multi-agent routing problems that seek to minimize the agents’ traveling time subject to certain congestion constraints. In more technical terms, the particular problem addressed in this work concerns the development of efficient, conflict-free, and …
-
Discrete Path Planing Strategies for Coverage and Multi-Robot Rendezvous
This thesis addresses the problem of motion planning for autonomous robots, given a map and an estimate of the robot pose within it. The motion planning problem for a mobile robot can be defined as computing a trajectory in an environment from one pose to another while avoiding obstacles and …
-
Minimum Length Anchored Steiner Trees with Removable Obstacles
… several domains. In automated-warehouse motion planning, shelves or other fixtures can be moved, but each move incurs a cost. So the goal is to decide which obstacles to clear and then decide where the shortest routes should go. We abstract this situation: given multi-target locations inside a …
-
Adaptive task allocation, localization and motion planning for the multi-robot system
… with it.<br><br>The first problem is the Multi-Robot Task Allocation (MRTA) problem. In this thesis, a novel approach named Distributed Heterogeneous Hash Tables (DHHT) is proposed to solve the task allocation problem. Our approach assigns robots to a set of transportation tasks offered by …
-
Mobile robot navigation in dynamic environments
Service robots which act in environments populated by humans have <br>become very popular in the last few years. A variety of systems exists <br>which act for example in hospitals, office buildings, department <br>stores, and museums. Furthermore, several multi-robot systems have <br>been developed …
-
Manipulating Objects using Compliant, Unactuated Tails: Modeling and Planning
… structures have received little attention in robotics. Because they are unactuated, such structures are regarded as difficult to model, plan and control. In this dissertation, we are interested in a mobile robot system using a flexible rope-like structure attached to its end akin to a ‘tail’. …