Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Robotics
Decentralized, Noncooperative Multirobot Path Planning With Sample-Basedplanners, William Le
Decentralized, Noncooperative Multirobot Path Planning With Sample-Basedplanners, William Le
Master's Theses
In this thesis, 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 algorithms uses BIT* to create a path which the robots then follow using an artificial potential field (APF) method. The final algorithm is a version of BIT* that supports replanning. While none of these algorithms take advantage of sharing information between the robots, the algorithms are able to guide the robots to their desired goals, with the …
Route Planning For Long-Term Robotics Missions, Christopher Alexander Arend Tatsch
Route Planning For Long-Term Robotics Missions, Christopher Alexander Arend Tatsch
Graduate Theses, Dissertations, and Problem Reports
Many future robotic applications such as the operation in large uncertain environment depend on a more autonomous robot. The robotics long term autonomy presents challenges on how to plan and schedule goal locations across multiple days of mission duration. This is an NP-hard problem that is infeasible to solve for an optimal solution due to the large number of vertices to visit. In some cases the robot hardware constraints also adds the requirement to return to a charging station multiple times in a long term mission. The uncertainties in the robot model and environment require the robot planner to account …